{"meta":{"query_hash":"d1408aa5b2d4","filters":{"topic":"Advanced Multi-Objective Optimization Algorithms"},"cohort_total":645,"direct_labels_cover":0,"predictions_cover":645,"exported":645,"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/d1408aa5b2d4","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Multi-Objective+Optimization+Algorithms"},"results":[{"id":"W122117794","doi":"10.1007/978-1-4020-6264-3_75","title":"Bond Graph Causality Assignment and Evolutionary Multi-Objective Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Causality (physics); Bond graph; Mathematical optimization; Assignment problem; Computer science; Optimization problem; Task (project management); Nonlinear system; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Engineering","score_opus":0.031192938822297216,"score_gpt":0.27636203719282504,"score_spread":0.24516909837052783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122117794","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.0026880528,0.0030558964,0.91531324,0.00042206675,0.00063782046,0.00004563723,0.00007965053,0.0002691964,0.07748846],"genre_scores_gemma":[0.16028698,0.009682241,0.648633,0.00045175827,0.0004636806,0.00035103672,0.00041820438,0.000670135,0.17904289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998592,0.000037464437,0.0000040536984,0.000021726679,0.000068022346,0.000009519267],"domain_scores_gemma":[0.999859,0.000066786866,0.000013064809,0.000020670986,0.000029982579,0.0000103537795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029660933,0.00074920896,0.00060013955,0.00067935744,0.00043351596,0.0007455752,0.0010232175,0.0008288346,0.01651286],"category_scores_gemma":[0.00090827077,0.00043235542,0.00046316086,0.0015447887,0.0006872801,0.0011177906,0.0007608628,0.0015938826,0.0024188613],"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.000019183091,0.00004968517,0.000119156706,0.00020431446,0.000032466272,0.00005917978,0.000041743817,0.28086707,0.0022660987,0.48643306,0.014447157,0.21546078],"study_design_scores_gemma":[0.000008664902,0.000026557953,0.00014114652,0.000048889586,0.000013658392,0.000087549146,0.000021333566,0.35986,0.0015106702,0.5772283,0.061036,0.000017247376],"about_ca_topic_score_codex":0.00087704114,"about_ca_topic_score_gemma":0.0015012616,"teacher_disagreement_score":0.01651286,"about_ca_system_score_codex":0.0005468672,"about_ca_system_score_gemma":0.00049530005,"threshold_uncertainty_score":0.05524105},"labels":[],"label_agreement":null},{"id":"W122534238","doi":"10.1007/978-1-4020-3610-1_65","title":"Preservation of Multiple Point Structure when Conditioning by Kriging","year":2005,"lang":"en","type":"book-chapter","venue":"Quantitative geology and geostatistics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Alberta","funders":"","keywords":"Kriging; Categorical variable; Conditioning; Variogram; Range (aeronautics); Mathematics; Statistics; Mathematical optimization; Computer science; Algorithm; Applied mathematics; Engineering","score_opus":0.016053441515165322,"score_gpt":0.2635232030837113,"score_spread":0.24746976156854597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122534238","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.0045208638,0.00009415359,0.9945305,0.00003441255,0.000017698174,0.000007770369,0.000039908602,0.00023885998,0.00051575754],"genre_scores_gemma":[0.27169937,0.0007563954,0.72063285,0.0001111144,0.000087825996,0.000081832775,0.00037791595,0.0009821408,0.00527057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858534,0.0005111578,0.00007423615,0.00025073512,0.00047710168,0.00010144267],"domain_scores_gemma":[0.99408466,0.0032071832,0.00027329515,0.0019391427,0.00042038047,0.00007543004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002397781,0.00092392205,0.0014271548,0.00063598936,0.00048007455,0.001225421,0.001431372,0.0007125,0.0032550446],"category_scores_gemma":[0.012411698,0.0010967499,0.00087938627,0.0017166515,0.0019298843,0.0024887032,0.0019430639,0.0021259675,0.0009139738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024248922,0.000080895865,0.0017518994,0.00041588067,0.000118607844,0.00021124554,0.00030251822,0.49120238,0.02529474,0.11903328,0.0027288185,0.3586172],"study_design_scores_gemma":[0.0000113995175,0.00005506365,0.0010823559,0.000022210352,0.000039141833,0.00015595589,0.000028619654,0.8823013,0.022997815,0.08969908,0.003579384,0.000027636115],"about_ca_topic_score_codex":0.0025505484,"about_ca_topic_score_gemma":0.003895054,"teacher_disagreement_score":0.0032550446,"about_ca_system_score_codex":0.00046954147,"about_ca_system_score_gemma":0.00087824493,"threshold_uncertainty_score":0.012680829},"labels":[],"label_agreement":null},{"id":"W13012010","doi":"10.1007/978-3-540-85646-7_26","title":"Multi-scenario Multi-objective Optimization with Applications in Engineering Design","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in economics and mathematical systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Waterloo","funders":"","keywords":"Multi-objective optimization; Mathematical optimization; Pareto principle; Decision maker; Engineering optimization; Context (archaeology); Preference; Computer science; Class (philosophy); Optimization problem; Operations research; Management science; Engineering; Mathematics; Artificial intelligence","score_opus":0.015735269306477978,"score_gpt":0.2208013627078256,"score_spread":0.20506609340134763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13012010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003953979,0.0021109316,0.9863615,0.00018907954,0.00014327826,0.000044747696,0.00007321742,0.00012972338,0.006993525],"genre_scores_gemma":[0.2855376,0.0041750856,0.69679505,0.00021040763,0.00024453705,0.00049018656,0.00036027117,0.00029053813,0.011896356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.0003694022,0.000023353685,0.00006949061,0.00015735882,0.000024810579],"domain_scores_gemma":[0.9992435,0.0005455223,0.00006388725,0.00004109899,0.0000793496,0.000026688105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014271084,0.0020560091,0.0015520273,0.0008770324,0.00037300412,0.0010075532,0.0012328352,0.0013770604,0.0059606507],"category_scores_gemma":[0.0023500791,0.00092649425,0.0016943057,0.0020338285,0.00037591186,0.0013351426,0.0012382334,0.0016251588,0.0007972498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003289625,0.000039507362,0.000132972,0.00022635874,0.00008477159,0.000094669806,0.000017973885,0.9374489,0.0011267907,0.013708916,0.0022049237,0.04488123],"study_design_scores_gemma":[0.0000049912483,0.00003725398,0.0000894891,0.000023304987,0.000013408427,0.00004751524,0.000008215361,0.9780042,0.00031614857,0.019433415,0.0020137604,0.000008322387],"about_ca_topic_score_codex":0.00046157377,"about_ca_topic_score_gemma":0.0006931105,"teacher_disagreement_score":0.0059606507,"about_ca_system_score_codex":0.0004549209,"about_ca_system_score_gemma":0.00030388086,"threshold_uncertainty_score":0.019940317},"labels":[],"label_agreement":null},{"id":"W140476297","doi":"10.1023/a:1020836221527","title":"Radial Solutions and Orthogonal Trajectories in Multiobjective Global Optimization","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Karush–Kuhn–Tucker conditions; Vector optimization; Theory of computation; Nonlinear programming; Mathematical optimization; Nonlinear system; Lagrange multiplier; Applied mathematics; Pareto principle; Set (abstract data type); Optimization problem; Multi-objective optimization; Computer science; Algorithm","score_opus":0.012555732355580673,"score_gpt":0.25020690630586456,"score_spread":0.2376511739502839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140476297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018862665,0.0011530895,0.97354174,0.00040180353,0.00008923842,0.000036321595,0.000024545083,0.000051018273,0.005839676],"genre_scores_gemma":[0.58379245,0.0031259076,0.39740893,0.00025387845,0.00018084896,0.00033067874,0.00014198708,0.00021078034,0.014554503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.0004964501,0.00003210369,0.00006527976,0.00014924812,0.000039441624],"domain_scores_gemma":[0.9971079,0.0019603588,0.00027751853,0.00009882025,0.00045419743,0.00010113563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035866858,0.0011485465,0.00094205077,0.0011304849,0.00065161375,0.0011688626,0.0010455258,0.0017185048,0.00220363],"category_scores_gemma":[0.011791392,0.0007008901,0.0006311481,0.001245495,0.0018202715,0.0026251127,0.0018947772,0.0015406257,0.00034138944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092164926,0.00003300274,0.00023397016,0.00012372459,0.000027420338,0.000050908504,0.00012751661,0.67684186,0.0007801534,0.29125404,0.0010332654,0.02940197],"study_design_scores_gemma":[0.000009580492,0.000035751455,0.00004728987,0.000018475248,0.000006007647,0.000013782941,0.00002928414,0.89787674,0.00015931939,0.10093331,0.00086138834,0.000009109829],"about_ca_topic_score_codex":0.0024090756,"about_ca_topic_score_gemma":0.0015582399,"teacher_disagreement_score":0.0035866858,"about_ca_system_score_codex":0.0009439528,"about_ca_system_score_gemma":0.0008841859,"threshold_uncertainty_score":0.018968403},"labels":[],"label_agreement":null},{"id":"W1460549585","doi":"10.1007/978-3-642-29946-9_13","title":"Regularized Least Squares Temporal Difference Learning with Nested ℓ2 and ℓ1 Penalization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":32,"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":"Overfitting; Computer science; Regularization (linguistics); Reinforcement learning; Solver; Mathematical optimization; Algorithm; Artificial intelligence; Applied mathematics; Mathematics; Artificial neural network","score_opus":0.012328453084216541,"score_gpt":0.2322221378745569,"score_spread":0.21989368479034035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1460549585","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.0015510428,0.00007700965,0.9976215,0.00007102722,0.00006216658,0.000016104614,0.000026507996,0.00020555758,0.00036900604],"genre_scores_gemma":[0.107844554,0.00017282362,0.8830202,0.000249422,0.00017575057,0.00028494804,0.0004689333,0.0003701117,0.0074132374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988738,0.00036934382,0.000085207095,0.00027418134,0.0002951644,0.00010222881],"domain_scores_gemma":[0.9973922,0.0012940655,0.00016195385,0.0004200571,0.00060152035,0.00013019836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028256585,0.00093661295,0.0015063974,0.00033088535,0.00043400907,0.0010620529,0.0027958571,0.0024233793,0.0041769887],"category_scores_gemma":[0.007773041,0.00092782377,0.0011421563,0.0006101886,0.0012076688,0.001978695,0.0024849796,0.0032931971,0.0016134738],"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.00043112348,0.00017775536,0.0006994676,0.00023835598,0.00015914784,0.00011127393,0.00013603733,0.6529124,0.009341283,0.0607908,0.008280999,0.26672134],"study_design_scores_gemma":[0.000007629552,0.00002090229,0.000034933284,0.0000046630557,0.0000054819916,0.000014882055,0.0000029419423,0.9944766,0.0007863543,0.0039458787,0.0006931516,0.0000066447205],"about_ca_topic_score_codex":0.0029446264,"about_ca_topic_score_gemma":0.003995334,"teacher_disagreement_score":0.0041769887,"about_ca_system_score_codex":0.0007009823,"about_ca_system_score_gemma":0.0018940154,"threshold_uncertainty_score":0.014943719},"labels":[],"label_agreement":null},{"id":"W1480330138","doi":"10.1613/jair.4806","title":"Bayesian Optimization in a Billion Dimensions via Random Embeddings","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Curse of dimensionality; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Mathematical optimization; Integer programming; Machine learning; Theoretical computer science; Algorithm; Mathematics","score_opus":0.07307959598059346,"score_gpt":0.39083408000608344,"score_spread":0.31775448402549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480330138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015365782,0.0005718336,0.98059833,0.0007504803,0.000044773795,0.000039399696,0.00010496991,0.0002761683,0.002248248],"genre_scores_gemma":[0.43334636,0.0010823457,0.5557263,0.0007501463,0.00022236722,0.0005387963,0.00069139316,0.0003672495,0.0072751134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984452,0.00089153356,0.000059610094,0.00022318629,0.00025960652,0.000120872704],"domain_scores_gemma":[0.9950942,0.0037941174,0.00031484992,0.0003053202,0.00033102647,0.00016043859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731885,0.0013997697,0.001816618,0.0008989803,0.000630802,0.0017448458,0.001330915,0.0018359735,0.003212527],"category_scores_gemma":[0.011413706,0.0012573285,0.0013712086,0.00090020604,0.0021755055,0.0030860135,0.0030404846,0.0031417636,0.00074224186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001175928,0.00007875368,0.00080848334,0.00012975425,0.00008775517,0.00005969438,0.00007822097,0.8638356,0.00056174106,0.09266441,0.0031041466,0.038473852],"study_design_scores_gemma":[0.000012238497,0.000014344172,0.00007254497,0.000011979816,0.000004668891,0.000007736205,0.00000820812,0.95958406,0.00008631104,0.03963663,0.0005544522,0.000006847599],"about_ca_topic_score_codex":0.0045329155,"about_ca_topic_score_gemma":0.005641275,"teacher_disagreement_score":0.0045329155,"about_ca_system_score_codex":0.0012603926,"about_ca_system_score_gemma":0.0013909208,"threshold_uncertainty_score":0.014447808},"labels":[],"label_agreement":null},{"id":"W1528483814","doi":"10.1029/2011wr011527","title":"Review of surrogate modeling in water resources","year":2012,"lang":"en","type":"article","venue":"Water Resources Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":961,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Surrogate model; Computer science; Metamodeling; Variety (cybernetics); Fidelity; Field (mathematics); Management science; Data science; Systems engineering; Operations research; Risk analysis (engineering); Machine learning; Artificial intelligence; Engineering; Software engineering","score_opus":0.09503813210406548,"score_gpt":0.3663211718458375,"score_spread":0.27128303974177204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528483814","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.0013968678,0.66234326,0.30069882,0.0037747885,0.0018615482,0.000072831135,0.0003763209,0.00023078857,0.029244764],"genre_scores_gemma":[0.030134745,0.88357294,0.07450707,0.0011515821,0.0017908558,0.00016070543,0.0006172372,0.00021128582,0.007853598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982009,0.00075986807,0.00018375591,0.00015377838,0.0006485119,0.00005312893],"domain_scores_gemma":[0.99713635,0.001996074,0.00013606015,0.0001402713,0.0005491917,0.000042041076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026782625,0.0011324654,0.0021572125,0.0021011003,0.0004670172,0.0021602467,0.00177295,0.0017514544,0.0054876115],"category_scores_gemma":[0.0058682305,0.000552859,0.0011234296,0.0061726295,0.0009438894,0.002546402,0.0012587054,0.0015948785,0.00206911],"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.000048212165,0.00006049473,0.0004679236,0.008121583,0.00015947042,0.00020140002,0.00010272675,0.13577019,0.0012052346,0.26304883,0.051176235,0.53963774],"study_design_scores_gemma":[0.000018346691,0.00009770248,0.00051909295,0.00422081,0.00010131246,0.00034645788,0.000105115665,0.0719538,0.0018389137,0.17492402,0.74578506,0.00008936532],"about_ca_topic_score_codex":0.002590335,"about_ca_topic_score_gemma":0.0022258307,"teacher_disagreement_score":0.0054876115,"about_ca_system_score_codex":0.0010736889,"about_ca_system_score_gemma":0.0019059868,"threshold_uncertainty_score":0.018357933},"labels":[],"label_agreement":null},{"id":"W1529269817","doi":"","title":"Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms forMulti-objective Network Partitioning","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Tabu search; Simulated annealing; Mathematical optimization; Heuristics; Computer science; Metaheuristic; Evolutionary algorithm; Set (abstract data type); Pareto principle; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.028422498015934283,"score_gpt":0.32132988627485826,"score_spread":0.292907388258924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529269817","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.7038182,0.01568528,0.24662603,0.0011107863,0.00045325307,0.00031456945,0.0004748539,0.0025512418,0.028965792],"genre_scores_gemma":[0.89044875,0.0017395597,0.10499777,0.00010985447,0.00004460179,0.00013359493,0.00040433768,0.00022893192,0.0018925088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996151,0.0022007609,0.00018331087,0.00023128046,0.0009552278,0.0002784932],"domain_scores_gemma":[0.9893121,0.008288579,0.0005175281,0.00073703524,0.0010010399,0.00014371071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040654107,0.0015168944,0.0017649393,0.002165052,0.00092795596,0.0017680201,0.0014883393,0.002252743,0.002072896],"category_scores_gemma":[0.014359878,0.00048134936,0.0010260459,0.002897493,0.0007350809,0.0019060567,0.0007795863,0.0008813617,0.0003348192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005302889,0.00020249233,0.0015938347,0.00028786744,0.00019544589,0.000039992115,0.000102260754,0.9157763,0.001968005,0.004594306,0.0009742317,0.07373493],"study_design_scores_gemma":[0.000038455888,0.0002668948,0.0009826113,0.000020775095,0.000042679385,0.00003806877,0.00004791114,0.9938552,0.0023826887,0.0015662919,0.00074336096,0.000015133327],"about_ca_topic_score_codex":0.007835726,"about_ca_topic_score_gemma":0.0054078824,"teacher_disagreement_score":0.007835726,"about_ca_system_score_codex":0.0019055931,"about_ca_system_score_gemma":0.0013977222,"threshold_uncertainty_score":0.02150017},"labels":[],"label_agreement":null},{"id":"W1531908466","doi":"10.1007/978-3-540-74581-5_2","title":"A Multi-Objective Genetic Algorithm Based on Density","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Pruning; Selection (genetic algorithm); Genetic algorithm; Fitness function; Mathematical optimization; Computer science; Set (abstract data type); Population; Construct (python library); Computation; Evolutionary algorithm; Algorithm; Mathematics; Artificial intelligence; Biology","score_opus":0.0200675455014978,"score_gpt":0.2705543683378924,"score_spread":0.2504868228363946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531908466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009216828,0.00023554037,0.9863412,0.00011595157,0.00012029364,0.00011215787,0.000018944645,0.00032834575,0.0035107194],"genre_scores_gemma":[0.20437288,0.00030691922,0.79030466,0.00018798187,0.0000864172,0.00057421025,0.000087108274,0.00012715644,0.003952663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00015777563,0.000018939585,0.00007136391,0.00020961103,0.00004009667],"domain_scores_gemma":[0.9992144,0.00043459595,0.00004599654,0.000044198932,0.00021811112,0.000042748314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011745135,0.00093068613,0.0016578395,0.0012889741,0.00087591115,0.0010190818,0.0022239138,0.0021095723,0.0028018488],"category_scores_gemma":[0.0028875745,0.00076085905,0.0010114661,0.0015269135,0.0009041948,0.0009642416,0.0015169176,0.0013500622,0.0005515453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005965729,0.000095650445,0.00047501858,0.00007851628,0.00007145329,0.00006561964,0.00008188332,0.86743265,0.0023152698,0.015173069,0.0013409943,0.112810165],"study_design_scores_gemma":[0.000019442108,0.000020842192,0.000057803452,0.000006772518,0.0000104433475,0.000017270464,0.0000040896384,0.9981287,0.00025943737,0.0011313173,0.00033802996,0.0000058723044],"about_ca_topic_score_codex":0.008742058,"about_ca_topic_score_gemma":0.005136269,"teacher_disagreement_score":0.008742058,"about_ca_system_score_codex":0.0011125973,"about_ca_system_score_gemma":0.0012553433,"threshold_uncertainty_score":0.017382383},"labels":[],"label_agreement":null},{"id":"W1542369266","doi":"10.1007/11740698_13","title":"The Importance of Scalability When Comparing Dynamic Weighted Aggregation and Pareto Front Techniques","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Computer science; Computation; Multi-objective optimization; Genetic algorithm; Population; Pareto principle; Mathematical optimization; Algorithm; Machine learning; Mathematics; Database","score_opus":0.008861077321542761,"score_gpt":0.24371619178205867,"score_spread":0.2348551144605159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542369266","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.20384477,0.013232169,0.71224636,0.0034247686,0.001995738,0.00075932796,0.00094005873,0.0013782494,0.062178615],"genre_scores_gemma":[0.70010805,0.0029936007,0.2899194,0.00043383986,0.0005684272,0.00047511543,0.00083385396,0.0007239023,0.0039436957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98361963,0.008821826,0.000908265,0.0006241441,0.0056701587,0.00035598016],"domain_scores_gemma":[0.8836475,0.09832196,0.0018793045,0.0075827986,0.007994227,0.000574246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021578006,0.0009409313,0.0016863943,0.0031559423,0.0011883554,0.0032754273,0.0018388194,0.0013818016,0.0040239836],"category_scores_gemma":[0.12606299,0.00038002452,0.0010342633,0.0044578565,0.001011952,0.008118052,0.0023103126,0.0018908673,0.00053436955],"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.0030732348,0.0005502909,0.012805568,0.0015846747,0.0010757786,0.000299556,0.0006253479,0.19855295,0.00905712,0.07786381,0.0144577585,0.6800539],"study_design_scores_gemma":[0.0003247233,0.00174993,0.01145152,0.0005587823,0.0009124564,0.00075577875,0.0012433045,0.7914329,0.01627203,0.16054656,0.0146216,0.00013039526],"about_ca_topic_score_codex":0.0019618268,"about_ca_topic_score_gemma":0.0034257912,"teacher_disagreement_score":0.021578006,"about_ca_system_score_codex":0.0009856626,"about_ca_system_score_gemma":0.0012438033,"threshold_uncertainty_score":0.11411673},"labels":[],"label_agreement":null},{"id":"W1543201103","doi":"10.1007/978-3-642-13800-3_30","title":"Time-Bounded Sequential Parameter Optimization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":74,"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; Bounded function; Overhead (engineering); Focus (optics); Optimization problem; Discrete optimization; Algorithm; Mathematics","score_opus":0.013939214822209132,"score_gpt":0.2546079592798334,"score_spread":0.24066874445762423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543201103","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.0040288176,0.00031415894,0.98339903,0.00014515269,0.00010401789,0.000045032728,0.00007599226,0.00043939002,0.011448502],"genre_scores_gemma":[0.497504,0.0010141562,0.4660353,0.00035378322,0.00030519057,0.00057484105,0.0006050082,0.0011344701,0.03247332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906665,0.0002796604,0.00003910337,0.00017310723,0.00032649902,0.00011512714],"domain_scores_gemma":[0.99807346,0.0012836688,0.00010086486,0.00025955736,0.00021243854,0.000069884765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014445116,0.0026143254,0.0019277242,0.0005548585,0.00051419856,0.0011049033,0.001557069,0.0012105406,0.010540578],"category_scores_gemma":[0.005654774,0.0008154138,0.0008200251,0.0012987865,0.0009983971,0.0015593813,0.0021400515,0.0019995454,0.0020624304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029631576,0.00007366569,0.00016011478,0.00019957985,0.00004568226,0.00006952472,0.00005355052,0.8503747,0.003453277,0.040269066,0.008042543,0.096961975],"study_design_scores_gemma":[0.000020795245,0.00003541056,0.00004403399,0.000007897722,0.000008583621,0.000021565766,0.000006227749,0.9757722,0.0006594025,0.022057965,0.0013620076,0.0000038997614],"about_ca_topic_score_codex":0.0021833458,"about_ca_topic_score_gemma":0.0021139877,"teacher_disagreement_score":0.010540578,"about_ca_system_score_codex":0.00076953607,"about_ca_system_score_gemma":0.0010856206,"threshold_uncertainty_score":0.03526175},"labels":[],"label_agreement":null},{"id":"W1550542145","doi":"10.1023/a:1011860702585","title":"Mixed Variable Optimization of the Number and Composition of Heat Intercepts in a Thermal Insulation System","year":2001,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":71,"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":"Categorical variable; Mathematical optimization; Mathematics; Discrete optimization; Variable (mathematics); Continuous optimization; Parametric statistics; Continuous variable; Reduction (mathematics); Function (biology); Optimization problem; Computer science; Statistics; Mathematical analysis","score_opus":0.006937388061216975,"score_gpt":0.19937026656132575,"score_spread":0.1924328785001088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550542145","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.41738904,0.00042419217,0.5766437,0.00025015787,0.000077993755,0.00005977771,0.000072683964,0.00020486553,0.004877524],"genre_scores_gemma":[0.96204245,0.00006643389,0.035691585,0.000025336321,0.000018868765,0.000056952173,0.00004053353,0.000051328294,0.0020065308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.00011437185,0.000010103579,0.00005197032,0.000046665667,0.00004182497],"domain_scores_gemma":[0.9988212,0.00084374484,0.00012349682,0.000029482015,0.00012672579,0.00005534118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012286315,0.0010174758,0.0011763093,0.00072999217,0.0006251679,0.0013234036,0.0006804593,0.0011249813,0.0017193314],"category_scores_gemma":[0.0026445414,0.00089727994,0.00052144413,0.00053797895,0.00091458624,0.0010825224,0.00068116264,0.00077476725,0.0001384133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010308883,0.000021181007,0.00020313505,0.000019044091,0.000013893547,0.000013391207,0.000009469174,0.9938315,0.0019628652,0.00082317606,0.000056306388,0.0029429784],"study_design_scores_gemma":[0.0000073250494,0.00002372723,0.00006572638,0.0000010840262,0.0000051248444,0.0000017602598,0.0000030949316,0.9987863,0.00078909576,0.00027812592,0.00003680522,0.0000019351985],"about_ca_topic_score_codex":0.0040028947,"about_ca_topic_score_gemma":0.003908286,"teacher_disagreement_score":0.0040028947,"about_ca_system_score_codex":0.001168133,"about_ca_system_score_gemma":0.0008301866,"threshold_uncertainty_score":0.008475423},"labels":[],"label_agreement":null},{"id":"W1552846432","doi":"10.1007/3-540-36970-8_24","title":"A New MOEA for Multi-objective TSP and Its Convergence Property Analysis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"York University","funders":"","keywords":"Crossover; Mathematical optimization; Selection (genetic algorithm); Convergence (economics); Evolutionary algorithm; Computer science; Property (philosophy); Operator (biology); Markov chain; Multi-objective optimization; Population; Tournament selection; Mutation; Mathematics; Artificial intelligence; Machine learning","score_opus":0.028218236087315086,"score_gpt":0.28008080356214216,"score_spread":0.25186256747482705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552846432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082497075,0.0011337367,0.98193604,0.0001108505,0.00020005126,0.000051429615,0.000036857236,0.00032207675,0.007959258],"genre_scores_gemma":[0.14510734,0.0018565516,0.83023846,0.00018722739,0.0002457453,0.00031493485,0.00020067344,0.00040877122,0.021440353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956185,0.00008179561,0.00002179822,0.000063953026,0.00023760392,0.00003299409],"domain_scores_gemma":[0.99949837,0.00019055801,0.000035429184,0.00006128116,0.00019059291,0.00002379701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867458,0.00082490686,0.0008578639,0.0011685621,0.0005979204,0.000818047,0.0009242896,0.00083493715,0.0031755012],"category_scores_gemma":[0.0018308357,0.0003586431,0.0010541315,0.0014821212,0.00066777447,0.0011790813,0.00086480845,0.0014293398,0.0006288379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016820162,0.0001389528,0.00072375813,0.0004781049,0.00021765113,0.00015083665,0.00015030909,0.43032897,0.022110684,0.11308935,0.0068379613,0.42560527],"study_design_scores_gemma":[0.000024585397,0.00014416593,0.0004763729,0.000030794734,0.00005798519,0.00023034768,0.000019432371,0.9548472,0.003422592,0.02822281,0.012500411,0.000023322225],"about_ca_topic_score_codex":0.0014184214,"about_ca_topic_score_gemma":0.0016078049,"teacher_disagreement_score":0.0031755012,"about_ca_system_score_codex":0.0006048722,"about_ca_system_score_gemma":0.00062351336,"threshold_uncertainty_score":0.010623097},"labels":[],"label_agreement":null},{"id":"W1566833990","doi":"10.1007/978-94-017-0161-7_42","title":"A Model-Based Framework for Robust Design","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Design matrix; Inverse; Logarithm; Robustness (evolution); Mathematics; Matrix (chemical analysis); Bandwidth (computing); Set (abstract data type); Computer science; Mathematical optimization; Algorithm; Applied mathematics; Statistics; Mathematical analysis; Regression analysis; Telecommunications; Geometry","score_opus":0.07856166619759361,"score_gpt":0.2824109632491055,"score_spread":0.20384929705151186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566833990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010921815,0.0002742797,0.9971113,0.000048120768,0.000028298587,0.000008354977,0.00001792861,0.00015884374,0.0022435645],"genre_scores_gemma":[0.07661853,0.002257122,0.90541154,0.00025238638,0.0002451341,0.00034227726,0.00025719719,0.0004175674,0.014198246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994185,0.00016087033,0.000030303618,0.00009247269,0.00027196662,0.000025912643],"domain_scores_gemma":[0.9996909,0.00012892582,0.0000333218,0.00006773644,0.00006828679,0.00001080186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079136225,0.0018395213,0.0015160823,0.0007122179,0.00043778657,0.0014965929,0.0022404108,0.0016272903,0.007117212],"category_scores_gemma":[0.0016836294,0.0010522848,0.0016076786,0.0008647227,0.0009850214,0.0015260951,0.0014044082,0.0023805073,0.0033564046],"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.00003644187,0.00003779686,0.000067006666,0.00032116397,0.00008213525,0.00009366517,0.00005210776,0.52097636,0.006020128,0.3261736,0.008930163,0.13720942],"study_design_scores_gemma":[0.000013487379,0.000048122092,0.0000466156,0.00004897724,0.00003153466,0.00009202705,0.00000795006,0.8028106,0.0015156022,0.17210864,0.023256835,0.000019686251],"about_ca_topic_score_codex":0.0016676275,"about_ca_topic_score_gemma":0.0018104308,"teacher_disagreement_score":0.007117212,"about_ca_system_score_codex":0.00061883935,"about_ca_system_score_gemma":0.00063911226,"threshold_uncertainty_score":0.023809433},"labels":[],"label_agreement":null},{"id":"W1574085630","doi":"10.1007/978-3-642-15461-4_43","title":"Inverse Modeling in Geoenvironmental Engineering Using a Novel Particle Swarm Optimization Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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 Saskatchewan","funders":"","keywords":"Particle swarm optimization; Computer science; Algorithm; Mathematical optimization; Inverse; Convergence (economics); Multi-swarm optimization; Inverse problem; Premature convergence; Population; Mathematics","score_opus":0.021452649873980066,"score_gpt":0.23416118009005418,"score_spread":0.2127085302160741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574085630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015040672,0.000070636605,0.99722916,0.00003585477,0.00003650358,0.000010696578,0.0000072867006,0.00006812805,0.0010376578],"genre_scores_gemma":[0.15695113,0.0004412857,0.8363163,0.00009537376,0.00011836032,0.00021135455,0.000092086855,0.00011042996,0.0056635546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.000043611144,0.000009725283,0.000030721545,0.000075111515,0.000008986341],"domain_scores_gemma":[0.99976414,0.00012563106,0.000022595816,0.000023671408,0.000055055996,0.000008852591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004172903,0.000661369,0.000951155,0.0003808242,0.00043985466,0.0008423698,0.0009846705,0.0016814315,0.0016069892],"category_scores_gemma":[0.00089861336,0.0005111702,0.00086658524,0.0007532409,0.00046267983,0.0010867522,0.0007461755,0.0009476416,0.0004970969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019813428,0.000044325094,0.0002150679,0.00005718625,0.000029211918,0.00005265271,0.000043267097,0.93712825,0.003045796,0.011575106,0.00087472226,0.046914678],"study_design_scores_gemma":[0.000001933361,0.000003539086,0.000019000276,0.0000013275547,0.000002274136,0.0000065774184,0.000001741427,0.9986519,0.00016091658,0.00076735043,0.00038147916,0.0000018386872],"about_ca_topic_score_codex":0.0035368034,"about_ca_topic_score_gemma":0.0029424322,"teacher_disagreement_score":0.0035368034,"about_ca_system_score_codex":0.00029642985,"about_ca_system_score_gemma":0.00053905713,"threshold_uncertainty_score":0.0070323944},"labels":[],"label_agreement":null},{"id":"W1578253793","doi":"10.1007/978-3-540-68123-6_28","title":"Hybrid Unsupervised/Supervised Virtual Reality Spaces for Visualizing Gastric and Liver Cancer Databases: An Evolutionary Computation Approach","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Data mining; Machine learning; Cluster analysis; Pattern recognition (psychology)","score_opus":0.047448569717176245,"score_gpt":0.30546356919975776,"score_spread":0.2580149994825815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578253793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023665909,0.00021272905,0.97404975,0.00012622762,0.00001535071,0.000045693378,0.000089801186,0.00052600005,0.0012685248],"genre_scores_gemma":[0.27255043,0.00029566922,0.7245207,0.00008863342,0.000026520709,0.00011396916,0.00021924473,0.0002307978,0.0019540743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.0001254647,0.000021530494,0.00007108808,0.00011751099,0.00004179328],"domain_scores_gemma":[0.999456,0.00026951768,0.00004700779,0.00006744911,0.00012356517,0.000036463287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091608893,0.0008165545,0.0009376607,0.001423521,0.0004639768,0.002358084,0.0016765496,0.0010799833,0.0019918082],"category_scores_gemma":[0.0016144227,0.00063782587,0.0013483616,0.0014091361,0.00056336756,0.0012895789,0.0014001856,0.00080285553,0.00038049615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028747434,0.00017503256,0.0015643697,0.00018606888,0.00017741664,0.00022185923,0.000369337,0.6038239,0.026763976,0.02493572,0.0026508027,0.33884403],"study_design_scores_gemma":[0.000005304919,0.000015318235,0.00023054409,0.000007665669,0.000009894262,0.000058870453,0.00003410509,0.9930494,0.002853624,0.0031827085,0.00054295565,0.000009672882],"about_ca_topic_score_codex":0.003159378,"about_ca_topic_score_gemma":0.005448006,"teacher_disagreement_score":0.003159378,"about_ca_system_score_codex":0.0005856887,"about_ca_system_score_gemma":0.0005577812,"threshold_uncertainty_score":0.006663263},"labels":[],"label_agreement":null},{"id":"W1603639300","doi":"10.1109/ccece.2001.933604","title":"A robust model parameter extraction technique based on meta-evolutionary programming for high speed/high frequency package interconnects","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Robustness (evolution); Computer science; Coplanar waveguide; Parametric statistics; Electronic engineering; Flip chip; Stripline; Evolutionary algorithm; Terahertz radiation; Convergence (economics); Algorithm; Engineering; Optoelectronics; Mathematics; Materials science; Telecommunications; Artificial intelligence","score_opus":0.07434086611109436,"score_gpt":0.27811175565235396,"score_spread":0.2037708895412596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603639300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008176754,0.000117739706,0.9908506,0.000056792305,0.000010091754,0.000014817419,0.000010890745,0.00009915698,0.0006630189],"genre_scores_gemma":[0.28884712,0.00024121256,0.7089004,0.000055775246,0.000022098777,0.00025431305,0.00007277989,0.00007387019,0.0015325322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997589,0.00009106475,0.000009667651,0.000036275218,0.000083642895,0.000020462534],"domain_scores_gemma":[0.9997781,0.000111864254,0.00003933311,0.000026943013,0.00003529737,0.000008526044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067898526,0.0007271708,0.00071028614,0.00044358702,0.0003305316,0.00054746494,0.0008212012,0.001010488,0.0008022231],"category_scores_gemma":[0.0010754997,0.0004679115,0.0009252791,0.0005654904,0.00044162516,0.0005181422,0.000528394,0.0010027355,0.00015218546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014532365,0.000022680744,0.00020095185,0.000038938168,0.00006131169,0.000055976714,0.000027646023,0.9447807,0.0068923687,0.009182445,0.00022107108,0.038501315],"study_design_scores_gemma":[0.000007948481,0.000028103885,0.00007769625,0.0000054843076,0.000011376794,0.000036817175,0.0000046067603,0.99450785,0.0015950882,0.0030191927,0.0007006002,0.0000053412555],"about_ca_topic_score_codex":0.00079383084,"about_ca_topic_score_gemma":0.00067154726,"teacher_disagreement_score":0.001010488,"about_ca_system_score_codex":0.00033377766,"about_ca_system_score_gemma":0.0005567473,"threshold_uncertainty_score":0.0035908818},"labels":[],"label_agreement":null},{"id":"W1603688956","doi":"10.1109/ijcnn.2005.1556070","title":"Feature subset selection via multi-objective genetic algorithm","year":2006,"lang":"en","type":"article","venue":"Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.","topic":"Advanced Multi-Objective Optimization Algorithms","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 Guelph","funders":"","keywords":"Computer science; Backpropagation; Genetic algorithm; Feature selection; Feature (linguistics); Selection (genetic algorithm); Population-based incremental learning; Algorithm; Artificial neural network; Artificial intelligence; Set (abstract data type); Pareto principle; Data mining; Pattern recognition (psychology); Machine learning; Mathematical optimization; Mathematics","score_opus":0.022377410316511352,"score_gpt":0.26340761261689805,"score_spread":0.2410302023003867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603688956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033618994,0.00014646995,0.964656,0.00015762605,0.000026353768,0.00009719528,0.00002893937,0.00033872505,0.00092973263],"genre_scores_gemma":[0.4330958,0.00013734597,0.5647968,0.00013744278,0.00003630338,0.00041014742,0.00015231952,0.00006049897,0.0011733122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990466,0.0003573123,0.000046094287,0.00015149941,0.00031497987,0.000083458486],"domain_scores_gemma":[0.9987098,0.000722552,0.000119262535,0.000077901765,0.00032228045,0.000048116206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021320912,0.0012386439,0.0014388196,0.002294926,0.00069413346,0.00091378926,0.0014767317,0.0013235525,0.0008628881],"category_scores_gemma":[0.004388191,0.00053847244,0.0010152125,0.0014217265,0.000698714,0.00092936633,0.0010301096,0.0008662294,0.00023788965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006521099,0.00009662979,0.0011870709,0.000033539007,0.00009760468,0.000092611495,0.00008098861,0.86332893,0.0031601172,0.004061039,0.00076493435,0.12703142],"study_design_scores_gemma":[0.000016533402,0.00002263908,0.000099111436,0.000003842341,0.000010512408,0.000016177384,0.00000699135,0.99696845,0.0007669604,0.0018924575,0.00019237895,0.0000040328605],"about_ca_topic_score_codex":0.002730824,"about_ca_topic_score_gemma":0.002140523,"teacher_disagreement_score":0.002730824,"about_ca_system_score_codex":0.0009257985,"about_ca_system_score_gemma":0.0011090602,"threshold_uncertainty_score":0.011275709},"labels":[],"label_agreement":null},{"id":"W1692713333","doi":"10.1109/icpr.2002.1044794","title":"Feature selection using multi-objective genetic algorithms for handwritten digit recognition","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"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; Feature selection; NIST; Artificial intelligence; Genetic algorithm; Novelty; Pattern recognition (psychology); Selection (genetic algorithm); Feature (linguistics); Generalization; Handwriting recognition; Data mining; Machine learning; Artificial neural network; Feature extraction; Speech recognition; Mathematics","score_opus":0.04481181056939632,"score_gpt":0.29718223166823804,"score_spread":0.2523704210988417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1692713333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006108902,0.001633193,0.9903296,0.00012303195,0.000050489027,0.000041252333,0.000018453708,0.00020598451,0.0014891189],"genre_scores_gemma":[0.21569291,0.0035940323,0.7749035,0.00016791391,0.00015713231,0.00026406063,0.00014043601,0.00010102463,0.0049790954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959,0.00016249767,0.000024005923,0.000049694012,0.00014380207,0.000030026269],"domain_scores_gemma":[0.9995433,0.0003118297,0.000039676353,0.000022418059,0.00007384408,0.000008960218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082024705,0.00088685803,0.0008607559,0.0011393994,0.0003363177,0.0006276401,0.0007882321,0.0009874193,0.00085427036],"category_scores_gemma":[0.0019327299,0.00030437642,0.0008212717,0.0018007348,0.0003948977,0.00048606913,0.00032044732,0.0006818615,0.0003398617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003619391,0.00009509271,0.00058126816,0.00012328512,0.00015669632,0.0001441173,0.000053872016,0.6460736,0.007293567,0.009953425,0.0015256199,0.33396322],"study_design_scores_gemma":[0.000008026211,0.00007411879,0.00032455742,0.000021822703,0.00002431619,0.00007715121,0.0000090980975,0.9859505,0.004190731,0.006072002,0.00323076,0.00001697848],"about_ca_topic_score_codex":0.0019732334,"about_ca_topic_score_gemma":0.002255423,"teacher_disagreement_score":0.0019732334,"about_ca_system_score_codex":0.00041231065,"about_ca_system_score_gemma":0.00032171153,"threshold_uncertainty_score":0.0043379664},"labels":[],"label_agreement":null},{"id":"W1766801768","doi":"10.1016/j.ifacol.2015.08.165","title":"Robust design of experiments using constrained stochastic optimization","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Particle swarm optimization; Mathematical optimization; Monte Carlo method; Optimal design; Set (abstract data type); Robust optimization; Fisher information; Design of experiments; Maximization; Stochastic optimization; Computer science; Mathematics; Statistics","score_opus":0.13765580702195318,"score_gpt":0.3134614791210271,"score_spread":0.17580567209907394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766801768","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.00235989,0.00008740791,0.99686855,0.000042226166,0.0000106528305,0.00007334642,0.000017876393,0.00008841801,0.00045168115],"genre_scores_gemma":[0.33852342,0.0004260495,0.6576009,0.00016130075,0.000044846227,0.0019300526,0.00020317825,0.00009914098,0.0010111551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614304,0.0019180649,0.00021457033,0.0007336594,0.0008244331,0.0001661899],"domain_scores_gemma":[0.99449474,0.0038054367,0.0008080994,0.0002642775,0.0005264738,0.00010096586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062237214,0.0018571704,0.0020822752,0.0010460747,0.00043903865,0.0013682076,0.0011377757,0.0013382056,0.0010215022],"category_scores_gemma":[0.009138555,0.0010326372,0.0015727595,0.00063160306,0.0015948785,0.00086099585,0.0016887962,0.0016028084,0.00020976765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006748352,0.000040247513,0.00011498891,0.00013830024,0.00006208382,0.000031051695,0.000021662783,0.9753494,0.003679331,0.010329952,0.00010242601,0.0100631155],"study_design_scores_gemma":[0.000022904189,0.000067315115,0.000060943203,0.000007426696,0.000009617909,0.0000048298693,0.000002428502,0.99464154,0.0013510716,0.0035226175,0.0003015499,0.0000075882044],"about_ca_topic_score_codex":0.0020601107,"about_ca_topic_score_gemma":0.0012106588,"teacher_disagreement_score":0.0062237214,"about_ca_system_score_codex":0.0013013466,"about_ca_system_score_gemma":0.0026581755,"threshold_uncertainty_score":0.03291458},"labels":[],"label_agreement":null},{"id":"W177935800","doi":"10.1007/978-3-642-10701-6_4","title":"Knowledge-Based Variable-Fidelity Optimization of Expensive Objective Functions through Space Mapping","year":2010,"lang":"en","type":"book-chapter","venue":"Adaptation, learning, and optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Space mapping; Fidelity; Computer science; Optimization problem; Space (punctuation); Surrogate model; Mathematical optimization; Variable (mathematics); Vector optimization; Algorithm; Mathematics; Multi-swarm optimization","score_opus":0.020379935224439136,"score_gpt":0.25123480710065743,"score_spread":0.23085487187621828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177935800","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.0035110966,0.00043912235,0.9918807,0.00007130314,0.000041224455,0.000010689898,0.000014221825,0.000109604836,0.0039220303],"genre_scores_gemma":[0.37521812,0.0014074678,0.6083608,0.00014363778,0.00014437926,0.0001701132,0.00016576053,0.0003462134,0.014043492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969816,0.000085427106,0.000013121377,0.00004982848,0.00012916182,0.000024289764],"domain_scores_gemma":[0.99945456,0.00036028997,0.00003407195,0.000068920046,0.000065291526,0.000016811258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962284,0.0008752334,0.0011252551,0.00040432363,0.0002552903,0.0010051462,0.0013846053,0.0011994581,0.0026502134],"category_scores_gemma":[0.002286328,0.00046848683,0.0006113295,0.0007381865,0.0008584199,0.0016042175,0.001658129,0.0016121553,0.0005048648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036974314,0.000035345056,0.000097573145,0.00013525209,0.000037099635,0.00003245394,0.00006253931,0.831697,0.0036314174,0.058717005,0.0020558513,0.10346138],"study_design_scores_gemma":[0.0000036416275,0.000014208425,0.00003733104,0.000010138656,0.0000044465273,0.000015679161,0.0000032504415,0.98621714,0.0007473934,0.011899707,0.0010422395,0.000004911045],"about_ca_topic_score_codex":0.00205048,"about_ca_topic_score_gemma":0.0024007156,"teacher_disagreement_score":0.0026502134,"about_ca_system_score_codex":0.0006340415,"about_ca_system_score_gemma":0.0005341832,"threshold_uncertainty_score":0.008865833},"labels":[],"label_agreement":null},{"id":"W1788829857","doi":"10.1016/j.apm.2015.09.008","title":"Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm","year":2015,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Multi-Objective Optimization Algorithms","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":"TransCanada (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Fidelity; Mathematical optimization; Computer science; Inviscid flow; Algorithm; High fidelity; Turbine; Optimization problem; Engineering; Mathematics; Mechanical engineering; Aerospace engineering","score_opus":0.0888120996797342,"score_gpt":0.30487300785960314,"score_spread":0.21606090817986895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788829857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07016085,0.00015336518,0.92474174,0.0001259468,0.000047577923,0.00006540886,0.00004973055,0.00020605585,0.0044493615],"genre_scores_gemma":[0.6952397,0.0001247775,0.30051428,0.00006990871,0.000035162906,0.00020038096,0.00011810892,0.00014877976,0.0035488817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979264,0.00006561541,0.000010610158,0.000026175181,0.00008589366,0.000019052788],"domain_scores_gemma":[0.99926764,0.00039706987,0.000080086145,0.00005727124,0.00015261819,0.000045401128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622183,0.00052716024,0.0008956408,0.0004344147,0.00037415713,0.0007579221,0.0008256756,0.0016349147,0.0017193994],"category_scores_gemma":[0.0021711653,0.0005646144,0.0006347928,0.00035964817,0.00058086106,0.00069185,0.0009054362,0.0007402728,0.00033093867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033397722,0.000023100703,0.0002336785,0.00002930377,0.000008609182,0.000034776527,0.000025703615,0.98658144,0.0019314765,0.0013866861,0.00012729206,0.009584496],"study_design_scores_gemma":[0.0000039505085,0.000008682292,0.000034336776,0.0000016376988,9.283253e-7,0.0000046684804,0.0000026289272,0.9995209,0.00019948487,0.00015564667,0.000065656655,0.0000015323504],"about_ca_topic_score_codex":0.0026249392,"about_ca_topic_score_gemma":0.0026766951,"teacher_disagreement_score":0.0026249392,"about_ca_system_score_codex":0.00048339867,"about_ca_system_score_gemma":0.00093703065,"threshold_uncertainty_score":0.005751908},"labels":[],"label_agreement":null},{"id":"W1833684988","doi":"10.1007/0-387-23152-8_57","title":"A New Method to Construct the Non-Dominated Set in Multi-Objective Genetic Algorithms","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Construct (python library); Benchmark (surveying); Convergence (economics); Set (abstract data type); Mathematical optimization; Computer science; Algorithm; Genetic algorithm; Cluster analysis; Multi-objective optimization; Mathematics; Artificial intelligence","score_opus":0.02084364257414391,"score_gpt":0.302866864529187,"score_spread":0.2820232219550431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833684988","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.0007417967,0.00013199078,0.9976509,0.000049131315,0.00003361625,0.00003028362,0.000008062154,0.00008554323,0.0012685872],"genre_scores_gemma":[0.020975163,0.0002591538,0.9759546,0.00012469498,0.000042729505,0.00030473934,0.000052668274,0.00011715954,0.0021690535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857676,0.00057277153,0.00006391475,0.0001662195,0.0005696016,0.000050726725],"domain_scores_gemma":[0.9991167,0.0004760569,0.000050532763,0.00010067357,0.00022655181,0.000029539207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022961458,0.001392122,0.0011911761,0.002065937,0.0009353265,0.0011751933,0.00194483,0.0016930422,0.0030783475],"category_scores_gemma":[0.0029879396,0.0007510834,0.0017373502,0.001528756,0.001384813,0.0018258508,0.0015625019,0.0025554004,0.0009915928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000648051,0.0001348137,0.0004004842,0.0003014506,0.0001639576,0.00015507748,0.00035665347,0.44592816,0.01253711,0.25288388,0.005898678,0.28117487],"study_design_scores_gemma":[0.000041286035,0.000071500894,0.0001132855,0.00004440481,0.000028199476,0.00013195374,0.000020147838,0.9301371,0.0042223507,0.05107487,0.014079531,0.000035292094],"about_ca_topic_score_codex":0.0009360634,"about_ca_topic_score_gemma":0.0009431325,"teacher_disagreement_score":0.0030783475,"about_ca_system_score_codex":0.0008760814,"about_ca_system_score_gemma":0.0011426917,"threshold_uncertainty_score":0.0121433735},"labels":[],"label_agreement":null},{"id":"W187020170","doi":"10.5555/1999416.1999433","title":"Multiobjective evolutionary optimization of a transportation fleet with a modified monetary cost function","year":2010,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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; Defence Research and Development Canada","funders":"","keywords":"Computer science; Multi-objective optimization; Sorting; Genetic algorithm; Mathematical optimization; Pareto principle; Monte Carlo method; Set (abstract data type); Evolutionary algorithm; Function (biology); Fleet management; Operations research; Engineering; Mathematics; Machine learning","score_opus":0.022515919018922703,"score_gpt":0.259158231377448,"score_spread":0.2366423123585253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187020170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15330723,0.00027617754,0.83824253,0.00041075246,0.00006673803,0.00008526242,0.000114172086,0.000107790635,0.0073893545],"genre_scores_gemma":[0.81753147,0.00020007708,0.17501053,0.00007909395,0.000018593744,0.0002494401,0.0001196635,0.00005601529,0.006735038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996637,0.0001703525,0.00001181588,0.000039423918,0.000069348425,0.000045329765],"domain_scores_gemma":[0.99958056,0.00022795223,0.000059851318,0.00003037856,0.00006487703,0.00003646571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818342,0.00070395664,0.00057424157,0.00069013424,0.00033875284,0.0008177921,0.0007685664,0.001236011,0.0017159668],"category_scores_gemma":[0.0019599567,0.00035060066,0.0008000493,0.0007686825,0.00047398827,0.00071543665,0.0005825423,0.0005834019,0.00016590253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065263807,0.000007807689,0.000075856406,0.000005293184,0.000006551199,0.000015574338,0.0000033752833,0.99658716,0.0002713071,0.0011806878,0.00005025291,0.0017895174],"study_design_scores_gemma":[0.000003900509,0.000014098409,0.000070476315,0.0000019823506,0.0000032984287,0.0000060431676,0.0000027971173,0.999111,0.00011117775,0.0005297217,0.00014334604,0.000002103007],"about_ca_topic_score_codex":0.0039223353,"about_ca_topic_score_gemma":0.0029722364,"teacher_disagreement_score":0.0039223353,"about_ca_system_score_codex":0.0011620816,"about_ca_system_score_gemma":0.000890418,"threshold_uncertainty_score":0.008431554},"labels":[],"label_agreement":null},{"id":"W1871676304","doi":"","title":"Bayesian optimization in high dimensions via random embeddings","year":2013,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Integer programming; Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.005049378076417137,"score_gpt":0.1907773810526467,"score_spread":0.18572800297622954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871676304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004686308,0.00019534524,0.99368286,0.00022077246,0.000017030543,0.000018937799,0.00002912464,0.00011327041,0.0010363351],"genre_scores_gemma":[0.38415942,0.0009602061,0.60656846,0.00038838756,0.00015539717,0.0005128888,0.00040942602,0.0003200171,0.0065258434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998033,0.0012078045,0.00006420695,0.00022856334,0.000345501,0.000120890574],"domain_scores_gemma":[0.9951444,0.003681541,0.00037579171,0.00025501408,0.00039423295,0.00014891519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033837284,0.0014942475,0.0015719892,0.0010295563,0.0005910883,0.0016219252,0.0012448409,0.0016705372,0.002441291],"category_scores_gemma":[0.010838844,0.001176493,0.0011408428,0.00096859265,0.002118382,0.0028359096,0.0030773543,0.0027990392,0.00066933705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007343375,0.000050049013,0.00045353954,0.00008369132,0.000055492277,0.000039338956,0.000062901614,0.8733909,0.00065186113,0.09395528,0.0014519176,0.02973156],"study_design_scores_gemma":[0.000008656524,0.000013375445,0.00005317029,0.000008451924,0.000003259738,0.0000057998614,0.000005095945,0.9691887,0.0001173207,0.030152872,0.0004366436,0.0000066858825],"about_ca_topic_score_codex":0.003984697,"about_ca_topic_score_gemma":0.0043151737,"teacher_disagreement_score":0.003984697,"about_ca_system_score_codex":0.0011247285,"about_ca_system_score_gemma":0.001323611,"threshold_uncertainty_score":0.017895043},"labels":[],"label_agreement":null},{"id":"W1951115035","doi":"10.24908/pceea.v0i0.4810","title":"Enhance Derivative Design Considering Global Sensitivity of Design Parameters","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Sensitivity (control systems); Multidisciplinary design optimization; Engineering design process; Computer science; Material derivative; Mathematical optimization; Curse of dimensionality; Aerodynamics; Variable (mathematics); Design process; Product design; Product (mathematics); Multidisciplinary approach; Mathematics; Engineering; Process engineering; Aerospace engineering; Artificial intelligence; Mechanical engineering; Process integration","score_opus":0.011479184713670971,"score_gpt":0.2221849050328735,"score_spread":0.21070572031920254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951115035","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.01844262,0.000087458735,0.97608054,0.000036576912,0.000018167788,0.00003616726,0.000015104129,0.00020557598,0.005077715],"genre_scores_gemma":[0.6864098,0.00019944926,0.3091468,0.00007854115,0.000024069659,0.00013150608,0.00007333907,0.00020340088,0.0037331565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00016268923,0.00002775219,0.00011291497,0.00029282246,0.000038476526],"domain_scores_gemma":[0.9993759,0.00028239822,0.00007699515,0.00010706042,0.00014079096,0.00001692311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010535673,0.001006495,0.00066135573,0.0006633113,0.00028520887,0.0007797869,0.00048289666,0.00059356866,0.0026720045],"category_scores_gemma":[0.0023408039,0.00033952086,0.00087907794,0.00035919587,0.00046118762,0.0008036523,0.0007609585,0.0006379106,0.00042319033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073580595,0.000080988146,0.0012199823,0.00019691,0.00004894382,0.00009505405,0.00010629225,0.8177732,0.051933486,0.0174623,0.0005991786,0.11041003],"study_design_scores_gemma":[0.000009990426,0.00011010855,0.00042853603,0.000011693176,0.00002017852,0.00005221625,0.00001168583,0.97935015,0.012050302,0.0052160765,0.002727528,0.000011508299],"about_ca_topic_score_codex":0.0007662654,"about_ca_topic_score_gemma":0.00065290614,"teacher_disagreement_score":0.0026720045,"about_ca_system_score_codex":0.00041574618,"about_ca_system_score_gemma":0.00068465597,"threshold_uncertainty_score":0.008938789},"labels":[],"label_agreement":null},{"id":"W1959931857","doi":"10.1007/s00158-015-1289-x","title":"Pareto front spacing with differential geometry in multidisciplinary systems","year":2015,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-objective optimization; Multidisciplinary design optimization; Mathematical optimization; Pareto principle; Engineering design process; Multidisciplinary approach; Differential (mechanical device); Mathematics; Computer science; Applied mathematics; Engineering; Mechanical engineering","score_opus":0.015826606312884108,"score_gpt":0.2571660949186689,"score_spread":0.24133948860578477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959931857","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.022776062,0.00035997544,0.97094125,0.00026761592,0.000081783895,0.000049682552,0.00003397164,0.000065853594,0.005423806],"genre_scores_gemma":[0.71414995,0.00052957074,0.27940506,0.00016006855,0.00018512229,0.00024003211,0.00008582114,0.00010280168,0.005141663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977043,0.001309248,0.00006931977,0.00020695002,0.00058060227,0.00012950503],"domain_scores_gemma":[0.992334,0.0056967144,0.0004722886,0.00042665322,0.0007193442,0.0003510129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468976,0.00095221266,0.0014275163,0.002267636,0.0009867422,0.0019372228,0.001924136,0.0017968819,0.0030982532],"category_scores_gemma":[0.014091165,0.0009286065,0.0011204093,0.0016795067,0.0021536096,0.0023736279,0.0039346335,0.0017792018,0.00034220747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006822613,0.000060961906,0.0005941693,0.000073311574,0.000030471903,0.00005777127,0.00007062654,0.8273555,0.00072804803,0.14528899,0.0006075051,0.025064465],"study_design_scores_gemma":[0.00001308835,0.000036927933,0.00015226057,0.000013294005,0.000007407503,0.000020356933,0.000015274174,0.93860245,0.00024721987,0.060306143,0.0005767415,0.000008876593],"about_ca_topic_score_codex":0.00113825,"about_ca_topic_score_gemma":0.0007845362,"teacher_disagreement_score":0.005468976,"about_ca_system_score_codex":0.002152151,"about_ca_system_score_gemma":0.0012319138,"threshold_uncertainty_score":0.028923094},"labels":[],"label_agreement":null},{"id":"W1966864823","doi":"10.1115/1.1904639","title":"An Efficient Pareto Set Identification Approach for Multiobjective Optimization on Black-Box Functions","year":2004,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"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":"Mathematical optimization; Pareto principle; Robustness (evolution); Multi-objective optimization; Black box; Computer science; Computation; Set (abstract data type); Identification (biology); Engineering design process; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.0375184653111403,"score_gpt":0.29753607695384204,"score_spread":0.26001761164270176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966864823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007175914,0.000028646224,0.9982653,0.000014222543,0.000005344069,0.000017825512,0.000004696484,0.000036742793,0.00090967305],"genre_scores_gemma":[0.08334294,0.00022642458,0.91277194,0.00007490133,0.000022548988,0.00040978345,0.000059839967,0.00008336283,0.0030082844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.00032939107,0.0000255502,0.00006937593,0.00043501979,0.000050870778],"domain_scores_gemma":[0.9991066,0.00054138096,0.000055560402,0.00008602066,0.00018042357,0.000029993293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023794952,0.0011622809,0.0011148619,0.001463632,0.00078995817,0.0008430632,0.0011285573,0.0010968753,0.0028874387],"category_scores_gemma":[0.0026954187,0.0006079113,0.0013595697,0.00091745245,0.0010864607,0.001145671,0.0018687415,0.0016196643,0.0007881547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003574726,0.000055964505,0.00018925671,0.000109328925,0.000038870283,0.00005384066,0.00007274006,0.8229602,0.00483204,0.07913028,0.0009029936,0.09161872],"study_design_scores_gemma":[0.0000055947544,0.000022070146,0.000032727276,0.0000134140155,0.0000045182524,0.0000173605,0.000005247706,0.9821813,0.001019951,0.015294508,0.0013967572,0.0000066541247],"about_ca_topic_score_codex":0.0010720034,"about_ca_topic_score_gemma":0.0013122327,"teacher_disagreement_score":0.0028874387,"about_ca_system_score_codex":0.0007145396,"about_ca_system_score_gemma":0.0014958404,"threshold_uncertainty_score":0.01258409},"labels":[],"label_agreement":null},{"id":"W1966918386","doi":"10.1007/s00158-010-0529-3","title":"A comparative study of metamodeling methods considering sample quality merits","year":2010,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"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; Western Canada Research Grid","keywords":"Metamodeling; Kriging; Computer science; Robustness (evolution); Artificial neural network; Sample (material); Sample size determination; Data mining; Machine learning; Artificial intelligence; Mathematics; Statistics","score_opus":0.05472640559811635,"score_gpt":0.40639614121822254,"score_spread":0.35166973562010617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966918386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20065022,0.0022131565,0.7900837,0.00048334413,0.00007159441,0.00012642897,0.00016568768,0.00072213216,0.0054837414],"genre_scores_gemma":[0.70429796,0.00059970655,0.29353473,0.00006917156,0.000048157082,0.00009537977,0.00019849809,0.0002760574,0.0008803022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933862,0.0046724556,0.00026106075,0.00038144292,0.001174513,0.00012423923],"domain_scores_gemma":[0.8906921,0.09502914,0.0020959368,0.005836389,0.0058928216,0.0004535231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019573012,0.0006841114,0.0014199087,0.002564686,0.00047156663,0.0015646428,0.0012982448,0.0013117822,0.002443927],"category_scores_gemma":[0.084179945,0.00032770768,0.0008704487,0.0017300821,0.00059712643,0.0026382052,0.0010201164,0.00067903026,0.00029620863],"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.0027452942,0.0003487289,0.013809873,0.00073914876,0.00054586073,0.00008416124,0.00046107036,0.2932413,0.010345448,0.02620494,0.0010966939,0.6503776],"study_design_scores_gemma":[0.00012630143,0.00059865316,0.0059748166,0.000118620235,0.0003197418,0.00014504232,0.00027937675,0.967771,0.011609181,0.011285528,0.0017269055,0.00004488585],"about_ca_topic_score_codex":0.0011951164,"about_ca_topic_score_gemma":0.0017768288,"teacher_disagreement_score":0.019573012,"about_ca_system_score_codex":0.0007810449,"about_ca_system_score_gemma":0.000816426,"threshold_uncertainty_score":0.10351324},"labels":[],"label_agreement":null},{"id":"W1967532012","doi":"10.1115/power2013-98149","title":"Multi-Objective Optimization of Runner Blades Using a Multi-Fidelity Algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Andritz (Canada); Polytechnique Montréal","funders":"","keywords":"Solver; Mathematical optimization; Computer science; Fidelity; Process (computing); Turbine; Variable (mathematics); Multi-objective optimization; Range (aeronautics); Constraint (computer-aided design); Algorithm; Mathematics; Engineering; Mechanical engineering","score_opus":0.028195408378132374,"score_gpt":0.2873632761045762,"score_spread":0.2591678677264438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967532012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007959408,0.000058879938,0.99045116,0.000029537146,0.000008812442,0.000041680676,0.00001785964,0.00009733682,0.0013354477],"genre_scores_gemma":[0.2545678,0.00011655104,0.74260145,0.000036015485,0.000015234305,0.00028288338,0.0000868352,0.000090852925,0.0022024142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.0001392744,0.000021945414,0.00005336757,0.00015564871,0.000032940134],"domain_scores_gemma":[0.99938285,0.00033280492,0.00009344963,0.00005467148,0.00011084577,0.000025434349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014913311,0.0006733756,0.00081071985,0.0005421646,0.0003637461,0.00076073693,0.0007753806,0.0011785894,0.0018629311],"category_scores_gemma":[0.0019146483,0.0004775337,0.00092130067,0.000317888,0.00048286654,0.0005667082,0.00081536366,0.0008712067,0.000339783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015902651,0.000016690094,0.00017719633,0.00004075896,0.000011770237,0.00002497962,0.000022193128,0.98099786,0.0029944172,0.0034190651,0.00010093753,0.012178317],"study_design_scores_gemma":[0.0000033319868,0.000015101981,0.00004110997,0.0000043578652,0.0000019190659,0.000005986171,0.0000018461076,0.99871016,0.00063212187,0.00031183998,0.0002699041,0.0000024305768],"about_ca_topic_score_codex":0.0021036912,"about_ca_topic_score_gemma":0.0020759245,"teacher_disagreement_score":0.0021036912,"about_ca_system_score_codex":0.0005519368,"about_ca_system_score_gemma":0.00090968725,"threshold_uncertainty_score":0.007887065},"labels":[],"label_agreement":null},{"id":"W1968093411","doi":"10.4028/www.scientific.net/amm.48-49.314","title":"Cognitive Radio Decision Engine Based on Multi-Objective Genetic Algorithm","year":2011,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Cognitive radio; Weighting; Genetic algorithm; Computer science; Mathematical optimization; Population; Adaptation (eye); Multi-objective optimization; Optimization problem; Algorithm; Machine learning; Mathematics; Wireless; Telecommunications","score_opus":0.018372302589333426,"score_gpt":0.24030071739757222,"score_spread":0.2219284148082388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968093411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023501351,0.00023054518,0.97329336,0.000119640405,0.00004751393,0.00004714651,0.000011093155,0.00022814846,0.002521144],"genre_scores_gemma":[0.80408585,0.0003103045,0.19239639,0.0001403529,0.000042323634,0.00020250988,0.00004141708,0.000034904497,0.0027459436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996032,0.0001061947,0.000017578774,0.00006822143,0.00015425796,0.000050479848],"domain_scores_gemma":[0.9996389,0.00017562853,0.000045953326,0.000016564638,0.000104983665,0.000017871125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088358583,0.00066782377,0.00079282955,0.0005317113,0.00038627087,0.0008802221,0.0011931998,0.00082515256,0.0006976414],"category_scores_gemma":[0.0014669221,0.00025392266,0.0005056635,0.00050849444,0.00052104547,0.00067704904,0.0005333631,0.00073695893,0.00014624305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003911083,0.000043605407,0.00039682147,0.000030584913,0.000056184082,0.00005658938,0.00004189738,0.9402571,0.0025798446,0.008715329,0.00045119118,0.04733175],"study_design_scores_gemma":[0.000012088687,0.000015523974,0.00005189662,0.00000255852,0.000006708589,0.0000089253435,0.0000031682482,0.9979373,0.00045438105,0.0013357223,0.0001679878,0.0000037447398],"about_ca_topic_score_codex":0.0043185633,"about_ca_topic_score_gemma":0.0024988034,"teacher_disagreement_score":0.0043185633,"about_ca_system_score_codex":0.00064243353,"about_ca_system_score_gemma":0.00085979025,"threshold_uncertainty_score":0.008586884},"labels":[],"label_agreement":null},{"id":"W1969411792","doi":"10.1115/detc2008-50061","title":"A Study of Covariance Functions for Multi-Response Metamodeling for Simulation-Based Design and Optimization","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Pennsylvania Department of Community and Economic Development","keywords":"Metamodeling; Covariance; Computer science; Covariance function; Engineering design process; Set (abstract data type); Design of experiments; Mathematical optimization; Machine learning; Algorithm; Mathematics; Covariance matrix; Engineering; Statistics","score_opus":0.12711970093626482,"score_gpt":0.34310777848872687,"score_spread":0.21598807755246205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969411792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042796186,0.00011516527,0.99494123,0.00010182984,0.000010567741,0.000016269714,0.000014320969,0.00007197935,0.0004489536],"genre_scores_gemma":[0.42674625,0.00068749697,0.5700888,0.00017858556,0.000039476086,0.00037769266,0.00019342462,0.00026414965,0.0014241321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762326,0.0014704735,0.000083608335,0.00017475967,0.00056271633,0.00008508638],"domain_scores_gemma":[0.9897105,0.008001485,0.0006510952,0.0006127329,0.00088683603,0.00013731963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007262626,0.001354999,0.0012007436,0.00087472436,0.00048405686,0.0010567246,0.0009893912,0.0014153295,0.0012298638],"category_scores_gemma":[0.017996829,0.00087733904,0.0015411532,0.00071327924,0.0008797718,0.0013021505,0.0011790561,0.0023753287,0.00028806872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002770426,0.000032517262,0.00044218224,0.000057181143,0.000035314126,0.000015981146,0.00003008141,0.9692544,0.0012857754,0.01612144,0.00016251995,0.012534938],"study_design_scores_gemma":[0.0000017935171,0.00001160814,0.000052571846,0.000007865359,0.0000030694305,0.0000036771955,0.0000020292903,0.9977375,0.0003391579,0.0016322805,0.00020512598,0.0000032731334],"about_ca_topic_score_codex":0.0032466825,"about_ca_topic_score_gemma":0.0023031598,"teacher_disagreement_score":0.007262626,"about_ca_system_score_codex":0.0012064105,"about_ca_system_score_gemma":0.0015551856,"threshold_uncertainty_score":0.038408935},"labels":[],"label_agreement":null},{"id":"W1969784127","doi":"10.1007/s11081-009-9082-6","title":"Benchmarking multidisciplinary design optimization algorithms","year":2009,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmarking; Multidisciplinary design optimization; Computer science; Modular design; Python (programming language); Multidisciplinary approach; Algorithm; Programming language","score_opus":0.011916215872024604,"score_gpt":0.2317326145440032,"score_spread":0.2198163986719786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969784127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31090793,0.0035277638,0.6176033,0.0010924495,0.00095041556,0.00038415866,0.0011430259,0.0029584162,0.06143255],"genre_scores_gemma":[0.7314624,0.00044108802,0.26286992,0.00019923027,0.00010768475,0.0003859573,0.0014881677,0.00051846413,0.0025270707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524635,0.002446248,0.0002361462,0.0003801494,0.0014567295,0.00023442606],"domain_scores_gemma":[0.99198884,0.0038003647,0.0002798418,0.0018782935,0.0018249736,0.0002276133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005847069,0.0015561648,0.0017017396,0.0025956612,0.0008340191,0.0016328208,0.0022720678,0.0029225731,0.0068565435],"category_scores_gemma":[0.015588711,0.00043437327,0.0011908767,0.0024774713,0.00072234235,0.0015335009,0.0018662979,0.0013066622,0.0010716603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024821557,0.0004726156,0.0016777697,0.00032491548,0.0001485807,0.000047801634,0.000033908946,0.88371927,0.00242469,0.0113851605,0.003317066,0.096200064],"study_design_scores_gemma":[0.000041990756,0.00012519745,0.00047805384,0.00002791767,0.000019936717,0.000029487608,0.000021531972,0.99039257,0.0029646305,0.0041960934,0.0016931123,0.00000955214],"about_ca_topic_score_codex":0.0011282288,"about_ca_topic_score_gemma":0.0011760354,"teacher_disagreement_score":0.0068565435,"about_ca_system_score_codex":0.0011183545,"about_ca_system_score_gemma":0.0010871269,"threshold_uncertainty_score":0.030922592},"labels":[],"label_agreement":null},{"id":"W1969837585","doi":"10.1109/nabic.2009.5393704","title":"Solving multiple-objective optimization problems using GISMOO algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Benchmark (surveying); Pareto principle; Computer science; Genetic algorithm; Algorithm; Artificial immune system; Multi-objective optimization; Mathematical optimization; Optimization algorithm; Optimization problem; Pareto optimal; Artificial intelligence; Mathematics; Machine learning","score_opus":0.01842879423602076,"score_gpt":0.260995659927023,"score_spread":0.24256686569100225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969837585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014965219,0.00040059467,0.9805787,0.00010854036,0.000050380826,0.000052830434,0.000032507465,0.00033570614,0.0034755263],"genre_scores_gemma":[0.23107475,0.0005065212,0.7646993,0.00015718045,0.00005919334,0.00025355918,0.0002489292,0.00011329449,0.0028872257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.000092128816,0.000018826882,0.00005223922,0.00016717156,0.000032482007],"domain_scores_gemma":[0.99979633,0.00009457262,0.000027790462,0.000017112816,0.00004873337,0.000015440897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558312,0.00093713915,0.0010317124,0.0011063942,0.00048165247,0.00057063624,0.0009887174,0.0010775723,0.0018420622],"category_scores_gemma":[0.00090832484,0.00029019266,0.00086749444,0.0010197962,0.0003732745,0.0008011628,0.00084952853,0.00070520025,0.0004361452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005497777,0.00008736029,0.0011147023,0.00017031781,0.00011904249,0.00012947473,0.000054076605,0.799065,0.004443277,0.0137878,0.0015247118,0.17944925],"study_design_scores_gemma":[0.000022307398,0.000050082865,0.00020663254,0.000010540273,0.000012560052,0.000041374024,0.000013231438,0.9923023,0.0008926942,0.004073258,0.0023675053,0.0000075200746],"about_ca_topic_score_codex":0.0014224687,"about_ca_topic_score_gemma":0.0021196099,"teacher_disagreement_score":0.0018420622,"about_ca_system_score_codex":0.0003889698,"about_ca_system_score_gemma":0.00071141915,"threshold_uncertainty_score":0.006162286},"labels":[],"label_agreement":null},{"id":"W1970596070","doi":"10.1115/detc2008-49702","title":"A Hybrid Relationship Modeling Scheme for Parametric Design Considering Uncertainties","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Parametric statistics; Mathematical optimization; Computer science; Fuzzy logic; Scheme (mathematics); Design of experiments; Optimal design; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.13520862043381765,"score_gpt":0.29615701153399215,"score_spread":0.1609483911001745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970596070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001274284,0.0000649422,0.9973749,0.00002661735,0.000010501451,0.00002015966,0.000017061084,0.0000757634,0.0011357823],"genre_scores_gemma":[0.2519593,0.00058836374,0.74209553,0.000084004976,0.000054547578,0.00049365876,0.00015238082,0.00008790625,0.0044842665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990496,0.00028456716,0.000058188954,0.00016963879,0.00040226922,0.000035640212],"domain_scores_gemma":[0.9993844,0.00029141,0.00009602409,0.00011613331,0.000094536095,0.000017412547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551799,0.000853192,0.0005833588,0.00087017467,0.00040886254,0.0010461371,0.0018210394,0.0011634501,0.0027115352],"category_scores_gemma":[0.0021484175,0.00053078897,0.0012770966,0.0007911217,0.00070661196,0.0027645957,0.0011230764,0.0011543159,0.00069297844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033397195,0.000028364002,0.0002606276,0.00007892268,0.000036705922,0.0000772428,0.00011136688,0.80928016,0.0048650317,0.1240859,0.00044966882,0.06069268],"study_design_scores_gemma":[0.000005920281,0.000041187337,0.000047037636,0.000011533479,0.000013061406,0.000047772948,0.000006163438,0.9783659,0.0009331171,0.016042465,0.0044721677,0.00001382254],"about_ca_topic_score_codex":0.0012358057,"about_ca_topic_score_gemma":0.0010654437,"teacher_disagreement_score":0.0027115352,"about_ca_system_score_codex":0.00061174977,"about_ca_system_score_gemma":0.00067089155,"threshold_uncertainty_score":0.0090709925},"labels":[],"label_agreement":null},{"id":"W1970883045","doi":"10.1243/14644207jmda260","title":"Multi-objective evolutionary optimization of polynomial neural networks for fatigue life modelling and prediction of unidirectional carbon-fibre-reinforced plastics composites","year":2010,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part L Journal of Materials Design and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Artificial neural network; Group method of data handling; Multi-objective optimization; Evolutionary algorithm; Pareto principle; Computer science; Materials science; Structural engineering; Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Machine learning","score_opus":0.020856864684263652,"score_gpt":0.2288680963270359,"score_spread":0.20801123164277224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970883045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14106226,0.0005660566,0.85448575,0.00017844012,0.000036402907,0.000061551276,0.000046109053,0.00014536953,0.0034179993],"genre_scores_gemma":[0.90879136,0.00027415206,0.08849317,0.00004870401,0.000016182446,0.00018271036,0.000075207914,0.000023936162,0.0020945899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997937,0.00008119215,0.000009564761,0.00003674697,0.000050531326,0.000028270077],"domain_scores_gemma":[0.9995852,0.0002569872,0.00004924291,0.000016337302,0.000076765486,0.000015497704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007587037,0.0008649065,0.00052620115,0.00042878356,0.00027068038,0.00054022064,0.0006358451,0.0010435903,0.0006407037],"category_scores_gemma":[0.0014141364,0.0003303007,0.00071406475,0.00034477314,0.0004219454,0.0004357539,0.00053141924,0.0008702319,0.00008845664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007829428,0.0000081398875,0.0001270755,0.0000112391,0.000007319806,0.000013102499,0.000007467487,0.994921,0.0004502621,0.0003614707,0.000024654168,0.0040604617],"study_design_scores_gemma":[7.1499244e-7,0.000005101239,0.000024056078,8.7687965e-7,0.0000010798515,9.522642e-7,0.0000012114875,0.99976116,0.00009484224,0.00008983996,0.0000194549,6.26257e-7],"about_ca_topic_score_codex":0.0050902516,"about_ca_topic_score_gemma":0.00466439,"teacher_disagreement_score":0.0050902516,"about_ca_system_score_codex":0.00059553474,"about_ca_system_score_gemma":0.0007037025,"threshold_uncertainty_score":0.010121226},"labels":[],"label_agreement":null},{"id":"W1971004571","doi":"10.1145/1555386.1555389","title":"pyMDO","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Computer science; Python (programming language); Fortran; Interface (matter); Object-oriented programming; Programming language; Focus (optics); Computational science; Parallel computing","score_opus":0.01763026921332817,"score_gpt":0.27442120303162154,"score_spread":0.2567909338182934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971004571","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.002249737,0.00040129368,0.9113844,0.0005001275,0.0003858475,0.00022274542,0.0046169925,0.06462039,0.015618534],"genre_scores_gemma":[0.047173567,0.0012063627,0.8811992,0.00094598334,0.00020163864,0.0012017415,0.014921155,0.03259748,0.020553043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990656,0.00014542388,0.00007181121,0.00015732921,0.00043482805,0.00012501031],"domain_scores_gemma":[0.9985446,0.00049830176,0.00011180681,0.0003589866,0.00033248647,0.00015395797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017615058,0.0010562988,0.0011406466,0.0010784011,0.00089214236,0.0031193383,0.004416531,0.001528644,0.045360476],"category_scores_gemma":[0.0061216233,0.0008904935,0.00203166,0.0009910747,0.00083130243,0.0033116702,0.004607905,0.0025041252,0.015368479],"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.0006048969,0.00027643258,0.0046988633,0.0022320312,0.0002979773,0.00071784906,0.00045202597,0.08052342,0.009536799,0.1675277,0.30777478,0.4253572],"study_design_scores_gemma":[0.00024765293,0.000066398694,0.0008364108,0.0001944345,0.00005753577,0.0004591815,0.000058669775,0.23447718,0.009159595,0.07444057,0.67989254,0.00010979287],"about_ca_topic_score_codex":0.002237871,"about_ca_topic_score_gemma":0.0024013596,"teacher_disagreement_score":0.045360476,"about_ca_system_score_codex":0.0006212954,"about_ca_system_score_gemma":0.0022549725,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1971138856","doi":"10.1007/s00158-005-0523-3","title":"Hybrid evolutionary algorithm and application to structural optimization","year":2005,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Truss; Evolutionary algorithm; Convergence (economics); Computer science; Local optimum; Algorithm; Benchmarking; Heuristic; Genetic algorithm; Global optimization; Engineering design process; Mathematics; Engineering","score_opus":0.005438449798877566,"score_gpt":0.25516550440984653,"score_spread":0.24972705461096897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971138856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010028474,0.0006023147,0.9832182,0.00010722976,0.000092654154,0.000018411854,0.000019155124,0.00016947043,0.0057441243],"genre_scores_gemma":[0.3191833,0.000996668,0.66499573,0.000146129,0.00012677709,0.00020844181,0.00007640378,0.00015706997,0.014109355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997714,0.00007500405,0.000008904856,0.000022458915,0.000108562024,0.0000136496155],"domain_scores_gemma":[0.99938333,0.00039021918,0.000023860488,0.000052156178,0.00013149464,0.00001893726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075675006,0.00049680134,0.0008181351,0.00088825845,0.0004164673,0.0008243195,0.00091389107,0.001483762,0.0035945023],"category_scores_gemma":[0.0025214446,0.0004122898,0.0005418827,0.001422036,0.0005762508,0.00082936,0.0008199106,0.0008578586,0.00056063005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006928174,0.000053481057,0.0003247853,0.00007780216,0.00006541547,0.000070461545,0.000056496632,0.8270507,0.003162037,0.04683051,0.001284361,0.12095464],"study_design_scores_gemma":[0.000009323113,0.000016793978,0.000086857515,0.0000045278125,0.000006369001,0.000021394699,0.0000043753635,0.99084646,0.0003121131,0.007566338,0.0011206759,0.000004776252],"about_ca_topic_score_codex":0.0015351482,"about_ca_topic_score_gemma":0.0016237745,"teacher_disagreement_score":0.0035945023,"about_ca_system_score_codex":0.00030617387,"about_ca_system_score_gemma":0.00030543946,"threshold_uncertainty_score":0.01202476},"labels":[],"label_agreement":null},{"id":"W1973412675","doi":"10.1115/1.1561044","title":"Adaptive Response Surface Method Using Inherited Latin Hypercube Design Points","year":2003,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":514,"is_retracted":false,"has_abstract":true,"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; Chonnam National University; Fonds National de la Recherche Luxembourg; University of Florida","keywords":"Latin hypercube sampling; Computation; Hypercube; Computer science; Set (abstract data type); Mathematical optimization; Optimal design; Mathematics; Algorithm; Parallel computing; Monte Carlo method; Statistics; Machine learning","score_opus":0.10890294536531425,"score_gpt":0.331500225385195,"score_spread":0.22259728001988077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973412675","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.002701206,0.000059288715,0.9962913,0.000021955768,0.00001485739,0.00003925298,0.000006277135,0.0001436391,0.00072228926],"genre_scores_gemma":[0.106625624,0.0001616497,0.89059305,0.00008592171,0.00002833846,0.0005869611,0.000066050634,0.00011437773,0.0017380331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981559,0.0011791551,0.000056567733,0.0001318101,0.00043230364,0.00004433481],"domain_scores_gemma":[0.9985073,0.0008778839,0.000117892014,0.00014283734,0.00032067986,0.00003339525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026044322,0.00082315394,0.000996647,0.00076525874,0.00031716784,0.00055963837,0.00093870074,0.00074208766,0.002665949],"category_scores_gemma":[0.0036726973,0.00041365786,0.0007834642,0.00064889004,0.0006118833,0.000640472,0.00083465787,0.00094511645,0.00082913286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016217979,0.00006786557,0.000360627,0.00020180523,0.00006769667,0.00006592232,0.00010447773,0.84042037,0.015078456,0.014234138,0.0006235581,0.12861283],"study_design_scores_gemma":[0.000031013707,0.0001570731,0.00006525757,0.000010515617,0.000008987093,0.000025489195,0.000008356433,0.9915609,0.0031381622,0.0027436495,0.002240783,0.000009791431],"about_ca_topic_score_codex":0.00059680926,"about_ca_topic_score_gemma":0.00059441733,"teacher_disagreement_score":0.002665949,"about_ca_system_score_codex":0.0003444185,"about_ca_system_score_gemma":0.00069916825,"threshold_uncertainty_score":0.01377368},"labels":[],"label_agreement":null},{"id":"W1974923626","doi":"10.2514/1.45790","title":"Comparison of Surrogate Models in a Multidisciplinary Optimization Framework for Wing Design","year":2010,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":68,"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":"Wing; Multidisciplinary design optimization; Surrogate model; Multidisciplinary approach; Computational fluid dynamics; Shape optimization; Wing configuration; Computer science; Aerospace engineering; Mathematical optimization; Engineering; Structural engineering; Mathematics; Finite element method","score_opus":0.06017781714268427,"score_gpt":0.36647302473989535,"score_spread":0.30629520759721107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974923626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05441128,0.0005558356,0.9400468,0.00028128407,0.000037272595,0.000053265772,0.00006708383,0.00013872916,0.0044084215],"genre_scores_gemma":[0.7364894,0.0006830305,0.2607447,0.000071665716,0.0000222453,0.00021133365,0.00017389139,0.0000947283,0.0015090313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998572,0.0009848352,0.000043889355,0.000052201776,0.00030986825,0.000037218833],"domain_scores_gemma":[0.9982482,0.0011498358,0.00010909978,0.00022102473,0.00022670746,0.00004518075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029353104,0.0006069538,0.00085557083,0.0005847455,0.00025635594,0.00094667694,0.0007187096,0.0011958339,0.0011343808],"category_scores_gemma":[0.0045363596,0.0003057518,0.0007162385,0.00070257037,0.00043866943,0.0011253549,0.0010102739,0.0010201309,0.00029247778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078247176,0.000045716188,0.00029989428,0.00004336395,0.000025713614,0.000018083078,0.000021619733,0.9734455,0.00079542893,0.011947666,0.0001023936,0.013176418],"study_design_scores_gemma":[0.000005764387,0.00005293456,0.00008980948,0.0000075475605,0.000003677668,0.000009893869,0.000007102472,0.9969117,0.00030934124,0.0022512255,0.00034696917,0.0000039375436],"about_ca_topic_score_codex":0.000858631,"about_ca_topic_score_gemma":0.0011952575,"teacher_disagreement_score":0.0029353104,"about_ca_system_score_codex":0.00048006882,"about_ca_system_score_gemma":0.000678257,"threshold_uncertainty_score":0.015523553},"labels":[],"label_agreement":null},{"id":"W1975069415","doi":"10.1007/s11081-014-9271-9","title":"A new algorithm using front prediction and NSGA-II for solving two and three-objective optimization problems","year":2014,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":31,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Sorting; Multi-objective optimization; Mathematical optimization; Algorithm; Genetic algorithm; Evolutionary algorithm; Computer science; Mathematics","score_opus":0.008871635243027535,"score_gpt":0.21655461054962633,"score_spread":0.2076829753065988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975069415","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.009383916,0.00024248939,0.9845903,0.000105267856,0.0002586177,0.00017155023,0.00005571615,0.0007647193,0.004427378],"genre_scores_gemma":[0.08700888,0.00020704037,0.906413,0.00018269122,0.000083880346,0.00068749575,0.00024716894,0.00012346874,0.0050463956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995441,0.000091284186,0.00003282832,0.00006650884,0.0002171079,0.000048101458],"domain_scores_gemma":[0.99946254,0.00019931693,0.000044809774,0.0000414599,0.00021251786,0.00003927861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010287601,0.0013705213,0.0014402797,0.0012296067,0.00085041,0.00082387036,0.0017996681,0.001674204,0.0035807244],"category_scores_gemma":[0.0013845012,0.0006727528,0.0011200487,0.0013360871,0.00048365424,0.0008230057,0.0011505592,0.0014641713,0.00071707484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012453197,0.00018849371,0.0007147751,0.00018487345,0.0001232069,0.00009650058,0.0000737646,0.69985414,0.0040213503,0.0068328967,0.005125855,0.2826595],"study_design_scores_gemma":[0.000038737042,0.000042907657,0.00013757935,0.000010307703,0.000016540704,0.000023233286,0.000006877348,0.99673826,0.0005354225,0.00085150095,0.0015894605,0.000009230069],"about_ca_topic_score_codex":0.008325592,"about_ca_topic_score_gemma":0.010243452,"teacher_disagreement_score":0.008325592,"about_ca_system_score_codex":0.00074382406,"about_ca_system_score_gemma":0.0019627598,"threshold_uncertainty_score":0.016554236},"labels":[],"label_agreement":null},{"id":"W1976009969","doi":"10.1002/cjs.10049","title":"An adaptive sampling scheme guided by BART—with an application to predict processor performance","year":2010,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"","funders":"","keywords":"Computer science; Sampling (signal processing); Adaptive sampling; Bayesian probability; Adaptive design; Scheme (mathematics); Machine learning; Data mining; Computer engineering; Artificial intelligence; Statistics; Monte Carlo method; Mathematics","score_opus":0.01589734367511268,"score_gpt":0.26326589340128803,"score_spread":0.24736854972617536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976009969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017621273,0.00006495243,0.9812213,0.00006954357,0.000017124203,0.00004692526,0.000023046958,0.00048632576,0.00044948692],"genre_scores_gemma":[0.48407322,0.000086890985,0.5141861,0.000078733385,0.000034279492,0.00022253364,0.00012109703,0.00012560339,0.0010714656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831593,0.0009775199,0.00005919712,0.00021636789,0.00034922123,0.00008190374],"domain_scores_gemma":[0.991154,0.0061946264,0.0006227191,0.00094701786,0.00091842934,0.00016332637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005120038,0.0006290999,0.00082898,0.0010899906,0.00046988265,0.00059519487,0.0017629066,0.00094499084,0.0018109849],"category_scores_gemma":[0.018428488,0.0004704776,0.00064708863,0.00089771306,0.0009133644,0.0010041728,0.0009541584,0.0012526923,0.00031245552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037793387,0.00015167457,0.003715365,0.000063214466,0.000048929807,0.000068877365,0.00015101294,0.80901605,0.004027475,0.024724955,0.0012213754,0.15643312],"study_design_scores_gemma":[0.000009184164,0.000023698256,0.00012419355,0.000002705057,0.0000032649136,0.0000075779653,0.0000021898616,0.99720424,0.00040268427,0.002026596,0.00018966915,0.000003923142],"about_ca_topic_score_codex":0.00662002,"about_ca_topic_score_gemma":0.0050069885,"teacher_disagreement_score":0.00662002,"about_ca_system_score_codex":0.00078084914,"about_ca_system_score_gemma":0.0009924212,"threshold_uncertainty_score":0.027077675},"labels":[],"label_agreement":null},{"id":"W1977715424","doi":"10.1198/004017006000000228","title":"Variable Selection for Gaussian Process Models in Computer Experiments","year":2006,"lang":"en","type":"article","venue":"Technometrics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Frequentist inference; Computer science; Computer experiment; Process (computing); Gaussian process; Selection (genetic algorithm); Variable (mathematics); Bayesian probability; Machine learning; Gaussian; Data mining; Artificial intelligence; Algorithm; Bayesian inference; Simulation; Mathematics","score_opus":0.020139867867623826,"score_gpt":0.28212035035974664,"score_spread":0.2619804824921228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977715424","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.009840601,0.00012359711,0.9886686,0.0002182989,0.000020080386,0.00020379429,0.000040900668,0.0001873597,0.0006967046],"genre_scores_gemma":[0.4356791,0.00047707025,0.55708617,0.0002869938,0.000109492474,0.0026519352,0.00028462958,0.00012525116,0.0032993527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97557086,0.020690633,0.00030108326,0.0010516588,0.0019143921,0.0004714073],"domain_scores_gemma":[0.92124486,0.070982054,0.0024684428,0.0023502149,0.0024979452,0.00045647038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03513522,0.0013943877,0.0024835109,0.0027284096,0.0009462315,0.0020259272,0.0022074832,0.0023759198,0.00427945],"category_scores_gemma":[0.06778985,0.00082337036,0.0013413599,0.0023637984,0.0038385743,0.0021730256,0.002525499,0.0021820061,0.00063144893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002623965,0.00014400536,0.0018394579,0.00014986632,0.000098448705,0.00011804384,0.00017168694,0.6516267,0.00059649243,0.30580166,0.00095425185,0.038236987],"study_design_scores_gemma":[0.000060004393,0.00005044888,0.00016511497,0.000013669223,0.0000074263294,0.000009996784,0.000011090682,0.9327494,0.00027397825,0.066242985,0.00040479796,0.000010991252],"about_ca_topic_score_codex":0.0035183793,"about_ca_topic_score_gemma":0.0023352413,"teacher_disagreement_score":0.03513522,"about_ca_system_score_codex":0.0026371502,"about_ca_system_score_gemma":0.0025793714,"threshold_uncertainty_score":0.18581504},"labels":[],"label_agreement":null},{"id":"W1977899896","doi":"10.1007/s11590-013-0688-4","title":"A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Variance (accounting); Mathematical optimization; Rank (graph theory); Mathematics; Function (biology); Divergence (linguistics); Computational intelligence; Computer science; Artificial intelligence","score_opus":0.012320311983936696,"score_gpt":0.25321201544526784,"score_spread":0.24089170346133115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977899896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093794364,0.000060605944,0.9981109,0.000028865636,0.00004197082,0.000014460807,0.000012950129,0.000109827575,0.0006824665],"genre_scores_gemma":[0.07069675,0.00015123971,0.9248469,0.000093445895,0.00009262864,0.00023694214,0.00012798328,0.00026069826,0.003493467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.00028532746,0.000034848454,0.00007402197,0.0003500342,0.000037419148],"domain_scores_gemma":[0.9987941,0.00055288116,0.000056578483,0.00012669807,0.00043293994,0.000036840658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013319459,0.00077241566,0.00093803066,0.0007929364,0.00042145135,0.0009130338,0.0012738464,0.0010220556,0.0046579875],"category_scores_gemma":[0.0051957825,0.00051573274,0.0006147783,0.0007386936,0.00056775275,0.0008509539,0.0010794121,0.0015924847,0.0013567527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027858827,0.00013400578,0.0006788806,0.00025829131,0.00013041483,0.000087288165,0.00007500237,0.48407677,0.017633261,0.06531556,0.006011309,0.42532066],"study_design_scores_gemma":[0.000012063972,0.000019428577,0.00006089758,0.0000066174875,0.0000058135897,0.000013046678,0.0000028189947,0.9951755,0.0011363839,0.0025515414,0.0010077679,0.000008260428],"about_ca_topic_score_codex":0.0022256433,"about_ca_topic_score_gemma":0.0032269154,"teacher_disagreement_score":0.0046579875,"about_ca_system_score_codex":0.0003160781,"about_ca_system_score_gemma":0.00136105,"threshold_uncertainty_score":0.015582502},"labels":[],"label_agreement":null},{"id":"W1978178229","doi":"10.2514/6.2013-4620","title":"Flight trajectories optimization under the influence of winds using genetic algorithms","year":2013,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control (GNC) Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Genetic algorithm; Computer science; Algorithm; Machine learning","score_opus":0.010472018219662713,"score_gpt":0.23856844350328482,"score_spread":0.22809642528362212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978178229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27316183,0.00093205227,0.7123085,0.0004142196,0.00008402526,0.00011490764,0.0001224933,0.0002902743,0.012571732],"genre_scores_gemma":[0.93605936,0.00040544005,0.06048271,0.000050267794,0.000029468907,0.0001262612,0.00011171186,0.00004287966,0.002691971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980456,0.000078401936,0.000008228429,0.00002716642,0.000045127115,0.00003653909],"domain_scores_gemma":[0.9994204,0.0003432422,0.00009459559,0.000016262207,0.00010031557,0.000025194777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637647,0.0007142196,0.00061285944,0.0007756401,0.000446863,0.0008428619,0.0004824784,0.00084951275,0.00071715884],"category_scores_gemma":[0.0020503816,0.00039906264,0.00058863824,0.00058347837,0.0005104844,0.00038579942,0.00045184873,0.0005116004,0.00009812242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010001286,0.000005267674,0.00014882804,0.000006137252,0.000008548468,0.000013237413,0.00000922464,0.9965209,0.00019363745,0.0005602605,0.000047841542,0.0024762107],"study_design_scores_gemma":[0.000004514854,0.000010028159,0.000079278405,0.0000028124466,0.0000040910004,0.0000030216456,0.000005304549,0.9993349,0.00009783417,0.00038440415,0.000071985276,0.0000018297204],"about_ca_topic_score_codex":0.015901025,"about_ca_topic_score_gemma":0.0075282743,"teacher_disagreement_score":0.015901025,"about_ca_system_score_codex":0.0008873153,"about_ca_system_score_gemma":0.0011541388,"threshold_uncertainty_score":0.031616926},"labels":[],"label_agreement":null},{"id":"W1978266779","doi":"10.3758/bf03212150","title":"Evaluating the importance of the convex hull in solving the Euclidean version of the traveling salesperson problem: Reply to Lee and Vickers (2000)","year":2000,"lang":"en","type":"article","venue":"Perception & Psychophysics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Convex hull; Mathematics; Regular polygon; Euclidean geometry; Artifact (error); Point (geometry); Stimulus (psychology); Combinatorics; Computer science; Algorithm; Artificial intelligence; Psychology; Cognitive psychology; Geometry","score_opus":0.022654714745276194,"score_gpt":0.31189016500445216,"score_spread":0.28923545025917596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978266779","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00362348,0.017294843,0.0094903,0.9572103,0.009690343,0.000016138663,0.00013135045,0.00007956845,0.0024636418],"genre_scores_gemma":[0.1870142,0.0354088,0.036457013,0.6653123,0.06592115,0.00018098224,0.00034719222,0.00032852445,0.009029858],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983088,0.00074566586,0.0001643401,0.00028936728,0.0004007411,0.00009116424],"domain_scores_gemma":[0.9615834,0.030563734,0.0007927707,0.000783088,0.0055125738,0.0007644548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006265857,0.0009297122,0.0014444834,0.00064439146,0.001411139,0.0034769864,0.0030150397,0.015384991,0.004296172],"category_scores_gemma":[0.051923487,0.00060925237,0.00083995564,0.0015373168,0.0035151225,0.0075812945,0.0019938801,0.018485717,0.0024224252],"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.00045109336,0.0001419519,0.0014751733,0.0007573118,0.00014452309,0.000330021,0.00062468246,0.008958842,0.00073536334,0.041911695,0.84526443,0.09920495],"study_design_scores_gemma":[0.0005035625,0.000272051,0.008624693,0.0010325375,0.00022401025,0.0014732381,0.0037147906,0.04377924,0.00225828,0.5617583,0.37593937,0.00041995253],"about_ca_topic_score_codex":0.0073859557,"about_ca_topic_score_gemma":0.0071855956,"teacher_disagreement_score":0.015384991,"about_ca_system_score_codex":0.0017455028,"about_ca_system_score_gemma":0.001844956,"threshold_uncertainty_score":0.03313744},"labels":[],"label_agreement":null},{"id":"W1980157939","doi":"10.2514/6.2012-5556","title":"On the Application of Differential Geometry to MDO","year":2012,"lang":"en","type":"article","venue":"12th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference and 14th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":6,"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; Cambridge Trust; Cambridge Commonwealth Trust","keywords":"Differential (mechanical device); Geometry; Computer science; Mathematics; Engineering; Aerospace engineering","score_opus":0.012444671382451413,"score_gpt":0.2731564944199342,"score_spread":0.2607118230374828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980157939","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.004863659,0.00089482067,0.9790252,0.0012598023,0.000101468286,0.000031973144,0.00003732753,0.00005363857,0.01373205],"genre_scores_gemma":[0.53367,0.004733792,0.44817945,0.0012069455,0.00065819453,0.00046949834,0.00018060081,0.00032936476,0.010572234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984522,0.0008312728,0.00006820705,0.00019144909,0.00036576684,0.000091134396],"domain_scores_gemma":[0.99612373,0.002792463,0.0002865512,0.00031203777,0.0003256074,0.00015964286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034360343,0.0012744896,0.0011317084,0.0015024615,0.00092739466,0.0017751905,0.001125416,0.0010756612,0.0040777004],"category_scores_gemma":[0.009481919,0.0005632435,0.001215308,0.0010636725,0.004948399,0.0029082058,0.0038684113,0.0022496758,0.0005123902],"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.000008979885,0.000009024683,0.000217817,0.00004964423,0.000014329262,0.000032995937,0.00006167057,0.12729873,0.00026532088,0.8626164,0.0005060629,0.008918973],"study_design_scores_gemma":[0.000008295187,0.000028257871,0.00011347409,0.000031592284,0.0000056179456,0.000018847799,0.000020978589,0.3321965,0.00016864997,0.66279006,0.0046057557,0.000011897887],"about_ca_topic_score_codex":0.002161649,"about_ca_topic_score_gemma":0.0012475786,"teacher_disagreement_score":0.0040777004,"about_ca_system_score_codex":0.0022768767,"about_ca_system_score_gemma":0.0012586598,"threshold_uncertainty_score":0.018171668},"labels":[],"label_agreement":null},{"id":"W1980201624","doi":"10.1016/j.ejor.2007.12.014","title":"An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":363,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Travelling salesman problem; Mathematical optimization; Heuristics; Combinatorial optimization; 2-opt; Traveling purchaser problem; Vertex (graph theory); Mathematics; Multi-objective optimization; Bottleneck traveling salesman problem; Pareto principle; Constraint (computer-aided design); Computer science; Combinatorics; Graph","score_opus":0.04206008863009993,"score_gpt":0.3738648753142147,"score_spread":0.3318047866841148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980201624","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.0022744595,0.00019284153,0.9927012,0.00014540154,0.00008042557,0.00008175117,0.00008088601,0.00022407458,0.0042188545],"genre_scores_gemma":[0.08274314,0.00036982624,0.9106433,0.00021054407,0.000094949624,0.00032242254,0.00024239715,0.00035585996,0.005017666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990018,0.00030527118,0.000045699166,0.0001101817,0.00044293684,0.000094091985],"domain_scores_gemma":[0.9966415,0.0021645443,0.00014448864,0.00024274772,0.0006888226,0.000117909185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024982162,0.0014291159,0.001607025,0.00112514,0.0007269044,0.0017323904,0.002371296,0.0017331954,0.012773484],"category_scores_gemma":[0.00884157,0.00088910904,0.0011071939,0.002972861,0.00077599456,0.0021110615,0.0019456679,0.0026599322,0.0013598592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057647787,0.00010498447,0.00018058032,0.00014671838,0.00003864543,0.000100131605,0.000043234868,0.8668613,0.0006560219,0.029261649,0.0041688452,0.09838021],"study_design_scores_gemma":[0.000012270035,0.000010886522,0.000023225666,0.00000776283,0.000004349203,0.000013725325,0.0000055614,0.99322176,0.00011135909,0.005817772,0.00076661224,0.0000047209974],"about_ca_topic_score_codex":0.014357246,"about_ca_topic_score_gemma":0.01297794,"teacher_disagreement_score":0.014357246,"about_ca_system_score_codex":0.0012102972,"about_ca_system_score_gemma":0.0029452927,"threshold_uncertainty_score":0.042731583},"labels":[],"label_agreement":null},{"id":"W1980754808","doi":"10.1016/s0895-7177(02)00047-x","title":"Balance space in airport construction: Application to the North Sea island option for Schiphol Airport","year":2002,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Multi-Objective Optimization Algorithms","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 à Montréal","funders":"","keywords":"Meteorology; Space (punctuation); Balance (ability); Environmental science; Geography; Computer science","score_opus":0.019304876474895587,"score_gpt":0.22621137701853405,"score_spread":0.20690650054363846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980754808","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.81920534,0.0012411821,0.123277254,0.002169306,0.00022304947,0.00015035392,0.0004503103,0.00011903258,0.053164117],"genre_scores_gemma":[0.98384166,0.00032647274,0.007530433,0.0000404581,0.00003536065,0.000047720463,0.00008462515,0.000047328518,0.008045914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.00016342782,0.0000072777934,0.000029688003,0.00003573091,0.000047958878],"domain_scores_gemma":[0.9988397,0.0008729473,0.00007040211,0.000026261698,0.00007335707,0.00011743463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731774,0.00089835783,0.0010566169,0.0011009491,0.0010179771,0.002557858,0.0011682538,0.0031952125,0.007555568],"category_scores_gemma":[0.0039679273,0.00069420855,0.0009968987,0.0013630573,0.0013838831,0.0022154145,0.0013200175,0.001938108,0.00021254335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023110135,0.00008313946,0.0010105366,0.000052747964,0.000014923863,0.00029610677,0.00007608481,0.9642251,0.00072141085,0.026204746,0.00072921184,0.0063548577],"study_design_scores_gemma":[0.000034670535,0.000055738936,0.00041203314,0.000008648429,0.000012681949,0.00002581284,0.000118418466,0.98879623,0.00017389629,0.009803194,0.0005464013,0.000012248038],"about_ca_topic_score_codex":0.027424466,"about_ca_topic_score_gemma":0.020287802,"teacher_disagreement_score":0.027424466,"about_ca_system_score_codex":0.0017618185,"about_ca_system_score_gemma":0.0010254532,"threshold_uncertainty_score":0.054529667},"labels":[],"label_agreement":null},{"id":"W1983072446","doi":"10.1177/1548512914547798","title":"A comparison of heuristics applied to the sensor deployment problem in two dimensions","year":2014,"lang":"en","type":"article","venue":"The Journal of Defense Modeling and Simulation Applications Methodology Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Royal Military College of Canada; Royal Ottawa Mental Health Centre; St. Lawrence College","funders":"","keywords":"Heuristics; Differential evolution; Swap (finance); Metaheuristic; Software deployment; Computer science; Genetic algorithm; Mathematical optimization; Simulated annealing; Algorithm; Mathematics; Machine learning","score_opus":0.08073492339101117,"score_gpt":0.39973838490997843,"score_spread":0.31900346151896725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983072446","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.6010742,0.008424925,0.34706727,0.0006779272,0.0007800685,0.00071856566,0.0005013254,0.0013923304,0.03936336],"genre_scores_gemma":[0.7571297,0.002505309,0.23775999,0.00025420098,0.000067150475,0.00027588452,0.00035502657,0.00016700123,0.0014857139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829584,0.0008589599,0.000104190345,0.00013194353,0.00038842025,0.00022056571],"domain_scores_gemma":[0.99235666,0.00622352,0.00033549187,0.00035048104,0.00057041284,0.00016342105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024011368,0.0011041431,0.0012113509,0.0022892165,0.0005471303,0.0011020032,0.00087737007,0.001373163,0.0013798007],"category_scores_gemma":[0.009396003,0.0003008486,0.00081526424,0.002650787,0.0005011021,0.0007757827,0.00055683934,0.00068673835,0.00018894495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043785924,0.0003567077,0.0022705195,0.0005208787,0.0002395768,0.0001006645,0.000091253394,0.89002347,0.0023642294,0.006204852,0.0013658885,0.09602419],"study_design_scores_gemma":[0.00017663001,0.0010022965,0.0025796178,0.000074184485,0.000108918364,0.00014695997,0.00031056465,0.98432136,0.0039788764,0.004407492,0.0028472326,0.000045827514],"about_ca_topic_score_codex":0.006993625,"about_ca_topic_score_gemma":0.0062045017,"teacher_disagreement_score":0.006993625,"about_ca_system_score_codex":0.0014567232,"about_ca_system_score_gemma":0.0013182146,"threshold_uncertainty_score":0.013905823},"labels":[],"label_agreement":null},{"id":"W1985753777","doi":"10.1007/s11081-008-9043-5","title":"Editorial—surrogate modeling and space mapping for engineering optimization","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Surrogate model; Computer science; Financial engineering; Multidisciplinary design optimization; Engineering optimization; Systems engineering; Exploit; Optimization problem; Multidisciplinary approach; Kriging; Industrial engineering; Uncertainty quantification; Machine learning; Engineering","score_opus":0.01166669951559834,"score_gpt":0.20358950946015764,"score_spread":0.1919228099445593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985753777","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.00007614147,0.0058701825,0.000743248,0.017825928,0.9741673,0.0000143921425,0.000056346333,0.000077935525,0.0011685124],"genre_scores_gemma":[0.0015195775,0.0035636078,0.00040158184,0.010685386,0.9794444,0.000021616908,0.00003124544,0.00005660123,0.004275938],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967824,0.0007184354,0.00049811223,0.00045978746,0.0013630668,0.00017822617],"domain_scores_gemma":[0.9791078,0.0108885905,0.0011111251,0.0007203421,0.006799135,0.0013730178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00467271,0.0036406643,0.004192898,0.0038298955,0.0025700685,0.0052241953,0.0038389424,0.01456682,0.011289373],"category_scores_gemma":[0.02754129,0.0014043013,0.003342794,0.0018324745,0.0027036334,0.0033851988,0.0010695334,0.01400177,0.00535997],"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.00006075143,0.000022193582,0.000029799692,0.0003110739,0.00005280014,0.00010229816,0.0000054396533,0.00017782139,0.00010463116,0.00074532174,0.9927428,0.0056450525],"study_design_scores_gemma":[0.00019412674,0.00010185779,0.0007492166,0.0005843848,0.0002417011,0.00072608906,0.000032293145,0.0039649755,0.0006087548,0.00597184,0.9867691,0.000055659842],"about_ca_topic_score_codex":0.0011359135,"about_ca_topic_score_gemma":0.0018809044,"teacher_disagreement_score":0.01456682,"about_ca_system_score_codex":0.0017053352,"about_ca_system_score_gemma":0.0012342675,"threshold_uncertainty_score":0.037766755},"labels":[],"label_agreement":null},{"id":"W1987521740","doi":"10.1243/09544054jem1472","title":"Sequential metamodelling application to improve porthole die design","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Metamodeling; Kriging; Design space exploration; Set (abstract data type); Computer science; Black box; Differential evolution; Conceptual design; Engineering design process; Differential (mechanical device); Mathematical optimization; Algorithm; Data mining; Engineering; Machine learning; Artificial intelligence; Mathematics; Mechanical engineering","score_opus":0.010981765125858276,"score_gpt":0.2259059312534517,"score_spread":0.21492416612759344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987521740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029292852,0.00007282601,0.96830654,0.000030438092,0.000013623951,0.00004662056,0.000033651115,0.00059770484,0.0016057809],"genre_scores_gemma":[0.5902613,0.00018764814,0.40725774,0.000027713573,0.000007626198,0.00015724663,0.00015724183,0.00010077575,0.001842744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.00008295764,0.000020522824,0.000054181215,0.00012029344,0.000022259137],"domain_scores_gemma":[0.99963725,0.00015396895,0.000052058895,0.000059274957,0.00008497016,0.00001250429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064716017,0.000525528,0.00044005705,0.00054976,0.00021673141,0.00047447352,0.0005656271,0.00040963735,0.0021231924],"category_scores_gemma":[0.001110322,0.00029597094,0.00069780997,0.00040796126,0.00018956281,0.0005050556,0.00047288038,0.0003282001,0.00023381368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006340518,0.00005307512,0.0012355909,0.00011052346,0.00001945699,0.0000760469,0.000081658654,0.89714444,0.025989363,0.0036906225,0.00024068795,0.07129515],"study_design_scores_gemma":[0.0000068295794,0.000077534256,0.0002692159,0.000006112784,0.000010484568,0.00003320499,0.000009750852,0.99020797,0.00669919,0.00090201845,0.0017713485,0.0000062769964],"about_ca_topic_score_codex":0.0017323962,"about_ca_topic_score_gemma":0.0026060059,"teacher_disagreement_score":0.0021231924,"about_ca_system_score_codex":0.0003142204,"about_ca_system_score_gemma":0.0006132839,"threshold_uncertainty_score":0.007102847},"labels":[],"label_agreement":null},{"id":"W1988999677","doi":"10.1061/(asce)0733-9364(2003)129:6(706.3)","title":"Discussion of “Incorporating Practicability into Genetic Algorithm-Based Time-Cost Optimization” by Bryan Christopher Que","year":2003,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Computer science; Genetic algorithm; Operations research; Mathematical optimization; Mathematics; Machine learning","score_opus":0.0029201399319309885,"score_gpt":0.20517314820778343,"score_spread":0.20225300827585244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988999677","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.0023980634,0.0046627265,0.12564634,0.80438757,0.0074336054,0.00008716301,0.000048936417,0.0001576958,0.055177804],"genre_scores_gemma":[0.23263462,0.0110975485,0.1955533,0.47673988,0.012367937,0.00079173135,0.00007522727,0.0006915569,0.070048265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99205244,0.0048291674,0.00025878896,0.00047973864,0.0020921903,0.00028772198],"domain_scores_gemma":[0.9727683,0.019582823,0.00062393036,0.0012191889,0.0054198545,0.0003859886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01578339,0.00089379173,0.0005877074,0.00074519124,0.0031991224,0.004391221,0.0043507805,0.010590776,0.006336165],"category_scores_gemma":[0.06071073,0.00059734273,0.0010245953,0.0015144179,0.0073330346,0.0064603607,0.0024744952,0.014376558,0.0013238929],"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.000040580806,0.00004886375,0.00039093697,0.00020193883,0.000050822124,0.00015272696,0.0006907839,0.019102782,0.000527506,0.7650115,0.17737792,0.03640354],"study_design_scores_gemma":[0.000068759844,0.00006364604,0.00054194813,0.0006670897,0.00004865255,0.00016904528,0.00093608454,0.03737699,0.0016235738,0.43185776,0.5265414,0.00010503869],"about_ca_topic_score_codex":0.03305658,"about_ca_topic_score_gemma":0.0460686,"teacher_disagreement_score":0.03305658,"about_ca_system_score_codex":0.00391678,"about_ca_system_score_gemma":0.006134934,"threshold_uncertainty_score":0.08347154},"labels":[],"label_agreement":null},{"id":"W1989062954","doi":"10.1115/detc2011-48227","title":"A Rational Design Approach to Gaussian Process Modeling for Variable Fidelity Models","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Toronto","funders":"","keywords":"Surrogate model; Computer science; Kriging; Variable (mathematics); Metric (unit); Gaussian process; Process (computing); Sampling (signal processing); Engineering design process; Mathematical optimization; Set (abstract data type); Data mining; Machine learning; Gaussian; Mathematics","score_opus":0.1235986684308437,"score_gpt":0.29333148559937405,"score_spread":0.16973281716853034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989062954","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.00024434447,0.000111032256,0.99760276,0.000092586815,0.000020752312,0.000026431693,0.000020335288,0.00004944391,0.0018323374],"genre_scores_gemma":[0.14312488,0.0017660644,0.84272873,0.00030353173,0.00021132678,0.00095589604,0.00017156759,0.00021274103,0.010525236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773324,0.0010189099,0.00008846036,0.0003265621,0.0007387137,0.00009400091],"domain_scores_gemma":[0.9984571,0.0008993502,0.00017101868,0.0001597704,0.00027808358,0.00003467451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031332523,0.0015254617,0.0010718458,0.0013107274,0.00058831996,0.0018136788,0.0023274503,0.0017343714,0.0067923893],"category_scores_gemma":[0.005428483,0.0007607159,0.00211298,0.0014723935,0.0015877807,0.0014683743,0.0015501871,0.0030531045,0.0015716007],"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.000022843806,0.000044696324,0.00035516085,0.00019449502,0.000052097763,0.00008718794,0.00010507289,0.4769746,0.0016256558,0.48331118,0.0021938453,0.03503317],"study_design_scores_gemma":[0.00001304619,0.000056802364,0.000080985206,0.000042501273,0.000021251539,0.00004291267,0.000019051173,0.9118309,0.0006489047,0.0737071,0.013517031,0.000019499686],"about_ca_topic_score_codex":0.0043111085,"about_ca_topic_score_gemma":0.004234687,"teacher_disagreement_score":0.0067923893,"about_ca_system_score_codex":0.0018421008,"about_ca_system_score_gemma":0.002158311,"threshold_uncertainty_score":0.02272284},"labels":[],"label_agreement":null},{"id":"W1989099368","doi":"10.1145/1254882.1254904","title":"Synthetic designs","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Design of experiments; Reliability engineering; Software; Sample size determination; Sample (material); Engineering; Statistics; Mathematics","score_opus":0.023705481332219582,"score_gpt":0.2839585832470893,"score_spread":0.2602531019148697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989099368","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.032402057,0.0016778347,0.89946544,0.001765895,0.002687658,0.021020265,0.0046386863,0.00091477355,0.035427395],"genre_scores_gemma":[0.22038813,0.0016050263,0.6669198,0.0028248855,0.00065798726,0.084625065,0.0032474566,0.00028525214,0.019446364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96113276,0.029853871,0.002164716,0.0027871144,0.0034149168,0.0006467007],"domain_scores_gemma":[0.9143952,0.057790846,0.005799221,0.012312771,0.008571142,0.0011308081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03508061,0.0014988933,0.0013015455,0.0014478161,0.0011265352,0.002385367,0.0025757267,0.002001059,0.045168392],"category_scores_gemma":[0.09185415,0.0007511335,0.0015821402,0.0012314304,0.0019794642,0.0022006838,0.0028887417,0.002462679,0.005419441],"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.0098064495,0.0019632126,0.0070991837,0.0043949583,0.0009314563,0.0003211219,0.0016694829,0.032253377,0.0040840204,0.49152532,0.043336876,0.40261456],"study_design_scores_gemma":[0.0070530106,0.01637248,0.005034746,0.0017198422,0.00085063704,0.0007539597,0.0012057392,0.07815868,0.007836177,0.5299868,0.35069913,0.00032871944],"about_ca_topic_score_codex":0.000624312,"about_ca_topic_score_gemma":0.0008788103,"teacher_disagreement_score":0.045168392,"about_ca_system_score_codex":0.0017043866,"about_ca_system_score_gemma":0.0028953308,"threshold_uncertainty_score":0.18552625},"labels":[],"label_agreement":null},{"id":"W1989286986","doi":"10.3182/20110828-6-it-1002.01726","title":"Casting Design Through Multi-Objective Optimization","year":2011,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Sensitivity (control systems); Mathematical optimization; Multi-objective optimization; Casting; Engineering; Process (computing); Key (lock); Evolutionary algorithm; Computer science; Optimization problem; Mathematics","score_opus":0.06921899410958726,"score_gpt":0.26904380160671343,"score_spread":0.19982480749712617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989286986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023226498,0.00009004878,0.99405426,0.000045548535,0.000041499672,0.000032225093,0.0000132546975,0.00011249294,0.0032880036],"genre_scores_gemma":[0.17058747,0.00043723994,0.82088166,0.00007221161,0.00006104359,0.0002939094,0.00009926304,0.00031229123,0.0072548906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.00017060518,0.00002541931,0.00007111692,0.0003390877,0.00004925787],"domain_scores_gemma":[0.9994097,0.00027261494,0.00007103954,0.000066589244,0.00014518735,0.00003484689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014427312,0.0014553532,0.0017890614,0.0012832566,0.0007186226,0.0018339552,0.0013302711,0.0014958975,0.0051459298],"category_scores_gemma":[0.0022859047,0.0013309839,0.00130534,0.00094020594,0.0008134968,0.001074099,0.0015260363,0.0016669807,0.0007198348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038146998,0.000033732802,0.00012294992,0.0000920007,0.000027095997,0.0000275042,0.000035395195,0.94605017,0.003553576,0.015004939,0.00069948705,0.03431506],"study_design_scores_gemma":[0.0000076243377,0.00002451328,0.000033136555,0.0000128498905,0.000007906733,0.0000107149945,0.00000744924,0.99369836,0.0010531325,0.0036091618,0.0015297121,0.000005396667],"about_ca_topic_score_codex":0.0023371154,"about_ca_topic_score_gemma":0.003033223,"teacher_disagreement_score":0.0051459298,"about_ca_system_score_codex":0.00095787604,"about_ca_system_score_gemma":0.0014297625,"threshold_uncertainty_score":0.017214894},"labels":[],"label_agreement":null},{"id":"W1990098741","doi":"10.1115/1.4003035","title":"Metamodel-Based Optimization for Problems With Expensive Objective and Constraint Functions","year":2011,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":42,"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; Simon Fraser University","funders":"","keywords":"Metamodeling; Mathematical optimization; Constraint (computer-aided design); Computer science; Sample (material); Sampling (signal processing); Discriminative model; Function (biology); Mathematics; Machine learning","score_opus":0.05938132704092378,"score_gpt":0.2478318437322162,"score_spread":0.18845051669129242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990098741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054227742,0.00008338353,0.9936115,0.000026345862,0.0000054247084,0.000020354504,0.00001544442,0.00015594564,0.00065877876],"genre_scores_gemma":[0.26812315,0.0002078909,0.7294694,0.00009061196,0.00001576484,0.0003025741,0.0001617997,0.00019374161,0.0014350665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955505,0.00020104827,0.000015951537,0.0000665022,0.00013342156,0.000027950253],"domain_scores_gemma":[0.99920064,0.0005102933,0.00007863987,0.000109181165,0.00007862329,0.0000227099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013253929,0.0011791431,0.0011861664,0.00073189737,0.00031933782,0.000601698,0.0008439755,0.00085212855,0.0017873624],"category_scores_gemma":[0.0022646259,0.00050415355,0.0008350629,0.0005254168,0.00054907106,0.0009305909,0.0008195661,0.00094033615,0.000384243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042768002,0.000040804025,0.0004910833,0.000106819665,0.000038722992,0.000031072366,0.000032395925,0.9301727,0.0066716634,0.008159518,0.00043483096,0.053777594],"study_design_scores_gemma":[0.000009290895,0.00003509187,0.00008079575,0.000008164401,0.00000728862,0.000017952958,0.0000065958634,0.99322695,0.0016413096,0.004183045,0.0007785799,0.000004954983],"about_ca_topic_score_codex":0.0011320135,"about_ca_topic_score_gemma":0.0021246467,"teacher_disagreement_score":0.0017873624,"about_ca_system_score_codex":0.00049913925,"about_ca_system_score_gemma":0.00091669493,"threshold_uncertainty_score":0.0070094466},"labels":[],"label_agreement":null},{"id":"W1990178974","doi":"10.1049/iet-smt.2014.0204","title":"Competitive co‐evolutionary algorithm for constrained robust design","year":2015,"lang":"en","type":"article","venue":"IET Science Measurement & Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Evolutionary algorithm; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.09124898709972785,"score_gpt":0.2974161950569839,"score_spread":0.20616720795725607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990178974","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.0028157283,0.00018020745,0.9939843,0.000052617695,0.000029688003,0.000032633638,0.000009265158,0.000095713294,0.002799923],"genre_scores_gemma":[0.33671415,0.0003788373,0.6560888,0.00023400468,0.000069675894,0.0006396573,0.00013452851,0.00009832925,0.005641953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.0003034283,0.00003310848,0.00010469154,0.00037568362,0.00007767523],"domain_scores_gemma":[0.99911934,0.00045096295,0.00006898528,0.00006580011,0.00025597846,0.000038948263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235853,0.0010251587,0.001035254,0.0008457409,0.0006075213,0.0007693204,0.0015016226,0.001515036,0.002517314],"category_scores_gemma":[0.0027612534,0.00040457613,0.00078611006,0.0010093543,0.00076770416,0.00047462867,0.0010316927,0.0011003672,0.0006301678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041676853,0.000041499487,0.000269053,0.00006472112,0.00007652997,0.000063021515,0.000045807043,0.8795906,0.0026447584,0.036138777,0.0014780392,0.07954554],"study_design_scores_gemma":[0.000008205674,0.00002647738,0.000037111924,0.0000030809042,0.000005283697,0.000022438297,0.0000022717422,0.9960265,0.0002594609,0.0023040636,0.001300859,0.0000042924166],"about_ca_topic_score_codex":0.003958407,"about_ca_topic_score_gemma":0.002717172,"teacher_disagreement_score":0.003958407,"about_ca_system_score_codex":0.0007184086,"about_ca_system_score_gemma":0.0011738832,"threshold_uncertainty_score":0.008421242},"labels":[],"label_agreement":null},{"id":"W1991019969","doi":"10.1115/1.4024470","title":"Maximizing Design Confidence in Sequential Simulation-Based Optimization","year":2013,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Process (computing); Bayesian optimization; Engineering design process; Task (project management); Mathematical optimization; Surrogate model; Cantilever; Design process; Simulation modeling; Machine learning; Engineering; Work in process; Mathematics; Systems engineering","score_opus":0.052987215292829175,"score_gpt":0.2932323241740303,"score_spread":0.2402451088812011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991019969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015989294,0.00008776286,0.9829896,0.00010925182,0.0000067736673,0.000039015355,0.000013052974,0.00012474714,0.00064056425],"genre_scores_gemma":[0.73922306,0.00017086709,0.2590066,0.000105811465,0.000021522093,0.00034395358,0.00008969678,0.00012898918,0.00090953254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936179,0.0035869353,0.00030763863,0.0006677565,0.0015352314,0.0002845651],"domain_scores_gemma":[0.96908367,0.024970157,0.0023206093,0.0016591195,0.0016131857,0.00035321934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013421946,0.0014002149,0.0015579752,0.0012590362,0.00049507845,0.001487312,0.0015243973,0.0014279528,0.0013697866],"category_scores_gemma":[0.04698022,0.0014732378,0.0011048486,0.0007045691,0.0020407971,0.0018378953,0.0025949676,0.0016557501,0.0002486112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008415835,0.000025910449,0.00045789848,0.000044556826,0.000028421668,0.000022269673,0.000047774105,0.98361087,0.0008985769,0.0074730995,0.000073597825,0.007232908],"study_design_scores_gemma":[0.000013463438,0.000051343817,0.000075643606,0.000010511428,0.0000070486176,0.000007323771,0.0000052158657,0.9926756,0.0007821516,0.0062425327,0.00012333396,0.0000059863014],"about_ca_topic_score_codex":0.002220317,"about_ca_topic_score_gemma":0.001443817,"teacher_disagreement_score":0.013421946,"about_ca_system_score_codex":0.001485946,"about_ca_system_score_gemma":0.0022789238,"threshold_uncertainty_score":0.07098293},"labels":[],"label_agreement":null},{"id":"W1993699294","doi":"10.1108/03321640910959071","title":"Tolerance and multiobjective optimization in electromagnetic devices","year":2009,"lang":"en","type":"article","venue":"COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematical optimization; Robustness (evolution); Computer science; Originality; Representation (politics); Algorithm; Multi-objective optimization; Reduction (mathematics); Engineering design process; Mathematics; Engineering","score_opus":0.007204713441442482,"score_gpt":0.2622723122052971,"score_spread":0.25506759876385465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993699294","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.014875534,0.00048757295,0.97985053,0.00016582262,0.000036543795,0.00002596122,0.000011707511,0.00007889109,0.004467514],"genre_scores_gemma":[0.565787,0.00070036197,0.42610773,0.00014364097,0.000055917608,0.00022170611,0.000047604248,0.0001116227,0.0068243807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999554,0.00019172617,0.000022399021,0.000046804198,0.00015831391,0.000026762318],"domain_scores_gemma":[0.9993895,0.00036861218,0.00009695655,0.000058081936,0.00007209468,0.000014667722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009549669,0.0005784213,0.0005885266,0.00058575626,0.00029682377,0.0008396075,0.00058775244,0.0006555117,0.0016365413],"category_scores_gemma":[0.00216673,0.0002747204,0.0007071205,0.00045786813,0.00075990515,0.0006398308,0.00074286456,0.00070347346,0.0002556559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013748826,0.000016110285,0.00024609934,0.00007073245,0.000024173243,0.000033418397,0.00003170466,0.95154786,0.002305775,0.018749097,0.00019777165,0.026763475],"study_design_scores_gemma":[0.0000060442867,0.000035080993,0.00014664455,0.0000198953,0.0000062366526,0.000032344884,0.000011439192,0.98558664,0.001241943,0.011139545,0.0017666009,0.0000074768423],"about_ca_topic_score_codex":0.00094924285,"about_ca_topic_score_gemma":0.0005881316,"teacher_disagreement_score":0.0016365413,"about_ca_system_score_codex":0.0006175581,"about_ca_system_score_gemma":0.00043663877,"threshold_uncertainty_score":0.005474746},"labels":[],"label_agreement":null},{"id":"W1994554484","doi":"10.1287/opre.48.6.939.12393","title":"Global Stochastic Optimization with Low-Dispersion Point Sets","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":70,"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é de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Smoothness; Basis (linear algebra); Euclidean space; Mathematics; Mathematical optimization; Bounded function; Domain (mathematical analysis); Rate function; Function (biology); Large deviations theory; Point (geometry); Space (punctuation); Stochastic optimization; Applied mathematics; Sample (material); Computer science; Statistics; Mathematical analysis","score_opus":0.021883795247685297,"score_gpt":0.3426205580910039,"score_spread":0.3207367628433186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994554484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009019711,0.00024522873,0.9894872,0.00014823534,0.000014230679,0.00002832706,0.000024465093,0.000055415854,0.0009772356],"genre_scores_gemma":[0.6803689,0.0009144778,0.30989775,0.00019886674,0.00013381593,0.00062750845,0.0003560287,0.00015831015,0.0073444517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970873,0.0015712831,0.00011712222,0.0005062493,0.00055165356,0.00016645456],"domain_scores_gemma":[0.9890164,0.008609098,0.0009380831,0.00051123026,0.0006734192,0.0002516007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070512984,0.0019904787,0.0029217282,0.0015354472,0.0006492275,0.0021632449,0.001808808,0.0020339205,0.0016333767],"category_scores_gemma":[0.019596277,0.0011175568,0.0014793568,0.0012682363,0.0029593105,0.0025548197,0.0035132207,0.0027474484,0.00034987828],"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.00004009953,0.000018849252,0.00020052232,0.000053161762,0.00003502066,0.000035785397,0.00003281517,0.9581731,0.0002886613,0.035136156,0.00021783127,0.0057679676],"study_design_scores_gemma":[0.000006957201,0.000027542806,0.000042264757,0.000008347407,0.000004850836,0.0000049429445,0.000005507017,0.9759487,0.00014166597,0.023608824,0.00019520524,0.000005135655],"about_ca_topic_score_codex":0.0020771034,"about_ca_topic_score_gemma":0.0012559509,"teacher_disagreement_score":0.0070512984,"about_ca_system_score_codex":0.0017026131,"about_ca_system_score_gemma":0.0013432782,"threshold_uncertainty_score":0.03729129},"labels":[],"label_agreement":null},{"id":"W1995351961","doi":"10.1002/atr.5670430405","title":"Multi‐objective highway alignment optimization using a genetic algorithm","year":2009,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":64,"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":"Process (computing); Genetic algorithm; Mathematical optimization; Multi-objective optimization; Set (abstract data type); Computer science; Earthworks; Function (biology); Engineering; Mathematics","score_opus":0.01230364714888291,"score_gpt":0.26886735016511776,"score_spread":0.2565637030162348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995351961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061545905,0.00032751437,0.92983645,0.00021963482,0.000045898287,0.00012879052,0.0000571463,0.000318914,0.007519674],"genre_scores_gemma":[0.6450748,0.00021550136,0.34959435,0.00010804905,0.000029409439,0.00039467608,0.0001515601,0.00005270884,0.004379007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.0001710166,0.00001540499,0.00006729431,0.00009190282,0.00005385722],"domain_scores_gemma":[0.9995377,0.00025784396,0.000058645797,0.00002048231,0.00010452601,0.000020849391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538524,0.00079877407,0.00095612585,0.0011816071,0.0004759625,0.0009065623,0.0009230641,0.0015055363,0.0021057012],"category_scores_gemma":[0.0013462533,0.00046511798,0.0007884049,0.001029598,0.00053470436,0.00058591063,0.0006221626,0.0006573645,0.00023973694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012201586,0.000021468599,0.00019988134,0.000017067052,0.000015952404,0.000019069636,0.000014868623,0.98544645,0.0004998111,0.0017847233,0.00018268194,0.0117858155],"study_design_scores_gemma":[0.0000059481445,0.000013741843,0.00004822716,0.0000031591562,0.000003837994,0.000003771788,0.0000035975277,0.9990977,0.00013964456,0.00050826475,0.00017010268,0.000001964234],"about_ca_topic_score_codex":0.007158023,"about_ca_topic_score_gemma":0.004141169,"teacher_disagreement_score":0.007158023,"about_ca_system_score_codex":0.0009805762,"about_ca_system_score_gemma":0.00120056,"threshold_uncertainty_score":0.014232695},"labels":[],"label_agreement":null},{"id":"W1997615575","doi":"10.1061/40794(179)19","title":"A Framework for Simulation-Based Optimization with Application to Green Building Design","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Computer science; Mathematical optimization; Engineering optimization; Optimization problem; Continuous optimization; Genetic algorithm; Multidisciplinary design optimization; Simulation-based optimization; Topology optimization; Multi-swarm optimization; Algorithm; Engineering; Mathematics; Machine learning; Finite element method","score_opus":0.022834825727171108,"score_gpt":0.3119995981038571,"score_spread":0.289164772376686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997615575","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.00031677235,0.00025124993,0.99707866,0.00010239136,0.00003606037,0.000041154522,0.000039939066,0.0004162227,0.0017176558],"genre_scores_gemma":[0.03157174,0.0014255538,0.96394867,0.000099987126,0.00008355528,0.0005673133,0.00029827136,0.00034553802,0.0016593261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912125,0.00036374386,0.00006386744,0.00007713029,0.00031361135,0.000060420287],"domain_scores_gemma":[0.9993278,0.0003664785,0.00005060879,0.000081609265,0.00012861697,0.000044892353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022525254,0.0017146923,0.0015380732,0.001317136,0.0009873421,0.0021709763,0.0027542834,0.001624656,0.004136002],"category_scores_gemma":[0.002347295,0.0008558212,0.0023020448,0.0015270058,0.0015571964,0.0012683583,0.0018541102,0.0023421317,0.0011835113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021536676,0.000056149504,0.00022447703,0.00021051858,0.00008080556,0.00012474562,0.00011190318,0.55664176,0.0017587767,0.40067348,0.0025891918,0.037506565],"study_design_scores_gemma":[0.00003276456,0.000028974855,0.000087315195,0.00011471084,0.000040453742,0.000073694675,0.000024014313,0.8203991,0.0010442374,0.12907867,0.04904547,0.00003061668],"about_ca_topic_score_codex":0.007700878,"about_ca_topic_score_gemma":0.0056393277,"teacher_disagreement_score":0.007700878,"about_ca_system_score_codex":0.001228948,"about_ca_system_score_gemma":0.002184543,"threshold_uncertainty_score":0.015312135},"labels":[],"label_agreement":null},{"id":"W1997995971","doi":"10.1115/1.4001597","title":"Metamodeling for High Dimensional Simulation-Based Design Problems","year":2010,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Curse of dimensionality; Black box; Computer science; Radial basis function; Engineering design process; Mathematical optimization; Function (biology); Process (computing); Nonlinear system; Algorithm; Engineering; Machine learning; Artificial intelligence; Artificial neural network; Mathematics","score_opus":0.051281716922726504,"score_gpt":0.2965239383016135,"score_spread":0.245242221378887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997995971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00125444,0.00012556411,0.997332,0.00005896774,0.000012744826,0.000015068547,0.000022713024,0.00013266514,0.0010458991],"genre_scores_gemma":[0.27791372,0.0013052275,0.7141667,0.00022793753,0.000081334656,0.0005958376,0.00041159653,0.0002827737,0.0050147623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993048,0.0003055269,0.000035935427,0.00008364549,0.00023293254,0.0000371673],"domain_scores_gemma":[0.99922967,0.0003991166,0.00009170538,0.00012781947,0.000117859105,0.00003381251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014149493,0.00088074384,0.0011037282,0.0007503608,0.0003748235,0.0009781608,0.0010986766,0.0014002416,0.0026126301],"category_scores_gemma":[0.0022363618,0.00048075043,0.0014653563,0.00055653404,0.00082322524,0.000948362,0.0011608911,0.0014905091,0.0007832369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019738114,0.00002221937,0.00023999599,0.000090680755,0.00002014556,0.000032030024,0.000040064006,0.9471749,0.0028822697,0.033321846,0.00043409073,0.015721936],"study_design_scores_gemma":[0.0000036912272,0.000011034776,0.000034782966,0.000009774955,0.0000037845036,0.00001363666,0.000004887251,0.9911308,0.0003666932,0.0064314264,0.0019856254,0.0000039120837],"about_ca_topic_score_codex":0.0018461188,"about_ca_topic_score_gemma":0.0013430249,"teacher_disagreement_score":0.0026126301,"about_ca_system_score_codex":0.0007838495,"about_ca_system_score_gemma":0.0009535467,"threshold_uncertainty_score":0.0087400675},"labels":[],"label_agreement":null},{"id":"W1999582351","doi":"10.1007/s00170-011-3324-4","title":"Incorporation of axiomatic design theory into design of a microchannel system for uniform and size-controllable microspheres","year":2011,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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 Saskatchewan","funders":"","keywords":"Axiomatic design; Microchannel; Controllability; Conceptual design; Probabilistic design; Process (computing); Design process; Microsphere; Computer science; Systems design; Optimal design; Engineering design process; Systems engineering; Engineering; Process engineering; Mechanical engineering; Nanotechnology; Mathematics; Materials science; Manufacturing engineering; Applied mathematics; Chemical engineering","score_opus":0.015729390095554935,"score_gpt":0.23421178302054876,"score_spread":0.21848239292499383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999582351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035487635,0.000041025396,0.9939569,0.00008064674,0.000017673821,0.00003016562,0.000009832366,0.000090670284,0.0022241813],"genre_scores_gemma":[0.35410926,0.0001730788,0.6428246,0.00016814662,0.00002167168,0.00037544587,0.000040770257,0.00005610826,0.0022309092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992513,0.00026775952,0.000042712967,0.00011032215,0.00027725703,0.000050519327],"domain_scores_gemma":[0.9994004,0.00028922188,0.000068665504,0.00007031169,0.00015390605,0.000017554921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012780135,0.0005394416,0.00052404084,0.0003302736,0.0005062965,0.0008585238,0.00095157546,0.0007035365,0.0018556964],"category_scores_gemma":[0.0014437586,0.00043764032,0.00061198795,0.00020701753,0.0012485726,0.00086101674,0.0008698634,0.0007881705,0.00028950154],"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.000120546225,0.00010755747,0.0005577345,0.00040753008,0.000048135716,0.00017705456,0.0002858655,0.4512206,0.058814768,0.43358874,0.001020377,0.05365111],"study_design_scores_gemma":[0.00005495935,0.00021309382,0.00019193531,0.000029219325,0.00002802042,0.000083323655,0.000030215757,0.92471075,0.020011349,0.04686838,0.007748837,0.000029997716],"about_ca_topic_score_codex":0.0010571984,"about_ca_topic_score_gemma":0.0016931703,"teacher_disagreement_score":0.0018556964,"about_ca_system_score_codex":0.00081469305,"about_ca_system_score_gemma":0.0014095958,"threshold_uncertainty_score":0.0067588687},"labels":[],"label_agreement":null},{"id":"W1999841373","doi":"10.1007/s00158-014-1186-8","title":"Differential geometry tools for multidisciplinary design optimization, Part I: Theory","year":2014,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada; Cambridge Trust; Cambridge Commonwealth Trust","keywords":"Multidisciplinary design optimization; Mathematical proof; Multidisciplinary approach; Differentiable function; Sensitivity (control systems); Limit (mathematics); Computer science; Function (biology); Differential (mechanical device); Engineering design process; Riemannian geometry; Translation (biology); Information geometry; Mathematics; Algebra over a field; Mathematical optimization; Geometry; Pure mathematics; Engineering; Mathematical analysis; Curvature; Mechanical engineering; Aerospace engineering","score_opus":0.021270214954355996,"score_gpt":0.2709732141313832,"score_spread":0.2497029991770272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999841373","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.00086577504,0.0023992313,0.99082536,0.00029004287,0.00012941875,0.000016230155,0.0000439233,0.000057814716,0.0053721913],"genre_scores_gemma":[0.21135591,0.010642135,0.75544363,0.0007346378,0.000924162,0.0005165154,0.00034020367,0.00046367702,0.01957912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919623,0.00031191143,0.000038045473,0.000079528945,0.00034084282,0.000033507968],"domain_scores_gemma":[0.99922395,0.00040436737,0.00006892629,0.00011939177,0.00014681098,0.00003657137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011506556,0.0013028645,0.0015685495,0.0020129585,0.0005411039,0.0017275056,0.001459387,0.0009941563,0.0048635476],"category_scores_gemma":[0.0025273173,0.00071125035,0.0012209644,0.0018704971,0.0017689636,0.0017525294,0.002147831,0.0026221764,0.0014657861],"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.000012871172,0.000042194093,0.00022945441,0.0003068967,0.000053570537,0.00005801771,0.00010761248,0.13026606,0.002440362,0.78218716,0.0063143075,0.07798143],"study_design_scores_gemma":[0.0000116957035,0.000029322517,0.00020496252,0.000078044905,0.000020262358,0.000081781465,0.00003792029,0.44654897,0.0011269365,0.5229399,0.028902894,0.000017296623],"about_ca_topic_score_codex":0.00087013945,"about_ca_topic_score_gemma":0.00088301353,"teacher_disagreement_score":0.0048635476,"about_ca_system_score_codex":0.0013260777,"about_ca_system_score_gemma":0.00067518174,"threshold_uncertainty_score":0.01627022},"labels":[],"label_agreement":null},{"id":"W2003910800","doi":"10.1115/1.4002978","title":"Turning Black-Box Functions Into White Functions","year":2011,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Black box; Metamodeling; White box; Variable (mathematics); Process (computing); Radial basis function; Representation (politics); Computer science; Function (biology); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Artificial neural network","score_opus":0.043489530459787026,"score_gpt":0.2581433939509434,"score_spread":0.21465386349115634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003910800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002644256,0.000025016958,0.9963315,0.000042753378,0.000010412938,0.000007243216,0.0000155311,0.0001434349,0.0007798343],"genre_scores_gemma":[0.26722747,0.00028822577,0.727205,0.00020837678,0.000033299322,0.00019504859,0.0001646908,0.0002871734,0.0043907394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.0003309488,0.000029530354,0.00011215617,0.00017565096,0.000039995437],"domain_scores_gemma":[0.99888235,0.00056084385,0.000105093466,0.0002568459,0.00015967252,0.00003508092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021485495,0.001018338,0.00079249684,0.0006993552,0.00035406637,0.0012074652,0.0010726961,0.0011835583,0.0023846782],"category_scores_gemma":[0.003936684,0.00041467865,0.00093427516,0.00057766814,0.0010510229,0.0023778002,0.0010684569,0.0012694105,0.00088301685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009132979,0.00004940989,0.0005359187,0.00010205028,0.000039289298,0.00008744655,0.00013781,0.6705988,0.011444786,0.25185025,0.0013311891,0.06373173],"study_design_scores_gemma":[0.0000038197,0.000016951297,0.00004540501,0.000009141982,0.000004119577,0.000013947625,0.000006429318,0.9761788,0.0018960234,0.020311108,0.0015067459,0.0000074694576],"about_ca_topic_score_codex":0.0010218916,"about_ca_topic_score_gemma":0.00075540564,"teacher_disagreement_score":0.0023846782,"about_ca_system_score_codex":0.00053787744,"about_ca_system_score_gemma":0.0007068049,"threshold_uncertainty_score":0.011362791},"labels":[],"label_agreement":null},{"id":"W2005144156","doi":"10.1007/s12293-011-0072-9","title":"DMEA: a direction-based multiobjective evolutionary algorithm","year":2011,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Population; Benchmark (surveying); Computer science; Evolutionary algorithm; Multi-objective optimization; Ideal (ethics); Selection (genetic algorithm); Mathematical optimization; Pareto principle; Convergence (economics); Point (geometry); Algorithm; Current (fluid); Artificial intelligence; Mathematics; Machine learning; Geography; Geology","score_opus":0.02228156810671539,"score_gpt":0.24519089203241773,"score_spread":0.22290932392570234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005144156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.00434002,0.00044423938,0.98885196,0.00010407855,0.00015896304,0.00009188807,0.000072874696,0.0008263549,0.005109671],"genre_scores_gemma":[0.0759601,0.00043094097,0.91638654,0.00014815241,0.000068855894,0.00031290852,0.00012762527,0.00016710366,0.006397798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997433,0.00007990153,0.0000117097525,0.000029955958,0.00011747386,0.000017606724],"domain_scores_gemma":[0.99976546,0.0001047755,0.000020929494,0.00002274136,0.00007114504,0.000014932095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839145,0.000676592,0.00076362514,0.0009033487,0.0003827616,0.00074797345,0.0011986981,0.0013256207,0.0035327913],"category_scores_gemma":[0.0012002279,0.00027934834,0.0006397671,0.0008659764,0.0003110817,0.0005950077,0.000739158,0.0010131622,0.0009801072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001413708,0.00015148774,0.00063279195,0.00029574984,0.00015561633,0.00011808064,0.000063554646,0.5335572,0.015993956,0.027404813,0.0065151243,0.4149703],"study_design_scores_gemma":[0.000058757818,0.00007715404,0.00015179795,0.00002455204,0.000026728698,0.000072368945,0.000009938348,0.9819011,0.0031288676,0.0044990536,0.010033644,0.000016086151],"about_ca_topic_score_codex":0.0008492869,"about_ca_topic_score_gemma":0.0011647014,"teacher_disagreement_score":0.0035327913,"about_ca_system_score_codex":0.00026225258,"about_ca_system_score_gemma":0.0005304397,"threshold_uncertainty_score":0.011818409},"labels":[],"label_agreement":null},{"id":"W2006143075","doi":"10.1080/02331888.2012.694440","title":"Pareto analysis based on records","year":2012,"lang":"en","type":"article","venue":"Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematics; Pareto principle; Econometrics; Lomax distribution; Statistics","score_opus":0.015709524405966735,"score_gpt":0.28814200654450883,"score_spread":0.2724324821385421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006143075","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.04270849,0.0002727982,0.95147556,0.00021030995,0.00002608174,0.00011131865,0.0004949579,0.00016018882,0.0045402767],"genre_scores_gemma":[0.634923,0.0013063994,0.3542263,0.00020150383,0.00018386247,0.0006286393,0.0025815438,0.00019049855,0.0057583195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99384105,0.002221286,0.00030551408,0.0009315934,0.002164795,0.00053571555],"domain_scores_gemma":[0.9721667,0.018855657,0.002053711,0.0034408807,0.0030296792,0.00045341701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009330781,0.0007490673,0.0015375621,0.0039939852,0.0011418005,0.0029790506,0.0026290994,0.0015226672,0.0035390714],"category_scores_gemma":[0.046937425,0.00058371585,0.002327385,0.0035700628,0.0022578472,0.0054861074,0.0035147688,0.002906341,0.000728579],"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.0002809171,0.00019920773,0.010785714,0.00028029666,0.00017226255,0.00026701455,0.0006129719,0.27911246,0.0025462892,0.57084763,0.0026029092,0.1322923],"study_design_scores_gemma":[0.00003126944,0.0001509346,0.004407959,0.00007315751,0.000041474053,0.00010845502,0.00021280583,0.68614465,0.0014433411,0.3040219,0.0033075383,0.000056604684],"about_ca_topic_score_codex":0.0035121476,"about_ca_topic_score_gemma":0.002006964,"teacher_disagreement_score":0.009330781,"about_ca_system_score_codex":0.0016129875,"about_ca_system_score_gemma":0.002046573,"threshold_uncertainty_score":0.049346447},"labels":[],"label_agreement":null},{"id":"W2007555958","doi":"10.1016/j.ces.2007.01.030","title":"Design stage optimization of an industrial low-density polyethylene tubular reactor for multiple objectives using NSGA-II and its jumping gene adaptations","year":2007,"lang":"en","type":"article","venue":"Chemical Engineering Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":48,"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":"Mathematical optimization; Multi-objective optimization; Constraint (computer-aided design); Maximization; Optimization problem; Mathematics; Genetic algorithm; Sorting; Penalty method; Pareto principle; Algorithm","score_opus":0.039647753271969954,"score_gpt":0.27215985685618066,"score_spread":0.2325121035842107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007555958","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.5006601,0.00036369386,0.48859215,0.00023061712,0.00008468938,0.00029786478,0.00010135886,0.0005046708,0.009164895],"genre_scores_gemma":[0.95108914,0.0001049916,0.0456572,0.00002350848,0.00000666657,0.00026863907,0.00005874467,0.000022875756,0.0027681317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997905,0.000059748672,0.0000093519975,0.000041345866,0.000057219626,0.00004193637],"domain_scores_gemma":[0.9997209,0.00013827349,0.000041812258,0.00001228589,0.00006400092,0.00002267259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806021,0.00066497474,0.0009009698,0.00037081444,0.000710014,0.00077242,0.0007944597,0.0010162755,0.0014264114],"category_scores_gemma":[0.0006826707,0.0004342886,0.00067102263,0.00034166063,0.00045051242,0.00031148412,0.00046064757,0.0006776533,0.00016977801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009387702,0.00005921692,0.00033911533,0.000051820825,0.000011357347,0.00003858614,0.000018478588,0.9860612,0.0066612912,0.0004971311,0.00007555937,0.0060924445],"study_design_scores_gemma":[0.000021081765,0.00015188167,0.00019978869,0.000002751982,0.00001207407,0.0000052519968,0.000009199292,0.9961377,0.003148567,0.0001315195,0.00017607765,0.000004169429],"about_ca_topic_score_codex":0.0072928392,"about_ca_topic_score_gemma":0.0061898474,"teacher_disagreement_score":0.0072928392,"about_ca_system_score_codex":0.0011056104,"about_ca_system_score_gemma":0.0017242138,"threshold_uncertainty_score":0.014500797},"labels":[],"label_agreement":null},{"id":"W2008003451","doi":"10.1115/1.4026281","title":"Value-Based Global Optimization","year":2013,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Kriging; Computer science; Mathematical optimization; Surrogate model; Global optimization; Metric (unit); Algorithm; Process (computing); Sampling (signal processing); Mathematics; Machine learning; Engineering","score_opus":0.01972188803488294,"score_gpt":0.2595366694631564,"score_spread":0.23981478142827345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008003451","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.003762128,0.0005503971,0.98810077,0.00018845474,0.00006462212,0.00006217661,0.00006373309,0.00022720579,0.0069805775],"genre_scores_gemma":[0.32898146,0.0013955224,0.6535854,0.0005278977,0.00016045422,0.000700717,0.00072987046,0.0007270225,0.013191725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986498,0.0005164221,0.000060966748,0.00031099137,0.00033022117,0.00013167248],"domain_scores_gemma":[0.9974298,0.0017570665,0.00017537366,0.00019649742,0.00037269105,0.00006859824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030227352,0.0022529487,0.0024307475,0.0014451727,0.0008914711,0.0022483733,0.0018399871,0.0018393453,0.006895357],"category_scores_gemma":[0.007060552,0.0009910162,0.0016110819,0.0012456392,0.0015590288,0.0019254147,0.0023943926,0.0018717758,0.0012525127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054180084,0.000043541273,0.00058275776,0.00013530193,0.00008140913,0.0000469358,0.00006078944,0.89991057,0.00048322062,0.040833347,0.0027723738,0.054995604],"study_design_scores_gemma":[0.000015070825,0.00004532297,0.00008950043,0.000033656062,0.00001876217,0.000021599244,0.000022246953,0.9698223,0.0003314156,0.026307678,0.0032819659,0.000010362956],"about_ca_topic_score_codex":0.004554079,"about_ca_topic_score_gemma":0.0032418284,"teacher_disagreement_score":0.006895357,"about_ca_system_score_codex":0.0016456086,"about_ca_system_score_gemma":0.0021906297,"threshold_uncertainty_score":0.023067296},"labels":[],"label_agreement":null},{"id":"W2008533091","doi":"10.1007/s11081-006-0351-3","title":"Variable-fidelity optimization: Efficiency and robustness","year":2006,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":26,"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":"Robustness (evolution); Solver; Fidelity; Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.004538927013477352,"score_gpt":0.19152137529082455,"score_spread":0.1869824482773472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008533091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076528676,0.0010352621,0.9870287,0.0002745946,0.0000679502,0.000028908953,0.00003584551,0.00014044606,0.003735316],"genre_scores_gemma":[0.46049342,0.0017834993,0.5313356,0.00017270325,0.00023652865,0.00022543219,0.00016070057,0.00038618007,0.0052060336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986721,0.0007037295,0.000039577022,0.00015807246,0.00037552038,0.00005112005],"domain_scores_gemma":[0.9923504,0.005999756,0.00038917904,0.0007423324,0.0004341432,0.0000841235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030591774,0.0010450681,0.0014696906,0.00079054444,0.0005077907,0.0015302364,0.0013671715,0.0018210575,0.00272625],"category_scores_gemma":[0.019010903,0.0006303708,0.00058557093,0.0010079205,0.0016297464,0.002290147,0.001970164,0.002173642,0.000528941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022641415,0.000081448874,0.00059933536,0.00027193822,0.000074301344,0.00005698903,0.00006997948,0.7522927,0.0022885203,0.12872173,0.0024369548,0.1128797],"study_design_scores_gemma":[0.000013427275,0.000020301088,0.00008515347,0.000015612644,0.000008136555,0.000029805513,0.0000058616583,0.9708163,0.0009231785,0.027143737,0.0009324258,0.0000060409143],"about_ca_topic_score_codex":0.0016762017,"about_ca_topic_score_gemma":0.0010513995,"teacher_disagreement_score":0.0030591774,"about_ca_system_score_codex":0.0006119947,"about_ca_system_score_gemma":0.0005517335,"threshold_uncertainty_score":0.016178668},"labels":[],"label_agreement":null},{"id":"W2010014459","doi":"10.1080/03052150903386674","title":"Trends, features, and tests of common and recently introduced global optimization methods","year":2010,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Global optimization; Engineering optimization; Test functions for optimization; Multidisciplinary design optimization; Computer science; Benchmark (surveying); Optimization problem; Metaheuristic; Mathematical optimization; Metamodeling; Continuous optimization; Multi-swarm optimization; Multidisciplinary approach; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0058888076438176895,"score_gpt":0.28086194795187835,"score_spread":0.27497314030806064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010014459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100383304,0.1469279,0.7075329,0.0023262922,0.000908571,0.00018182966,0.00022801482,0.00080083637,0.040710427],"genre_scores_gemma":[0.48421603,0.07252544,0.43471766,0.00065430463,0.00089915685,0.00029763236,0.0005143244,0.0004963684,0.0056791105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957652,0.0016122151,0.00030821908,0.0005684194,0.001622554,0.00012334745],"domain_scores_gemma":[0.99402255,0.0033217194,0.00059212034,0.00066622946,0.0012853249,0.00011209386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062623727,0.0008953183,0.00095642556,0.0017403548,0.0004075259,0.0019117976,0.0016340704,0.0010917505,0.0012113203],"category_scores_gemma":[0.011328581,0.00032975385,0.0010091315,0.0029699113,0.0012357815,0.002438594,0.0012322441,0.0018166674,0.0002902577],"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.00036868954,0.00024881464,0.0049582496,0.0033704794,0.00031758755,0.000214194,0.00040159505,0.15564059,0.011525648,0.11482809,0.0054748575,0.70265126],"study_design_scores_gemma":[0.00013316312,0.0020004371,0.015454454,0.0019376369,0.00070336123,0.001719461,0.00067058794,0.6637132,0.06595347,0.08087998,0.16646615,0.0003679867],"about_ca_topic_score_codex":0.0006494094,"about_ca_topic_score_gemma":0.00072428584,"teacher_disagreement_score":0.0062623727,"about_ca_system_score_codex":0.000836223,"about_ca_system_score_gemma":0.0007320794,"threshold_uncertainty_score":0.033119023},"labels":[],"label_agreement":null},{"id":"W2011178729","doi":"10.1145/1570256.1570259","title":"A new multi-objective algorithm, pareto archived DDS","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Economic Affairs","keywords":"Benchmark (surveying); Pareto principle; Computer science; Maxima and minima; Mathematical optimization; Multi-objective optimization; Algorithm; Set (abstract data type); Mathematics","score_opus":0.014631091310723822,"score_gpt":0.2730592972777367,"score_spread":0.2584282059670129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011178729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061348653,0.00041065598,0.9884709,0.00013587986,0.00015827459,0.000091315946,0.00010810747,0.0007107839,0.0037792549],"genre_scores_gemma":[0.13446175,0.00043671028,0.85711974,0.00026782395,0.00011021723,0.00045648613,0.00058613636,0.00015308075,0.006408045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908984,0.0002013925,0.00006364405,0.000108279426,0.00048825124,0.00004871984],"domain_scores_gemma":[0.99909484,0.0002754443,0.00010082259,0.00013580262,0.00033313636,0.00005996383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012091513,0.0009032561,0.001518349,0.0019752881,0.00050807995,0.0012479828,0.0023987133,0.0012489002,0.0030684946],"category_scores_gemma":[0.002355484,0.0004599903,0.001087026,0.0020671093,0.0005213028,0.0010567508,0.0013723837,0.0013934075,0.00083470246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001221444,0.00015674978,0.0011426385,0.000254581,0.00016252817,0.000099088895,0.00007997998,0.53048897,0.005524103,0.017373554,0.007123947,0.4374717],"study_design_scores_gemma":[0.000050954462,0.00008502203,0.00017899642,0.000019832427,0.000021570457,0.00008586508,0.000010362487,0.986863,0.0018219785,0.0032761449,0.0075712316,0.000014933313],"about_ca_topic_score_codex":0.0017903917,"about_ca_topic_score_gemma":0.0019347518,"teacher_disagreement_score":0.0030684946,"about_ca_system_score_codex":0.0009391274,"about_ca_system_score_gemma":0.0015903496,"threshold_uncertainty_score":0.0102651715},"labels":[],"label_agreement":null},{"id":"W2012569716","doi":"10.1007/s10957-014-0576-9","title":"A Weighted Sequential Sampling Method Considering Influences of Sample Qualities in Input and Output Parameter Spaces for Global Optimization","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Calgary","funders":"","keywords":"Metamodeling; Weighting; Sampling (signal processing); Adaptive sampling; Sample (material); Mathematics; Mathematical optimization; Sample space; Quality (philosophy); Process (computing); Algorithm; Computer science; Statistics; Monte Carlo method","score_opus":0.031821269869103566,"score_gpt":0.3417841240154184,"score_spread":0.30996285414631486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012569716","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.005000606,0.000092442424,0.9945739,0.000019597395,0.00002061812,0.000026089485,0.0000074964146,0.00004253688,0.0002167095],"genre_scores_gemma":[0.33090976,0.0003401823,0.66629153,0.000098371434,0.00012609862,0.00043965757,0.00015602705,0.0001313104,0.0015070059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982849,0.00077659084,0.00008609084,0.0002560473,0.0005218684,0.00007461413],"domain_scores_gemma":[0.9945372,0.0040341644,0.00023552198,0.00027840232,0.00080113095,0.00011351017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041532726,0.0012516148,0.0019720702,0.000843657,0.00048487034,0.0007054083,0.0015973076,0.0012490078,0.0019065766],"category_scores_gemma":[0.009302878,0.00088455033,0.0013154072,0.00092058815,0.0007970417,0.0017326955,0.0013128633,0.0010684625,0.00019549511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041609938,0.00018720991,0.00142802,0.00034840257,0.0002160493,0.00012134997,0.00011494807,0.8401389,0.010398056,0.01616581,0.0007955393,0.12966955],"study_design_scores_gemma":[0.000010282405,0.000048764254,0.000080436854,0.000004302513,0.000016108574,0.000010062085,0.000002960813,0.9981027,0.00051138294,0.0010568327,0.00015227609,0.0000039636834],"about_ca_topic_score_codex":0.0033284526,"about_ca_topic_score_gemma":0.00369092,"teacher_disagreement_score":0.0041532726,"about_ca_system_score_codex":0.0004973014,"about_ca_system_score_gemma":0.0011398428,"threshold_uncertainty_score":0.021964848},"labels":[],"label_agreement":null},{"id":"W2012884505","doi":"10.1007/s00158-011-0666-3","title":"pyOpt: a Python-based object-oriented framework for nonlinear constrained optimization","year":2011,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":422,"is_retracted":false,"has_abstract":false,"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":"Python (programming language); Computer science; Optimization problem; Mathematical optimization; Nonlinear programming; Object-oriented programming; Engineering optimization; Programming language; Theoretical computer science; Nonlinear system; Algorithm; Mathematics","score_opus":0.020096411531526432,"score_gpt":0.2790700468690601,"score_spread":0.2589736353375337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012884505","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.0017177305,0.000119240714,0.86948764,0.00015352307,0.00011370024,0.000110999776,0.0022998143,0.120253004,0.0057443506],"genre_scores_gemma":[0.06969276,0.0005361615,0.85026664,0.00068105146,0.00011681759,0.0011547528,0.0066898065,0.05868217,0.012179871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00010805292,0.000055578457,0.00008274432,0.00025364087,0.0000877522],"domain_scores_gemma":[0.9986778,0.0007093263,0.000078327095,0.00018288,0.00023911905,0.00011241634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012857517,0.0017305318,0.0015788497,0.0008773546,0.00077794364,0.0017449163,0.0038987945,0.001293718,0.04530514],"category_scores_gemma":[0.0035984206,0.0010898428,0.0017440385,0.0010934877,0.0008202716,0.0018009499,0.0022344815,0.0028109923,0.012919269],"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.0010316204,0.00053916353,0.0030799462,0.0026210535,0.00050071743,0.00078260235,0.00047017488,0.22408448,0.0138218505,0.090475895,0.27666613,0.38592637],"study_design_scores_gemma":[0.00043879874,0.000057069607,0.0008304313,0.00013103716,0.000059928396,0.00023319901,0.000050755905,0.82173437,0.012623439,0.056523737,0.10721174,0.000105540734],"about_ca_topic_score_codex":0.0046074567,"about_ca_topic_score_gemma":0.005590914,"teacher_disagreement_score":0.04530514,"about_ca_system_score_codex":0.00061772676,"about_ca_system_score_gemma":0.001947578,"threshold_uncertainty_score":0.15156078},"labels":[],"label_agreement":null},{"id":"W2014288437","doi":"10.1504/ijpd.2009.026178","title":"Approximated unimodal region elimination-based global optimisation method for engineering design","year":2009,"lang":"en","type":"article","venue":"International Journal of Product Development","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Victoria","funders":"","keywords":"Benchmark (surveying); Computation; Global optimization; Mathematical optimization; Computer science; Field (mathematics); Ideal (ethics); Function (biology); Algorithm; Mathematics","score_opus":0.024607933549310606,"score_gpt":0.3084243863992482,"score_spread":0.28381645284993756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014288437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013002218,0.00015242629,0.99744594,0.00001867711,0.000009710324,0.00001717619,0.000011723559,0.00019141089,0.0008526575],"genre_scores_gemma":[0.10281462,0.0003484903,0.8932356,0.00006843202,0.000017017288,0.00034253593,0.00012279728,0.00017012152,0.0028804229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993656,0.00027650764,0.00001986743,0.000061867184,0.00025054725,0.000025574787],"domain_scores_gemma":[0.9990715,0.00061760057,0.00006060864,0.00007702912,0.00016124938,0.000011937007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779563,0.0008961577,0.0011791184,0.00089504535,0.00030063125,0.00057749584,0.0009293889,0.00074544444,0.0037625423],"category_scores_gemma":[0.0022283217,0.00037969465,0.0007964438,0.0007557343,0.00049568474,0.0006653776,0.0006099949,0.0010295371,0.0009416712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007628365,0.000032208773,0.00021187194,0.00022658364,0.000055126497,0.00003737192,0.000057629444,0.81647176,0.006508427,0.012999077,0.0011530408,0.16217059],"study_design_scores_gemma":[0.000011585085,0.000032584296,0.000069424335,0.000012043895,0.000008923135,0.000018883018,0.0000070507613,0.9920026,0.0015553671,0.0034139557,0.002860211,0.000007525536],"about_ca_topic_score_codex":0.0017893618,"about_ca_topic_score_gemma":0.0022919998,"teacher_disagreement_score":0.0037625423,"about_ca_system_score_codex":0.0005194608,"about_ca_system_score_gemma":0.001033559,"threshold_uncertainty_score":0.012586951},"labels":[],"label_agreement":null},{"id":"W2015261375","doi":"10.1115/1.4028883","title":"Error Metrics and the Sequential Refinement of Kriging Metamodels","year":2014,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Kriging; Computer science; Resampling; Engineering design process; Computer experiment; Reliability (semiconductor); Set (abstract data type); Process (computing); Data mining; Algorithm; Machine learning; Simulation; Engineering","score_opus":0.04480847137402148,"score_gpt":0.28783372277078895,"score_spread":0.24302525139676745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015261375","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.028547417,0.00054132927,0.96973926,0.00014387138,0.000029779372,0.000046756824,0.00010346492,0.00018593749,0.00066218653],"genre_scores_gemma":[0.62703973,0.00048714233,0.37075642,0.00007105716,0.000026364973,0.00018677539,0.0005101419,0.00017158934,0.0007507631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99279404,0.0035820887,0.00053856766,0.00079340383,0.002015149,0.0002767926],"domain_scores_gemma":[0.9700946,0.020281533,0.0031157061,0.002678615,0.0035441036,0.0002853396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015385821,0.0013964011,0.0012971046,0.0023508966,0.00041489294,0.0011690336,0.0014720185,0.0011875553,0.0006787449],"category_scores_gemma":[0.041711807,0.0005811224,0.0010770259,0.0015971169,0.001194335,0.0019058471,0.0018725556,0.0013438022,0.00016905623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009961331,0.000030501662,0.0027090053,0.00013900483,0.000060208233,0.00003216509,0.000083642924,0.9525234,0.0022138245,0.01813497,0.00023059649,0.023743017],"study_design_scores_gemma":[0.000008537702,0.000074732205,0.00080123375,0.000027546954,0.000011982507,0.000025778829,0.000015115791,0.9864448,0.002192764,0.009749038,0.0006316867,0.00001686065],"about_ca_topic_score_codex":0.0060543357,"about_ca_topic_score_gemma":0.0035730444,"teacher_disagreement_score":0.015385821,"about_ca_system_score_codex":0.0012081629,"about_ca_system_score_gemma":0.0012997289,"threshold_uncertainty_score":0.08136898},"labels":[],"label_agreement":null},{"id":"W2017110647","doi":"10.1063/1.3452150","title":"Global Optimization Using Mixed Surrogate Models for Computation Intensive Designs","year":2010,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Benchmark (surveying); Latin hypercube sampling; Global optimization; Surrogate model; Mathematical optimization; Computation; Computer science; Optimization problem; Hypercube; Field (mathematics); Algorithm; Mathematics; Parallel computing; Monte Carlo method","score_opus":0.06332828907830652,"score_gpt":0.3098062357448717,"score_spread":0.2464779466665652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017110647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031835998,0.00012083333,0.9957489,0.00003686449,0.000008378022,0.000019180301,0.0000098724,0.00008912836,0.00078330137],"genre_scores_gemma":[0.23806033,0.00047939093,0.75800925,0.00009335041,0.000024375566,0.0005721603,0.00014321602,0.00014884045,0.002469121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985884,0.0009111615,0.0000399095,0.0000746987,0.0003498383,0.00003595435],"domain_scores_gemma":[0.9980703,0.0014231487,0.00014311618,0.00015784753,0.00017836814,0.000027202315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002994386,0.0011315375,0.0010725892,0.0007905358,0.00030255082,0.0008558505,0.0007074239,0.00094871037,0.0016145179],"category_scores_gemma":[0.0041764174,0.00047432698,0.0010989651,0.0006241433,0.000660851,0.0008053274,0.0009956838,0.0010511916,0.0003781226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046711302,0.000019620886,0.00018543236,0.000071395705,0.000028562054,0.000022512068,0.000024787896,0.9602728,0.0018775074,0.011238936,0.00022203279,0.025989704],"study_design_scores_gemma":[0.000006972482,0.000037856364,0.00002776811,0.000006893222,0.0000035686442,0.000006760785,0.000003298584,0.9955171,0.00076926226,0.0029927434,0.0006246026,0.0000031556128],"about_ca_topic_score_codex":0.0006030572,"about_ca_topic_score_gemma":0.0008516439,"teacher_disagreement_score":0.002994386,"about_ca_system_score_codex":0.0004472581,"about_ca_system_score_gemma":0.0010097129,"threshold_uncertainty_score":0.015836},"labels":[],"label_agreement":null},{"id":"W2017226599","doi":"10.1093/biomet/asn064","title":"Construction of orthogonal and nearly orthogonal Latin hypercubes","year":2009,"lang":"en","type":"article","venue":"Biometrika","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypercube; Mathematics; Latin hypercube sampling; Library science; Combinatorics; Statistics; Computer science","score_opus":0.011571705788514589,"score_gpt":0.24103963182670712,"score_spread":0.22946792603819255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017226599","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.010888777,0.00015400695,0.9801517,0.00007682746,0.00007468599,0.00010688657,0.00008539646,0.00027451827,0.008187161],"genre_scores_gemma":[0.10906372,0.00034067617,0.88330865,0.00015089297,0.000058925485,0.00069498736,0.00032299696,0.00024009394,0.005819038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860185,0.00058713974,0.00009846699,0.00021585167,0.00037368955,0.00012308867],"domain_scores_gemma":[0.9986553,0.00040450087,0.00017544368,0.00026787605,0.00038261485,0.00011418875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971663,0.00069167075,0.00079153565,0.001069916,0.0007214569,0.0011130446,0.0008745319,0.00043575867,0.0053161476],"category_scores_gemma":[0.00318769,0.0006226342,0.0006940528,0.0010462966,0.0011369132,0.0013438879,0.0028915422,0.0010289835,0.001851098],"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.0003230736,0.00014050577,0.0011512175,0.00036324124,0.00009140461,0.00035553367,0.0004347652,0.17568232,0.07274799,0.44599515,0.0065908274,0.29612395],"study_design_scores_gemma":[0.00015699553,0.00043563606,0.00054243533,0.000121015844,0.000060955834,0.0005752815,0.00034492704,0.55661434,0.08546249,0.2675302,0.08800979,0.00014590338],"about_ca_topic_score_codex":0.00036709526,"about_ca_topic_score_gemma":0.00044898468,"teacher_disagreement_score":0.0053161476,"about_ca_system_score_codex":0.00036579132,"about_ca_system_score_gemma":0.00071557093,"threshold_uncertainty_score":0.017784238},"labels":[],"label_agreement":null},{"id":"W2017760786","doi":"10.1115/1.3290763","title":"Lagrangian Relaxation Approach for Decentralized Decision Making in Engineering Design","year":2010,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lagrangian relaxation; Context (archaeology); Relaxation (psychology); Convergence (economics); Engineering design process; Workflow; Process (computing); Factor (programming language); Computer science; Mathematical optimization; Augmented Lagrangian method; Industrial engineering; Systems engineering; Engineering; Mechanical engineering; Mathematics","score_opus":0.009994730464558732,"score_gpt":0.2637967835799094,"score_spread":0.25380205311535065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017760786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031191949,0.00026773365,0.9922695,0.0003124073,0.00003614942,0.000044040164,0.00003117072,0.00004225957,0.0038774791],"genre_scores_gemma":[0.36785007,0.0010038527,0.6226621,0.00027941377,0.00017128735,0.00076156645,0.00017520021,0.00011788608,0.006978547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836797,0.0010084552,0.000046575202,0.00014280678,0.0003111041,0.00012312358],"domain_scores_gemma":[0.9981212,0.0013370164,0.00017227228,0.000080083424,0.00020991433,0.00007951684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038848547,0.0010848944,0.0015473762,0.00062085025,0.00066679,0.0012806869,0.0012278237,0.0012829602,0.0029776052],"category_scores_gemma":[0.0043014497,0.0007864712,0.0010174691,0.00089834066,0.0014758805,0.0013349024,0.0017084869,0.0024078041,0.00041496396],"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.000033193177,0.000029142855,0.00008665025,0.00010345883,0.000028713537,0.00006223394,0.00006430297,0.9384518,0.00042846805,0.0511102,0.0008604874,0.008741428],"study_design_scores_gemma":[0.000027859967,0.000022477074,0.0000309081,0.000013210401,0.000005909427,0.000008644108,0.000013433584,0.97464246,0.0001446009,0.023944877,0.0011398488,0.0000058124306],"about_ca_topic_score_codex":0.003505207,"about_ca_topic_score_gemma":0.0030117747,"teacher_disagreement_score":0.0038848547,"about_ca_system_score_codex":0.001595019,"about_ca_system_score_gemma":0.0024030018,"threshold_uncertainty_score":0.020545304},"labels":[],"label_agreement":null},{"id":"W2018636595","doi":"10.1007/s00158-004-0396-x","title":"Optimization of the new Saab 9-3 exposed to impact load using a space mapping technique","year":2004,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nordic Life Science Pipeline (Canada)","funders":"Saab; Stiftelsen för Strategisk Forskning","keywords":"Crashworthiness; Space mapping; Surrogate model; Mathematical optimization; Finite element method; Computer science; Surface (topology); Space (punctuation); Optimization problem; Response surface methodology; Algorithm; Mathematics; Engineering; Structural engineering; Machine learning","score_opus":0.016611778548438445,"score_gpt":0.28438292930843856,"score_spread":0.26777115076000013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018636595","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.53277194,0.00038968853,0.42795876,0.00031301723,0.00021164418,0.00016182613,0.00018135969,0.00081116427,0.037200656],"genre_scores_gemma":[0.9328382,0.00008439875,0.06117171,0.000042729174,0.000016469494,0.00010843031,0.00011111032,0.00009893333,0.0055280398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998617,0.00003689218,0.0000045160114,0.000018093337,0.000047981564,0.000030708878],"domain_scores_gemma":[0.999783,0.000068465946,0.000022995748,0.000021910764,0.000079719444,0.000023897637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042741053,0.0007638984,0.0006101662,0.00045567632,0.00061726064,0.00092088466,0.0005042037,0.0009965892,0.0039628423],"category_scores_gemma":[0.0006614474,0.00031567036,0.00048025214,0.00033785476,0.00041057682,0.0004083262,0.0004575985,0.0005928738,0.00053780025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104392675,0.00003549222,0.00037061636,0.000034859157,0.00001843941,0.0000407022,0.000027698368,0.97861207,0.008854675,0.0010812982,0.0002935274,0.010526278],"study_design_scores_gemma":[0.000017260283,0.00013560738,0.0003775161,0.000004617512,0.000012024365,0.00001614938,0.000027969914,0.99524456,0.0027526622,0.00033848442,0.001066452,0.000006602515],"about_ca_topic_score_codex":0.0028954824,"about_ca_topic_score_gemma":0.0029364608,"teacher_disagreement_score":0.0039628423,"about_ca_system_score_codex":0.00040559797,"about_ca_system_score_gemma":0.00081599044,"threshold_uncertainty_score":0.013257027},"labels":[],"label_agreement":null},{"id":"W2019722917","doi":"10.1115/detc2010-28355","title":"Constraint Importance Mode Pursuing Sampling for Continuous Global Optimization","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; Simon Fraser University","funders":"","keywords":"Mathematical optimization; Sampling (signal processing); Computer science; Constraint (computer-aided design); Metamodeling; Global optimization; Mode (computer interface); Sample (material); Optimization problem; Constrained optimization; Computation; Domain (mathematical analysis); Function (biology); Algorithm; Mathematics","score_opus":0.016696692885559673,"score_gpt":0.3089574854628433,"score_spread":0.2922607925772836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019722917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059086434,0.000078966004,0.99325573,0.00003026538,0.0000065842137,0.000018508003,0.000009693954,0.000082332626,0.00060927746],"genre_scores_gemma":[0.37615508,0.00024572338,0.62204087,0.00007431276,0.000042862008,0.0002595177,0.00010890077,0.000105946994,0.00096676964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995016,0.00025320944,0.0000125462375,0.000051431674,0.00015888686,0.000022260943],"domain_scores_gemma":[0.9985115,0.0011052787,0.00007440742,0.00014642745,0.00012871811,0.000033677476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551185,0.00067250145,0.00062582246,0.0005556499,0.00023393611,0.00040719737,0.0006540486,0.00055432477,0.0013980231],"category_scores_gemma":[0.0044005867,0.0002674438,0.00054285437,0.0005220516,0.0005786962,0.00059408,0.00059423124,0.0007660777,0.00019526616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015604122,0.00006615246,0.0009951694,0.00016412271,0.00004941213,0.000076874145,0.000076091805,0.8346617,0.011977927,0.040778186,0.0010481745,0.10995006],"study_design_scores_gemma":[0.0000080225,0.000033737517,0.000069807495,0.0000033842582,0.00000319015,0.000011774398,0.0000022917695,0.99462694,0.0013119105,0.0035280879,0.0003979317,0.0000029715625],"about_ca_topic_score_codex":0.0007898309,"about_ca_topic_score_gemma":0.0008498427,"teacher_disagreement_score":0.001551185,"about_ca_system_score_codex":0.00040602792,"about_ca_system_score_gemma":0.0005231081,"threshold_uncertainty_score":0.0082035065},"labels":[],"label_agreement":null},{"id":"W2020700108","doi":"10.1115/1.4001599","title":"On the Performance of the PSP Method for Mixed-Variable Multi-Objective Design Optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Benchmark (surveying); Robustness (evolution); Multi-objective optimization; Black box; Pareto principle; Computer science; Closeness; Continuous variable; Continuous optimization; Variable (mathematics); Engineering design process; Set (abstract data type); Optimization problem; Mathematics; Engineering; Artificial intelligence; Multi-swarm optimization","score_opus":0.03057773855711829,"score_gpt":0.28751245423751787,"score_spread":0.2569347156803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020700108","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.06473218,0.0017217909,0.92172134,0.00020290237,0.00006520119,0.00007586109,0.00005431847,0.00043515343,0.010991349],"genre_scores_gemma":[0.5758205,0.0011224538,0.42032313,0.000120819845,0.000047453676,0.00014760201,0.00013914994,0.00015922521,0.002119775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813604,0.00089723157,0.000061328334,0.0001155354,0.00071923237,0.00007063042],"domain_scores_gemma":[0.9922133,0.0064343503,0.00018186177,0.00040233368,0.00069320406,0.00007488531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004605559,0.0010428732,0.0009561313,0.0007872596,0.00042806662,0.00077129464,0.0010008619,0.000991511,0.0019909437],"category_scores_gemma":[0.011784061,0.0003172392,0.00065625214,0.0008290443,0.00076922774,0.001053069,0.0009859574,0.0010004496,0.00031684115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025511312,0.00006900938,0.0008949093,0.00017786614,0.00007916236,0.00004910463,0.000044601507,0.88832855,0.0035026327,0.005944135,0.0005031691,0.10015167],"study_design_scores_gemma":[0.000011286634,0.00008318151,0.00021651246,0.000013389666,0.000008973191,0.00001783569,0.0000052568566,0.9960084,0.00214427,0.0011242942,0.000361359,0.00000528779],"about_ca_topic_score_codex":0.0025336298,"about_ca_topic_score_gemma":0.0018874345,"teacher_disagreement_score":0.004605559,"about_ca_system_score_codex":0.00048227175,"about_ca_system_score_gemma":0.00079981145,"threshold_uncertainty_score":0.024356842},"labels":[],"label_agreement":null},{"id":"W2020821169","doi":"10.1016/j.envsoft.2011.09.010","title":"Numerical assessment of metamodelling strategies in computationally intensive optimization","year":2011,"lang":"en","type":"article","venue":"Environmental Modelling & Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metamodeling; Computer science; Mathematical optimization; Optimization problem; Emulation; Kriging; Function (biology); Machine learning; Mathematics; Algorithm","score_opus":0.029692641945791635,"score_gpt":0.2555625978735644,"score_spread":0.22586995592777276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020821169","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.4939184,0.00095308037,0.48399308,0.00060008897,0.00007825068,0.00025662198,0.00012613248,0.00030904668,0.019765345],"genre_scores_gemma":[0.932288,0.00017620387,0.06652921,0.000041898533,0.000009132365,0.00010938097,0.00004857771,0.00004973515,0.0007479111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931836,0.0004598273,0.000023408982,0.000031682142,0.00013292531,0.000033684286],"domain_scores_gemma":[0.9943421,0.0046274127,0.00024315547,0.00032954325,0.00036956687,0.00008824365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030126297,0.0005467083,0.0005253237,0.0007399759,0.00043925422,0.0009879749,0.0007297752,0.0010526979,0.0015557699],"category_scores_gemma":[0.012610157,0.00023973371,0.00043018212,0.00053896825,0.0005882745,0.0010861203,0.00080834696,0.0006908522,0.0001477456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012420307,0.000101935504,0.00047849413,0.00006123177,0.000015612977,0.000016605258,0.000034277324,0.9728036,0.0015891526,0.00893993,0.000121478726,0.01571357],"study_design_scores_gemma":[0.0000142197705,0.00006508836,0.00013957449,0.0000099588415,0.0000065359654,0.000004403479,0.000014942594,0.9960368,0.0008062401,0.0027514375,0.0001467813,0.0000040916043],"about_ca_topic_score_codex":0.002369254,"about_ca_topic_score_gemma":0.0023176773,"teacher_disagreement_score":0.0030126297,"about_ca_system_score_codex":0.0007209507,"about_ca_system_score_gemma":0.0008170642,"threshold_uncertainty_score":0.0159325},"labels":[],"label_agreement":null},{"id":"W2021601290","doi":"10.1007/s10898-011-9732-z","title":"An experimental methodology for response surface optimization methods","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":51,"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":"Mathematics; Mathematical optimization; Gaussian process; Global optimization; Gaussian; Set (abstract data type); Function (biology); Dimension (graph theory); Test functions for optimization; Scaling; Surface (topology); Optimization problem; Algorithm; Computer science; Multi-swarm optimization","score_opus":0.09512033817134276,"score_gpt":0.41913846528555154,"score_spread":0.3240181271142088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021601290","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.0063943095,0.000118501644,0.9886994,0.00011586258,0.00011433247,0.00034113374,0.00014019654,0.00063091004,0.003445434],"genre_scores_gemma":[0.14903586,0.000294637,0.8438289,0.0001386597,0.00007078952,0.0024366179,0.00030505966,0.0003898901,0.0034995403],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499476,0.0020157944,0.00028993143,0.00042984073,0.0021078833,0.00016186561],"domain_scores_gemma":[0.996222,0.0013312886,0.00020695869,0.0010483107,0.0011281036,0.000063245374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004703624,0.0009936568,0.00071344,0.00080566085,0.0006777779,0.0009708502,0.0016679538,0.0010707541,0.011433081],"category_scores_gemma":[0.008847807,0.00046474682,0.0005558112,0.0010052775,0.0010049816,0.0013193256,0.0015179348,0.0015404072,0.0021267869],"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.0006075365,0.0013958988,0.0008927428,0.0013751988,0.00010432653,0.0001063144,0.00024483266,0.04157187,0.46378854,0.119492985,0.0058169332,0.3646029],"study_design_scores_gemma":[0.00037951846,0.0026375656,0.0022446325,0.00017029127,0.00008314694,0.00030538166,0.00020018463,0.46549723,0.43737087,0.03381909,0.05712654,0.00016566335],"about_ca_topic_score_codex":0.00030109193,"about_ca_topic_score_gemma":0.00030973548,"teacher_disagreement_score":0.011433081,"about_ca_system_score_codex":0.00041538902,"about_ca_system_score_gemma":0.000840191,"threshold_uncertainty_score":0.038247526},"labels":[],"label_agreement":null},{"id":"W2021984249","doi":"10.1142/s0129626407003034","title":"COMPARING MINIMUM NEIGHBORHOOD EVALUATION SCHEMES FOR FINDING SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Science Council","keywords":"Robustness (evolution); Fitness function; Mathematical optimization; Neighbourhood (mathematics); Computer science; Algorithm; Mathematics; Genetic algorithm","score_opus":0.08517098334736357,"score_gpt":0.3201502356648206,"score_spread":0.23497925231745703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021984249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.166894,0.002990282,0.8216618,0.00032402834,0.0001274384,0.00027844583,0.00011883244,0.00044547993,0.00715974],"genre_scores_gemma":[0.6086766,0.0009675291,0.38753158,0.00006218719,0.00004576248,0.00030268982,0.00021529401,0.00015002963,0.0020482063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768,0.0008718818,0.00020639863,0.00020292314,0.00093233876,0.0001065043],"domain_scores_gemma":[0.9903342,0.006805597,0.0005390194,0.0010205461,0.0011506288,0.00015005411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058194497,0.00076141686,0.0012565696,0.0026614543,0.00047322692,0.0011059585,0.0012715535,0.0016226711,0.001362217],"category_scores_gemma":[0.023430685,0.00032606345,0.0010624243,0.0016306612,0.00086327014,0.0022420657,0.0014239969,0.0007159321,0.00025781608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006523289,0.00012980589,0.0027192687,0.00037266914,0.00019236245,0.000076110104,0.00027333398,0.7203446,0.0065827924,0.033465173,0.001018186,0.2341733],"study_design_scores_gemma":[0.000039598788,0.0003344009,0.001418777,0.00004872811,0.000054964577,0.00009258195,0.000078642915,0.98248094,0.005735902,0.00849478,0.001181061,0.000039600713],"about_ca_topic_score_codex":0.0017972208,"about_ca_topic_score_gemma":0.0016252254,"teacher_disagreement_score":0.0058194497,"about_ca_system_score_codex":0.001265264,"about_ca_system_score_gemma":0.00055947196,"threshold_uncertainty_score":0.03077656},"labels":[],"label_agreement":null},{"id":"W2023062871","doi":"10.1108/ijicc-07-2014-0034","title":"Simultaneous knowledge-based identification and optimization of PHEV fuel economy using hyper-level Pareto-based chaotic Lamarckian immune algorithm, MSBA and fuzzy programming","year":2015,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","topic":"Advanced Multi-Objective Optimization Algorithms","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; Identifier; Identification (biology); Fuzzy logic; Exploit; Pareto principle; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03317434205134592,"score_gpt":0.29949965574047865,"score_spread":0.2663253136891327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023062871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070821136,0.00019369669,0.92285603,0.00020832408,0.000022072543,0.000058623034,0.000020815618,0.0001261244,0.005693206],"genre_scores_gemma":[0.9172284,0.0000927305,0.080765,0.00007004855,0.000010650749,0.00014529131,0.00003107573,0.000011951161,0.0016448525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997781,0.000063387044,0.000011317753,0.00004561072,0.000070766655,0.000030850224],"domain_scores_gemma":[0.9996463,0.00017642892,0.000060903865,0.000022367574,0.000078663994,0.000015291318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070557836,0.0004778443,0.00044952557,0.0005050118,0.000363191,0.00097466673,0.0007032288,0.0007250534,0.0010593084],"category_scores_gemma":[0.0015159379,0.00021744116,0.0005292537,0.00028388202,0.00047884288,0.00050509605,0.00075169053,0.0005376511,0.0001309857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036736994,0.000042890584,0.00080316,0.000048844322,0.000034219007,0.000042282565,0.00006107229,0.96112484,0.0030056725,0.004528453,0.00021176596,0.030060142],"study_design_scores_gemma":[0.00000298738,0.000023847077,0.00008612315,0.0000034932707,0.0000033780955,0.000007812248,0.000008181656,0.9984653,0.00051819254,0.0007494554,0.00012874874,0.0000024291517],"about_ca_topic_score_codex":0.0017245116,"about_ca_topic_score_gemma":0.0013148724,"teacher_disagreement_score":0.0017245116,"about_ca_system_score_codex":0.0005148557,"about_ca_system_score_gemma":0.00082995807,"threshold_uncertainty_score":0.0037355423},"labels":[],"label_agreement":null},{"id":"W2023835690","doi":"10.1080/03052150108940935","title":"MULTIOBJECTIVE DESIGN OPTIMIZATION BASED ON SATISFACTION METRICS","year":2001,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Multi-objective optimization; Solver; Computer science; Pareto principle; Mathematical optimization; Context (archaeology); Implementation; Constraint satisfaction problem; Engineering design process; Mathematics; Engineering; Software engineering; Artificial intelligence; Probabilistic logic","score_opus":0.014408971302169258,"score_gpt":0.23113274333323688,"score_spread":0.21672377203106763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023835690","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.0039631706,0.00006787691,0.99406284,0.000055848555,0.0000093355,0.000031646352,0.000012848782,0.000042531326,0.0017539683],"genre_scores_gemma":[0.45686397,0.0003019682,0.5386563,0.00009138381,0.000024979416,0.00045588554,0.00012952485,0.00011335585,0.0033625665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734384,0.0013267285,0.00010601835,0.00015076698,0.0009421022,0.00013049648],"domain_scores_gemma":[0.9984085,0.00088095444,0.00017840596,0.00013456568,0.0003382965,0.000059374837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003158402,0.001077441,0.0008652222,0.0010977408,0.00037263913,0.0013609217,0.00074974145,0.000650944,0.0020416996],"category_scores_gemma":[0.0038488603,0.00038089027,0.0009672075,0.00086291356,0.0010612018,0.001196228,0.0012779629,0.00093971647,0.0002700522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032900392,0.0000356388,0.00030338962,0.00011354691,0.000033398905,0.000032408825,0.00006778811,0.80098355,0.0043648565,0.15659337,0.00058987184,0.036849234],"study_design_scores_gemma":[0.000008262209,0.000044845063,0.000060220424,0.000014299293,0.0000051696384,0.000014787177,0.000009704902,0.96489745,0.001080189,0.032342575,0.0015152007,0.0000072768757],"about_ca_topic_score_codex":0.0012770419,"about_ca_topic_score_gemma":0.00087580184,"teacher_disagreement_score":0.003158402,"about_ca_system_score_codex":0.0014124755,"about_ca_system_score_gemma":0.0011288336,"threshold_uncertainty_score":0.016703427},"labels":[],"label_agreement":null},{"id":"W2024598862","doi":"10.1007/s00158-011-0661-8","title":"Application of SEUMRE global optimization algorithm in automotive magnetorheological brake design","year":2011,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University; University of Victoria","funders":"","keywords":"Magnetorheological fluid; Brake; Simulated annealing; Automotive industry; Global optimization; Torque; Genetic algorithm; Computation; Computer science; Automotive engineering; Engineering design process; Control theory (sociology); Algorithm; Engineering; Control engineering; Mechanical engineering","score_opus":0.01839155456451052,"score_gpt":0.26087887969492024,"score_spread":0.24248732513040971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024598862","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.019293055,0.00026147446,0.97616845,0.00009905142,0.00004377493,0.000027585656,0.000013858299,0.00020783118,0.003884959],"genre_scores_gemma":[0.4476314,0.00029332956,0.54447496,0.000115597555,0.000037981772,0.00019762346,0.000087606146,0.00020184426,0.0069595347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998142,0.00007888644,0.000007747363,0.000028980488,0.000052505617,0.000017634375],"domain_scores_gemma":[0.99972767,0.00013633701,0.000020993211,0.000020527037,0.000085588326,0.00000885697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007079837,0.00068727747,0.000889823,0.00060013274,0.00051925436,0.00049600477,0.000571301,0.0010973007,0.0023914669],"category_scores_gemma":[0.0009632141,0.0003639908,0.00060354423,0.0003904434,0.00036465874,0.00062059466,0.00047482032,0.0004814099,0.00038582683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007105355,0.00005107293,0.00040771562,0.0000651876,0.0000366234,0.000037823516,0.000048299527,0.91170394,0.00515751,0.0069463095,0.000846884,0.074627556],"study_design_scores_gemma":[0.0000059252675,0.000040219755,0.00009457861,0.0000044440967,0.000005422971,0.000010820759,0.0000063987673,0.99736065,0.0010197136,0.00075782946,0.00069039006,0.0000036544884],"about_ca_topic_score_codex":0.0024208804,"about_ca_topic_score_gemma":0.0038011395,"teacher_disagreement_score":0.0024208804,"about_ca_system_score_codex":0.00028499658,"about_ca_system_score_gemma":0.0006359908,"threshold_uncertainty_score":0.008000195},"labels":[],"label_agreement":null},{"id":"W2025463696","doi":"10.1109/mwsym.2007.380266","title":"Coarse and Surrogate Model Assessment for Engineering Design Optimization with Space Mapping","year":2007,"lang":"en","type":"article","venue":"IEEE MTT-S International Microwave Symposium digest","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate model; Space mapping; Computer science; Space (punctuation); Systems engineering; Reliability engineering; Engineering; Machine learning; Algorithm","score_opus":0.015771252785468145,"score_gpt":0.2575394444583826,"score_spread":0.24176819167291447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025463696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042714686,0.00020404502,0.9935196,0.00009440027,0.000018724875,0.000018995386,0.000019029092,0.00010230755,0.0017513628],"genre_scores_gemma":[0.45400196,0.0008760242,0.54052764,0.0001783371,0.000086903034,0.00030254974,0.00017278134,0.00020279462,0.003650987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976477,0.0011102884,0.000079417056,0.00011987262,0.0009811941,0.00006149845],"domain_scores_gemma":[0.99618465,0.0023649433,0.00028209414,0.0006594472,0.00041789052,0.00009104387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040400573,0.001036373,0.0013606171,0.0013463732,0.00043683776,0.0017073309,0.0007809983,0.0013354993,0.0025988384],"category_scores_gemma":[0.0118384585,0.00048267326,0.000901808,0.00086206343,0.0014426825,0.0022203636,0.002001417,0.0013406696,0.0004104749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004761742,0.000027063703,0.0002737451,0.00007573255,0.000020658546,0.000036815552,0.000041987296,0.91383064,0.0026297555,0.055138186,0.0004543732,0.02742346],"study_design_scores_gemma":[0.0000056795,0.00004046154,0.000089550056,0.00001591176,0.0000042791094,0.000018613751,0.000010097361,0.9623295,0.0012521461,0.034881875,0.0013410884,0.000010703954],"about_ca_topic_score_codex":0.00087751425,"about_ca_topic_score_gemma":0.0007399547,"teacher_disagreement_score":0.0040400573,"about_ca_system_score_codex":0.00067371136,"about_ca_system_score_gemma":0.00091795303,"threshold_uncertainty_score":0.02136612},"labels":[],"label_agreement":null},{"id":"W2026717679","doi":"10.2514/1.j052180","title":"Development of a Multilevel Multidisciplinary-Optimization Capability for an Industrial Environment","year":2013,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Bombardier (Canada)","funders":"","keywords":"Multidisciplinary design optimization; Multidisciplinary approach; Systems engineering; Software deployment; Engineering optimization; Computer science; Frame (networking); Industrial engineering; Engineering; Optimization problem; Software engineering; Mechanical engineering","score_opus":0.05361191833676478,"score_gpt":0.28441759231733366,"score_spread":0.2308056739805689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026717679","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.004087926,0.00013184179,0.98998135,0.00017272907,0.000018539793,0.00004241159,0.00004045225,0.00035280475,0.0051719216],"genre_scores_gemma":[0.06768364,0.00024316814,0.93019414,0.00007843311,0.00002321246,0.0001227231,0.000112028734,0.00010444925,0.0014382286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917185,0.00021127606,0.00004141777,0.000102883605,0.00040486257,0.000067723544],"domain_scores_gemma":[0.99922335,0.00022681944,0.00007211218,0.000220544,0.00017460881,0.000082617444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320919,0.00063493947,0.0006304402,0.0007227551,0.0004997615,0.001343419,0.001385098,0.00079621765,0.004335598],"category_scores_gemma":[0.002067972,0.00040489135,0.0010946811,0.00069155666,0.00049602863,0.0016252586,0.003912669,0.0020043459,0.0015952558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008812522,0.00020445547,0.0019885148,0.0003750778,0.00011842,0.00018425575,0.00022882185,0.5500576,0.027581234,0.17853224,0.004230749,0.23641045],"study_design_scores_gemma":[0.000020158015,0.000114163726,0.00042728256,0.00008790715,0.000018456923,0.00009421073,0.00004586703,0.9369251,0.0064556175,0.032641035,0.023144873,0.000025342839],"about_ca_topic_score_codex":0.001141539,"about_ca_topic_score_gemma":0.0017706824,"teacher_disagreement_score":0.004335598,"about_ca_system_score_codex":0.00045711652,"about_ca_system_score_gemma":0.0012823921,"threshold_uncertainty_score":0.014504075},"labels":[],"label_agreement":null},{"id":"W2030030592","doi":"10.1115/interpack2009-89341","title":"Multi-Objective Optimization of Graphite Heat Spreader for Portable Systems Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Graphite; Heat sink; Heat spreader; Miniaturization; Thermal conductivity; Materials science; Heat transfer; Electronics; Mechanical engineering; Power density; Process engineering; Nuclear engineering; Computer science; Electrical engineering; Power (physics); Composite material; Nanotechnology; Engineering; Mechanics; Thermodynamics; Physics","score_opus":0.01652862787372476,"score_gpt":0.2753230982392943,"score_spread":0.2587944703655695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030030592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30147636,0.0010415503,0.68217915,0.00033080092,0.00007740074,0.00024832852,0.00018538561,0.0003881129,0.01407282],"genre_scores_gemma":[0.8439409,0.0003653093,0.14617243,0.00006618988,0.000024856503,0.0003610731,0.00018761035,0.000075306576,0.008806298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997589,0.00010106207,0.000008895104,0.0000314914,0.000067932415,0.000031703934],"domain_scores_gemma":[0.99950373,0.00033446736,0.00004959499,0.000014567085,0.00007499848,0.00002275469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008102387,0.0011094223,0.00086793175,0.00086276396,0.00042097332,0.000703502,0.00058745255,0.0013007654,0.0028441562],"category_scores_gemma":[0.0014252111,0.00035398017,0.0006796735,0.0007343499,0.00033632026,0.00045616023,0.00047475516,0.00056255976,0.00023604915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004040045,0.000023372355,0.00015745114,0.000027669596,0.0000103143875,0.00002914504,0.000008341216,0.9920581,0.00082008,0.00032699082,0.000118331125,0.006379816],"study_design_scores_gemma":[0.000010183483,0.000045703666,0.000138161,0.000004077865,0.000005439801,0.0000070885676,0.000007245093,0.99876285,0.0005827773,0.00028057428,0.00015267907,0.0000031428463],"about_ca_topic_score_codex":0.005183488,"about_ca_topic_score_gemma":0.003888303,"teacher_disagreement_score":0.005183488,"about_ca_system_score_codex":0.0007016868,"about_ca_system_score_gemma":0.00083765126,"threshold_uncertainty_score":0.010306656},"labels":[],"label_agreement":null},{"id":"W2031907338","doi":"10.1115/1.4003840","title":"Integrating Least Square Support Vector Regression and Mode Pursuing Sampling Optimization for Crashworthiness Design","year":2011,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Crashworthiness; Metamodeling; Support vector machine; Kriging; Engineering; Multivariate adaptive regression splines; Computer science; Radial basis function; Artificial neural network; Mathematical optimization; Polynomial regression; Machine learning; Regression analysis; Mathematics; Structural engineering; Finite element method","score_opus":0.10116708821314256,"score_gpt":0.3205314552529235,"score_spread":0.2193643670397809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031907338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010015039,0.000088441644,0.98950726,0.000020663445,0.0000051052243,0.0000109390285,0.0000052713417,0.000115555755,0.00023171454],"genre_scores_gemma":[0.5214179,0.00021300185,0.4768737,0.000046020315,0.000028369062,0.00014614587,0.00007825766,0.00010178631,0.0010948561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00043017312,0.000033198907,0.00009278227,0.00028354896,0.000032867123],"domain_scores_gemma":[0.9988518,0.0007136901,0.00011575703,0.0000822155,0.00021339906,0.00002317038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019444572,0.0008232088,0.0007677367,0.0006665699,0.00015672196,0.0003827742,0.000614945,0.000653363,0.00058479706],"category_scores_gemma":[0.0038947468,0.00038073963,0.0006884588,0.00046366884,0.0003138001,0.0005323493,0.000470127,0.000596239,0.00019053173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009853396,0.00006048011,0.0014037145,0.000081621794,0.000064508946,0.000034899404,0.000046254925,0.8666121,0.008911566,0.0039535654,0.00023995561,0.11849285],"study_design_scores_gemma":[0.0000034900027,0.000042721953,0.00011729298,0.000002089606,0.0000039593365,0.000006357359,0.000002181342,0.9982735,0.00093283376,0.0004551659,0.00015694967,0.000003448294],"about_ca_topic_score_codex":0.0019532533,"about_ca_topic_score_gemma":0.0016268534,"teacher_disagreement_score":0.0019532533,"about_ca_system_score_codex":0.00028870057,"about_ca_system_score_gemma":0.0005701407,"threshold_uncertainty_score":0.010283351},"labels":[],"label_agreement":null},{"id":"W2034562492","doi":"10.1080/03052150903325540","title":"Metamodelling and search using space exploration and unimodal region elimination for design optimization","year":2010,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Metamodeling; Maxima and minima; Benchmark (surveying); Mathematical optimization; Computation; Reduction (mathematics); Global optimization; Kriging; Computer science; Latin hypercube sampling; Dimensionality reduction; Design space exploration; Subspace topology; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.04073800279990948,"score_gpt":0.26091610046440744,"score_spread":0.22017809766449797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034562492","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.0038825055,0.0001041262,0.99531966,0.000020589037,0.000003995202,0.000017219478,0.000008535371,0.00014570626,0.00049763673],"genre_scores_gemma":[0.095367745,0.00018956636,0.9029819,0.000038426086,0.000008251352,0.00021598366,0.0000648176,0.00007792344,0.0010553821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992779,0.00039828644,0.000024643326,0.00007046618,0.00019794267,0.000030735377],"domain_scores_gemma":[0.9990583,0.00064966665,0.00007475702,0.000107932705,0.00009435719,0.000014981278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013551823,0.00080882857,0.0009029516,0.0009809653,0.00030702245,0.00048746736,0.0006080983,0.00054080144,0.0016793181],"category_scores_gemma":[0.0023568403,0.0003533288,0.00079583307,0.0007755303,0.00058971834,0.0008066003,0.00080876146,0.0008055001,0.0003505681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583904,0.000049213573,0.0004757793,0.0001428246,0.000053184205,0.00003159422,0.00010129732,0.80858696,0.0088201845,0.023136474,0.0005888811,0.1579378],"study_design_scores_gemma":[0.000014639075,0.00006541435,0.00010248206,0.000011431244,0.000009609196,0.000024272033,0.00001139463,0.9875975,0.003535449,0.006726321,0.0018912836,0.000010135087],"about_ca_topic_score_codex":0.0015671141,"about_ca_topic_score_gemma":0.0019956857,"teacher_disagreement_score":0.0016793181,"about_ca_system_score_codex":0.00041423162,"about_ca_system_score_gemma":0.00096327014,"threshold_uncertainty_score":0.0071669817},"labels":[],"label_agreement":null},{"id":"W2034606896","doi":"10.1115/detc2010-29030","title":"Improving Multi-Response Metamodels With Upper/Lower Bound Information Using Multi-Stage, Non-Stationary Covariance Functions","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Pennsylvania Department of Community and Economic Development","keywords":"Metamodeling; Computer science; Covariance; A priori and a posteriori; Upper and lower bounds; Context (archaeology); Mathematical optimization; Design of experiments; Algorithm; Mathematics; Statistics","score_opus":0.025827108999124757,"score_gpt":0.2876470708421782,"score_spread":0.26181996184305345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034606896","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.0028185025,0.000038232018,0.99668354,0.000028840332,0.0000032636412,0.000015247886,0.000018437157,0.000119776414,0.00027422662],"genre_scores_gemma":[0.34794685,0.0002787674,0.6483318,0.00019587838,0.00002356159,0.00058998883,0.00040535536,0.00032938365,0.0018983572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847907,0.00071846956,0.000085141095,0.00021187284,0.0004201368,0.000085356376],"domain_scores_gemma":[0.996141,0.002441621,0.0005031103,0.00048131603,0.00035857907,0.000074236734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005045208,0.0016943484,0.0017139219,0.0011647508,0.0003792307,0.001215209,0.001501115,0.0019802577,0.0014304667],"category_scores_gemma":[0.007436868,0.00119008,0.0021945836,0.0008291076,0.00089498394,0.0020681522,0.0015530341,0.0019223163,0.0004893524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037365247,0.000056507237,0.00026459227,0.000059057325,0.000031364092,0.000017558845,0.000033799144,0.97217846,0.0038115154,0.008786057,0.00013962513,0.014584065],"study_design_scores_gemma":[0.0000038435683,0.000024489256,0.00005062908,0.0000063189586,0.000004600526,0.0000038755165,0.0000024794697,0.9961367,0.0011241495,0.0024303894,0.00020677823,0.0000056285066],"about_ca_topic_score_codex":0.001707405,"about_ca_topic_score_gemma":0.0018374379,"teacher_disagreement_score":0.005045208,"about_ca_system_score_codex":0.0009790754,"about_ca_system_score_gemma":0.0013771718,"threshold_uncertainty_score":0.0266819},"labels":[],"label_agreement":null},{"id":"W2036348784","doi":"10.1243/09544054jem1482","title":"Robust design of finned-tube evaporators: A scalable product platform approach","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Evaporator; Maximization; Minification; Scalability; Product design; Computer science; Compromise; Product (mathematics); Industrial engineering; Mathematical optimization; Reliability engineering; Engineering; Mathematics; Mechanical engineering","score_opus":0.020883981296362406,"score_gpt":0.208919073836967,"score_spread":0.1880350925406046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036348784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073753037,0.00009164871,0.9908145,0.000024283472,0.000008502664,0.000039786268,0.000012677451,0.00014512644,0.0014882766],"genre_scores_gemma":[0.5529887,0.000415438,0.44247258,0.00004262769,0.000029380935,0.00028678958,0.00010638082,0.00010953049,0.003548475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.00012857093,0.000026445516,0.00012203015,0.00030393628,0.00004876885],"domain_scores_gemma":[0.9995766,0.00017374565,0.00006775344,0.000056955665,0.00010960134,0.000015221289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165873,0.00106094,0.0008802229,0.00040558347,0.00029321568,0.0007834284,0.0014421812,0.0008383304,0.0021543938],"category_scores_gemma":[0.0014791384,0.000656969,0.00082778925,0.0002920885,0.0005345428,0.0009245168,0.0011589587,0.0008198774,0.0004405229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036509366,0.000018877656,0.00011561121,0.00010504078,0.000028186487,0.00007903129,0.000026505078,0.9537405,0.014488621,0.0055608503,0.00012089451,0.025679335],"study_design_scores_gemma":[0.000011457413,0.00011134201,0.00006307807,0.000009485105,0.000010016146,0.000024115525,0.000007689555,0.9917624,0.004830065,0.002305781,0.0008585742,0.0000060358648],"about_ca_topic_score_codex":0.0004859014,"about_ca_topic_score_gemma":0.00057964877,"teacher_disagreement_score":0.0021543938,"about_ca_system_score_codex":0.0004687749,"about_ca_system_score_gemma":0.0007344903,"threshold_uncertainty_score":0.0072070956},"labels":[],"label_agreement":null},{"id":"W2036627938","doi":"10.1007/s00158-014-1086-y","title":"Reallocation of testing resources in validating optimal designs using local domains","year":2014,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Domain (mathematical analysis); Process (computing); Engineering design process; Computer science; Set (abstract data type); Sequential analysis; Mathematical optimization; Design of experiments; Sizing; Mathematics; Engineering; Statistics","score_opus":0.029034778066000903,"score_gpt":0.2877439807964628,"score_spread":0.2587092027304619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036627938","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.16853294,0.0002304663,0.8256895,0.0002737907,0.000038417606,0.000117323005,0.00006703313,0.0007080363,0.004342527],"genre_scores_gemma":[0.8272611,0.00006139794,0.17167966,0.00007826293,0.000007958683,0.00015001332,0.000052853284,0.00011817238,0.0005905155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960407,0.0028392295,0.00012762596,0.00033558265,0.0004893686,0.00016757743],"domain_scores_gemma":[0.96866,0.025088755,0.0012720493,0.0030845143,0.0015472462,0.00034748245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067498186,0.00114283,0.0009910993,0.000956498,0.00057989685,0.0009435285,0.0018198711,0.0014235087,0.0027718775],"category_scores_gemma":[0.03485324,0.0006668669,0.0006010907,0.00051221176,0.0017980379,0.002610972,0.0018060431,0.0012932842,0.00042283948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002585301,0.00011979049,0.0018699886,0.00012565542,0.000027699109,0.00006358616,0.00007723486,0.955691,0.0040461537,0.0061432854,0.00021147836,0.03136569],"study_design_scores_gemma":[0.000027810669,0.00010385029,0.00029400643,0.000030791853,0.000014113195,0.000025890447,0.000043586944,0.98954135,0.005278542,0.0043840203,0.0002487222,0.000007441722],"about_ca_topic_score_codex":0.0020691385,"about_ca_topic_score_gemma":0.0031995317,"teacher_disagreement_score":0.0067498186,"about_ca_system_score_codex":0.00089685124,"about_ca_system_score_gemma":0.0017057031,"threshold_uncertainty_score":0.035696924},"labels":[],"label_agreement":null},{"id":"W2037704679","doi":"10.1109/icsm.2007.4362625","title":"Multi-Objective Genetic Algorithm to Support Class Responsibility Assignment","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Conference on Software Maintenance","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Carleton University","funders":"","keywords":"Class (philosophy); Computer science; Genetic algorithm; Cohesion (chemistry); Influence diagram; Domain (mathematical analysis); Class diagram; Machine learning; Mathematical optimization; Artificial intelligence; Management science; Algorithm; Decision tree; Mathematics; Engineering; Programming language; Unified Modeling Language","score_opus":0.027895364276304038,"score_gpt":0.2929770724549701,"score_spread":0.2650817081786661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037704679","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.017092954,0.00013605802,0.97935873,0.0001692141,0.000036187885,0.00006336295,0.000023175227,0.00060027034,0.0025200266],"genre_scores_gemma":[0.2745995,0.00013315922,0.7221346,0.0001099386,0.000023288954,0.000268717,0.00009357466,0.00010541722,0.0025318426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00018042883,0.000018507777,0.0000545651,0.00011194857,0.00004626201],"domain_scores_gemma":[0.9989305,0.0006697767,0.00008784561,0.000054775974,0.00021548166,0.000041489315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374511,0.0008056823,0.0006717092,0.001063822,0.0005970465,0.00086766924,0.0010596875,0.001249904,0.0020125199],"category_scores_gemma":[0.0032891957,0.00043700665,0.0005392652,0.0007645506,0.0005086678,0.00071529247,0.0006328138,0.0010766212,0.00037393963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002187504,0.000031346262,0.00036832198,0.000023714738,0.0000241552,0.00003582773,0.00004700626,0.9545064,0.0010321346,0.0046603847,0.0006900942,0.038558763],"study_design_scores_gemma":[0.000008833082,0.000008479176,0.000038267754,0.0000036390766,0.000004220726,0.000005725377,0.000003991853,0.9981462,0.00024334708,0.0011666504,0.0003685632,0.0000022419636],"about_ca_topic_score_codex":0.007716598,"about_ca_topic_score_gemma":0.006937965,"teacher_disagreement_score":0.007716598,"about_ca_system_score_codex":0.0011181479,"about_ca_system_score_gemma":0.0016588295,"threshold_uncertainty_score":0.015343368},"labels":[],"label_agreement":null},{"id":"W2038557532","doi":"10.1145/1570256.1570387","title":"Improving NSGA-II with an adaptive mutation operator","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Waterloo","funders":"","keywords":"Operator (biology); Mutation; Adaptive mutation; Value (mathematics); Multi-objective optimization; Pareto principle","score_opus":0.010122225837221147,"score_gpt":0.2459347438610009,"score_spread":0.23581251802377975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038557532","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.07885312,0.00032790352,0.91371995,0.0002434556,0.00014723917,0.00019917868,0.00004054375,0.0006844832,0.0057841823],"genre_scores_gemma":[0.47074473,0.0003619054,0.5228551,0.0002394436,0.000058316622,0.00030922345,0.00013587328,0.00013353876,0.0051619024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.00020904726,0.000040120194,0.00006481524,0.00027127258,0.000047920053],"domain_scores_gemma":[0.9993703,0.000238304,0.000076959186,0.000078770776,0.00020498468,0.00003066739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010183224,0.0009112726,0.0006077897,0.0006367927,0.00033724846,0.0005148167,0.00091893837,0.0007305709,0.0010480992],"category_scores_gemma":[0.0029200367,0.00022816661,0.00056518195,0.0005125253,0.0004293368,0.0005063236,0.00078634184,0.0007710713,0.00029684216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095917,0.0001497623,0.0016295317,0.00008153407,0.00008709687,0.0001968656,0.00014142909,0.8229356,0.015250354,0.008737916,0.0015199869,0.149174],"study_design_scores_gemma":[0.000038052403,0.00007657325,0.0004710692,0.000009746651,0.000027682947,0.000065405315,0.000013746645,0.9918337,0.0030169683,0.0016083517,0.0028257333,0.000012967561],"about_ca_topic_score_codex":0.0043306816,"about_ca_topic_score_gemma":0.0036320158,"teacher_disagreement_score":0.0043306816,"about_ca_system_score_codex":0.00048494848,"about_ca_system_score_gemma":0.00091664464,"threshold_uncertainty_score":0.008610964},"labels":[],"label_agreement":null},{"id":"W2038744423","doi":"10.1145/2483028.2483115","title":"A self-tuning multi-objective optimization framework for geometric programming with gate sizing applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Western Canada Research Grid; Compute Canada","keywords":"Geometric programming; Sizing; Skew; Mathematical optimization; Reduction (mathematics); Computer science; Multi-objective optimization; Pareto principle; Optimization problem; Mathematics","score_opus":0.01527717656386362,"score_gpt":0.26962289663514877,"score_spread":0.25434572007128514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038744423","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.001991439,0.00007862196,0.996369,0.000041036023,0.000011450599,0.000030924788,0.000009917174,0.000089629546,0.0013780667],"genre_scores_gemma":[0.15402237,0.000271309,0.8421595,0.00009442627,0.00004720361,0.00044769247,0.000084962296,0.00018973739,0.0026827885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00022247455,0.000017615414,0.000052249372,0.00019453306,0.000040211027],"domain_scores_gemma":[0.999603,0.00020922272,0.000046372625,0.000028843273,0.00009506329,0.000017565915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015661482,0.0013495274,0.00084690255,0.00079438544,0.00040525862,0.00079912355,0.0012904635,0.00085034897,0.0026408364],"category_scores_gemma":[0.0014351433,0.0005500608,0.0011507346,0.00073450885,0.0006972386,0.00063218176,0.0010085314,0.0014500183,0.00036478945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072182934,0.000020993624,0.0000815346,0.00003657057,0.000016407925,0.00002402624,0.000017376893,0.9699545,0.0011580498,0.012639658,0.0003343454,0.015709193],"study_design_scores_gemma":[0.0000040611235,0.000017592585,0.000019831932,0.0000040784266,0.0000030057433,0.00000742788,0.0000028805591,0.99545974,0.00024870154,0.0036616758,0.0005684258,0.0000026086175],"about_ca_topic_score_codex":0.0016984976,"about_ca_topic_score_gemma":0.0022885783,"teacher_disagreement_score":0.0026408364,"about_ca_system_score_codex":0.0006866133,"about_ca_system_score_gemma":0.0011966606,"threshold_uncertainty_score":0.008834481},"labels":[],"label_agreement":null},{"id":"W2039188123","doi":"10.6112/kscfe.2012.17.4.032","title":"A STUDY ON CONSTRAINED EGO METHOD FOR NOISY CFD DATA","year":2012,"lang":"en","type":"article","venue":"Journal of computational fluids engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Kriging; Mathematical optimization; Global optimization; Interpolation (computer graphics); Computer science; Function (biology); Metamodeling; Mathematics; Algorithm; Artificial intelligence; Machine learning; Image (mathematics)","score_opus":0.048706465481120335,"score_gpt":0.3532155430837276,"score_spread":0.30450907760260726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039188123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007992181,0.00018676379,0.99076825,0.000080106394,0.000028261644,0.000027636652,0.000016644342,0.00015237025,0.00074767094],"genre_scores_gemma":[0.28961432,0.0011035298,0.7044635,0.00014834762,0.00010017543,0.00028119047,0.0002555565,0.00033862906,0.0036947161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981494,0.00075617543,0.000081968756,0.000257792,0.00067626167,0.000078443714],"domain_scores_gemma":[0.9969695,0.0017823133,0.00017062537,0.00025696965,0.00075576216,0.00006483754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024553556,0.000731686,0.0009123029,0.0007794226,0.00052323553,0.0009167495,0.0013374048,0.0012272238,0.001585017],"category_scores_gemma":[0.00894529,0.0005444584,0.0009482287,0.00096615305,0.00073662226,0.0017417232,0.0011150148,0.00093104364,0.0003413811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030431867,0.000110023575,0.0040491167,0.000520399,0.00017440003,0.00050337624,0.00051983877,0.6202086,0.01870219,0.043715764,0.0027056558,0.30848637],"study_design_scores_gemma":[0.000005657745,0.00002203912,0.00023528491,0.000010446516,0.000007496853,0.000052417614,0.000021048918,0.9955374,0.0017968947,0.0011072733,0.0011914668,0.0000125291745],"about_ca_topic_score_codex":0.0066061392,"about_ca_topic_score_gemma":0.0029198176,"teacher_disagreement_score":0.0066061392,"about_ca_system_score_codex":0.00043875168,"about_ca_system_score_gemma":0.0011824972,"threshold_uncertainty_score":0.013135374},"labels":[],"label_agreement":null},{"id":"W2039252507","doi":"10.1145/2463372.2463456","title":"Revisiting the NSGA-II crowding-distance computation","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":77,"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é Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Crowding; Instability; Convergence (economics); Benchmark (surveying); Pareto principle; Computation; Mathematics; Mathematical optimization; Position (finance); Multi-objective optimization; Computer science; Algorithm; Physics; Economics; Biology; Geography","score_opus":0.012532856668329715,"score_gpt":0.2583710644320654,"score_spread":0.24583820776373572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039252507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028124867,0.00028192968,0.96394956,0.00021498457,0.00016004386,0.00012187309,0.000055519427,0.0005448395,0.0065464405],"genre_scores_gemma":[0.44839764,0.00048364227,0.544675,0.0002482918,0.00007246098,0.0002707815,0.00026731752,0.00027210222,0.0053127464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00016919155,0.00004470782,0.000069198686,0.00033794594,0.000052232615],"domain_scores_gemma":[0.99916875,0.0003150508,0.000056278914,0.00008240158,0.00033961816,0.000038067363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009982502,0.0008497738,0.0008127092,0.0008042453,0.000510398,0.0009689396,0.0012693162,0.0006425869,0.0015041055],"category_scores_gemma":[0.0041624755,0.00030390752,0.0006116897,0.0006301945,0.0005603269,0.0006887623,0.0011569655,0.0009551712,0.00052546384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004533488,0.000034647,0.00085506064,0.00008023926,0.000032187923,0.00005108423,0.00008872703,0.8791374,0.0024254748,0.008930114,0.0009985066,0.107321255],"study_design_scores_gemma":[0.000007762668,0.00002873493,0.00018838943,0.000014730506,0.000006555401,0.000015115351,0.000015858632,0.9940852,0.0010699087,0.002037326,0.002522964,0.0000074268255],"about_ca_topic_score_codex":0.010763761,"about_ca_topic_score_gemma":0.008571138,"teacher_disagreement_score":0.010763761,"about_ca_system_score_codex":0.0010530666,"about_ca_system_score_gemma":0.0021723206,"threshold_uncertainty_score":0.02140224},"labels":[],"label_agreement":null},{"id":"W2040684881","doi":"10.1109/cec.2014.6900592","title":"MODEL: Multi-objective differential evolution with leadership enhancement","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Memorial University of Newfoundland; Ontario Tech University","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Acceleration; Differential evolution; Generalization; Computer science; Convergence (economics); Metaheuristic; Process (computing); Differential (mechanical device); Multi-swarm optimization; Mathematics; Engineering","score_opus":0.039289988803120006,"score_gpt":0.2564670842114165,"score_spread":0.2171770954082965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040684881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04688524,0.000884686,0.91413724,0.0007127228,0.00026312098,0.0002299664,0.00031580467,0.0005270187,0.036044244],"genre_scores_gemma":[0.83590657,0.0007291635,0.13302512,0.0002753252,0.00006517761,0.00057200727,0.0003351527,0.00006288349,0.029028598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998431,0.000038456204,0.00000699666,0.000032192558,0.000059500995,0.000019710073],"domain_scores_gemma":[0.9998845,0.000032577474,0.000022737693,0.0000117040145,0.000036534628,0.000011868841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027889194,0.0005368113,0.0006369468,0.00030632748,0.0002720101,0.0008156551,0.0013099387,0.000906014,0.0036249151],"category_scores_gemma":[0.00044488517,0.00017931618,0.00056859246,0.0003738571,0.00030210926,0.0005489136,0.0006360627,0.0006004345,0.0007195385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058395282,0.00007888006,0.00095875486,0.00012522946,0.00005730809,0.00025129644,0.000050079103,0.9254455,0.0067450753,0.02078201,0.0025369513,0.04291056],"study_design_scores_gemma":[0.000015736814,0.000043795408,0.00014231996,0.0000057238985,0.000009030343,0.000048683072,0.0000055411883,0.99497116,0.00068977126,0.0016482581,0.00241378,0.0000062383247],"about_ca_topic_score_codex":0.001907299,"about_ca_topic_score_gemma":0.0016661723,"teacher_disagreement_score":0.0036249151,"about_ca_system_score_codex":0.00044586655,"about_ca_system_score_gemma":0.0004698278,"threshold_uncertainty_score":0.012126565},"labels":[],"label_agreement":null},{"id":"W2041749499","doi":"10.1016/j.compstruc.2006.10.013","title":"Particle swarm approach for structural design optimization","year":2007,"lang":"en","type":"article","venue":"Computers & Structures","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":703,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Multi-swarm optimization; Mathematical optimization; Metaheuristic; Benchmark (surveying); Particle swarm optimization; Meta-optimization; Derivative-free optimization; Computer science; Scope (computer science); Engineering optimization; Continuous optimization; Optimization problem; Imperialist competitive algorithm; Constraint (computer-aided design); Algorithm; Mathematics","score_opus":0.025396158069988194,"score_gpt":0.28298057101651747,"score_spread":0.2575844129465293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041749499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017417871,0.00072188315,0.99408543,0.0001286075,0.0001239592,0.000022782144,0.000020169928,0.00008347089,0.0030720262],"genre_scores_gemma":[0.27245656,0.0030811632,0.70472896,0.00018313543,0.00036034678,0.0006212609,0.00023991225,0.000162589,0.018166108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00010985471,0.0000121849225,0.000025829844,0.00012634942,0.000015487054],"domain_scores_gemma":[0.99956995,0.0002322793,0.000025662703,0.00003570812,0.00011973111,0.00001669891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549035,0.0010098707,0.0013491053,0.0007230114,0.00051205454,0.0008530522,0.0010804927,0.0016909844,0.0026644482],"category_scores_gemma":[0.0016769344,0.0005919904,0.00065371464,0.0010512732,0.0006348584,0.00081175874,0.0007735445,0.0017376082,0.0007232557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002861495,0.00003258286,0.00011234318,0.000102974576,0.000041378833,0.000032627853,0.000039021277,0.92804366,0.00086779176,0.028276654,0.0020387345,0.040383626],"study_design_scores_gemma":[0.000007085627,0.000008734167,0.000025886606,0.000004129303,0.000004005923,0.000003262189,0.0000031175618,0.9930206,0.00007968831,0.005792657,0.001048497,0.0000023492719],"about_ca_topic_score_codex":0.0052356194,"about_ca_topic_score_gemma":0.0030808055,"teacher_disagreement_score":0.0052356194,"about_ca_system_score_codex":0.0004883796,"about_ca_system_score_gemma":0.00071906066,"threshold_uncertainty_score":0.010410249},"labels":[],"label_agreement":null},{"id":"W2042139369","doi":"10.1080/03610926.2010.533230","title":"A Bayesian Meta-Modeling Approach for Gaussian Stochastic Process Models Using a Non Informative Prior","year":2012,"lang":"en","type":"article","venue":"Communication in Statistics- Theory and Methods","topic":"Advanced Multi-Objective Optimization Algorithms","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; Constructive; Bayesian probability; Artificial intelligence; Machine learning; Gaussian process; Gaussian; Process (computing)","score_opus":0.10647305690187177,"score_gpt":0.4337829574225255,"score_spread":0.32730990052065373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042139369","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.0016013526,0.00012633172,0.99782926,0.0000706368,0.000008098514,0.00002322642,0.000023987554,0.00008521887,0.00023173155],"genre_scores_gemma":[0.19497865,0.00052089297,0.8017652,0.00014756086,0.00007176811,0.00055344054,0.00029568232,0.00014794877,0.0015187928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962573,0.002373768,0.00014925469,0.00046777623,0.0005949199,0.00015696179],"domain_scores_gemma":[0.99409014,0.004389572,0.00046082126,0.00035435957,0.000566515,0.00013851705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007956471,0.0017348487,0.0026320182,0.0027462295,0.0010666827,0.0023019186,0.0037467584,0.0023479604,0.0027457231],"category_scores_gemma":[0.010702958,0.001636948,0.0032001643,0.0022020526,0.000915671,0.0028403928,0.0021265543,0.002767022,0.0006086436],"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.000047191978,0.000062675615,0.00058721314,0.00009021502,0.00021003725,0.0000565437,0.00007926205,0.93071586,0.0006617511,0.033909597,0.00043978155,0.033139843],"study_design_scores_gemma":[0.000006480392,0.000011673942,0.000053660307,0.000009802697,0.000023513025,0.000010159583,0.0000054309385,0.9904757,0.00013112312,0.009003928,0.00025959406,0.000008891729],"about_ca_topic_score_codex":0.007700226,"about_ca_topic_score_gemma":0.008720362,"teacher_disagreement_score":0.007956471,"about_ca_system_score_codex":0.0021878902,"about_ca_system_score_gemma":0.002604903,"threshold_uncertainty_score":0.042078376},"labels":[],"label_agreement":null},{"id":"W2043096963","doi":"10.1016/j.jcp.2010.03.005","title":"A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":51,"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":"Burroughs Wellcome Fund","keywords":"Mathematical optimization; Surrogate model; Collocation (remote sensing); Stochastic optimization; Computer science; Kriging; Probabilistic logic; Uncertainty quantification; Optimization problem; Monte Carlo method; Set (abstract data type); Derivative-free optimization; Mathematics; Multi-swarm optimization; Machine learning; Artificial intelligence","score_opus":0.02563932248109915,"score_gpt":0.3296106729543946,"score_spread":0.3039713504732955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043096963","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.0006351998,0.000028951297,0.9986966,0.000025015077,0.00002834339,0.000013647118,0.000010661745,0.00007224229,0.0004892066],"genre_scores_gemma":[0.04572368,0.00010755196,0.9503304,0.00007971079,0.000044201624,0.00023070231,0.0000910919,0.0002436711,0.003149082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993901,0.00020816385,0.000035550027,0.00005906886,0.00028278172,0.000024280404],"domain_scores_gemma":[0.9987632,0.0006268852,0.00007729067,0.00016316124,0.00031464975,0.000054801232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013271575,0.0008183581,0.0012439915,0.0007362075,0.0006047492,0.00084076443,0.0016735849,0.0021169703,0.0038172998],"category_scores_gemma":[0.004300168,0.0008342186,0.000864289,0.0010318446,0.0008240085,0.0012006835,0.0018407404,0.0017735233,0.0013451639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013847505,0.00012614502,0.00037939797,0.00023625797,0.00010504339,0.00012551862,0.000097001044,0.74609005,0.009637472,0.07789927,0.0038418258,0.16132362],"study_design_scores_gemma":[0.000008851749,0.000011681757,0.000023378638,0.0000058891183,0.0000037437549,0.000015365431,0.000002395916,0.99456644,0.00042312563,0.0038858366,0.001046568,0.0000066651487],"about_ca_topic_score_codex":0.0020769837,"about_ca_topic_score_gemma":0.002535783,"teacher_disagreement_score":0.0038172998,"about_ca_system_score_codex":0.00041433962,"about_ca_system_score_gemma":0.00120801,"threshold_uncertainty_score":0.012770116},"labels":[],"label_agreement":null},{"id":"W2045463058","doi":"","title":"Algorithm Runtime Prediction: Methods & Evaluation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Generalization; Range (aeronautics); Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Mathematics","score_opus":0.11003129838507508,"score_gpt":0.26929776936074895,"score_spread":0.15926647097567387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045463058","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.104987174,0.0114694955,0.7972627,0.0022150418,0.0013339984,0.0024272436,0.014166361,0.04798933,0.018148556],"genre_scores_gemma":[0.36348286,0.003250278,0.59899044,0.0007462173,0.0005360548,0.0038177876,0.019126121,0.0051583233,0.0048919744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873806,0.0042438973,0.0009804027,0.0026229843,0.004065187,0.0007069278],"domain_scores_gemma":[0.9524923,0.025799913,0.0027763497,0.011477115,0.0066521247,0.0008022957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011923305,0.003253895,0.002062027,0.0041794786,0.0009144542,0.0034627852,0.004934189,0.0033080978,0.009987228],"category_scores_gemma":[0.07631387,0.00100039,0.0019111662,0.0045568184,0.0011937318,0.0046589915,0.0022473542,0.002972499,0.0053846547],"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.001993227,0.0015477606,0.0212304,0.0017918689,0.0006079965,0.00012588671,0.00017413036,0.4126255,0.002203765,0.009382591,0.06331296,0.48500395],"study_design_scores_gemma":[0.00024311134,0.00027703514,0.0026586626,0.00015903845,0.00011219876,0.00010358111,0.00005343851,0.9778306,0.0034038539,0.0073496676,0.0077450047,0.000063869265],"about_ca_topic_score_codex":0.010577464,"about_ca_topic_score_gemma":0.009047086,"teacher_disagreement_score":0.011923305,"about_ca_system_score_codex":0.0030520135,"about_ca_system_score_gemma":0.0047330926,"threshold_uncertainty_score":0.063057184},"labels":[],"label_agreement":null},{"id":"W2047311030","doi":"10.1115/detc2007-35554","title":"Non-Dominated Sorting Genetic Quantum Algorithm for Multi-Objective Optimization","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"","keywords":"Sorting; Benchmark (surveying); Genetic algorithm; Computer science; Mathematical optimization; Algorithm; Multi-objective optimization; Meta-optimization; Optimization problem; Quantum; Mathematics; Machine learning","score_opus":0.019080527160186773,"score_gpt":0.2972423854904822,"score_spread":0.27816185833029544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047311030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037835436,0.00027209928,0.9927408,0.00012111595,0.00005555551,0.00006361408,0.00001530816,0.0001298822,0.0028180934],"genre_scores_gemma":[0.18736203,0.00048033736,0.8072585,0.00026847018,0.00006560223,0.00045822005,0.00008602166,0.00007084828,0.0039499365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897647,0.00041780528,0.000037723392,0.00007048962,0.0004507557,0.000046744513],"domain_scores_gemma":[0.9992186,0.00045418885,0.000061113446,0.00005637239,0.00017948405,0.00003025191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018017748,0.00074338616,0.0010703906,0.0009416456,0.00080059224,0.0007033602,0.0011863438,0.0012056235,0.0020783986],"category_scores_gemma":[0.002582805,0.00029983866,0.0008081159,0.0011911336,0.00094686635,0.00068233407,0.0007513633,0.0009472692,0.00033755775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006069199,0.00009115944,0.000454894,0.00020482141,0.00009612227,0.00007542227,0.000090451234,0.7787814,0.0036873235,0.069058135,0.0021391695,0.14526042],"study_design_scores_gemma":[0.000022820868,0.00004513196,0.00012007995,0.000011070658,0.000009636478,0.00002763401,0.000006708638,0.98601544,0.00066604,0.010678096,0.0023881514,0.000009119884],"about_ca_topic_score_codex":0.0029605802,"about_ca_topic_score_gemma":0.0029253685,"teacher_disagreement_score":0.0029605802,"about_ca_system_score_codex":0.0012514795,"about_ca_system_score_gemma":0.001981108,"threshold_uncertainty_score":0.009528816},"labels":[],"label_agreement":null},{"id":"W2048711666","doi":"10.1115/1.2429697","title":"Review of Metamodeling Techniques in Support of Engineering Design Optimization","year":2006,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1680,"is_retracted":false,"has_abstract":true,"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":"Metamodeling; Scope (computer science); Computer science; Engineering design process; Process (computing); Computation; Systems engineering; Industrial engineering; Management science; Engineering; Software engineering; Algorithm; Mechanical engineering","score_opus":0.027315505147018405,"score_gpt":0.2721950032825603,"score_spread":0.24487949813554188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048711666","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.0011128313,0.0405187,0.9526916,0.0004220775,0.00015542393,0.00004928406,0.00008558745,0.00048585152,0.0044786236],"genre_scores_gemma":[0.042981822,0.116698995,0.8355552,0.00037205152,0.00043009437,0.00030846434,0.00048300857,0.0002965037,0.0028738687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985607,0.0005440651,0.00017593119,0.00016190718,0.00051747775,0.0000399653],"domain_scores_gemma":[0.99780315,0.0013603588,0.00016360712,0.00031277857,0.00033283135,0.000027314234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002163496,0.0012091134,0.0014349553,0.0018651375,0.00037407188,0.0012025211,0.0017715524,0.0012101618,0.0024805474],"category_scores_gemma":[0.004058179,0.00087021734,0.0016077383,0.0033131863,0.000563243,0.0016706971,0.0007160655,0.0014323374,0.0015673],"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.00006710781,0.000076703785,0.00042865786,0.0048186244,0.0001905193,0.00018353561,0.00014256084,0.19320135,0.00877384,0.10267286,0.0072570806,0.6821872],"study_design_scores_gemma":[0.000065479224,0.00018648065,0.000892726,0.0022796222,0.000262977,0.00086863467,0.000098328026,0.43919027,0.013621717,0.13971326,0.40270332,0.00011722309],"about_ca_topic_score_codex":0.0009851012,"about_ca_topic_score_gemma":0.000821103,"teacher_disagreement_score":0.0024805474,"about_ca_system_score_codex":0.00060619705,"about_ca_system_score_gemma":0.0010743692,"threshold_uncertainty_score":0.011441827},"labels":[],"label_agreement":null},{"id":"W2049743496","doi":"10.1007/s00158-014-1219-3","title":"Efficient adaptive response surface method using intelligent space exploration strategy","year":2015,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Latin hypercube sampling; Computer science; Mathematical optimization; Robustness (evolution); Adaptive sampling; Global optimization; Benchmark (surveying); Algorithm; Mathematics","score_opus":0.0666897497182106,"score_gpt":0.342705415130482,"score_spread":0.2760156654122714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049743496","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.0073429253,0.00010143015,0.98999983,0.000060357117,0.000038774415,0.000022448958,0.000009397308,0.00017922594,0.0022455563],"genre_scores_gemma":[0.36705682,0.00022400607,0.62556976,0.00014182167,0.00006731638,0.00038328386,0.0000931545,0.00022006697,0.0062437556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.00010072673,0.00001090565,0.00003107344,0.00011273417,0.00002000488],"domain_scores_gemma":[0.9996753,0.00016706319,0.000022553595,0.00003218334,0.00009015237,0.000012908455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005320759,0.0006061046,0.0009174769,0.00046102412,0.00029704487,0.000494603,0.0009112917,0.000962313,0.0026151824],"category_scores_gemma":[0.0011940007,0.00030843567,0.0005965431,0.00046732847,0.00039404878,0.0006243632,0.00075259974,0.0007305754,0.0005986651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001784602,0.00010684339,0.00041065522,0.00016263312,0.000090198395,0.00009188912,0.00009532248,0.8012359,0.020972647,0.022576058,0.0022779722,0.1518015],"study_design_scores_gemma":[0.0000068873383,0.000013250446,0.000029466839,0.0000016214693,0.0000031207162,0.000007452153,0.0000029993407,0.99840516,0.0004532054,0.00072738965,0.00034697118,0.0000025373638],"about_ca_topic_score_codex":0.00077563897,"about_ca_topic_score_gemma":0.0006531725,"teacher_disagreement_score":0.0026151824,"about_ca_system_score_codex":0.00019083064,"about_ca_system_score_gemma":0.00046294412,"threshold_uncertainty_score":0.008748651},"labels":[],"label_agreement":null},{"id":"W2051457218","doi":"10.1109/cec.2013.6557570","title":"A scalability study of multi-objective particle swarm optimizers","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Brock University","funders":"","keywords":"Particle swarm optimization; Scalability; Mathematical optimization; Computer science; Multi-swarm optimization; Multi-objective optimization; Swarm behaviour; Optimization problem; Mathematics","score_opus":0.02082616173945717,"score_gpt":0.2775070820002674,"score_spread":0.25668092026081024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051457218","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.5831674,0.008746992,0.37975326,0.0011896936,0.00020388886,0.00035019443,0.0002974313,0.0010882376,0.025202986],"genre_scores_gemma":[0.9448224,0.0011551754,0.05244004,0.00005590486,0.000047274705,0.00009987918,0.00023222715,0.00009128164,0.0010558534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818903,0.00071585923,0.000105121726,0.00018932398,0.00069030485,0.00011036906],"domain_scores_gemma":[0.9944621,0.0036001725,0.00036929545,0.00050729484,0.000917787,0.00014338753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031359566,0.00069476257,0.00063830474,0.0009537462,0.00034595781,0.00081687,0.00063834066,0.0005375737,0.0009052335],"category_scores_gemma":[0.009981355,0.00023848825,0.00055472046,0.00089894,0.00047325055,0.0016998046,0.00067150086,0.0006296548,0.00013041403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036821992,0.00023484218,0.01052406,0.000464386,0.00022862238,0.00047925673,0.00026260375,0.8027469,0.015916772,0.009302004,0.0019814821,0.15749083],"study_design_scores_gemma":[0.000025391391,0.00023654326,0.0035800794,0.000040345516,0.00003253908,0.00015423933,0.00010593458,0.98547924,0.0062023564,0.0023760921,0.0017466142,0.000020624913],"about_ca_topic_score_codex":0.0020322807,"about_ca_topic_score_gemma":0.0009752575,"teacher_disagreement_score":0.0031359566,"about_ca_system_score_codex":0.0005666734,"about_ca_system_score_gemma":0.00051536417,"threshold_uncertainty_score":0.016584694},"labels":[],"label_agreement":null},{"id":"W2051514052","doi":"10.1007/s00158-009-0439-4","title":"Data Mining based mutation function for engineering problems with mixed continuous-discrete design variables","year":2009,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"","keywords":"Mutation; Mathematical optimization; Discrete optimization; Continuous optimization; Convergence (economics); Engineering design process; Computer science; Genetic algorithm; Pareto principle; Frame (networking); Multi-objective optimization; Optimization problem; Data mining; Mathematics; Engineering; Multi-swarm optimization","score_opus":0.022898595106653766,"score_gpt":0.25711352233214346,"score_spread":0.2342149272254897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051514052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041419096,0.00026979885,0.95658636,0.0002637461,0.00006863969,0.00009611658,0.000071293296,0.00029620845,0.0009287698],"genre_scores_gemma":[0.54402983,0.00022740148,0.45273587,0.00020421992,0.000048153473,0.00043493978,0.00025588536,0.00008100771,0.0019827124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.00035295502,0.000074031625,0.00014853201,0.00031131643,0.00005423444],"domain_scores_gemma":[0.9961119,0.0027456696,0.00024162074,0.00018989046,0.00061298563,0.000097951124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033682787,0.00086000084,0.0013146651,0.0012568024,0.00052303507,0.00082484126,0.0016542044,0.0013166148,0.0012917423],"category_scores_gemma":[0.00769446,0.0003231452,0.00094196055,0.0010103543,0.0006484085,0.0010479575,0.0010226659,0.0011025455,0.00021117038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024498443,0.0003487562,0.0034541965,0.00022627058,0.000118670265,0.00015815451,0.000077972654,0.77067494,0.0059554637,0.01669435,0.0012746494,0.2007715],"study_design_scores_gemma":[0.000011384107,0.000030986732,0.000134846,0.0000075965586,0.000010731311,0.000036871457,0.00000569784,0.99620205,0.0010568587,0.0022999744,0.00019999128,0.000002934505],"about_ca_topic_score_codex":0.0011229096,"about_ca_topic_score_gemma":0.0008986241,"teacher_disagreement_score":0.0033682787,"about_ca_system_score_codex":0.0008074697,"about_ca_system_score_gemma":0.00091007864,"threshold_uncertainty_score":0.017813325},"labels":[],"label_agreement":null},{"id":"W2051720317","doi":"10.1115/detc2007-34839","title":"Approximated Unimodal Region Elimination Based Global Optimization Method for Engineering Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"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); Global optimization; Computation; Mathematical optimization; Computer science; Optimization problem; Algorithm; Field (mathematics); Mathematics","score_opus":0.022981830394992908,"score_gpt":0.29921564732940176,"score_spread":0.27623381693440885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051720317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012484464,0.00011109303,0.99792516,0.000015919559,0.0000065448476,0.000010514862,0.000008450766,0.0001615488,0.0005122786],"genre_scores_gemma":[0.116894655,0.00031733984,0.879909,0.000066826644,0.00001890596,0.00027415052,0.000108808934,0.00013257242,0.0022777456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995053,0.00020470095,0.0000136746685,0.00005404662,0.00020194196,0.00002035005],"domain_scores_gemma":[0.99938595,0.00037887626,0.00004835895,0.000066341796,0.000110456094,0.00001002804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026974,0.00077815156,0.0009657784,0.00071359094,0.00025573492,0.00046141402,0.0007414151,0.0005572158,0.0027114102],"category_scores_gemma":[0.0017106746,0.0002994199,0.00062897825,0.0005519702,0.00045658395,0.00062432804,0.00051818864,0.00080084446,0.0006857445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009360087,0.000036445384,0.00030527732,0.00020544986,0.00006047881,0.00004386533,0.0000635059,0.7582562,0.011479726,0.020092783,0.0016666582,0.20769607],"study_design_scores_gemma":[0.000009583722,0.00003470152,0.00007473145,0.000008856692,0.000008670897,0.00002033645,0.0000058890023,0.991039,0.0023406926,0.0038962646,0.0025546616,0.0000066017883],"about_ca_topic_score_codex":0.0012667967,"about_ca_topic_score_gemma":0.0016200822,"teacher_disagreement_score":0.0027114102,"about_ca_system_score_codex":0.00048517666,"about_ca_system_score_gemma":0.00089570903,"threshold_uncertainty_score":0.009070575},"labels":[],"label_agreement":null},{"id":"W2055163119","doi":"10.1016/s0378-3758(02)00464-0","title":"Component-wise dimension reduction","year":2003,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"","keywords":"Mathematics; Sufficient dimension reduction; Component (thermodynamics); Sliced inverse regression; Dimensionality reduction; Dimension (graph theory); Statistics; Reduction (mathematics); Applied mathematics; Combinatorics; Regression analysis; Geometry; Artificial intelligence; Regression","score_opus":0.023628036533946517,"score_gpt":0.307558646949925,"score_spread":0.2839306104159785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055163119","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.005376523,0.0006150817,0.9882658,0.00037599172,0.00034431627,0.00009191105,0.0006371902,0.0012617424,0.0030313404],"genre_scores_gemma":[0.09925703,0.0010601389,0.8816376,0.00030905442,0.00028637337,0.00041971434,0.0030631495,0.00063753175,0.013329472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892384,0.0003070423,0.00007649844,0.00024429968,0.00035519432,0.00009314953],"domain_scores_gemma":[0.99803525,0.0004827676,0.00005781243,0.000727322,0.000648306,0.000048513037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008828431,0.0016402394,0.0014885454,0.0013670946,0.0008104908,0.0015861893,0.0010234232,0.00086602604,0.007362577],"category_scores_gemma":[0.005192419,0.0006547799,0.0017504377,0.0017379177,0.00061489025,0.0014196673,0.001859731,0.0023363938,0.004195525],"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.00027665446,0.00015511739,0.00082035665,0.00021216195,0.00020946852,0.00010445362,0.000090605936,0.09092527,0.009467431,0.060721595,0.04255429,0.79446256],"study_design_scores_gemma":[0.000036604833,0.00009681577,0.0011224631,0.000042796204,0.00014407001,0.00023640227,0.000052363146,0.8797743,0.013202655,0.077284776,0.027949313,0.000057478355],"about_ca_topic_score_codex":0.00249225,"about_ca_topic_score_gemma":0.0037075293,"teacher_disagreement_score":0.007362577,"about_ca_system_score_codex":0.00041245666,"about_ca_system_score_gemma":0.0017957311,"threshold_uncertainty_score":0.024630249},"labels":[],"label_agreement":null},{"id":"W2056931841","doi":"10.1109/ictai.2006.51","title":"Discover Gene Specific Local Co-regulations Using Progressive Genetic Algorithm","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Saint Mary's University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Genetic algorithm; Position (finance); Window (computing); Computer science; Gene; Population; Algorithm; Data mining; Computational biology; Biology; Genetics; Machine learning; Medicine","score_opus":0.06341183955686304,"score_gpt":0.3179801793595039,"score_spread":0.2545683398026409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056931841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16882692,0.00021572172,0.82850546,0.00009225296,0.000010214057,0.00013381723,0.00004963914,0.0006603609,0.0015055438],"genre_scores_gemma":[0.52591527,0.00016218789,0.47186747,0.00009643263,0.000012541583,0.00026400312,0.00021030869,0.000056998226,0.0014148175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00008013546,0.000016093976,0.00011536182,0.00009311198,0.00004130704],"domain_scores_gemma":[0.9993556,0.0003805599,0.00008997583,0.00007289738,0.00007619244,0.000024796364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988982,0.00078526995,0.00094119844,0.0012713011,0.0003371133,0.0005250053,0.001166184,0.0007473963,0.00061288924],"category_scores_gemma":[0.0021144454,0.0003568172,0.00078379834,0.0008999222,0.00062228803,0.0005595392,0.0008485569,0.00048668456,0.00013906749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012971203,0.00014845032,0.0067166192,0.000096510434,0.00015163123,0.00022116755,0.00022462814,0.7909322,0.021057503,0.006008902,0.0005726362,0.17374009],"study_design_scores_gemma":[0.000026383792,0.000067989924,0.0006954788,0.000005563389,0.000031909993,0.00005486707,0.000025016769,0.9921482,0.0026983465,0.0038002122,0.00043916894,0.000006888862],"about_ca_topic_score_codex":0.003331586,"about_ca_topic_score_gemma":0.004090466,"teacher_disagreement_score":0.003331586,"about_ca_system_score_codex":0.0005375643,"about_ca_system_score_gemma":0.0011419811,"threshold_uncertainty_score":0.006624341},"labels":[],"label_agreement":null},{"id":"W2057639762","doi":"10.1007/s00366-014-0358-x","title":"Comparative study on influencing factors in adaptive metamodeling","year":2014,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Kriging; Computer science; Multivariate statistics; Sample size determination; Polynomial; Sample (material); Noise (video); Quality (philosophy); Mathematical optimization; Algorithm; Data mining; Mathematics; Machine learning; Artificial intelligence; Statistics","score_opus":0.019708510550921394,"score_gpt":0.24391569033848232,"score_spread":0.2242071797875609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057639762","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.6877964,0.00072693557,0.29909545,0.00008991786,0.000024027646,0.0001310815,0.000092612965,0.00035725528,0.011686278],"genre_scores_gemma":[0.9687552,0.00017086182,0.030522654,0.0000075492158,0.0000043891428,0.000026061256,0.00008536898,0.000043371867,0.0003846175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974377,0.001225954,0.00013981172,0.00029039866,0.00075283175,0.00015325776],"domain_scores_gemma":[0.9809575,0.0149390735,0.0006975623,0.0012249479,0.0019461013,0.000234839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044636796,0.00058648136,0.0005135569,0.0016970024,0.0006122814,0.0013499884,0.00063438056,0.0004882365,0.0020038567],"category_scores_gemma":[0.021279583,0.00020794496,0.00080696243,0.0019410934,0.00048437488,0.0015037598,0.00062374136,0.0004496301,0.00018904875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010133875,0.0004243549,0.09482473,0.00068190217,0.00035517215,0.0002889759,0.001019614,0.47436163,0.027438713,0.02687172,0.000544751,0.372175],"study_design_scores_gemma":[0.000040084324,0.0004861445,0.032392856,0.00007848646,0.0005168101,0.00019083629,0.0009439935,0.93252033,0.021649005,0.008584787,0.002539025,0.000057639085],"about_ca_topic_score_codex":0.0023072164,"about_ca_topic_score_gemma":0.0024872383,"teacher_disagreement_score":0.0044636796,"about_ca_system_score_codex":0.00071664754,"about_ca_system_score_gemma":0.0008569035,"threshold_uncertainty_score":0.02360642},"labels":[],"label_agreement":null},{"id":"W2059013163","doi":"10.1115/1.4006996","title":"Multiresponse Metamodeling in Simulation-Based Design Applications","year":2012,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Metamodeling; Engineering design process; Computer science; Set (abstract data type); Function (biology); Design of experiments; Sampling (signal processing); Process (computing); Bayesian probability; Machine learning; Artificial intelligence; Engineering; Mathematics; Statistics","score_opus":0.07561615083097034,"score_gpt":0.3316012940338979,"score_spread":0.25598514320292753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059013163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006299006,0.0001862349,0.99167997,0.00009761497,0.000019645833,0.00007197532,0.000052836855,0.00057290803,0.0010198065],"genre_scores_gemma":[0.40187353,0.0006316536,0.59452397,0.00019778397,0.00004347017,0.0007253441,0.00029095451,0.00029782238,0.0014155265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971923,0.0019407002,0.000122759,0.00018788013,0.0004697879,0.00008654754],"domain_scores_gemma":[0.9959074,0.0028655496,0.00035874292,0.0004406251,0.0003522507,0.00007535633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005368605,0.0010758456,0.0010189416,0.0011146575,0.00037261887,0.0011190498,0.0012047167,0.0017449405,0.0021951736],"category_scores_gemma":[0.007592909,0.000907541,0.0016429417,0.00074379,0.00073544035,0.0008891683,0.0010025654,0.001654781,0.00051553664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029250217,0.00003506754,0.0003423956,0.000052774263,0.000027557055,0.000021258102,0.000036565496,0.98218614,0.001277239,0.0066488995,0.00014168155,0.009201239],"study_design_scores_gemma":[0.0000060297616,0.000026233462,0.000062081075,0.000013715085,0.0000050223052,0.000007080587,0.0000053306117,0.9953015,0.0006890018,0.0029704787,0.00090801815,0.0000054570132],"about_ca_topic_score_codex":0.0026166553,"about_ca_topic_score_gemma":0.0024848697,"teacher_disagreement_score":0.005368605,"about_ca_system_score_codex":0.0009801745,"about_ca_system_score_gemma":0.0011510196,"threshold_uncertainty_score":0.028392255},"labels":[],"label_agreement":null},{"id":"W2059486227","doi":"10.1115/1.4028756","title":"Statistical Surrogate Formulations for Simulation-Based Design Optimization","year":2014,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":42,"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; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Benchmark (surveying); Surrogate model; Mathematical optimization; Computer science; Simulation-based optimization; Multidisciplinary design optimization; Algorithm; Mathematics; Multidisciplinary approach","score_opus":0.04705848767742186,"score_gpt":0.312561158192595,"score_spread":0.2655026705151731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059486227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009023495,0.00017009853,0.9971316,0.000076992845,0.000019476644,0.00002068116,0.00002984541,0.000092456634,0.0015564081],"genre_scores_gemma":[0.22865142,0.0015419791,0.76256794,0.00026220456,0.00012820504,0.0009559486,0.00044705495,0.0005407238,0.004904533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981395,0.000998453,0.00010020965,0.00009251479,0.0006134781,0.000055788743],"domain_scores_gemma":[0.99517894,0.0033509012,0.00037061624,0.00033415906,0.000682661,0.000082717976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003926378,0.0012122651,0.0012693476,0.0012195045,0.0003845136,0.0016351466,0.0012621381,0.0015682509,0.0036087222],"category_scores_gemma":[0.008453482,0.0006986787,0.0011932168,0.0013982668,0.0012589679,0.0011474469,0.001381672,0.0019476366,0.0009090781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010658143,0.000013705622,0.00011138847,0.00006369237,0.000017132388,0.00001677556,0.000015782523,0.9609031,0.0004876622,0.031393003,0.00037550007,0.006591611],"study_design_scores_gemma":[0.0000034505708,0.000009467363,0.000017789285,0.000011100933,0.0000024895992,0.000005842555,0.00000282769,0.9893873,0.0001983701,0.009283614,0.0010748645,0.0000028852053],"about_ca_topic_score_codex":0.0009831735,"about_ca_topic_score_gemma":0.00080191623,"teacher_disagreement_score":0.003926378,"about_ca_system_score_codex":0.0008819309,"about_ca_system_score_gemma":0.0014192822,"threshold_uncertainty_score":0.020764947},"labels":[],"label_agreement":null},{"id":"W2060780342","doi":"10.1016/j.jspi.2011.12.030","title":"Projection array based designs for computer experiments","year":2012,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; U.S. Department of Energy","keywords":"Latin hypercube sampling; Projection (relational algebra); Orthogonal array; Orthographic projection; Computer experiment; Hypercube; Mathematics; Sampling (signal processing); Design of experiments; Focus (optics); Class (philosophy); Sample (material); Algorithm; Space (punctuation); Mathematical optimization; Computer science; Monte Carlo method; Artificial intelligence; Geometry; Discrete mathematics; Statistics; Computer vision","score_opus":0.08170966478275682,"score_gpt":0.37518087932356353,"score_spread":0.2934712145408067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060780342","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.00084069034,0.0001244849,0.99667466,0.000089259054,0.000114372975,0.00064543035,0.00016683135,0.0008460296,0.0004982172],"genre_scores_gemma":[0.013653035,0.00011708542,0.97608715,0.00012674414,0.00006733789,0.008542881,0.0002433579,0.00023301698,0.0009294193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.902512,0.085141525,0.0020150375,0.005016418,0.004477705,0.0008373743],"domain_scores_gemma":[0.73045504,0.22960255,0.0065430957,0.026294155,0.006022777,0.0010823779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06296314,0.0032624528,0.005745884,0.002164362,0.0013997956,0.0031082353,0.0040960293,0.0037681316,0.031040993],"category_scores_gemma":[0.21302623,0.0038460842,0.0030522528,0.0030279486,0.0036415395,0.0035927421,0.0033815138,0.0072984165,0.0058826776],"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.008083301,0.0013356213,0.0021193784,0.0026161335,0.0020633517,0.00034713477,0.0007611143,0.13895406,0.0071686055,0.31506115,0.020465123,0.5010251],"study_design_scores_gemma":[0.003854424,0.0031901028,0.0015980136,0.00039294374,0.0005575479,0.00024228795,0.000120056466,0.5208319,0.0072960225,0.43516612,0.026587315,0.00016332678],"about_ca_topic_score_codex":0.00090088695,"about_ca_topic_score_gemma":0.0008969633,"teacher_disagreement_score":0.06296314,"about_ca_system_score_codex":0.001706776,"about_ca_system_score_gemma":0.0049395976,"threshold_uncertainty_score":0.33298492},"labels":[],"label_agreement":null},{"id":"W2060810048","doi":"10.1109/mesa.2012.6275565","title":"Metamodel multi-objective optimization tool for mechatronic system design","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Multi-objective optimization; Metamodeling; Benchmark (surveying); Mathematical optimization; Computer science; Pareto principle; Engineering optimization; Computation; Mechatronics; Black box; Optimization problem; Test functions for optimization; Multi-swarm optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.03645320878998011,"score_gpt":0.2789788759735975,"score_spread":0.2425256671836174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060810048","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.0018524417,0.00011028082,0.9956499,0.000041644016,0.000016183096,0.0000325211,0.000046859866,0.00034164853,0.0019085706],"genre_scores_gemma":[0.14052054,0.00034460422,0.8547542,0.00008181899,0.000017287884,0.00060798734,0.00024099663,0.00019668559,0.0032359592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999744,0.000106952466,0.000010758585,0.000019270463,0.00010652889,0.000012548622],"domain_scores_gemma":[0.9996836,0.00018842387,0.00002980696,0.000036721554,0.000051096977,0.0000103084785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007061882,0.0007934334,0.00058118283,0.0005058407,0.000273361,0.00043943306,0.0005456614,0.00065879663,0.0040050778],"category_scores_gemma":[0.0009934788,0.0002976504,0.0008188202,0.00045066967,0.00022347517,0.00040126886,0.0005896745,0.00112538,0.00069522945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000254343,0.00003239493,0.00024802276,0.00012105015,0.000040655912,0.000037411468,0.000024320576,0.915137,0.006145154,0.014057574,0.0013126376,0.06281835],"study_design_scores_gemma":[0.0000074625564,0.000024532428,0.00007594073,0.000014313077,0.0000066637767,0.00001777519,0.00000457717,0.99086773,0.0014837104,0.0036537703,0.003838548,0.0000049791383],"about_ca_topic_score_codex":0.0009047515,"about_ca_topic_score_gemma":0.0012098345,"teacher_disagreement_score":0.0040050778,"about_ca_system_score_codex":0.0004056805,"about_ca_system_score_gemma":0.0006858393,"threshold_uncertainty_score":0.01339829},"labels":[],"label_agreement":null},{"id":"W2060879653","doi":"10.1093/biomet/asu042","title":"Nearly orthogonal arrays mappable into fully orthogonal arrays","year":2014,"lang":"en","type":"article","venue":"Biometrika","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Orthogonal array; Mathematics; Column (typography); Set (abstract data type); Orthogonal basis; Orthogonal transformation; Orthogonal functions; Algorithm; Orthogonal matrix; Empirical orthogonal functions; Orthogonality; Combinatorics; Topology (electrical circuits); Geometry; Computer science; Mathematical analysis; Statistics; Connection (principal bundle)","score_opus":0.010759778961211157,"score_gpt":0.24406219784249653,"score_spread":0.23330241888128536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060879653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014776177,0.00007114015,0.9811343,0.000058540503,0.000048090136,0.000029768913,0.0000843646,0.00028940616,0.0035081871],"genre_scores_gemma":[0.1991759,0.00037985778,0.7900403,0.00029989902,0.0000874941,0.00037065783,0.00037022875,0.00025776273,0.009017905],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939656,0.00014836472,0.000030021634,0.00014431811,0.00022653188,0.000054227112],"domain_scores_gemma":[0.99914336,0.00030739373,0.0001313111,0.00022305775,0.00014365106,0.000051234147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037810422,0.000561918,0.0004931117,0.00042312616,0.0002734525,0.0006922332,0.0005946692,0.0003808556,0.0035548767],"category_scores_gemma":[0.0019093924,0.00041376986,0.000468558,0.00051780575,0.00058153435,0.0009185935,0.0012577573,0.0010778039,0.0014121225],"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.00023155639,0.000103100494,0.00043017397,0.00022113566,0.000048937934,0.00022729264,0.00021283471,0.101351336,0.3553574,0.24715917,0.0028505174,0.29180664],"study_design_scores_gemma":[0.00007196077,0.00046245666,0.00045971933,0.000042749507,0.000041969946,0.0004733567,0.00009647367,0.49972865,0.23803085,0.2155874,0.044907488,0.00009687205],"about_ca_topic_score_codex":0.00016902562,"about_ca_topic_score_gemma":0.00020741446,"teacher_disagreement_score":0.0035548767,"about_ca_system_score_codex":0.0001780148,"about_ca_system_score_gemma":0.00031675596,"threshold_uncertainty_score":0.011892259},"labels":[],"label_agreement":null},{"id":"W2061685312","doi":"10.7551/978-0-262-31709-2-ch139","title":"A hybrid genetic/immune strategy to tackle the multiobjective quadratic assignment problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Knapsack problem; Mathematical optimization; Benchmark (surveying); Multi-objective optimization; Quadratic assignment problem; Genetic algorithm; Computer science; Optimization problem; Quadratic equation; Mathematics","score_opus":0.00949706403982447,"score_gpt":0.23855539712973522,"score_spread":0.22905833308991075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061685312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037649844,0.00042385128,0.9545805,0.00017823145,0.000087141445,0.00006483254,0.000017462195,0.00021730778,0.0067809704],"genre_scores_gemma":[0.5062481,0.00032473326,0.48666057,0.00033492286,0.00007393051,0.00019487683,0.000070144284,0.00004742227,0.006045279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980706,0.00004914906,0.0000063261905,0.000023709343,0.00009101947,0.00002271259],"domain_scores_gemma":[0.99988663,0.000045974797,0.000017833598,0.000008307356,0.000028463895,0.000012719963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036928005,0.0005239402,0.00042797238,0.0005045677,0.0002752975,0.0004375498,0.00078858476,0.0008649308,0.0011968052],"category_scores_gemma":[0.00043783683,0.00014075848,0.00037083283,0.00041296717,0.00034796726,0.0004078242,0.00054111576,0.00049014017,0.00022209849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007202953,0.00020591325,0.0009523612,0.0001330752,0.00011854636,0.0002790569,0.000110074136,0.7493574,0.027355857,0.025855623,0.002617524,0.19294252],"study_design_scores_gemma":[0.000021898897,0.00012106754,0.00015374472,0.0000073572314,0.000014672866,0.000101980215,0.000011838697,0.99221826,0.0020139562,0.0028644132,0.0024629356,0.00000774701],"about_ca_topic_score_codex":0.00070869515,"about_ca_topic_score_gemma":0.0010781541,"teacher_disagreement_score":0.0011968052,"about_ca_system_score_codex":0.00024217281,"about_ca_system_score_gemma":0.00037014196,"threshold_uncertainty_score":0.0040037036},"labels":[],"label_agreement":null},{"id":"W2061895663","doi":"10.1145/2566669","title":"A comparative evaluation of multi-objective exploration algorithms for high-level design","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Scalability; Algorithm; Set (abstract data type); Heuristic; Evolutionary algorithm; Transformation (genetics); Computer engineering; Machine learning; Artificial intelligence","score_opus":0.15764757757916154,"score_gpt":0.3476167720200399,"score_spread":0.18996919444087834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061895663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520302,0.0062902966,0.71881866,0.00057068607,0.0001646764,0.00037272772,0.00028187982,0.0023587737,0.019112114],"genre_scores_gemma":[0.56611085,0.0010005827,0.43031713,0.000108808745,0.000028404818,0.00031148567,0.00032719062,0.0002702121,0.0015253865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679536,0.0015300643,0.00019585063,0.00025210466,0.0010763508,0.00015036452],"domain_scores_gemma":[0.99067396,0.007163456,0.0003857945,0.0008380589,0.00081645016,0.00012232698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052413223,0.0016305735,0.00095858035,0.0018566967,0.00041720437,0.0011065698,0.0010460991,0.001258124,0.0021763658],"category_scores_gemma":[0.012017701,0.00039025844,0.0009857796,0.0013896128,0.0004961809,0.0014151218,0.00086545263,0.0009554552,0.00036556023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004527189,0.00033752137,0.0015537263,0.0005357601,0.00013990272,0.00002461924,0.00008559638,0.7563212,0.004070528,0.0058170385,0.00074023893,0.22992113],"study_design_scores_gemma":[0.00006454445,0.00056033843,0.00077049143,0.000051335606,0.000029984601,0.000045216584,0.000041795378,0.989435,0.005132971,0.001856193,0.001996178,0.000016039196],"about_ca_topic_score_codex":0.0008857602,"about_ca_topic_score_gemma":0.00130957,"teacher_disagreement_score":0.0052413223,"about_ca_system_score_codex":0.0010694076,"about_ca_system_score_gemma":0.0011674021,"threshold_uncertainty_score":0.02771908},"labels":[],"label_agreement":null},{"id":"W2062850469","doi":"10.1115/detc2014-34624","title":"Multi-Objective Selection of Cutting Conditions in Advanced Machining Processes via an Efficient Global Optimization Approach","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University; National Research Council Canada; McMaster University","funders":"","keywords":"Kriging; Pareto principle; Computer science; Multi-objective optimization; Mathematical optimization; Selection (genetic algorithm); Population; Dimension (graph theory); Process (computing); Optimization problem; Machine learning; Mathematics; Algorithm","score_opus":0.01081894644514615,"score_gpt":0.280354815196197,"score_spread":0.26953586875105084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062850469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03916568,0.0003928069,0.9580257,0.00007711427,0.00001796674,0.00009738085,0.000035446097,0.00023648827,0.0019514906],"genre_scores_gemma":[0.537067,0.00033532732,0.45925155,0.000093399685,0.000028111255,0.00055820134,0.00018913482,0.00012511473,0.002352139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931943,0.00029928715,0.00003004386,0.0001028578,0.0001694259,0.000078986945],"domain_scores_gemma":[0.9989072,0.00075689494,0.00008310091,0.000037000296,0.00017991578,0.000035839694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020876713,0.0017121319,0.0017171002,0.0016610458,0.00042689955,0.0010355489,0.0011757666,0.001592823,0.0012361353],"category_scores_gemma":[0.0021151921,0.00090854807,0.0014466014,0.0010349961,0.00072789955,0.0007173373,0.0009299404,0.0009110647,0.00018203392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016699058,0.000023636094,0.00018310714,0.000032816937,0.00002588392,0.000028482364,0.00002035073,0.98863363,0.0008331486,0.0007270539,0.00007472987,0.00940044],"study_design_scores_gemma":[0.0000063474545,0.00003210164,0.00011291118,0.0000046798373,0.000007893089,0.0000060145053,0.000007032494,0.9988488,0.0002706517,0.0005824347,0.00011782048,0.000003302791],"about_ca_topic_score_codex":0.0036206103,"about_ca_topic_score_gemma":0.0034772472,"teacher_disagreement_score":0.0036206103,"about_ca_system_score_codex":0.00069440407,"about_ca_system_score_gemma":0.0010424828,"threshold_uncertainty_score":0.011040747},"labels":[],"label_agreement":null},{"id":"W2064300800","doi":"10.1016/j.proeng.2011.12.398","title":"A MEM Electric Field Sensor Optimization by Multi-Objective Niched Pareto Genetic Algorithm","year":2011,"lang":"en","type":"article","venue":"Procedia Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Pareto principle; Pareto optimal; Genetic algorithm; Intuition; Algorithm; Microelectromechanical systems; Mathematical optimization; Set (abstract data type); Multi-objective optimization; Computer science; Optimal design; Displacement (psychology); Engineering; Mathematics; Materials science; Nanotechnology; Machine learning","score_opus":0.01063426469680353,"score_gpt":0.21106147676137968,"score_spread":0.20042721206457614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064300800","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.124822915,0.00031705113,0.8662549,0.00022628669,0.00004523607,0.000094256415,0.00005380678,0.0003112101,0.007874318],"genre_scores_gemma":[0.5932392,0.00016601314,0.40158948,0.00014822868,0.00001648365,0.00028041034,0.00008006021,0.000050248156,0.0044298596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998111,0.00006272213,0.0000057137613,0.0000299225,0.00006936566,0.000021141737],"domain_scores_gemma":[0.9997781,0.00010897383,0.000023044833,0.000018121664,0.000060413437,0.000011387629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552622,0.00053530507,0.0005214012,0.0006256698,0.0003348805,0.00042228863,0.0006213386,0.00091771607,0.0010100617],"category_scores_gemma":[0.001006217,0.0002637478,0.0004815102,0.00040064452,0.00045820128,0.0002806061,0.000480021,0.0003245958,0.00015484987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047438483,0.000053895754,0.00054429664,0.000046928755,0.000040989176,0.00006624127,0.000060889448,0.9529344,0.008814432,0.0043130643,0.00049817836,0.032579225],"study_design_scores_gemma":[0.000013967148,0.000042743013,0.00008288748,0.0000048313245,0.0000048112915,0.00001638416,0.0000071713334,0.9970214,0.0017053524,0.00071696,0.00037976386,0.0000037136397],"about_ca_topic_score_codex":0.0015029773,"about_ca_topic_score_gemma":0.001149905,"teacher_disagreement_score":0.0015029773,"about_ca_system_score_codex":0.00048679704,"about_ca_system_score_gemma":0.0005931988,"threshold_uncertainty_score":0.0035319328},"labels":[],"label_agreement":null},{"id":"W2070890570","doi":"10.1007/s11081-007-9032-0","title":"Quality assessment of coarse models and surrogates for space mapping optimization","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Computer science; Convergence (economics); Mathematical optimization; Quality (philosophy); Space (punctuation); Similarity (geometry); Surrogate model; Data mining; Algorithm; Mathematics; Machine learning; Artificial intelligence","score_opus":0.031161423987999773,"score_gpt":0.29837259838241836,"score_spread":0.2672111743944186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070890570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042728342,0.00032004947,0.95439804,0.00013751574,0.00003407219,0.000038004906,0.00009506416,0.00021562647,0.0020331964],"genre_scores_gemma":[0.81233937,0.00040115055,0.18528688,0.00007709828,0.000026771453,0.00010693488,0.00033272064,0.00020846658,0.0012206896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843556,0.00073082105,0.000057433277,0.000095584975,0.00060909195,0.00007148239],"domain_scores_gemma":[0.99487853,0.0030067733,0.00031129748,0.0010034833,0.0006782391,0.00012164188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00491807,0.0007620774,0.0013737084,0.0013786015,0.00042709024,0.0020165606,0.00084711355,0.00154608,0.0014826688],"category_scores_gemma":[0.017404411,0.00054953864,0.0007529093,0.000916061,0.0011120499,0.0018840645,0.0016560261,0.0010723782,0.00019520192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008772124,0.00002252178,0.00062222336,0.00006155184,0.000023548571,0.000026491527,0.000029853018,0.9639892,0.0015008523,0.017631996,0.00026717808,0.015736861],"study_design_scores_gemma":[0.00000584701,0.000026104211,0.0001522013,0.0000091259735,0.000006055359,0.0000147920255,0.000007564025,0.9908351,0.00095177407,0.0077181095,0.0002683871,0.00000493694],"about_ca_topic_score_codex":0.001577908,"about_ca_topic_score_gemma":0.0011032138,"teacher_disagreement_score":0.00491807,"about_ca_system_score_codex":0.00077643286,"about_ca_system_score_gemma":0.0008688237,"threshold_uncertainty_score":0.02600956},"labels":[],"label_agreement":null},{"id":"W2073323853","doi":"10.1007/s00170-012-4059-6","title":"Design of a microchannel system using axiomatic design theory for size-controllable and monodispersed microspheres by enhanced perturbation","year":2012,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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 Saskatchewan","funders":"","keywords":"Axiomatic design; Microchannel; Controllability; Probabilistic design; Optimal design; Systems design; Conceptual design; Computer science; Design of experiments; Design methods; Microsphere; Engineering; Engineering design process; Mathematics; Systems engineering; Nanotechnology; Mechanical engineering; Materials science; Manufacturing engineering; Applied mathematics","score_opus":0.012337246259388637,"score_gpt":0.24859735614275735,"score_spread":0.2362601098833687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073323853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017472992,0.00007103699,0.97988164,0.00008456552,0.000032718912,0.000100622594,0.00002626362,0.00026276908,0.002067413],"genre_scores_gemma":[0.5735387,0.00013489145,0.42273638,0.00008107327,0.000018902441,0.00052369357,0.000041812782,0.00005321866,0.002871341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996294,0.00010026194,0.000019447009,0.00009290098,0.00012481776,0.000033220687],"domain_scores_gemma":[0.9998248,0.00006356344,0.00003380536,0.000016556975,0.00004743755,0.000013750979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049185735,0.000538941,0.00057209574,0.0002008105,0.0004585226,0.0005810504,0.0007244183,0.00060681294,0.0011870927],"category_scores_gemma":[0.0004525736,0.00029425716,0.00043341558,0.00016782914,0.00049912237,0.00043764844,0.0006938715,0.000533818,0.0002497573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024662382,0.0001498798,0.00043071562,0.0003663742,0.00006478741,0.00020483587,0.00019234707,0.48520207,0.38851428,0.070562705,0.0008491138,0.053216238],"study_design_scores_gemma":[0.000059963117,0.000275164,0.0002032577,0.000008533199,0.000020796444,0.00005831806,0.000014741446,0.94645494,0.04568788,0.004158863,0.003030653,0.000026958991],"about_ca_topic_score_codex":0.000791751,"about_ca_topic_score_gemma":0.0009030785,"teacher_disagreement_score":0.0011870927,"about_ca_system_score_codex":0.0005229498,"about_ca_system_score_gemma":0.0010353437,"threshold_uncertainty_score":0.003971219},"labels":[],"label_agreement":null},{"id":"W2074655754","doi":"10.2495/op070201","title":"Aerodynamic optimization of a biplane configuration using differential evolution","year":2007,"lang":"en","type":"article","venue":"WIT transactions on the built environment","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Airfoil; Biplane; Chord (peer-to-peer); Angle of attack; Aerodynamics; Wing; Computer science; Lift-to-drag ratio; Drag; Lift (data mining); Mathematics; Aerospace engineering; Engineering","score_opus":0.014460308286182095,"score_gpt":0.22905377170646515,"score_spread":0.21459346342028307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074655754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13032432,0.00040609587,0.85897905,0.00011431276,0.0000289042,0.000057567016,0.00007272588,0.00020879947,0.009808332],"genre_scores_gemma":[0.68995196,0.000426947,0.30492678,0.0000700185,0.000023589104,0.00014888456,0.00016801499,0.00013347682,0.0041503226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.000061378385,0.000009915487,0.00003488817,0.000105309744,0.000027687363],"domain_scores_gemma":[0.9997868,0.000105305866,0.00003020789,0.000019223215,0.000038815782,0.000019647765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004275063,0.00039759497,0.00062689674,0.00060300203,0.00033698944,0.0006801951,0.00037462614,0.00045579922,0.002296382],"category_scores_gemma":[0.0007649161,0.00028068424,0.00034963753,0.0005120819,0.00042870737,0.0005433876,0.00073993,0.00046871012,0.00032419377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057863737,0.000048405647,0.00088453956,0.00010258623,0.000023412173,0.00010264455,0.00012251646,0.91494966,0.0150664635,0.011575502,0.0006561134,0.05641026],"study_design_scores_gemma":[0.000016628397,0.000085894644,0.0002888885,0.00001309499,0.000005432013,0.00004187217,0.00003124897,0.9925413,0.0020668467,0.0027576175,0.0021394517,0.000011779878],"about_ca_topic_score_codex":0.0006279923,"about_ca_topic_score_gemma":0.0005889337,"teacher_disagreement_score":0.002296382,"about_ca_system_score_codex":0.00038819856,"about_ca_system_score_gemma":0.00032514185,"threshold_uncertainty_score":0.0076822042},"labels":[],"label_agreement":null},{"id":"W2076037038","doi":"10.1109/cec.2013.6557735","title":"A new principal curve algorithm and standard deviation clouds for non-parametric ordered data analysis","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Defence Research and Development Canada; University of Waterloo","funders":"","keywords":"Algorithm; Convergence (economics); Vertex (graph theory); Standard deviation; Parametric statistics; Mathematics; Measure (data warehouse); Path (computing); Polygonal chain; Computer science; Curve fitting; Representation (politics); Parametric equation; Data mining; Combinatorics; Geometry; Graph; Statistics","score_opus":0.024313186612839894,"score_gpt":0.3009605480084589,"score_spread":0.276647361395619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076037038","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.000722923,0.000029658544,0.9986791,0.00004069328,0.00001551224,0.000046605004,0.000043003383,0.00027831946,0.0001442614],"genre_scores_gemma":[0.017201556,0.000062024126,0.98157364,0.000027568354,0.000021836,0.0002269997,0.00027435998,0.0001873597,0.00042461377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99394387,0.0014140496,0.00052524765,0.00083034433,0.003057295,0.00022912161],"domain_scores_gemma":[0.9904011,0.003807563,0.0009971939,0.0014499811,0.0030063395,0.00033792012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060097254,0.0016429769,0.0023421862,0.0055759526,0.0011705,0.0032601182,0.0037664978,0.0022126914,0.002692604],"category_scores_gemma":[0.019517628,0.0011833643,0.0030993726,0.0070829415,0.0017608202,0.0035794845,0.003545592,0.0043765735,0.0013675034],"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.00016274172,0.00014028477,0.0023419291,0.00018152052,0.00020198291,0.00010642482,0.00018882888,0.5303533,0.0047252313,0.045569267,0.0043826117,0.4116459],"study_design_scores_gemma":[0.00001434714,0.00003667446,0.0003035875,0.000013921277,0.000008396641,0.000040513478,0.000016747996,0.9860699,0.0012982865,0.009703239,0.002470312,0.000024065786],"about_ca_topic_score_codex":0.0060880994,"about_ca_topic_score_gemma":0.0040885066,"teacher_disagreement_score":0.0060880994,"about_ca_system_score_codex":0.0024863654,"about_ca_system_score_gemma":0.0041849753,"threshold_uncertainty_score":0.031782866},"labels":[],"label_agreement":null},{"id":"W2076091564","doi":"10.1016/j.compstruct.2012.03.021","title":"Surrogate-based multi-objective optimization of a composite laminate with curvilinear fibers","year":2012,"lang":"en","type":"article","venue":"Composite Structures","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Curvilinear coordinates; Buckling; Stiffness; Isotropy; Structural engineering; Materials science; Fiber; Composite number; Boundary value problem; Perpendicular; Composite material; Mathematics; Engineering; Geometry; Mathematical analysis","score_opus":0.012203477880992039,"score_gpt":0.2585924993968429,"score_spread":0.24638902151585088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076091564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09622936,0.00034805684,0.8949452,0.00025003933,0.00007044818,0.000051834333,0.000086423475,0.00013994536,0.007878669],"genre_scores_gemma":[0.7824693,0.00030890078,0.21055967,0.00007937179,0.00003603608,0.00018381425,0.00017180249,0.00010840574,0.0060828268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967325,0.00015767748,0.000010071537,0.000035712525,0.000093827875,0.000029431143],"domain_scores_gemma":[0.9991461,0.00049783086,0.000108912835,0.000045706118,0.00014565019,0.00005582099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013982994,0.00095992885,0.0009924655,0.00062810717,0.0004880804,0.0012124209,0.00067999226,0.0023233749,0.0015605972],"category_scores_gemma":[0.0020616592,0.0006909384,0.00074649305,0.00079076743,0.00086098723,0.0008463395,0.0008649234,0.00084609026,0.00021830262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027076174,0.000012438961,0.00007587801,0.000016158334,0.000006280237,0.00001977132,0.0000060699535,0.9962314,0.000799478,0.001340635,0.000057141187,0.001407629],"study_design_scores_gemma":[0.000002505672,0.000009180449,0.000022345466,0.0000020222467,0.0000014431355,0.0000036512845,0.0000018187684,0.9994128,0.00019711484,0.00029213398,0.00005345431,0.0000015081398],"about_ca_topic_score_codex":0.0021208439,"about_ca_topic_score_gemma":0.0020286979,"teacher_disagreement_score":0.0023233749,"about_ca_system_score_codex":0.00079574203,"about_ca_system_score_gemma":0.00091973424,"threshold_uncertainty_score":0.0073949695},"labels":[],"label_agreement":null},{"id":"W2078135442","doi":"10.1115/detc2006-99560","title":"Developing Multiple Diverse Potential Designs for Heat Transfer Utilizing Graph Based Evolutionary Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Population; Mathematical optimization; Evolutionary algorithm; Graph; Computer science; Premature convergence; Convergence (economics); Evolutionary computation; Mathematics; Genetic algorithm; Theoretical computer science","score_opus":0.04076738277535654,"score_gpt":0.2695126757341008,"score_spread":0.22874529295874427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078135442","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.018572897,0.0003206117,0.9729021,0.00015195477,0.000037651746,0.00009069308,0.00001595399,0.00013726752,0.007770815],"genre_scores_gemma":[0.41827834,0.0006297595,0.5725912,0.00015378874,0.000033485754,0.0005099367,0.00006901137,0.00016389754,0.0075705857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994741,0.00022812193,0.00001760378,0.00006964967,0.00016804831,0.000042543845],"domain_scores_gemma":[0.9994035,0.0003853089,0.000052198426,0.000045903133,0.00008307514,0.000030145437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248456,0.0011291078,0.00077155867,0.0013248584,0.00068730727,0.0011729739,0.0011852538,0.0013265628,0.003597759],"category_scores_gemma":[0.0023231194,0.0007415023,0.001414331,0.00080180087,0.0009971875,0.0011992388,0.0013806019,0.0009205601,0.0005836811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014460691,0.000029315663,0.0001858002,0.000058673304,0.000024479396,0.000052103016,0.000059528833,0.955537,0.0016183389,0.016934656,0.0002233218,0.025262387],"study_design_scores_gemma":[0.000015127141,0.00006212055,0.000053611402,0.000018890181,0.00001208718,0.000026284937,0.000027935615,0.98714113,0.00058276125,0.010268069,0.001782435,0.000009629867],"about_ca_topic_score_codex":0.0014100644,"about_ca_topic_score_gemma":0.0019380805,"teacher_disagreement_score":0.003597759,"about_ca_system_score_codex":0.00084155466,"about_ca_system_score_gemma":0.0007640193,"threshold_uncertainty_score":0.0120357275},"labels":[],"label_agreement":null},{"id":"W2078153679","doi":"10.1115/gt2010-23011","title":"Optimization of a Gas Turbine Engine Rotor Disc Using Case-Based Reasoning and the GATE Genetic Algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"","keywords":"Initialization; Genetic algorithm; Artificial neural network; Computer science; Rotor (electric); Upgrade; Process (computing); Algorithm; Case-based reasoning; Field (mathematics); Population; Engineering design process; Local search (optimization); Mathematical optimization; Engineering; Artificial intelligence; Mechanical engineering; Machine learning; Mathematics","score_opus":0.007190403796450365,"score_gpt":0.23808501216304406,"score_spread":0.2308946083665937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078153679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28414673,0.00025190777,0.6997833,0.00025936044,0.000039213268,0.0001914226,0.0000850428,0.0005812834,0.014661671],"genre_scores_gemma":[0.77506196,0.00012346677,0.2221091,0.000051377334,0.00000846459,0.00015885501,0.00012014241,0.00003668486,0.0023298224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997168,0.000097927776,0.000013137762,0.00004034769,0.00009560902,0.000036229994],"domain_scores_gemma":[0.9995968,0.0002770201,0.000032578293,0.000024035613,0.000054830023,0.000014819539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006840788,0.00056832016,0.0004854428,0.0007554294,0.00031383958,0.0007428214,0.00086249434,0.0010820074,0.0013817389],"category_scores_gemma":[0.0014905247,0.00036880598,0.000629665,0.0005277937,0.0005297339,0.00037324298,0.0004372471,0.000348581,0.000120740566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027144699,0.0000260781,0.00029575694,0.000018067443,0.0000087508115,0.000050147442,0.000020951746,0.98408926,0.0010119561,0.0016414816,0.00014694536,0.0126635805],"study_design_scores_gemma":[0.0000086817545,0.000016352182,0.000075574884,0.0000021061062,0.0000047562153,0.000008041594,0.000006646928,0.99877197,0.0005425202,0.00035623173,0.00020486901,0.00000220184],"about_ca_topic_score_codex":0.010792282,"about_ca_topic_score_gemma":0.008423753,"teacher_disagreement_score":0.010792282,"about_ca_system_score_codex":0.0012404947,"about_ca_system_score_gemma":0.0009962597,"threshold_uncertainty_score":0.021458924},"labels":[],"label_agreement":null},{"id":"W2079018405","doi":"10.1115/detc2013-12663","title":"Visual HDMR Model Refinement Through Iterative Interaction","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Metamodeling; Computer science; Representation (politics); Radial basis function; Surrogate model; Iterative method; Sampling (signal processing); Basis (linear algebra); Mathematical optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Computer vision; Artificial neural network","score_opus":0.022031703522444972,"score_gpt":0.31110241241991077,"score_spread":0.2890707088974658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079018405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007013951,0.00004682547,0.98697126,0.00009008612,0.000018672767,0.000045724402,0.000058291524,0.0041229823,0.0016323165],"genre_scores_gemma":[0.15891838,0.00016695145,0.83475304,0.00015347774,0.00002275702,0.00026141424,0.00027992163,0.0018270381,0.003616989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989786,0.0003767352,0.000058699137,0.000119880606,0.00039932944,0.000066746135],"domain_scores_gemma":[0.9965323,0.0023399442,0.00015606912,0.00048663933,0.000411105,0.00007384384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025716042,0.0016127334,0.0008841678,0.0008436325,0.0004819579,0.0018638214,0.0018376032,0.0013543783,0.010612934],"category_scores_gemma":[0.0071986793,0.00077906833,0.001191083,0.00043688065,0.0006879793,0.0015668172,0.003606914,0.0017287534,0.0018008514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005939308,0.00023623007,0.001452134,0.0005618201,0.00008887751,0.00044712992,0.002060465,0.61933124,0.06537642,0.024053356,0.009273092,0.27652532],"study_design_scores_gemma":[0.000052792697,0.000100451674,0.00015662635,0.000038246348,0.000014577331,0.00009635179,0.00006882695,0.9730023,0.012398183,0.0056316294,0.008405523,0.000034457305],"about_ca_topic_score_codex":0.0018004127,"about_ca_topic_score_gemma":0.0025152757,"teacher_disagreement_score":0.010612934,"about_ca_system_score_codex":0.00054943154,"about_ca_system_score_gemma":0.0008232182,"threshold_uncertainty_score":0.035503805},"labels":[],"label_agreement":null},{"id":"W2080044387","doi":"10.1080/15502287.2012.682196","title":"Global Optimization Using Mixed Surrogates and Space Elimination in Computationally Intensive Engineering Designs","year":2012,"lang":"en","type":"article","venue":"International Journal for Computational Methods in Engineering Science and Mechanics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Surrogate model; Global optimization; Benchmark (surveying); Kriging; Mathematical optimization; Latin hypercube sampling; Metamodeling; Computer science; Optimization problem; Computation; Field (mathematics); Algorithm; Mathematics; Machine learning","score_opus":0.04075989357208958,"score_gpt":0.3803735774643139,"score_spread":0.3396136838922243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080044387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004356759,0.00012289868,0.99483806,0.000032675314,0.000007707326,0.000018953815,0.0000062466456,0.00008548471,0.00053115864],"genre_scores_gemma":[0.1818269,0.00034336993,0.8156305,0.00006804949,0.000019200392,0.00040756768,0.00007380351,0.00011317051,0.0015174485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986815,0.0008223688,0.00004977809,0.00008009858,0.00032327816,0.00004309689],"domain_scores_gemma":[0.9982179,0.0012867621,0.00014286322,0.00014611507,0.00017599043,0.000030287194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030772972,0.0010164982,0.0011675229,0.0009773239,0.00041607782,0.00075712556,0.00070351845,0.0009815482,0.0013403076],"category_scores_gemma":[0.0041769645,0.0005873333,0.001102909,0.0008366095,0.00077171664,0.0009328573,0.0012715487,0.0009578112,0.00035657082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006978513,0.00003121121,0.0003527913,0.0001025778,0.000040259245,0.000042851287,0.00005682664,0.93251663,0.0034208694,0.01579194,0.00024542282,0.04732889],"study_design_scores_gemma":[0.000009781939,0.000060987342,0.00005812553,0.000011018097,0.0000060259317,0.000015901871,0.0000072547623,0.993561,0.0013602265,0.0040607117,0.0008426043,0.000006324965],"about_ca_topic_score_codex":0.0009409233,"about_ca_topic_score_gemma":0.0011280758,"teacher_disagreement_score":0.0030772972,"about_ca_system_score_codex":0.0003770149,"about_ca_system_score_gemma":0.00094282394,"threshold_uncertainty_score":0.016274512},"labels":[],"label_agreement":null},{"id":"W2080313552","doi":"10.1007/s00158-014-1170-3","title":"Differential geometry tools for multidisciplinary design optimization, part II: application to QSD","year":2014,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada; Cambridge Trust; Cambridge Commonwealth Trust; Cambridge Overseas Trust","keywords":"Multidisciplinary design optimization; Computer science; Convergence (economics); Multidisciplinary approach; Mathematical optimization; Differential (mechanical device); Decomposition; Mathematics; Engineering; Aerospace engineering","score_opus":0.017875525487434304,"score_gpt":0.27519214207137194,"score_spread":0.2573166165839376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080313552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011227569,0.00047187295,0.9934738,0.00015878298,0.000076717806,0.000035912664,0.000075802614,0.0001698621,0.0044143563],"genre_scores_gemma":[0.13251676,0.0023264757,0.8536931,0.00041071785,0.00019945427,0.0006038201,0.00036527077,0.0008000869,0.009084291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994517,0.00021154474,0.00003132659,0.000046327466,0.00023054883,0.00002851097],"domain_scores_gemma":[0.99900573,0.0005845401,0.00006368247,0.0001201494,0.0001906342,0.000035281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668462,0.0009991355,0.0013466303,0.0016181652,0.0005133797,0.001198565,0.0013421279,0.0010208251,0.008492816],"category_scores_gemma":[0.0030026995,0.0006024144,0.0010335619,0.0015429754,0.0010576285,0.0009219206,0.0018058778,0.0017470106,0.0017303547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002783886,0.00006663792,0.00038512988,0.00040225004,0.00004885504,0.00010082966,0.00012128604,0.65085393,0.004154778,0.20029582,0.005082832,0.13845979],"study_design_scores_gemma":[0.000011161825,0.000015540732,0.0000831207,0.000028401993,0.000006744534,0.000029921057,0.000017196939,0.9427358,0.00094186445,0.045383137,0.010738897,0.000008284217],"about_ca_topic_score_codex":0.0016818111,"about_ca_topic_score_gemma":0.0015520176,"teacher_disagreement_score":0.008492816,"about_ca_system_score_codex":0.0009040237,"about_ca_system_score_gemma":0.0009238101,"threshold_uncertainty_score":0.028411329},"labels":[],"label_agreement":null},{"id":"W2080464723","doi":"10.1016/j.eswa.2011.11.093","title":"Design of prestressed concrete flat slab using modern heuristic optimization techniques","year":2011,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Heuristic; Slab; Computer science; Mathematical optimization; Constraint (computer-aided design); Optimization problem; Finite element method; Boundary (topology); Genetic algorithm; Optimal design; Algorithm; Structural engineering; Mathematics; Engineering; Machine learning; Mechanical engineering","score_opus":0.0432689488108323,"score_gpt":0.2715322232163039,"score_spread":0.2282632744054716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080464723","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.08185041,0.00021953385,0.904671,0.00009518257,0.000047825353,0.00014602992,0.00011617133,0.0005461334,0.012307759],"genre_scores_gemma":[0.68476206,0.00031340835,0.30645558,0.00004992688,0.000021950227,0.00036080138,0.00021489356,0.00013493004,0.007686422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982125,0.000033438846,0.000007744464,0.000025487572,0.00007834748,0.000033794797],"domain_scores_gemma":[0.9998518,0.00004664843,0.000029125269,0.000013594694,0.00004222638,0.000016679393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024876223,0.00075686147,0.00080609706,0.000727972,0.00038990128,0.00065021607,0.0008779513,0.0009097266,0.0036762692],"category_scores_gemma":[0.0005406355,0.000585617,0.00064290664,0.0005564163,0.00040081338,0.00037063175,0.0004927224,0.0005776057,0.00051678927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034836186,0.000034879035,0.0001447285,0.00005324543,0.000014271268,0.000048640984,0.000019923802,0.9724966,0.010193614,0.002114984,0.00025434478,0.01458991],"study_design_scores_gemma":[0.00001314658,0.00007104935,0.00015223106,0.000006885324,0.000009562399,0.0000151266295,0.000019182839,0.9962521,0.0021975038,0.000660226,0.0005962845,0.000006608512],"about_ca_topic_score_codex":0.005559687,"about_ca_topic_score_gemma":0.008312763,"teacher_disagreement_score":0.005559687,"about_ca_system_score_codex":0.0004956706,"about_ca_system_score_gemma":0.0016048369,"threshold_uncertainty_score":0.012298346},"labels":[],"label_agreement":null},{"id":"W2080927183","doi":"10.1145/2808234","title":"A Review and Taxonomy of Interactive Optimization Methods in Operations Research","year":2015,"lang":"en","type":"review","venue":"ACM Transactions on Interactive Intelligent Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Optimization problem; Multi-objective optimization; Process (computing); Perspective (graphical); Test functions for optimization; Basis (linear algebra); Engineering optimization; Artificial intelligence; Machine learning; Management science; Multi-swarm optimization; Mathematics; Engineering; Algorithm","score_opus":0.2519919103655676,"score_gpt":0.502770982196378,"score_spread":0.25077907183081033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080927183","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.00035522244,0.9616162,0.029396784,0.0010742589,0.00045060087,0.000061562496,0.000096817974,0.000069376176,0.0068792286],"genre_scores_gemma":[0.0043234397,0.96665657,0.02612228,0.0004756362,0.0008249375,0.00014976594,0.00015719018,0.000039259485,0.0012508879],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689215,0.0009981424,0.00047810853,0.00035533347,0.001129792,0.00014652482],"domain_scores_gemma":[0.9911492,0.0067456937,0.00044337602,0.000295542,0.0012398895,0.000126221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049216626,0.002092694,0.0023636555,0.008567621,0.0007510079,0.0032357143,0.002528599,0.0023844163,0.00649429],"category_scores_gemma":[0.0097757485,0.00096583366,0.0017092875,0.01937051,0.0015765572,0.004287125,0.0015639873,0.0025958586,0.0029371798],"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.00005864785,0.00012338648,0.00059301296,0.026627077,0.0001718956,0.00015460876,0.00038463497,0.00494107,0.00064646493,0.0730494,0.0314,0.86184984],"study_design_scores_gemma":[0.00003304489,0.0001679602,0.0019989826,0.021939145,0.0002869907,0.00093207834,0.00037160915,0.007024681,0.001081397,0.068332545,0.89765733,0.00017425485],"about_ca_topic_score_codex":0.0032327932,"about_ca_topic_score_gemma":0.0032150901,"teacher_disagreement_score":0.008567621,"about_ca_system_score_codex":0.0026725943,"about_ca_system_score_gemma":0.0046684626,"threshold_uncertainty_score":0.026028514},"labels":[],"label_agreement":null},{"id":"W2081686652","doi":"10.4236/wsn.2011.38029","title":"Modeling of Data Reduction in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"Wireless Sensor Network","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Computer science; Wireless sensor network; Asynchronous communication; Wireless network; Reduction (mathematics); Real-time computing; Field (mathematics); Distributed computing; Wireless; Data mining; Computer network; Telecommunications","score_opus":0.05876249012014325,"score_gpt":0.2731683338151399,"score_spread":0.21440584369499663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081686652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013794242,0.00031217025,0.98341227,0.0003873527,0.00004141881,0.00005042638,0.000117188945,0.00018183012,0.0017030837],"genre_scores_gemma":[0.80351436,0.0019887974,0.18602572,0.00027643557,0.00020712876,0.0006620742,0.0005085102,0.000238087,0.006578902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851674,0.00048685743,0.00008375939,0.00026952827,0.00052565837,0.00011741211],"domain_scores_gemma":[0.99815696,0.0011637955,0.00019917391,0.00019784304,0.00023123556,0.00005099773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015228095,0.0009270214,0.0010406075,0.00068997504,0.00053031364,0.0012047419,0.0023647028,0.0012160757,0.0009969021],"category_scores_gemma":[0.0048190393,0.00056353834,0.0010545624,0.0011544224,0.0013297271,0.0023703498,0.0012131284,0.0010535024,0.00029997333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014426984,0.000012968958,0.0002324111,0.0000431242,0.000013714275,0.00004554593,0.000045989254,0.9634327,0.0009526674,0.030997297,0.00031447652,0.0038946527],"study_design_scores_gemma":[0.0000025430768,0.000007596932,0.00005571427,0.000002561058,0.000002939139,0.000014075131,0.000008000349,0.98962444,0.00019091976,0.009654218,0.00043307905,0.0000039234797],"about_ca_topic_score_codex":0.004540037,"about_ca_topic_score_gemma":0.0024861381,"teacher_disagreement_score":0.004540037,"about_ca_system_score_codex":0.001263486,"about_ca_system_score_gemma":0.00088123366,"threshold_uncertainty_score":0.009167254},"labels":[],"label_agreement":null},{"id":"W2082752737","doi":"10.1080/15598608.2011.10412055","title":"Follow-Up Experimental Designs for Computer Models and Physical Processes","year":2011,"lang":"en","type":"article","venue":"Journal of Statistical Theory and Practice","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University; Acadia University","funders":"National Nuclear Security Administration; National Science Foundation","keywords":"Process (computing); Field (mathematics); Computer experiment; Physical system; Computer science; Physical science; Mathematics; Simulation","score_opus":0.08667361235577452,"score_gpt":0.35979388779304217,"score_spread":0.27312027543726763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082752737","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.17885453,0.00044494707,0.8007441,0.0001793808,0.0008065423,0.01340857,0.0009348402,0.0008627614,0.003764418],"genre_scores_gemma":[0.3184954,0.00033387227,0.6007591,0.00032379138,0.0001354739,0.0719263,0.00078099425,0.00031612173,0.0069289785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98738575,0.0065739914,0.00081543025,0.0026070261,0.002213823,0.00040394877],"domain_scores_gemma":[0.9597156,0.02295934,0.0037030687,0.010362945,0.002654159,0.0006050457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013138474,0.0011712209,0.0015291361,0.00073420996,0.0011912107,0.0011335517,0.002584035,0.0019143578,0.015432534],"category_scores_gemma":[0.051457655,0.0009340673,0.0011633935,0.0007586451,0.0015857437,0.0018624264,0.0015723932,0.0032236606,0.0015358807],"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.09695359,0.02891799,0.00997829,0.002723686,0.0009032111,0.00029689353,0.0021352628,0.032159887,0.21009187,0.1395393,0.004750252,0.47154975],"study_design_scores_gemma":[0.028807258,0.14042225,0.040084388,0.00058211706,0.0020792696,0.00036334107,0.00052583404,0.20221691,0.29878762,0.22713779,0.058425,0.0005681974],"about_ca_topic_score_codex":0.00043643653,"about_ca_topic_score_gemma":0.00065153115,"teacher_disagreement_score":0.015432534,"about_ca_system_score_codex":0.0009069441,"about_ca_system_score_gemma":0.0020114598,"threshold_uncertainty_score":0.0694837},"labels":[],"label_agreement":null},{"id":"W2083130261","doi":"10.1115/detc2005-84425","title":"Modeling of Non-Linear Relations Among Different Design Evaluation Measures for Multi-Objective Design Optimization","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Calgary","funders":"","keywords":"Weighting; Relation (database); Measure (data warehouse); Computer science; Calipers; Design of experiments; Multi-objective optimization; Evaluation methods; Design methods; Mathematical optimization; Mathematics; Reliability engineering; Data mining; Engineering; Statistics","score_opus":0.09695934750448543,"score_gpt":0.3319777351398806,"score_spread":0.23501838763539518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083130261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037587138,0.00008880654,0.9956245,0.000025647652,0.000005969195,0.000025692994,0.000006675154,0.00004842605,0.00041559126],"genre_scores_gemma":[0.40664485,0.00045345226,0.58911943,0.00008097263,0.00003696606,0.00075529946,0.000090896654,0.00012349548,0.0026946513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953359,0.0024689173,0.00017194905,0.00048555582,0.0013988302,0.00013892389],"domain_scores_gemma":[0.9929906,0.005255763,0.00081327616,0.00031562228,0.0005726895,0.00005211049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006201927,0.002365254,0.0012711376,0.0014331492,0.0004115773,0.0012080749,0.0016884257,0.0011160366,0.0012394317],"category_scores_gemma":[0.012524841,0.0010289625,0.0014319441,0.0013708005,0.0009625839,0.002330364,0.0010721413,0.0021128352,0.00037294778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023733292,0.00004439819,0.00030937063,0.000104315106,0.000047778703,0.000029833978,0.00005770593,0.9695738,0.001496175,0.008869731,0.0000874683,0.019355662],"study_design_scores_gemma":[0.0000031210175,0.000030401443,0.00010174418,0.000007138905,0.00000739699,0.000008751934,0.0000043607215,0.99627966,0.00042256838,0.0029188767,0.0002094701,0.0000065240433],"about_ca_topic_score_codex":0.001916616,"about_ca_topic_score_gemma":0.0019936848,"teacher_disagreement_score":0.006201927,"about_ca_system_score_codex":0.0012079547,"about_ca_system_score_gemma":0.0011305818,"threshold_uncertainty_score":0.032799304},"labels":[],"label_agreement":null},{"id":"W2084165293","doi":"10.1162/evco.2010.18.1.18105","title":"Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"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; Evolutionary algorithm; Mathematical optimization; Pareto principle; Multi-swarm optimization; Convergence (economics); Imperialist competitive algorithm; Multi-objective optimization; Computer science; Metaheuristic; Mathematics; Algorithm","score_opus":0.01579169677716093,"score_gpt":0.2768926140270181,"score_spread":0.2611009172498572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084165293","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.009955412,0.0012910324,0.98073614,0.00014352782,0.000099745404,0.00005750151,0.000026993475,0.00018656929,0.0075030415],"genre_scores_gemma":[0.3950142,0.0018624128,0.5939463,0.00019701864,0.00013756768,0.00034557868,0.00020922901,0.00012978112,0.008158007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.0002448916,0.000045699726,0.00007481304,0.0003805539,0.000034196877],"domain_scores_gemma":[0.9993967,0.00029284615,0.000059991213,0.000076741206,0.00014818205,0.000025438992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010478896,0.0008467049,0.000661664,0.00096761854,0.00043174985,0.0009154942,0.00089622516,0.0011005208,0.001393619],"category_scores_gemma":[0.0022263655,0.00030680798,0.0009975923,0.000989027,0.0004899783,0.0011705223,0.0008392724,0.00090368785,0.0005443759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010756723,0.00011571855,0.0017525825,0.0003654931,0.00028761872,0.00021339628,0.000082730214,0.5848208,0.012574449,0.068804316,0.0029548204,0.32792047],"study_design_scores_gemma":[0.000021769229,0.00010128658,0.0007393072,0.000023200046,0.000033504453,0.00019086922,0.000016145612,0.97308886,0.0038732367,0.013104664,0.008787201,0.000019872534],"about_ca_topic_score_codex":0.00094604574,"about_ca_topic_score_gemma":0.0010153174,"teacher_disagreement_score":0.001393619,"about_ca_system_score_codex":0.00034204993,"about_ca_system_score_gemma":0.0005726683,"threshold_uncertainty_score":0.005541861},"labels":[],"label_agreement":null},{"id":"W2085781772","doi":"10.1115/detc2009-87121","title":"Hybrid and Adaptive Metamodel Based Global Optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Metamodeling; Computer science; Benchmark (surveying); Global optimization; Computation; Mathematical optimization; Optimization problem; Process (computing); Identification (biology); Metaheuristic; Algorithm; Mathematics","score_opus":0.012211326574668335,"score_gpt":0.24863645431364606,"score_spread":0.23642512773897773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085781772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00783481,0.00007261901,0.9907176,0.000020754664,0.00000660425,0.000012767058,0.000018694443,0.00022457834,0.0010916105],"genre_scores_gemma":[0.49183938,0.00016748862,0.50500005,0.000087603534,0.000015942229,0.00022226632,0.00019321378,0.00014352139,0.0023306133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996872,0.00011837412,0.000013303913,0.00006443627,0.00009436123,0.00002226272],"domain_scores_gemma":[0.99963415,0.0001921318,0.00003718792,0.00007245513,0.000053441327,0.000010738543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008102055,0.0005710821,0.0006516572,0.00058865146,0.00019573256,0.0004822072,0.00093192,0.0005749919,0.001429823],"category_scores_gemma":[0.0011486821,0.00024353569,0.000578159,0.00056946214,0.0004243758,0.0008126457,0.0008560944,0.0004675116,0.0002590041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043846296,0.00003142741,0.00060439797,0.000054549953,0.000048031754,0.00002699337,0.00003818565,0.9060488,0.006618532,0.011819339,0.00046595975,0.07419994],"study_design_scores_gemma":[0.0000064834157,0.000024934405,0.00013601298,0.0000043075656,0.00000595471,0.000011511988,0.0000056037306,0.99396753,0.0012754994,0.003740976,0.00081622304,0.000004992505],"about_ca_topic_score_codex":0.0008335487,"about_ca_topic_score_gemma":0.0012450514,"teacher_disagreement_score":0.001429823,"about_ca_system_score_codex":0.0003173853,"about_ca_system_score_gemma":0.0003854783,"threshold_uncertainty_score":0.0047832727},"labels":[],"label_agreement":null},{"id":"W2085800607","doi":"10.1115/gt2008-51181","title":"Automated Preliminary Structural Rotor Design Using Genetic Algorithms and Neural Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Algorithm; Artificial neural network; Genetic algorithm; Computer science; Engineering design process; Aerodynamics; Sensitivity (control systems); Rotor (electric); Process (computing); Population; Optimal design; Set (abstract data type); Mathematical optimization; Control engineering; Engineering; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03128943442036555,"score_gpt":0.2735420989682373,"score_spread":0.24225266454787173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085800607","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.02159141,0.00011628191,0.9746279,0.00006819797,0.000011206234,0.00008985304,0.000022746763,0.0009950697,0.0024772505],"genre_scores_gemma":[0.28380305,0.00019530441,0.71315616,0.00006682087,0.000016524787,0.00034563366,0.0001286172,0.00013511309,0.0021527533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940956,0.00021036176,0.000027842862,0.00009584151,0.00019479344,0.00006155268],"domain_scores_gemma":[0.99907887,0.00058274384,0.00009929274,0.00008211585,0.00013569664,0.000021302287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442536,0.0011306782,0.00087368686,0.0010502357,0.00045267082,0.0008252273,0.0010860846,0.00094688934,0.0020847784],"category_scores_gemma":[0.0024115867,0.00071396003,0.000849514,0.0006197051,0.0007593734,0.0006897693,0.00069158373,0.0008670937,0.00043947517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002360557,0.00002155348,0.00019192994,0.00003241574,0.000013317306,0.00002515912,0.000030080699,0.95249563,0.0021573224,0.0018986112,0.00017006321,0.04294028],"study_design_scores_gemma":[0.0000077270815,0.000028517079,0.000068606554,0.0000067549445,0.0000046052505,0.000007943383,0.000007655026,0.99630994,0.00096341124,0.0020187707,0.0005714332,0.0000046131277],"about_ca_topic_score_codex":0.007197273,"about_ca_topic_score_gemma":0.009432155,"teacher_disagreement_score":0.007197273,"about_ca_system_score_codex":0.0009592121,"about_ca_system_score_gemma":0.0013674072,"threshold_uncertainty_score":0.014310718},"labels":[],"label_agreement":null},{"id":"W2086136405","doi":"10.1115/detc2014-34778","title":"Problem Formulations for Simulation-Based Design Optimization Using Statistical Surrogates and Direct Search","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Surrogate model; Simulation-based optimization; Derivative-free optimization; Multidisciplinary design optimization; Optimization problem; Algorithm; Multi-swarm optimization; Mathematics; Multidisciplinary approach","score_opus":0.04865802477201221,"score_gpt":0.3277754521897883,"score_spread":0.2791174274177761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086136405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006224822,0.00010530859,0.99778664,0.00009168016,0.00001295259,0.00002641076,0.00002081346,0.000045545527,0.0012881352],"genre_scores_gemma":[0.12721528,0.00090055115,0.8655968,0.00021505765,0.00008488973,0.001173562,0.00029307004,0.00027326148,0.004247574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.0007331927,0.000070670976,0.000092439244,0.00039175205,0.000034082925],"domain_scores_gemma":[0.99676967,0.0023744374,0.00021302309,0.00018205163,0.0004054516,0.00005541396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00361702,0.0011843431,0.001270939,0.00101714,0.0004390803,0.001489504,0.0012154666,0.0017733544,0.0036683904],"category_scores_gemma":[0.006383619,0.00069808564,0.0013847564,0.0010797051,0.001222603,0.0009219869,0.0015811372,0.0019138559,0.00089217775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122351485,0.000018080307,0.00012895296,0.000108903216,0.000018094488,0.000025773677,0.00002668666,0.95228815,0.0004921787,0.035530962,0.00051638385,0.010833597],"study_design_scores_gemma":[0.000005311656,0.000009967032,0.000022286538,0.0000140278735,0.00000308625,0.000010578378,0.000004364755,0.9888787,0.0001924237,0.009787206,0.0010686368,0.000003313843],"about_ca_topic_score_codex":0.0015346747,"about_ca_topic_score_gemma":0.0013921798,"teacher_disagreement_score":0.0036683904,"about_ca_system_score_codex":0.0008446826,"about_ca_system_score_gemma":0.0016437303,"threshold_uncertainty_score":0.019128859},"labels":[],"label_agreement":null},{"id":"W2086314248","doi":"10.1007/s10732-007-9042-2","title":"Pareto memetic algorithm for multiple objective optimization with an industrial application","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Multi-Objective Optimization Algorithms","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é Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Memetic algorithm; Mathematical optimization; Heuristics; Knapsack problem; Computer science; Pareto principle; Local search (optimization); Combinatorial optimization; Scheduling (production processes); Job shop scheduling; Continuous knapsack problem; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.020248092557960003,"score_gpt":0.28023996852129207,"score_spread":0.25999187596333206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086314248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015466062,0.0013181265,0.9658702,0.0003070401,0.00021235598,0.000044933022,0.000024071911,0.00027636206,0.016480863],"genre_scores_gemma":[0.36337435,0.00127285,0.6175095,0.0001423448,0.00011420427,0.00023138666,0.000045385492,0.0000914915,0.017218418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973685,0.000107588625,0.000009398856,0.000021802764,0.00010557471,0.00001871542],"domain_scores_gemma":[0.99971014,0.00016657503,0.000018583309,0.000021275231,0.000075116775,0.000008345002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232454,0.0007306308,0.00055238703,0.0008777651,0.0008333336,0.0007330606,0.0007321063,0.0011829119,0.0025163204],"category_scores_gemma":[0.0012315847,0.00029895638,0.0005838082,0.0012301994,0.0004771731,0.0005100503,0.00048752612,0.00088283845,0.00036207004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008720441,0.00013072843,0.00028339372,0.00015869256,0.00007003404,0.00017101874,0.00006027169,0.7266835,0.0045206794,0.050156508,0.004357311,0.21332072],"study_design_scores_gemma":[0.000014053847,0.000052326643,0.00009147791,0.000008687032,0.000015526814,0.000045750843,0.000011561636,0.98736304,0.0015631664,0.007800325,0.0030271707,0.000006805173],"about_ca_topic_score_codex":0.001087895,"about_ca_topic_score_gemma":0.0012975285,"teacher_disagreement_score":0.0025163204,"about_ca_system_score_codex":0.000397411,"about_ca_system_score_gemma":0.0006074732,"threshold_uncertainty_score":0.008417964},"labels":[],"label_agreement":null},{"id":"W2086609533","doi":"10.1007/bf03040964","title":"Procedural texture evolution using multi-objective optimization","year":2004,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":22,"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; Universities Space Research Association","keywords":"Computer science; Pareto principle; Multi-objective optimization; Ranking (information retrieval); Artificial intelligence; Genetic programming; Feature (linguistics); Evolutionary algorithm; Pattern recognition (psychology); Population; Abstraction; Feature vector; Data mining; Machine learning; Mathematical optimization; Mathematics","score_opus":0.032522054657071545,"score_gpt":0.2886651881681984,"score_spread":0.2561431335111269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086609533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014328719,0.00008822576,0.98160684,0.00008293427,0.00006081128,0.00004127769,0.0000202697,0.00035522817,0.0034157352],"genre_scores_gemma":[0.3356488,0.0001767226,0.6586805,0.00012503086,0.000041410338,0.00015417562,0.00008413177,0.00055995176,0.004529236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998005,0.00003854673,0.0000076215274,0.000030253017,0.00010329391,0.000019800626],"domain_scores_gemma":[0.99959105,0.00019781277,0.000039281265,0.00006747682,0.000071912735,0.000032463788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005236247,0.0005654853,0.00073641626,0.0008765382,0.00042046877,0.0012028838,0.001213036,0.0010179174,0.0032110813],"category_scores_gemma":[0.0014219079,0.0005530643,0.00078353507,0.0007258567,0.0007366728,0.00084500783,0.0012630348,0.0011447578,0.00034948922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089098256,0.000060000337,0.00042639812,0.000072878865,0.000071693576,0.00008506647,0.00012400754,0.8707815,0.018729052,0.02200512,0.001382589,0.08617269],"study_design_scores_gemma":[0.000007653089,0.000008922417,0.000040848696,0.0000026131286,0.0000047406493,0.000013922159,0.000005152231,0.99611855,0.0011875316,0.0019528838,0.00065294217,0.000004296615],"about_ca_topic_score_codex":0.002043633,"about_ca_topic_score_gemma":0.0026388753,"teacher_disagreement_score":0.0032110813,"about_ca_system_score_codex":0.00066770887,"about_ca_system_score_gemma":0.00045427066,"threshold_uncertainty_score":0.010742128},"labels":[],"label_agreement":null},{"id":"W2087794678","doi":"10.1115/detc2009-86973","title":"On the Application of Multi-Objective Parallel Asynchronous Particle Swarm Optimization to Engineering Design Problems","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ontario Tech University","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Computer science; Asynchronous communication; Multi-swarm optimization; Metaheuristic; Task (project management); Mathematical optimization; Multi-objective optimization; Parallel computing; Algorithm; Mathematics; Engineering","score_opus":0.018599729608089415,"score_gpt":0.2504233093471802,"score_spread":0.2318235797390908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087794678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044577535,0.00042544157,0.9496165,0.00014587225,0.00004529223,0.00005416347,0.000012647057,0.00019915398,0.0049233437],"genre_scores_gemma":[0.64220387,0.00086813,0.3545407,0.000058044396,0.00006336072,0.00013952465,0.000037564445,0.00007116321,0.0020176691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999744,0.000111827154,0.000009599897,0.00003129734,0.00008809794,0.000015096494],"domain_scores_gemma":[0.99911004,0.0006647698,0.000045082394,0.00008064622,0.00008169659,0.000017628407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071135064,0.0006146503,0.00060385437,0.0002497918,0.00035723156,0.00049269374,0.00057246606,0.00052404683,0.00087873125],"category_scores_gemma":[0.0020842636,0.0002110949,0.00033789387,0.0004360084,0.00046077475,0.00039229635,0.00052519847,0.0006066788,0.00015213787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036923553,0.00003205405,0.00030093463,0.00006426116,0.0000213186,0.000061801235,0.000019450703,0.9548479,0.0034976492,0.004446031,0.00015183752,0.036519896],"study_design_scores_gemma":[0.000007936013,0.0000350859,0.00007812311,0.0000025859088,0.0000039156103,0.000014130565,0.0000036553652,0.9961957,0.00096216955,0.002279638,0.000415108,0.0000020902978],"about_ca_topic_score_codex":0.0014884269,"about_ca_topic_score_gemma":0.001575344,"teacher_disagreement_score":0.0014884269,"about_ca_system_score_codex":0.00026735227,"about_ca_system_score_gemma":0.00038996988,"threshold_uncertainty_score":0.0037620068},"labels":[],"label_agreement":null},{"id":"W2087951682","doi":"10.1109/wi-iat.2014.112","title":"Two-Phase Pareto Set Discovery for Team Formation in Social Networks","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Pareto principle; Computer science; Cover (algebra); Set (abstract data type); Population; Graph; Multi-objective optimization; Mathematical optimization; Operations research; Machine learning; Theoretical computer science; Mathematics; Engineering","score_opus":0.052602732303005405,"score_gpt":0.32979404857229716,"score_spread":0.2771913162692918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087951682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012875678,0.0002981132,0.98414814,0.0002614392,0.00003418714,0.00027927823,0.00010206921,0.00015292373,0.0018482415],"genre_scores_gemma":[0.27754757,0.0005051356,0.7152146,0.00025243597,0.00008745392,0.0012744472,0.00070412783,0.000118038755,0.0042960593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961902,0.0019863509,0.00015800777,0.00055065047,0.0007850608,0.0003296429],"domain_scores_gemma":[0.9906323,0.0072215297,0.00063007785,0.0004075686,0.0007105862,0.00039802588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007685571,0.0022704697,0.002820512,0.004525555,0.0025259627,0.002145785,0.0035742025,0.0032184066,0.0036297194],"category_scores_gemma":[0.01287978,0.0013352775,0.0028713413,0.0030611998,0.0018722597,0.003242781,0.0035836266,0.0019279656,0.0007560959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014987806,0.00023815133,0.0014710727,0.00026353283,0.00017531999,0.00013290471,0.00031501023,0.8953335,0.0008075487,0.027079467,0.002122291,0.07191124],"study_design_scores_gemma":[0.00003696231,0.00005650168,0.00013936106,0.000025941728,0.000016401424,0.000027801276,0.00008193473,0.978217,0.00038611414,0.020052211,0.00094787206,0.000011797066],"about_ca_topic_score_codex":0.0044013015,"about_ca_topic_score_gemma":0.004623352,"teacher_disagreement_score":0.007685571,"about_ca_system_score_codex":0.0028854473,"about_ca_system_score_gemma":0.0030346094,"threshold_uncertainty_score":0.04064566},"labels":[],"label_agreement":null},{"id":"W2088744342","doi":"10.1007/s00158-006-0061-7","title":"An adaptive approach to constraint aggregation using adjoint sensitivity analysis","year":2006,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Sensitivity (control systems); Mathematical optimization; Key (lock); Minification; Computer science; Function (biology); Mathematics; Engineering","score_opus":0.01564829907526832,"score_gpt":0.27056599761366396,"score_spread":0.25491769853839563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088744342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002273222,0.000030127647,0.996363,0.000039631588,0.000021525038,0.00001524541,0.00000903116,0.00009920014,0.0011489937],"genre_scores_gemma":[0.27043387,0.00010913005,0.72631854,0.00015843539,0.000086470034,0.00018454297,0.000066143584,0.00019185369,0.0024510827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00038678412,0.00004329478,0.0001251854,0.00032291576,0.00005282013],"domain_scores_gemma":[0.9980921,0.001215158,0.00010284861,0.00023285009,0.00031384095,0.000043220083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018329185,0.00092337636,0.0011272631,0.001126178,0.0006656271,0.0011343516,0.0015873186,0.0012945615,0.0035327761],"category_scores_gemma":[0.0059994315,0.00085726165,0.0010293679,0.0012259206,0.0009784353,0.001752265,0.001929559,0.0018597957,0.0003271555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034099452,0.00007018767,0.00019369165,0.000044877546,0.00006113009,0.000061597675,0.000055737775,0.91020733,0.0028744496,0.03103411,0.0008908201,0.05447195],"study_design_scores_gemma":[0.0000021920553,0.0000046429764,0.000017416285,0.000001935235,0.000003741746,0.0000041861435,0.0000021011624,0.99512273,0.00024989812,0.0044161794,0.00017186339,0.0000030701663],"about_ca_topic_score_codex":0.002798419,"about_ca_topic_score_gemma":0.0034148553,"teacher_disagreement_score":0.0035327761,"about_ca_system_score_codex":0.0005466442,"about_ca_system_score_gemma":0.00076848845,"threshold_uncertainty_score":0.01181829},"labels":[],"label_agreement":null},{"id":"W2089960166","doi":"10.1007/s10999-011-9154-6","title":"Combinatorial optimization of weld sequence by using a surrogate model to mitigate a weld distortion","year":2011,"lang":"en","type":"article","venue":"International Journal of Mechanics and Materials in Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Carleton University","funders":"","keywords":"Surrogate model; Sequence (biology); Solid mechanics; Welding; Distortion (music); Set (abstract data type); Mathematical optimization; Algorithm; Girth (graph theory); Mathematics; Computer science; Engineering; Materials science; Mechanical engineering","score_opus":0.06197597549678736,"score_gpt":0.29234038666268847,"score_spread":0.23036441116590112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089960166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011806167,0.00007846247,0.98585075,0.00007778471,0.000023602357,0.000018369234,0.000022456134,0.00007750858,0.0020449685],"genre_scores_gemma":[0.6457086,0.0003491646,0.3479105,0.0000809947,0.000038405888,0.00016832179,0.00019758716,0.00020004234,0.0053463154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996443,0.00015546309,0.000013643846,0.000047017274,0.000112951544,0.000026639627],"domain_scores_gemma":[0.9992592,0.0004003691,0.000094770294,0.0000777315,0.00012773064,0.00004024378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872946,0.0009446182,0.0009679912,0.0006052482,0.00028813025,0.00093017204,0.0007777357,0.0013604505,0.0017853072],"category_scores_gemma":[0.002991264,0.0006560023,0.00083279214,0.00070583425,0.000573148,0.001182856,0.00077216467,0.0010474588,0.0002953677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021879463,0.00001316605,0.000046826666,0.000016815931,0.000005697489,0.000017994793,0.000007874016,0.9907064,0.0011745996,0.0043767965,0.000121095254,0.0034909227],"study_design_scores_gemma":[0.0000019916351,0.00001005215,0.000012637112,0.0000014851095,0.0000014334379,0.000005830163,0.0000013363709,0.99870193,0.00022377251,0.000951361,0.000086865744,0.0000014273947],"about_ca_topic_score_codex":0.0010506675,"about_ca_topic_score_gemma":0.0010918175,"teacher_disagreement_score":0.0017853072,"about_ca_system_score_codex":0.00058422436,"about_ca_system_score_gemma":0.00091439235,"threshold_uncertainty_score":0.006279111},"labels":[],"label_agreement":null},{"id":"W2090142805","doi":"10.1007/s11222-012-9357-1","title":"Estimating mixed-effects differential equation models","year":2012,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"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 Ottawa; Ottawa Hospital; McGill University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Ordinary differential equation; Applied mathematics; Mathematics; Smoothing; Smoothing spline; Mathematical optimization; Spline (mechanical); Differential equation; Statistics; Spline interpolation; Mathematical analysis; Bilinear interpolation","score_opus":0.02088113994297148,"score_gpt":0.27275855103406865,"score_spread":0.2518774110910972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090142805","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.012158958,0.00028172767,0.9866192,0.0001688699,0.000043844335,0.00007178765,0.000116486844,0.00023278325,0.00030643842],"genre_scores_gemma":[0.19559309,0.0005420509,0.8000188,0.00020269245,0.00008985163,0.0005702585,0.00074515305,0.00017407215,0.0020640634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927573,0.005106038,0.00034630872,0.0010341925,0.00057621626,0.00017991138],"domain_scores_gemma":[0.94357765,0.05303389,0.001107884,0.0010955741,0.0009275796,0.00025757635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010020451,0.0019210633,0.0029994524,0.0019250382,0.00069668965,0.002673057,0.0034709477,0.0032027026,0.0025677287],"category_scores_gemma":[0.0546237,0.0029181922,0.0035062297,0.0019167191,0.0013986183,0.0023260699,0.0030303085,0.002871497,0.0007244677],"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.00036074832,0.00034706623,0.008629788,0.0006210867,0.0016331681,0.00034401036,0.00026780556,0.8076551,0.0018658462,0.06311633,0.0014289127,0.1137301],"study_design_scores_gemma":[0.00006083693,0.000044876477,0.00049240567,0.00002698137,0.00014080982,0.00003949179,0.000022127759,0.9727465,0.0005456792,0.025210658,0.00064329436,0.000026379357],"about_ca_topic_score_codex":0.009067428,"about_ca_topic_score_gemma":0.012076907,"teacher_disagreement_score":0.010020451,"about_ca_system_score_codex":0.0013879515,"about_ca_system_score_gemma":0.002491123,"threshold_uncertainty_score":0.052993834},"labels":[],"label_agreement":null},{"id":"W2092838665","doi":"10.1109/mwsym.2006.249380","title":"Space-Mapping-Based Modeling Utilizing Parameter Extraction with Variable Weight Coefficients and a Data Base","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"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":"Weighting; Robustness (evolution); Space mapping; Base (topology); Surrogate model; Computer science; Algorithm; Set (abstract data type); Data mining; Mathematical optimization; Mathematics","score_opus":0.03384643139179515,"score_gpt":0.27462707551552623,"score_spread":0.24078064412373107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092838665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010825233,0.000022618671,0.99848264,0.000016668138,0.0000052327664,0.0000068743607,0.000011080725,0.00008923211,0.00028324148],"genre_scores_gemma":[0.15115803,0.00027488128,0.8463345,0.0000523627,0.000033696077,0.00025236342,0.00025687664,0.00014463045,0.001492652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00025047673,0.000049399277,0.000094148316,0.0003064366,0.00003141566],"domain_scores_gemma":[0.998852,0.00051995803,0.00011788402,0.00026670314,0.0002122313,0.0000312372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015055534,0.0010003743,0.0010734337,0.00092609844,0.00032523734,0.0013536422,0.0014959238,0.0010391141,0.0017142736],"category_scores_gemma":[0.003993788,0.0005912278,0.0011129747,0.0013751646,0.0006189012,0.0022765107,0.0016964823,0.0014070664,0.0007015129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052760744,0.000034839548,0.00043768718,0.00008590498,0.000041167383,0.00006157877,0.000052464613,0.88347024,0.008013326,0.030858686,0.0005885368,0.07630285],"study_design_scores_gemma":[0.0000026153962,0.000014298445,0.000028636721,0.0000053868725,0.0000040089453,0.00001833967,0.000003083777,0.9931519,0.001466372,0.0043280963,0.0009711341,0.0000061362684],"about_ca_topic_score_codex":0.0012498457,"about_ca_topic_score_gemma":0.0009458646,"teacher_disagreement_score":0.0017142736,"about_ca_system_score_codex":0.00048753517,"about_ca_system_score_gemma":0.0008320327,"threshold_uncertainty_score":0.007962227},"labels":[],"label_agreement":null},{"id":"W2093077824","doi":"10.1080/08982110802247744","title":"Evaluating Three DOE Methodologies: Optimization of a Composite Laminate under Fabrication Error","year":2008,"lang":"en","type":"article","venue":"Quality Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; National Science Foundation","keywords":"Design of experiments; Response surface methodology; Computer science; Composite number; Bayesian probability; Reliability engineering; Engineering drawing; Engineering; Mathematics; Algorithm; Machine learning; Artificial intelligence; Statistics","score_opus":0.20182623593448912,"score_gpt":0.41174375457916007,"score_spread":0.20991751864467095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093077824","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.50134933,0.0007003282,0.49542066,0.00006706133,0.000022492228,0.00016114107,0.0000754341,0.00014498875,0.0020585402],"genre_scores_gemma":[0.7530887,0.00021054325,0.24605015,0.000015243936,0.0000045439665,0.00018690457,0.0000480454,0.000027131076,0.00036861177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741346,0.0015728264,0.00007493798,0.00015780731,0.0007033769,0.00007758978],"domain_scores_gemma":[0.9944015,0.004269741,0.00041251312,0.00026926456,0.0005984299,0.000048582406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00546768,0.0008698956,0.00076090737,0.000847296,0.00028679147,0.0006646234,0.00035569404,0.00065152836,0.00037654076],"category_scores_gemma":[0.0074307746,0.0003093657,0.00071500445,0.00060666347,0.00047271381,0.0004138016,0.00040500177,0.00040607012,0.000050813695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033112415,0.0001913182,0.0018898373,0.00023633796,0.000115498704,0.00004403648,0.00007720833,0.90504473,0.03466447,0.002164303,0.00008406293,0.055157043],"study_design_scores_gemma":[0.000072624694,0.0014282333,0.002347036,0.000026236181,0.00007384642,0.00004924541,0.00006278889,0.9343357,0.05969132,0.0010536626,0.0008214452,0.000037770013],"about_ca_topic_score_codex":0.0011483808,"about_ca_topic_score_gemma":0.0014743346,"teacher_disagreement_score":0.00546768,"about_ca_system_score_codex":0.0006209367,"about_ca_system_score_gemma":0.00072939484,"threshold_uncertainty_score":0.02891624},"labels":[],"label_agreement":null},{"id":"W2096649264","doi":"10.1007/s10514-009-9130-2","title":"A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot","year":2009,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":false,"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; Mobile robot; Reinforcement learning; Motion planning; Bayesian optimization; Partially observable Markov decision process; Artificial intelligence; Robot; Differentiable function; Bayesian probability; Robotics; Machine learning; Mathematical optimization; Markov chain","score_opus":0.03127060285093802,"score_gpt":0.306921433026712,"score_spread":0.27565083017577396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096649264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005449663,0.00012623006,0.9931686,0.00011280796,0.000018205117,0.00002000431,0.000015191185,0.00011004512,0.0009793199],"genre_scores_gemma":[0.64380795,0.00028044256,0.35093886,0.00019049636,0.00008977907,0.00035865745,0.00009295355,0.00011815008,0.004122681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992736,0.00018819541,0.000034571993,0.00013682253,0.00028612153,0.0000807705],"domain_scores_gemma":[0.9987031,0.000819869,0.00012631182,0.00005748747,0.0002255143,0.00006771625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013140748,0.0010732041,0.0018010802,0.00091070356,0.00084797334,0.0010489234,0.0020236792,0.0021063406,0.0017199945],"category_scores_gemma":[0.0044570123,0.0013851296,0.0009213739,0.0009772936,0.001432255,0.0018106455,0.0021722503,0.001228453,0.00029395657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100178804,0.00005133696,0.0002755171,0.00006353273,0.0000415519,0.00006688256,0.000090853384,0.94296074,0.0016159962,0.01634381,0.00065952644,0.037730042],"study_design_scores_gemma":[0.000008031061,0.000013985889,0.00003544224,0.0000030206193,0.0000045162096,0.000007665639,0.0000032175494,0.9960407,0.00016662096,0.003613428,0.0000977629,0.0000056999766],"about_ca_topic_score_codex":0.013877164,"about_ca_topic_score_gemma":0.014002132,"teacher_disagreement_score":0.013877164,"about_ca_system_score_codex":0.0013245896,"about_ca_system_score_gemma":0.0023229702,"threshold_uncertainty_score":0.027592778},"labels":[],"label_agreement":null},{"id":"W2097746659","doi":"10.1007/s00158-005-0557-6","title":"Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation","year":2005,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":488,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multi-objective optimization; Mathematical optimization; Pareto principle; Piecewise; Mathematics; Pareto analysis; Simple (philosophy); Computer science","score_opus":0.025438543972311874,"score_gpt":0.33198768003632445,"score_spread":0.3065491360640126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097746659","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.00068321923,0.00010093465,0.9981299,0.000024115816,0.000042851512,0.000021807677,0.000011679311,0.000078435085,0.0009070848],"genre_scores_gemma":[0.03942025,0.00032560842,0.95556915,0.00009335463,0.00009594571,0.00031023446,0.000103597115,0.00019260841,0.0038893851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990489,0.0002559624,0.000037612248,0.00008493804,0.0005382064,0.000034325534],"domain_scores_gemma":[0.9992465,0.0002965433,0.00004360956,0.00007334959,0.00030295353,0.000037145535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532855,0.0014233367,0.0011972106,0.0014341241,0.000554524,0.0010022861,0.0021822024,0.0013266797,0.005037691],"category_scores_gemma":[0.0025194557,0.000560648,0.0013840984,0.0017066126,0.0006153217,0.0016191516,0.0015931975,0.0018023925,0.0014373938],"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.00011806689,0.000129368,0.0002601082,0.00030655996,0.00015101532,0.00007375913,0.00010482246,0.4444587,0.014879552,0.03843476,0.005001971,0.49608126],"study_design_scores_gemma":[0.000012878297,0.000026982832,0.00004830073,0.000012054242,0.000016289305,0.000027291084,0.0000044537624,0.9901826,0.00155294,0.00519338,0.0029113435,0.000011510654],"about_ca_topic_score_codex":0.0010255324,"about_ca_topic_score_gemma":0.0013093443,"teacher_disagreement_score":0.005037691,"about_ca_system_score_codex":0.0004343286,"about_ca_system_score_gemma":0.0006872284,"threshold_uncertainty_score":0.016852796},"labels":[],"label_agreement":null},{"id":"W2097998348","doi":"","title":"Random search for hyper-parameter optimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":7937,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Hyperparameter optimization; Random search; Computer science; Grid; Set (abstract data type); Artificial neural network; Fraction (chemistry); Search algorithm; Data mining; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.030044046383621726,"score_gpt":0.29760255476646075,"score_spread":0.267558508382839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097998348","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.015598274,0.0008229211,0.97758013,0.0002827211,0.00006150438,0.00020232449,0.000067977286,0.0007878982,0.0045962674],"genre_scores_gemma":[0.4563361,0.00048417825,0.53772384,0.00038591548,0.000069723195,0.0014967523,0.0003369427,0.00053303584,0.0026334776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531895,0.003413728,0.00018111458,0.00044164326,0.00048641398,0.00015813885],"domain_scores_gemma":[0.98353636,0.013357059,0.0006149271,0.0014552304,0.0008704901,0.00016595994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006756522,0.0014052391,0.0015776661,0.0019054172,0.00076792843,0.0013463328,0.0016676601,0.0016674799,0.0047209496],"category_scores_gemma":[0.033430416,0.0008698409,0.0009913939,0.0014983524,0.0018661221,0.0018694246,0.0016724406,0.0020573842,0.0012948902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019347643,0.000092039925,0.0012042832,0.0001720733,0.00015868228,0.00009540929,0.0000941765,0.90364206,0.00072657084,0.039637655,0.0024698284,0.051513765],"study_design_scores_gemma":[0.000082880804,0.000076691846,0.0001553104,0.000045651203,0.000021897607,0.00004071811,0.000031152147,0.96323043,0.0006715356,0.03392685,0.0016968963,0.000019909216],"about_ca_topic_score_codex":0.002230891,"about_ca_topic_score_gemma":0.0024721115,"teacher_disagreement_score":0.006756522,"about_ca_system_score_codex":0.000976883,"about_ca_system_score_gemma":0.0013381591,"threshold_uncertainty_score":0.03573239},"labels":[],"label_agreement":null},{"id":"W2098678467","doi":"10.1109/tmtt.2006.884648","title":"Theoretical Justification of Space-Mapping-Based Modeling Utilizing a Database and On-Demand Parameter Extraction","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Weighting; Space mapping; Benchmark (surveying); Computer science; Set (abstract data type); Data mining; Point (geometry); Base (topology); Parameter space; Space (punctuation); Data modeling; Surrogate model; Algorithm; Mathematical optimization; Database; Mathematics; Machine learning; Statistics","score_opus":0.017395911040698712,"score_gpt":0.2718570943285353,"score_spread":0.25446118328783657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098678467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025400873,0.00007222776,0.9949332,0.00018527091,0.000011501841,0.00001275668,0.000039668463,0.000035921956,0.0021694736],"genre_scores_gemma":[0.4435834,0.0008076907,0.55121535,0.00025236508,0.00011667168,0.00043992145,0.00030006532,0.000105798965,0.0031787322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979842,0.000830008,0.00009529407,0.0001900334,0.0008063325,0.00009406914],"domain_scores_gemma":[0.9962205,0.0022414757,0.00022825075,0.00071426836,0.0005164458,0.00007906618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036810806,0.0007082627,0.0009623463,0.0013138728,0.00049766584,0.0022584328,0.0026960992,0.0019724155,0.0035453357],"category_scores_gemma":[0.010216116,0.0005978417,0.001078055,0.0013776165,0.0017153993,0.0038133452,0.0023199255,0.0016208837,0.00068641535],"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.000026893209,0.00002699893,0.00024023159,0.000073903415,0.000016847565,0.00009594892,0.00006702084,0.3065339,0.001189645,0.6746217,0.00055516016,0.016551763],"study_design_scores_gemma":[0.000006855189,0.000024274059,0.000057360587,0.000015960606,0.000005152487,0.00006628806,0.000015057192,0.8786677,0.0008352063,0.1185611,0.0017344325,0.000010632906],"about_ca_topic_score_codex":0.0009551498,"about_ca_topic_score_gemma":0.00040347883,"teacher_disagreement_score":0.0036810806,"about_ca_system_score_codex":0.0008910227,"about_ca_system_score_gemma":0.0009451885,"threshold_uncertainty_score":0.019467652},"labels":[],"label_agreement":null},{"id":"W2100358079","doi":"10.1109/tmag.2009.2022492","title":"Improved Sequential Optimization Method for High Dimensional Electromagnetic Device Optimization","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Dimension (graph theory); Optimization problem; Mathematical optimization; Reduction (mathematics); Engineering optimization; Algorithm; Mathematics","score_opus":0.012824749163893524,"score_gpt":0.2773621062419217,"score_spread":0.26453735707802817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100358079","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.0022101786,0.000085451575,0.9963349,0.000032636995,0.000017485192,0.000014562784,0.0000152074435,0.00012796791,0.0011615814],"genre_scores_gemma":[0.14581023,0.0002408339,0.8486654,0.00008070727,0.000041787607,0.0004048153,0.0001525354,0.00014274777,0.004460853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.00016917253,0.000016938233,0.00004072426,0.00018743274,0.000024353261],"domain_scores_gemma":[0.9996544,0.00017453394,0.000029272687,0.000037051566,0.00009094849,0.0000138179075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075867365,0.00082175573,0.00090172765,0.0005644584,0.00030071064,0.00040164334,0.0008183464,0.0006248927,0.002916005],"category_scores_gemma":[0.0011651792,0.00038580017,0.0008170448,0.00069397705,0.00035823832,0.0005642946,0.0005939937,0.00068969565,0.000566792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055027413,0.000035195782,0.00024363335,0.000121745084,0.000060205562,0.00004177395,0.00003181779,0.9016749,0.0055576297,0.013009476,0.0019375236,0.077231],"study_design_scores_gemma":[0.000005301433,0.000012556805,0.000026580145,0.000001653995,0.0000024018232,0.000007578592,0.0000013561543,0.99759966,0.0003636819,0.0013836976,0.0005932275,0.0000022748748],"about_ca_topic_score_codex":0.0018306545,"about_ca_topic_score_gemma":0.002400961,"teacher_disagreement_score":0.002916005,"about_ca_system_score_codex":0.00040170824,"about_ca_system_score_gemma":0.00084364536,"threshold_uncertainty_score":0.009755015},"labels":[],"label_agreement":null},{"id":"W2101083806","doi":"10.1287/ijoc.1110.0476","title":"A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":35,"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":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche","keywords":"Travelling salesman problem; Branch and cut; 2-opt; Bottleneck traveling salesman problem; Branch and bound; Mathematical optimization; Mathematics; Maximum cut; Algorithm; Traveling purchaser problem; Constraint (computer-aided design); Hamiltonian path; Computer science; Integer programming; Combinatorics; Graph","score_opus":0.025452194892687716,"score_gpt":0.26221907165372105,"score_spread":0.23676687676103333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101083806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001380712,0.000111230576,0.9966749,0.000065845146,0.000017925342,0.0000421589,0.000028669103,0.00016051302,0.0015181438],"genre_scores_gemma":[0.023797618,0.00021933857,0.9745009,0.00006570087,0.000023993756,0.00015716242,0.00010936374,0.00011149119,0.0010144894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999201,0.00024809732,0.000039109942,0.0001497794,0.0002704148,0.00009171264],"domain_scores_gemma":[0.9992405,0.00038395167,0.00007712044,0.00009142354,0.00015806923,0.000049020407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014384675,0.0012046167,0.0013133222,0.00093654153,0.0009834386,0.000989633,0.0017486312,0.0017008455,0.0041799014],"category_scores_gemma":[0.0029180716,0.000498187,0.0010659294,0.0018961168,0.0007095213,0.0013740485,0.0015827859,0.0022181843,0.00094983133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007141533,0.000089380505,0.00033701462,0.00026492824,0.00005540983,0.00013399139,0.00010075787,0.607971,0.0025876611,0.062008094,0.0053952434,0.32098502],"study_design_scores_gemma":[0.000027481708,0.00003588549,0.00008228501,0.000022251103,0.000014587133,0.00007603474,0.00001532518,0.9633011,0.0008566881,0.029277252,0.006278807,0.000012291953],"about_ca_topic_score_codex":0.0026382555,"about_ca_topic_score_gemma":0.004116727,"teacher_disagreement_score":0.0041799014,"about_ca_system_score_codex":0.0011148178,"about_ca_system_score_gemma":0.0015438116,"threshold_uncertainty_score":0.01398313},"labels":[],"label_agreement":null},{"id":"W2102314356","doi":"10.1115/omae2014-23489","title":"Response Surface Models for Analyzing Planing Hull Motions in a Vertical Plane","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Memorial University of Newfoundland","funders":"","keywords":"Hull; Marine engineering; Trim; Head (geology); Center of gravity; Vertical plane; Engineering; Structural engineering; Geology","score_opus":0.024210763723180963,"score_gpt":0.27856523520608484,"score_spread":0.25435447148290385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102314356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00799678,0.00007294954,0.99070895,0.000029706953,0.000010547543,0.000056368513,0.00007931831,0.00029048984,0.0007549029],"genre_scores_gemma":[0.66528416,0.0007661437,0.32493865,0.00009338144,0.00003401563,0.0017259067,0.0007088372,0.00019984301,0.0062489756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993268,0.0003021221,0.00003345994,0.00009379893,0.00020639812,0.000037358066],"domain_scores_gemma":[0.99889684,0.000767745,0.0001249027,0.000057568854,0.0001391883,0.000013739892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013865498,0.0010806435,0.0006791749,0.00049893995,0.00016817357,0.0004753989,0.00074948644,0.0008550851,0.0017827818],"category_scores_gemma":[0.0026441328,0.00036106922,0.0010647837,0.0006310464,0.000343426,0.00046962698,0.0003234143,0.0009632431,0.0005233475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021763188,0.000019938157,0.00023410465,0.00004760258,0.00001825468,0.000010519113,0.000019367953,0.984656,0.0032239053,0.0020040146,0.00012874228,0.009615868],"study_design_scores_gemma":[0.0000027496085,0.00003790696,0.000109295965,0.000002238622,0.0000035903197,0.0000030807548,0.0000035325945,0.9984509,0.00053916615,0.00053738954,0.00030701756,0.0000030853296],"about_ca_topic_score_codex":0.0024596786,"about_ca_topic_score_gemma":0.0016741228,"teacher_disagreement_score":0.0024596786,"about_ca_system_score_codex":0.00040368625,"about_ca_system_score_gemma":0.0005540655,"threshold_uncertainty_score":0.0073328614},"labels":[],"label_agreement":null},{"id":"W2105084210","doi":"10.1109/icsmc.1998.726710","title":"An extension to design of experiment for design optimization with implicit parametric models and virtual prototypes","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtual prototyping; Parametric statistics; Computation; Extension (predicate logic); Parametric design; Mathematical optimization; Nonlinear system; Simulation; Algorithm; Mathematics","score_opus":0.062214232993946156,"score_gpt":0.29235219520489003,"score_spread":0.23013796221094387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105084210","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.0007215872,0.00006605029,0.99797386,0.000041855146,0.000040697636,0.000049065682,0.000011357889,0.00015227443,0.000943331],"genre_scores_gemma":[0.07263887,0.0002721338,0.9242885,0.00008438066,0.00006675829,0.0008997549,0.000045183206,0.0001055365,0.0015988633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967084,0.0017179801,0.00013095235,0.0003313453,0.0010264517,0.00008488594],"domain_scores_gemma":[0.99645895,0.0023029458,0.00024354721,0.0006157735,0.0003321675,0.000046644323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042721475,0.0013896498,0.001155816,0.0005750004,0.00035810875,0.0008646976,0.0014735991,0.0011971091,0.0050739795],"category_scores_gemma":[0.0073485803,0.0006624957,0.0015549732,0.000549837,0.001147811,0.0012067708,0.0016301055,0.0016247381,0.00080901664],"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.00047166803,0.00044393234,0.00080444774,0.0015482362,0.00023561425,0.00026664368,0.0003627997,0.36260477,0.042002242,0.17034093,0.0033688152,0.4175499],"study_design_scores_gemma":[0.00016745087,0.0007403803,0.00032828885,0.00008924965,0.000063883934,0.00023196715,0.000032126412,0.88510036,0.015024599,0.05553488,0.042619865,0.00006688099],"about_ca_topic_score_codex":0.00032383052,"about_ca_topic_score_gemma":0.00029645895,"teacher_disagreement_score":0.0050739795,"about_ca_system_score_codex":0.00030743837,"about_ca_system_score_gemma":0.00074923574,"threshold_uncertainty_score":0.022593558},"labels":[],"label_agreement":null},{"id":"W2105756282","doi":"10.1115/detc2013-12664","title":"Development of a Common Platform for Testing Metamodel Based Design Optimization Methods","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; Simon Fraser University","funders":"","keywords":"Testbed; Computer science; Metamodeling; Benchmark (surveying); Pareto principle; Set (abstract data type); Optimization problem; Test functions for optimization; Engineering optimization; Mathematical optimization; Algorithm; Multi-swarm optimization; Software engineering","score_opus":0.12831463682150115,"score_gpt":0.35454135550807325,"score_spread":0.2262267186865721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105756282","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.04278148,0.0001491476,0.94132465,0.000101562306,0.00008516575,0.00072114513,0.0009137427,0.009640849,0.004282293],"genre_scores_gemma":[0.2398239,0.00021172685,0.75258416,0.00008501066,0.000019335035,0.0018010895,0.002808501,0.0011123038,0.0015540065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977442,0.00069137913,0.0002180269,0.00025821824,0.0009100227,0.00017817745],"domain_scores_gemma":[0.9963805,0.00133888,0.00025065153,0.0011763434,0.0007176121,0.00013600916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046168393,0.0013862672,0.0009687265,0.0016128148,0.0003604479,0.0009342721,0.0026832726,0.00094834383,0.004615851],"category_scores_gemma":[0.006819891,0.00045389798,0.0009612701,0.00088734314,0.0005212531,0.0012984662,0.001547662,0.0013469876,0.0010690821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058867247,0.0013998969,0.00665272,0.0012722458,0.00028700376,0.0006120461,0.00031387754,0.576916,0.10523323,0.039049823,0.008461413,0.25921312],"study_design_scores_gemma":[0.00021390975,0.0009646497,0.0017285257,0.000138198,0.000059570106,0.00025835633,0.00009049687,0.8539082,0.111081794,0.0067118197,0.024785558,0.000058845497],"about_ca_topic_score_codex":0.00134101,"about_ca_topic_score_gemma":0.0010183753,"teacher_disagreement_score":0.0046168393,"about_ca_system_score_codex":0.00070706196,"about_ca_system_score_gemma":0.0014624178,"threshold_uncertainty_score":0.024416506},"labels":[],"label_agreement":null},{"id":"W2106831600","doi":"10.1109/tmag.2006.871573","title":"Multiobjective approaches for robust electromagnetic design","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":41,"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":"Computer science; Compromise; Multi-objective optimization; Mathematical optimization; Optimal design; Robustness (evolution); Decision maker; Operations research; Mathematics; Machine learning","score_opus":0.04258719587666003,"score_gpt":0.23518942404153992,"score_spread":0.19260222816487987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106831600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032037075,0.0005604331,0.99751925,0.00007141195,0.0000234085,0.000018718963,0.0000099075305,0.000028842089,0.001447728],"genre_scores_gemma":[0.108288236,0.003014943,0.8825307,0.00022413135,0.00024592923,0.0007704203,0.000121552155,0.00012805573,0.004676043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984819,0.0007240718,0.00007703648,0.00015628201,0.0005099208,0.000050789626],"domain_scores_gemma":[0.9986072,0.00087370013,0.00017200166,0.000102107035,0.00021328498,0.000031652406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031241844,0.0025216988,0.0012797175,0.0015472362,0.00045747135,0.0014637469,0.0013579206,0.0016469463,0.0030612971],"category_scores_gemma":[0.003637008,0.0007311636,0.0014204971,0.0011384842,0.0012842781,0.0009693524,0.0019177664,0.0021497612,0.0008782131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022678349,0.00003110548,0.00010611521,0.00029183924,0.00013406073,0.000058420304,0.000053373093,0.81983703,0.0018432123,0.12359003,0.0010802456,0.05295185],"study_design_scores_gemma":[0.00001940839,0.000049843085,0.000051093888,0.000065693435,0.000021972546,0.000029392197,0.0000142242025,0.90790117,0.0007947099,0.08426529,0.0067692404,0.000018075434],"about_ca_topic_score_codex":0.0007843613,"about_ca_topic_score_gemma":0.0007231302,"teacher_disagreement_score":0.0031241844,"about_ca_system_score_codex":0.0010156749,"about_ca_system_score_gemma":0.00079773617,"threshold_uncertainty_score":0.016522408},"labels":[],"label_agreement":null},{"id":"W2107571131","doi":"10.1016/j.applthermaleng.2009.12.010","title":"A grid based multi-objective evolutionary algorithm for the optimization of power plants","year":2010,"lang":"en","type":"article","venue":"Applied Thermal Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Header; Mathematical optimization; Evolutionary algorithm; Process (computing); Set (abstract data type); Genetic algorithm; Computer science; Cogeneration; Power station; Population; Grid; Task (project management); Power (physics); Engineering; Electricity generation; Mathematics; Systems engineering","score_opus":0.006514385156439571,"score_gpt":0.2141665179242579,"score_spread":0.20765213276781833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107571131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016590353,0.00019807114,0.9777297,0.0001402059,0.00007796046,0.000060952898,0.000053147076,0.00035444245,0.004795204],"genre_scores_gemma":[0.36716452,0.00021317974,0.6275904,0.00012889333,0.00004741992,0.00037685776,0.00015434164,0.00014098095,0.004183389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979657,0.00009492386,0.000007572492,0.000019140754,0.00006712194,0.000014645259],"domain_scores_gemma":[0.999681,0.00018116905,0.00002245243,0.000021567635,0.00007783087,0.000016050037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680996,0.0006067921,0.0007419463,0.00047640005,0.00041522513,0.0005787428,0.0009792509,0.001238546,0.0031109627],"category_scores_gemma":[0.0016365998,0.0004084574,0.00040014027,0.00081756857,0.00031143244,0.0005668327,0.0007117386,0.0008139768,0.00045824714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039157712,0.000025865655,0.00020452823,0.000025761423,0.000020497038,0.000029600076,0.000016988786,0.96102583,0.00054965855,0.0022170946,0.00061755907,0.035227437],"study_design_scores_gemma":[0.000012558904,0.0000126886,0.00003543451,0.000001909241,0.0000025062632,0.0000055535093,0.0000016288577,0.9990939,0.00007906663,0.00047381967,0.0002798158,0.0000012191218],"about_ca_topic_score_codex":0.003198221,"about_ca_topic_score_gemma":0.0036477437,"teacher_disagreement_score":0.003198221,"about_ca_system_score_codex":0.00040538903,"about_ca_system_score_gemma":0.0005902442,"threshold_uncertainty_score":0.010407269},"labels":[],"label_agreement":null},{"id":"W2109424752","doi":"10.1115/imece2013-64792","title":"Decomposition of High-Dimensional Shape Optimization Problems Through Quantifying Design Variable Correlation","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Airfoil; Aerodynamics; Turbomachinery; Mathematical optimization; Computer science; Multidisciplinary design optimization; Metamodeling; Engineering design process; Shape optimization; Variable (mathematics); Decomposition; Optimization problem; Scale (ratio); Gas compressor; Mathematics; Engineering; Aerospace engineering; Mechanical engineering; Finite element method; Physics","score_opus":0.03358741631807934,"score_gpt":0.273719910749234,"score_spread":0.24013249443115467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109424752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037030685,0.000027890515,0.9958068,0.00002285618,0.000004670691,0.000011659064,0.000007991978,0.00003982814,0.00037523653],"genre_scores_gemma":[0.18768235,0.00018595172,0.81053287,0.00006957997,0.00003121195,0.00025585532,0.0001294788,0.00013732379,0.0009754009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928457,0.00032607667,0.000029467548,0.000089706235,0.00023240062,0.000037862417],"domain_scores_gemma":[0.9986511,0.0008456378,0.00014173685,0.00019854389,0.00011561486,0.000047384212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020107066,0.001119534,0.0010858186,0.0006772594,0.0003293178,0.0009038743,0.0006644024,0.0007506888,0.0014416724],"category_scores_gemma":[0.003242263,0.0005138441,0.0010198117,0.00049137796,0.00079343753,0.0010830278,0.0015738403,0.0013941752,0.00032760337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041699222,0.000058179947,0.0005519808,0.00012233101,0.000044220385,0.000051732306,0.00005268783,0.90395445,0.008355317,0.03334785,0.00034365724,0.053075843],"study_design_scores_gemma":[0.000004576471,0.000022766057,0.000079800804,0.0000070221727,0.0000046208615,0.000012784686,0.0000073519063,0.9895834,0.0010796642,0.008667605,0.0005262312,0.0000042228635],"about_ca_topic_score_codex":0.00043070692,"about_ca_topic_score_gemma":0.0004255938,"teacher_disagreement_score":0.0020107066,"about_ca_system_score_codex":0.00038576854,"about_ca_system_score_gemma":0.0008493504,"threshold_uncertainty_score":0.010633767},"labels":[],"label_agreement":null},{"id":"W2111188993","doi":"10.1109/tmtt.2006.890524","title":"Space-Mapping Optimization With Adaptive Surrogate Model","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Extrapolation; Surrogate model; Mathematical optimization; Space (punctuation); Computer science; Point (geometry); Algorithm; Optimization problem; Mathematics; Statistics","score_opus":0.013081143403960575,"score_gpt":0.24249825300624736,"score_spread":0.22941710960228678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111188993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00904525,0.00007716592,0.98868376,0.000087079105,0.000018797511,0.000021323887,0.000016541639,0.0000999593,0.0019501327],"genre_scores_gemma":[0.48739266,0.00024595618,0.50533766,0.00010004491,0.000030043113,0.00028387734,0.00013194222,0.00011598332,0.0063617984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996238,0.00017492952,0.000016212089,0.00005200961,0.00010923418,0.00002373248],"domain_scores_gemma":[0.9993942,0.00033432833,0.0000523449,0.000084616535,0.00011278402,0.000021774536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009493745,0.00059893564,0.00073879526,0.0004096315,0.00023718369,0.00064592157,0.0006357451,0.0011164539,0.0015609859],"category_scores_gemma":[0.0021267233,0.00029525338,0.00057190435,0.0005428461,0.0004929465,0.0009219939,0.0009169605,0.0008478784,0.0003276602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025163463,0.000016739956,0.00014700477,0.000023994686,0.000009197459,0.000029772722,0.000017088918,0.97540617,0.0014327554,0.009455293,0.00029686716,0.013139914],"study_design_scores_gemma":[0.000002223662,0.000007339012,0.000016443539,0.0000014594442,8.738925e-7,0.0000052611217,0.0000017142747,0.9978465,0.00023666472,0.0016178667,0.00026213715,0.0000015278691],"about_ca_topic_score_codex":0.0013131928,"about_ca_topic_score_gemma":0.0007397957,"teacher_disagreement_score":0.0015609859,"about_ca_system_score_codex":0.000376111,"about_ca_system_score_gemma":0.0005840882,"threshold_uncertainty_score":0.0052220225},"labels":[],"label_agreement":null},{"id":"W2111515077","doi":"10.1007/s00158-009-0366-4","title":"Pareto frontier for simultaneous structural and manufacturing optimization of a composite part","year":2009,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Mathematical optimization; Sorting; Pareto principle; Multi-objective optimization; Engineering design process; Constraint (computer-aided design); Vector optimization; Convergence (economics); Computer science; Optimization problem; Mathematics; Multi-swarm optimization; Algorithm; Engineering","score_opus":0.009233764074291486,"score_gpt":0.26013590647274615,"score_spread":0.25090214239845465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111515077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041132182,0.00042910312,0.9437444,0.0002043451,0.00004582791,0.000072135175,0.00012394428,0.00015182624,0.014096275],"genre_scores_gemma":[0.7605663,0.00081044657,0.2261493,0.00014237202,0.000058080026,0.0006313158,0.00037926063,0.00015429435,0.011108642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.00018024344,0.000012350361,0.000030026511,0.00025236807,0.00005381278],"domain_scores_gemma":[0.99927515,0.00046736424,0.000046615387,0.00003620515,0.00013607387,0.00003863748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334674,0.0013481549,0.0011257264,0.0019879946,0.00076020573,0.0016984886,0.0009210409,0.0017019947,0.0028987979],"category_scores_gemma":[0.0036442168,0.00067275955,0.0011285002,0.0011972683,0.0009626752,0.0009135229,0.0014115053,0.00095105934,0.0005608869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036890153,0.000029293546,0.000094143565,0.000038198956,0.000017052555,0.000028299824,0.000023737639,0.98134446,0.0007993394,0.008972913,0.00039829628,0.008217506],"study_design_scores_gemma":[0.000005729507,0.00001947558,0.00007711171,0.000007285832,0.000004747329,0.0000065516197,0.000009450848,0.99392694,0.00030151897,0.005412489,0.00022500352,0.0000036857184],"about_ca_topic_score_codex":0.0030646024,"about_ca_topic_score_gemma":0.0018208711,"teacher_disagreement_score":0.0030646024,"about_ca_system_score_codex":0.0013766112,"about_ca_system_score_gemma":0.0015113739,"threshold_uncertainty_score":0.012347043},"labels":[],"label_agreement":null},{"id":"W2113159894","doi":"10.1002/cjce.22384","title":"Adaptive Sampling for Surrogate Modelling with Artificial Neural Network and its Application in an Industrial Cracking Furnace","year":2015,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Fundamental Research Funds for the Central Universities; Shanghai Municipal Education Commission; National Natural Science Foundation of China; Science and Technology Commission of Shanghai Municipality; Beijing Municipal Science and Technology Commission; Shanghai Education Development Foundation; Natural Science Foundation of Shanghai","keywords":"Surrogate model; Adaptive sampling; Computer science; Artificial neural network; Surrogate data; Sampling (signal processing); Artificial intelligence; Process (computing); Selection (genetic algorithm); Machine learning; Data mining; Nonlinear system; Statistics; Mathematics","score_opus":0.07640862325215528,"score_gpt":0.2548289818497013,"score_spread":0.17842035859754604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113159894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097442985,0.00044668862,0.89800674,0.00025261735,0.000054068245,0.00007501401,0.000030287161,0.00021948089,0.0034720881],"genre_scores_gemma":[0.8553158,0.00026762832,0.14270173,0.000036021378,0.000016222271,0.00013013405,0.00004922243,0.00003265602,0.0014505684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993948,0.00033235946,0.000029213244,0.000058353795,0.000158379,0.00002692647],"domain_scores_gemma":[0.99881727,0.0007773037,0.00007505233,0.0000736726,0.00022725633,0.000029363206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017790833,0.0005699861,0.0006740392,0.0004288576,0.0003949642,0.0005756922,0.000626005,0.0011588366,0.0006450929],"category_scores_gemma":[0.0031797208,0.00030740147,0.0006134476,0.0004911918,0.00058991177,0.0006521288,0.0007029102,0.0008793297,0.000087645545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008721302,0.00004032256,0.0006518894,0.000050819985,0.0000144198275,0.000071215276,0.00004957197,0.9794279,0.0022764723,0.003956566,0.00010820442,0.013265313],"study_design_scores_gemma":[0.0000016924058,0.000008889943,0.000037366182,0.0000013960253,8.1017026e-7,0.0000033303033,0.0000018818887,0.99938667,0.0002608793,0.0002456469,0.00004978773,0.0000017317883],"about_ca_topic_score_codex":0.0033235617,"about_ca_topic_score_gemma":0.0019797666,"teacher_disagreement_score":0.0033235617,"about_ca_system_score_codex":0.00044907627,"about_ca_system_score_gemma":0.00051575335,"threshold_uncertainty_score":0.009408772},"labels":[],"label_agreement":null},{"id":"W2113955139","doi":"10.1145/1569901.1569940","title":"An experimental investigation of model-based parameter optimisation","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"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; Gaussian process; Process (computing); Key (lock); Model parameter; Gaussian network model; Machine learning; Gaussian; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.028739908156011285,"score_gpt":0.3002304423346162,"score_spread":0.2714905341786049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113955139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43792564,0.0007372605,0.5477072,0.0007009116,0.00024009921,0.00060707954,0.00048209005,0.0021846828,0.009415032],"genre_scores_gemma":[0.88780683,0.00015882295,0.1092325,0.00019070698,0.00002328779,0.00044705864,0.00025653595,0.0002508099,0.0016333656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959026,0.0015462049,0.00029502352,0.0008100843,0.0011413641,0.00030472287],"domain_scores_gemma":[0.98829496,0.0071549998,0.00079843693,0.0025326766,0.0010462847,0.00017265516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047205393,0.0011790257,0.0010830805,0.00067902927,0.00045942608,0.001386594,0.002138199,0.0019959935,0.004154448],"category_scores_gemma":[0.026559839,0.00046709777,0.0006156024,0.000762663,0.0011713175,0.0020750111,0.001653059,0.0019270722,0.0010933898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036882982,0.0023498123,0.0032050353,0.0015538825,0.00024978427,0.0002245741,0.00050047383,0.5963547,0.22485733,0.019092709,0.0025479891,0.14537537],"study_design_scores_gemma":[0.00029769455,0.0044529247,0.002072174,0.00009600368,0.000076947006,0.00024151347,0.00014099292,0.7833442,0.19358452,0.010172351,0.0053781564,0.00014256078],"about_ca_topic_score_codex":0.00083229557,"about_ca_topic_score_gemma":0.00051494926,"teacher_disagreement_score":0.0047205393,"about_ca_system_score_codex":0.00076141435,"about_ca_system_score_gemma":0.00074115547,"threshold_uncertainty_score":0.024964869},"labels":[],"label_agreement":null},{"id":"W2114452512","doi":"10.1002/cjs.11156","title":"Sequential design for computer experiments with a flexible Bayesian additive model","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bayesian probability; Focus (optics); Feature (linguistics); Representation (politics); Surrogate model; Artificial intelligence; Bayesian inference; Machine learning; Computer experiment; Simulation","score_opus":0.04889409630846797,"score_gpt":0.28230011981881054,"score_spread":0.23340602351034256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114452512","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.014776057,0.00007541828,0.98227686,0.00020210807,0.00007590663,0.0015482921,0.000061831175,0.0002809739,0.0007025885],"genre_scores_gemma":[0.2695534,0.00016587354,0.7166627,0.00030481594,0.000108560846,0.011359197,0.00019464083,0.00007280511,0.0015780574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.93037987,0.05724721,0.0015064392,0.00524267,0.0043816245,0.0012421275],"domain_scores_gemma":[0.85488605,0.12655175,0.0066247964,0.006053037,0.004530464,0.0013539682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07325107,0.0023772903,0.0045373873,0.0021277668,0.0009424215,0.002524051,0.0035666756,0.0031370062,0.008491407],"category_scores_gemma":[0.122499816,0.0016181968,0.0023551288,0.0017826095,0.0035106507,0.0033126997,0.002958509,0.004552011,0.0008622466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062912093,0.0009704504,0.0026168202,0.00067150075,0.0007378983,0.00021693962,0.00045949683,0.67445415,0.002891094,0.23370126,0.0012885557,0.07570065],"study_design_scores_gemma":[0.0006892653,0.0009924219,0.00036883267,0.000034842884,0.000074528165,0.000016888247,0.000017523076,0.94287056,0.0006803038,0.053464916,0.00075399893,0.000035872643],"about_ca_topic_score_codex":0.0022708694,"about_ca_topic_score_gemma":0.0014424634,"teacher_disagreement_score":0.07325107,"about_ca_system_score_codex":0.0031869265,"about_ca_system_score_gemma":0.0039988267,"threshold_uncertainty_score":0.3873933},"labels":[],"label_agreement":null},{"id":"W2115173649","doi":"10.1504/ijpmb.2014.065518","title":"Municipal waste management optimisation using a firefly algorithm-driven simulation-optimisation approach","year":2014,"lang":"en","type":"article","venue":"International Journal of Process Management and Benchmarking","topic":"Advanced Multi-Objective Optimization Algorithms","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":"York University","funders":"","keywords":"Firefly algorithm; Computer science; Firefly protocol; Mathematical optimization; Variety (cybernetics); Stochastic simulation; Municipal solid waste; Stochastic modelling; Algorithm; Engineering; Mathematics; Artificial intelligence; Waste management","score_opus":0.02096694470863541,"score_gpt":0.300349919083832,"score_spread":0.2793829743751966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115173649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033274047,0.0001361921,0.96044177,0.00017375467,0.00003862502,0.000076487755,0.000043327127,0.00029938229,0.005516509],"genre_scores_gemma":[0.6760384,0.00022319658,0.31960556,0.00007903348,0.000027852477,0.0003052831,0.000121452686,0.00007491844,0.003524305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.00017221858,0.000016126673,0.00003262372,0.0001339426,0.00003396629],"domain_scores_gemma":[0.99961346,0.00022983509,0.00004353568,0.00003582237,0.000057547884,0.000019801284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008025863,0.0004658179,0.0007714844,0.00048289643,0.0004471526,0.0007206045,0.00082751364,0.0010399751,0.0010612246],"category_scores_gemma":[0.0011954271,0.00037213715,0.00094947446,0.00057967304,0.0004904313,0.0005166427,0.0007671444,0.00074401335,0.00013880293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084653075,0.000007997757,0.00008343087,0.0000064217033,0.000007409756,0.000007405341,0.000005595786,0.99476445,0.0005941227,0.0020811046,0.000036457353,0.002397128],"study_design_scores_gemma":[0.0000036546073,0.0000059312324,0.000024124412,0.0000012456358,0.0000014508479,0.0000024025514,9.843806e-7,0.99900573,0.00027238938,0.00047969783,0.00020061304,0.0000018389178],"about_ca_topic_score_codex":0.0052414215,"about_ca_topic_score_gemma":0.004228384,"teacher_disagreement_score":0.0052414215,"about_ca_system_score_codex":0.0008839787,"about_ca_system_score_gemma":0.0013184154,"threshold_uncertainty_score":0.0104218125},"labels":[],"label_agreement":null},{"id":"W2115276375","doi":"10.1002/qre.1591","title":"Using Genetic Algorithms to Design Experiments: A Review","year":2014,"lang":"en","type":"review","venue":"Quality and Reliability Engineering International","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University; Queen's University","funders":"","keywords":"Computer science; Implementation; Set (abstract data type); Optimal design; Range (aeronautics); Genetic algorithm; Mathematical optimization; Machine learning; Engineering; Mathematics; Software engineering","score_opus":0.11815220724140803,"score_gpt":0.41623084700981183,"score_spread":0.2980786397684038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115276375","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031457786,0.9738777,0.021700894,0.00067163847,0.00028054,0.00004929519,0.000036780944,0.0000727858,0.002995696],"genre_scores_gemma":[0.004357003,0.967773,0.026123894,0.0004424586,0.00030410054,0.00012040474,0.000069479145,0.00002898734,0.0007806616],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970782,0.0011858714,0.00031660823,0.0004199821,0.00093367905,0.00006566343],"domain_scores_gemma":[0.98913515,0.009115181,0.00048631587,0.00028945974,0.000884053,0.00008996613],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0050665946,0.0019210203,0.002794487,0.0044105677,0.00037369068,0.002071221,0.0032534497,0.0033162928,0.0033480136],"category_scores_gemma":[0.011446044,0.0008008162,0.0012501159,0.0069961026,0.0023457722,0.0021077832,0.0008938889,0.0020846247,0.0020810836],"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.000065262306,0.00012260466,0.0005526048,0.020574698,0.00023812274,0.00017119029,0.00012608006,0.01032711,0.00086877105,0.026039828,0.011767932,0.9291458],"study_design_scores_gemma":[0.00007904703,0.0003459044,0.0019538829,0.019307343,0.00047764613,0.0018446415,0.00016584754,0.0077829277,0.0023991722,0.059142742,0.90632206,0.00017889998],"about_ca_topic_score_codex":0.0021719371,"about_ca_topic_score_gemma":0.0019597244,"teacher_disagreement_score":0.9949334,"about_ca_system_score_codex":0.0015795196,"about_ca_system_score_gemma":0.002060701,"threshold_uncertainty_score":0.02679503},"labels":[],"label_agreement":null},{"id":"W2116193148","doi":"10.1109/tmag.2009.2012694","title":"Multi-Objective Optimization Applied to the Matching of a Specified Torque-Speed Curve for an Internal Permanent Magnet Motor","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Torque; Computer science; Magnet; Control theory (sociology); Direct torque control; Voltage; Induction motor; Physics; Electrical engineering; Engineering","score_opus":0.02438668565967948,"score_gpt":0.28029162879351527,"score_spread":0.25590494313383577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116193148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010414974,0.00019831436,0.9872745,0.00005671581,0.000019390629,0.000028323404,0.000007192296,0.00007951976,0.001921131],"genre_scores_gemma":[0.55354834,0.00036911786,0.4414174,0.000072001574,0.000034710265,0.00021525435,0.000047829737,0.00010344394,0.004191864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00021056703,0.000026650767,0.00006082807,0.00015763103,0.000036800546],"domain_scores_gemma":[0.9993773,0.0003693875,0.00007594598,0.000035130484,0.00012081847,0.000021489339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141913,0.0008941835,0.0008533827,0.0006841638,0.0004098897,0.0008162144,0.00066684023,0.0010931034,0.0011865462],"category_scores_gemma":[0.002196834,0.00041178978,0.00070655707,0.00069938414,0.0005362447,0.00046870834,0.0006610117,0.0008006999,0.00019977825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018842564,0.000016460566,0.000113158196,0.00003853757,0.000015956197,0.000026138667,0.000023055547,0.9792346,0.001827902,0.002815205,0.00012433805,0.015745858],"study_design_scores_gemma":[0.000002422843,0.000015950542,0.000038730384,0.0000032261269,0.0000032639375,0.000007321741,0.0000025142358,0.9985475,0.0005097025,0.0006303281,0.00023661742,0.000002336436],"about_ca_topic_score_codex":0.0016389864,"about_ca_topic_score_gemma":0.0012925596,"teacher_disagreement_score":0.0016389864,"about_ca_system_score_codex":0.0006617425,"about_ca_system_score_gemma":0.00061895256,"threshold_uncertainty_score":0.0069501996},"labels":[],"label_agreement":null},{"id":"W2117561764","doi":"10.2514/6.2000-4938","title":"Aircraft conceptual design using genetic algorithms","year":2000,"lang":"en","type":"article","venue":"8th Symposium on Multidisciplinary Analysis and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":68,"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":"Computer science; Conceptual design; Genetic algorithm; Algorithm design; Algorithm; Machine learning; Human–computer interaction","score_opus":0.021407334126306625,"score_gpt":0.2741287671290095,"score_spread":0.2527214330027029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117561764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050264145,0.00023386627,0.9894008,0.00006820451,0.000019777219,0.00007654308,0.000033295237,0.00031150796,0.0048296945],"genre_scores_gemma":[0.18952525,0.0006838222,0.8053612,0.00009285044,0.000031909363,0.0005512395,0.00017062278,0.00012165588,0.0034614305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964035,0.00015176374,0.000014701698,0.00004964649,0.0001201306,0.000023447967],"domain_scores_gemma":[0.999542,0.0002696499,0.00004793677,0.00003757344,0.00009182026,0.000011001814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070908497,0.0008871627,0.00068159547,0.0011077641,0.00040629043,0.0008414516,0.0009829974,0.0009630105,0.0031735394],"category_scores_gemma":[0.0017041059,0.00042545528,0.0007451177,0.00094068615,0.0006447168,0.00047850725,0.00069521356,0.00068231527,0.0006026539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007719662,0.000011165602,0.00012480977,0.00003534142,0.000016051868,0.00001500477,0.000016861439,0.96211725,0.0007010707,0.0076630437,0.00034490306,0.028946688],"study_design_scores_gemma":[0.000009206488,0.000018028542,0.00004472984,0.000013013887,0.000007480213,0.000011747248,0.0000068680138,0.99169207,0.00031414535,0.006052438,0.0018261875,0.000004097263],"about_ca_topic_score_codex":0.004219345,"about_ca_topic_score_gemma":0.0032861629,"teacher_disagreement_score":0.004219345,"about_ca_system_score_codex":0.0006558785,"about_ca_system_score_gemma":0.00094512856,"threshold_uncertainty_score":0.010616541},"labels":[],"label_agreement":null},{"id":"W2118097554","doi":"10.2307/3315868","title":"Design and analysis of computer experiments when the output is highly correlated over the input space","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":58,"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 Waterloo","funders":"","keywords":"Realization (probability); Limiting; Gaussian process; Process (computing); Code (set theory); Function (biology); Gaussian; Mathematical optimization; Mathematics; Stochastic process; Applied mathematics; Computer science; Source code; Algorithm; Correlation; Space (punctuation); Statistics; Engineering","score_opus":0.029100535860775448,"score_gpt":0.23941308834084127,"score_spread":0.2103125524800658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118097554","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.1573671,0.00039435766,0.83928305,0.0002921204,0.00005116747,0.00072697876,0.00006685465,0.0005037763,0.0013145368],"genre_scores_gemma":[0.7600467,0.00016501202,0.2372633,0.00010982772,0.000035966346,0.0017741995,0.00010158856,0.000046367142,0.00045704716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986252,0.01084965,0.0003424714,0.0010113801,0.0010414041,0.00050299347],"domain_scores_gemma":[0.8878528,0.10122142,0.0048350454,0.0025575522,0.0029558912,0.000577295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018281784,0.00086478004,0.0014499685,0.00063655665,0.0004041423,0.001190178,0.0010625933,0.0012806723,0.0009922514],"category_scores_gemma":[0.068684764,0.00095837953,0.00047054084,0.00045406868,0.0018926682,0.0010075489,0.00092933094,0.0010540923,0.00011845926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043702438,0.00051386026,0.0037872447,0.0003859127,0.00028794399,0.00010737569,0.0000814706,0.91864604,0.008537513,0.019810101,0.00037927568,0.043093007],"study_design_scores_gemma":[0.00020376973,0.0006996496,0.0007660321,0.00001866065,0.000046887595,0.000014247964,0.000013329197,0.98389006,0.0059219836,0.008118141,0.00029311905,0.000014073256],"about_ca_topic_score_codex":0.0008215569,"about_ca_topic_score_gemma":0.00068345515,"teacher_disagreement_score":0.018281784,"about_ca_system_score_codex":0.0014293805,"about_ca_system_score_gemma":0.0017589545,"threshold_uncertainty_score":0.096684515},"labels":[],"label_agreement":null},{"id":"W2118101551","doi":"10.1109/fitme.2009.156","title":"Casting Design through Multi-objective Optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Sensitivity (control systems); Computer science; Mathematical optimization; Casting; Multi-objective optimization; Process (computing); Evolutionary algorithm; Engineering design process; Optimization problem; Engineering optimization; Engineering; Algorithm; Mathematics; Artificial intelligence; Machine learning; Mechanical engineering; Materials science","score_opus":0.04437748358033325,"score_gpt":0.2972923484010716,"score_spread":0.2529148648207383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118101551","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.009067224,0.00016221937,0.98829657,0.00003972223,0.000013703762,0.00007274131,0.000015888822,0.00013592874,0.0021959797],"genre_scores_gemma":[0.31490064,0.00043661526,0.6813542,0.000041499276,0.00001630693,0.00041557912,0.000077075696,0.000097790646,0.002660191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993339,0.00025597535,0.000028923423,0.00006726944,0.00026750137,0.000046401987],"domain_scores_gemma":[0.9995834,0.00022922884,0.000057220434,0.000031504165,0.00008629331,0.000012423089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016225198,0.0009864907,0.001169052,0.0010319935,0.0004188366,0.001024895,0.00080633216,0.0008838843,0.0017734853],"category_scores_gemma":[0.0014389894,0.0005168203,0.0009460272,0.0006069434,0.00061117165,0.0006640668,0.00068653544,0.0007190994,0.00024928243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016485124,0.00001973026,0.00012806107,0.0000876467,0.000017847871,0.000020393836,0.000020066174,0.9685938,0.0040993984,0.0047394712,0.0001019477,0.022155233],"study_design_scores_gemma":[0.000009686313,0.000043271502,0.00007517112,0.0000109908315,0.000009520021,0.00001137582,0.000007430254,0.99518543,0.0017425774,0.001951728,0.0009476588,0.0000051948264],"about_ca_topic_score_codex":0.0014912362,"about_ca_topic_score_gemma":0.0020907451,"teacher_disagreement_score":0.0017734853,"about_ca_system_score_codex":0.000714159,"about_ca_system_score_gemma":0.001233378,"threshold_uncertainty_score":0.008580744},"labels":[],"label_agreement":null},{"id":"W2118311688","doi":"10.1017/s0890060401151024","title":"Kriging as a surrogate fitness landscape in evolutionary optimization","year":2001,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Institut de Recherche Robert-Sauvé en Santé et en Sécurité du Travail","keywords":"Kriging; Fitness landscape; Fitness approximation; Mathematical optimization; Surrogate model; Interpolation (computer graphics); Evolutionary algorithm; Fitness function; Computer science; Process (computing); Function (biology); Black box; Engineering design process; Mathematics; Genetic algorithm; Machine learning; Artificial intelligence; Engineering","score_opus":0.02283994912642328,"score_gpt":0.26412463775253625,"score_spread":0.24128468862611296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118311688","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.020345178,0.00057380553,0.97506547,0.00024043277,0.000023688526,0.000020049776,0.000024660376,0.000116513205,0.0035901826],"genre_scores_gemma":[0.589114,0.0010757741,0.4055346,0.00009584392,0.000024018429,0.00012230425,0.00008503156,0.00011745329,0.0038309395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.00033110272,0.000020720046,0.00005469761,0.00014544315,0.000029850955],"domain_scores_gemma":[0.9992812,0.00047146276,0.00005979341,0.00008649129,0.00008081581,0.000020240806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014220198,0.00046832138,0.00085063657,0.00053680904,0.0004469427,0.0009962266,0.00069502706,0.0013169083,0.00087454263],"category_scores_gemma":[0.0035565018,0.00039140525,0.0005228933,0.0009909302,0.0010176648,0.0011139644,0.00080632523,0.0010010374,0.00028440973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015515256,0.000010269796,0.00028838485,0.0000340323,0.000014716359,0.000041132378,0.00005146453,0.9428128,0.0013295225,0.040146206,0.00017335224,0.015082685],"study_design_scores_gemma":[0.0000043011883,0.000017084692,0.0001000551,0.0000089498735,0.0000040221157,0.00002112948,0.0000070391743,0.98453194,0.0004831195,0.013721061,0.0010932537,0.000007971456],"about_ca_topic_score_codex":0.0017813889,"about_ca_topic_score_gemma":0.0017684998,"teacher_disagreement_score":0.0017813889,"about_ca_system_score_codex":0.0007115581,"about_ca_system_score_gemma":0.00059842033,"threshold_uncertainty_score":0.0075204372},"labels":[],"label_agreement":null},{"id":"W2121400278","doi":"10.1109/cisda.2011.5945946","title":"Multi-objective evolutionary optimization of a military air transportation fleet mix with the flexibility objective","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Defence Research and Development Canada","funders":"","keywords":"Flexibility (engineering); Multi-objective optimization; Sorting; Task (project management); Computer science; Genetic algorithm; Mathematical optimization; Pareto principle; Monte Carlo method; Operations research; Fleet management; Stochastic programming; Engineering; Mathematics; Systems engineering; Algorithm","score_opus":0.020820380523508236,"score_gpt":0.24738306747208538,"score_spread":0.22656268694857715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121400278","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.6183226,0.00036379215,0.3703212,0.00030941548,0.000046803492,0.0001599444,0.00014058434,0.00014458968,0.010190983],"genre_scores_gemma":[0.8922699,0.0001117635,0.10423703,0.000041985277,0.000008119046,0.00018352624,0.00008558106,0.000038627895,0.0030235024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.00009536044,0.0000071561,0.000026053243,0.000054212596,0.000041943375],"domain_scores_gemma":[0.9995709,0.00027816658,0.000049948776,0.000017665088,0.00004646308,0.000036889396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009530381,0.0007000797,0.0005442926,0.0009622428,0.0003924316,0.0006658873,0.0004247611,0.00075404375,0.0011400568],"category_scores_gemma":[0.001512198,0.0004011887,0.0006312618,0.0008452455,0.00035867764,0.0004630717,0.00056012004,0.0004957063,0.00010057052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024160958,0.000024386894,0.00028203134,0.000012417547,0.000016527047,0.00003677293,0.0000149344605,0.99202603,0.0010421759,0.0012663989,0.00007533409,0.005178735],"study_design_scores_gemma":[0.000008181702,0.000038505343,0.00015862331,0.0000026537484,0.000006361618,0.000009118874,0.000010561456,0.99854517,0.00038154933,0.00067388965,0.0001627409,0.0000027346682],"about_ca_topic_score_codex":0.0033787698,"about_ca_topic_score_gemma":0.0033165277,"teacher_disagreement_score":0.0033787698,"about_ca_system_score_codex":0.0008337907,"about_ca_system_score_gemma":0.0006801744,"threshold_uncertainty_score":0.0067182183},"labels":[],"label_agreement":null},{"id":"W2121410096","doi":"10.4271/2004-01-0240","title":"Design Space Reduction for Multi-Objective Optimization and Robust Design Optimization Problems","year":2004,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":30,"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; Linear subspace; Computer science; Multi-objective optimization; Set (abstract data type); Pareto principle; Optimization problem; Reduction (mathematics); Engineering optimization; Point (geometry); Computation; Pareto optimal; Optimal design; Engineering design process; Mathematics; Algorithm; Engineering; Machine learning","score_opus":0.03414118991731742,"score_gpt":0.2673352140016915,"score_spread":0.23319402408437412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121410096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010194159,0.00031299287,0.9974885,0.000056463912,0.000017695998,0.000024733754,0.000018689845,0.000061198654,0.0010003209],"genre_scores_gemma":[0.13558374,0.0010105396,0.8593316,0.00011945413,0.00008312991,0.00065282127,0.00024956543,0.00013891891,0.0028302204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815744,0.00096820586,0.00006833834,0.00014979001,0.0005883876,0.00006783059],"domain_scores_gemma":[0.9989365,0.000728984,0.00007596796,0.00009712828,0.00013972021,0.000021805741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023007658,0.0014547387,0.0016351498,0.0014242742,0.00047050093,0.0010818214,0.0008544592,0.0008912524,0.0029204367],"category_scores_gemma":[0.0034907646,0.00059238187,0.0022594226,0.001086187,0.00097399694,0.00084914605,0.0012293854,0.0018725931,0.000905324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052579013,0.00004458065,0.00015494874,0.00035211406,0.00008334412,0.000057515197,0.000083609055,0.8570927,0.0027257067,0.0431708,0.0015623588,0.0946197],"study_design_scores_gemma":[0.00001624121,0.00004569435,0.000081137,0.00002967431,0.000018515895,0.000020840467,0.000013539324,0.967991,0.0010024287,0.027681882,0.0030884235,0.000010545674],"about_ca_topic_score_codex":0.0018451202,"about_ca_topic_score_gemma":0.0015753522,"teacher_disagreement_score":0.0029204367,"about_ca_system_score_codex":0.0008732679,"about_ca_system_score_gemma":0.000985089,"threshold_uncertainty_score":0.012167752},"labels":[],"label_agreement":null},{"id":"W2124035050","doi":"10.1109/cec.2008.4982907","title":"Optimizing the stochastic fleet estimation model using evolutionary computation","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Waterloo; Defence Research and Development Canada","funders":"","keywords":"Genetic algorithm; Computation; Computer science; Evolutionary computation; Monte Carlo method; Set (abstract data type); Mathematical optimization; Stochastic modelling; Function (biology); Evolutionary algorithm; Algorithm; Machine learning; Mathematics","score_opus":0.04387516469604175,"score_gpt":0.2919703577495393,"score_spread":0.24809519305349753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124035050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029674066,0.00007107903,0.9680855,0.00015795129,0.000012123783,0.000015644038,0.000037596805,0.00011293922,0.0018330902],"genre_scores_gemma":[0.8140673,0.00016274783,0.18302283,0.00007214801,0.000024628256,0.00014324897,0.00017979514,0.00008041779,0.0022468786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.00018966729,0.000016880213,0.00007166468,0.0001447211,0.00005748927],"domain_scores_gemma":[0.99931026,0.00042180394,0.00010322752,0.00005418573,0.00008788705,0.000022553746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009854884,0.00049795886,0.0006889054,0.000592451,0.0003444983,0.0008107538,0.0007792176,0.0009635116,0.00095344905],"category_scores_gemma":[0.00294843,0.00039605607,0.0006399027,0.00070815,0.0006261106,0.00092990353,0.0005890945,0.0006710242,0.00012506162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025997067,0.0000022468353,0.000058923648,0.0000019416293,0.0000034206703,0.000006112426,0.000002017803,0.99662906,0.00013853113,0.0018995001,0.000027780734,0.0012279354],"study_design_scores_gemma":[0.0000011835407,0.0000024094497,0.000025015077,6.055384e-7,8.71444e-7,0.0000020382402,6.984296e-7,0.99868804,0.00006228019,0.001173563,0.000042132688,0.000001167651],"about_ca_topic_score_codex":0.009916169,"about_ca_topic_score_gemma":0.0061496394,"teacher_disagreement_score":0.009916169,"about_ca_system_score_codex":0.0009776284,"about_ca_system_score_gemma":0.001181027,"threshold_uncertainty_score":0.019716859},"labels":[],"label_agreement":null},{"id":"W2126489459","doi":"10.1016/j.inffus.2008.11.003","title":"Overfitting cautious selection of classifier ensembles with genetic algorithms","year":2008,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"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":"Overfitting; Computer science; Artificial intelligence; Machine learning; Classifier (UML); Ensemble learning; Selection (genetic algorithm); Random subspace method; Data mining; Pattern recognition (psychology); Artificial neural network","score_opus":0.011274993820370434,"score_gpt":0.21826553205423144,"score_spread":0.20699053823386102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126489459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03893035,0.00018755998,0.9583065,0.00019939968,0.00006735676,0.00006951033,0.000021652362,0.00050339365,0.0017142255],"genre_scores_gemma":[0.54321104,0.00013098096,0.45330012,0.0002926188,0.00007388048,0.00017562509,0.00012955663,0.0002041005,0.0024821092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973501,0.0010642326,0.00015159247,0.00039773952,0.0008077109,0.00022860155],"domain_scores_gemma":[0.9957094,0.0018813976,0.00029169503,0.000548919,0.0014469237,0.00012167637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064010182,0.0012111409,0.0019379164,0.0019412099,0.0014016685,0.0018544896,0.0016205381,0.0019288238,0.0013460573],"category_scores_gemma":[0.016128482,0.00065178575,0.0013397672,0.0011684607,0.0009070673,0.0020225719,0.0015760056,0.0019020657,0.0005278908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029527227,0.00015836515,0.0035150012,0.00007000268,0.00031361476,0.00013862368,0.00027506816,0.67842335,0.008144648,0.01083026,0.0020915996,0.2957442],"study_design_scores_gemma":[0.000010198188,0.000033263797,0.00026404642,0.000010706931,0.00003432003,0.00003446464,0.0000207996,0.9927054,0.0020619994,0.0044602156,0.0003558253,0.000008791723],"about_ca_topic_score_codex":0.004619428,"about_ca_topic_score_gemma":0.005351166,"teacher_disagreement_score":0.0064010182,"about_ca_system_score_codex":0.0010516249,"about_ca_system_score_gemma":0.001500574,"threshold_uncertainty_score":0.03385222},"labels":[],"label_agreement":null},{"id":"W2126901434","doi":"10.1504/ijise.2010.033997","title":"A computational intelligent approach to estimate the Weibull parameters","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Weibull distribution; Censoring (clinical trials); Sample size determination; Statistics; Shape parameter; Scale parameter; Warranty; Mathematics; Computer science","score_opus":0.02893584695091346,"score_gpt":0.28629667725962704,"score_spread":0.2573608303087136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126901434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015245407,0.00008118833,0.9972082,0.00007556954,0.00001213654,0.000016146436,0.000013827714,0.00009037369,0.0009780672],"genre_scores_gemma":[0.08603468,0.0003724148,0.91133034,0.00009851743,0.0000506141,0.00021944642,0.00008300509,0.000077432436,0.0017335108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.00018786274,0.000032158565,0.00007714733,0.00020540175,0.0000239708],"domain_scores_gemma":[0.998528,0.000964156,0.00011543712,0.00010192693,0.00027046315,0.000019936017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014685064,0.00085662724,0.0007141709,0.0016295896,0.00053661794,0.0009723591,0.0012451338,0.0011299815,0.0023551963],"category_scores_gemma":[0.0060530133,0.0004677365,0.0008360318,0.0014403085,0.00062668044,0.0012176202,0.00075467274,0.0012235483,0.00057338295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019451894,0.000029772229,0.00061192317,0.00008436964,0.00004889809,0.00004147672,0.00005449953,0.84967667,0.0017541032,0.031540442,0.00081327255,0.11532517],"study_design_scores_gemma":[0.000004043569,0.000011854327,0.00012358985,0.000010604384,0.0000070126475,0.00003072858,0.000009563047,0.98590183,0.00048687612,0.011929695,0.0014758642,0.000008375329],"about_ca_topic_score_codex":0.0022010838,"about_ca_topic_score_gemma":0.00219707,"teacher_disagreement_score":0.0023551963,"about_ca_system_score_codex":0.00057239924,"about_ca_system_score_gemma":0.0009880352,"threshold_uncertainty_score":0.0078789},"labels":[],"label_agreement":null},{"id":"W2128628754","doi":"10.1007/s10479-011-1045-6","title":"Multiobjective scatter search for a commercial territory design problem","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":45,"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; HEC Montréal","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Universidad de León; Ministerio de Ciencia e Innovación; Universidad Autónoma de Nuevo León; Consejo Nacional de Ciencia y Tecnología","keywords":"Tabu search; Heuristics; Mathematical optimization; Metaheuristic; Sorting; Computer science; Local search (optimization); Theory of computation; Genetic algorithm; Multi-objective optimization; Heuristic; Mathematics; Algorithm","score_opus":0.3634122278103288,"score_gpt":0.4893909142891731,"score_spread":0.1259786864788443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128628754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14728695,0.0010868788,0.8374612,0.00068736175,0.00006821222,0.00022914645,0.00023941511,0.00019640071,0.012744462],"genre_scores_gemma":[0.73123634,0.0005881321,0.25691178,0.00010216039,0.000053992993,0.00040218837,0.00029778734,0.00013514319,0.010272533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947625,0.00027786425,0.000016303773,0.00006725155,0.000097046475,0.00006520868],"domain_scores_gemma":[0.99843353,0.0012027284,0.00009958457,0.000049529037,0.00010887336,0.00010566477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786942,0.001311139,0.0020872003,0.0022523853,0.0008742211,0.0016055095,0.0011286911,0.00330892,0.0049530193],"category_scores_gemma":[0.0034891993,0.0010823533,0.0015898289,0.0021176704,0.0011410112,0.0013893937,0.0014995128,0.0013448098,0.00038859047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005578306,0.000049555703,0.0002931782,0.000054829732,0.00003514428,0.00005662538,0.000031490752,0.9868667,0.00038640146,0.003720274,0.00046254098,0.007987382],"study_design_scores_gemma":[0.00002215684,0.000050872477,0.00009759568,0.000009878025,0.000012834481,0.000016435664,0.000024347111,0.9964217,0.0001071132,0.0029274742,0.00030491367,0.0000047348076],"about_ca_topic_score_codex":0.0068908385,"about_ca_topic_score_gemma":0.005749224,"teacher_disagreement_score":0.0068908385,"about_ca_system_score_codex":0.0011677492,"about_ca_system_score_gemma":0.0013101777,"threshold_uncertainty_score":0.016569555},"labels":[],"label_agreement":null},{"id":"W2131420534","doi":"10.1108/03321640710751217","title":"Hybrid genetic algorithms using quadratic local search operators","year":2007,"lang":"en","type":"article","venue":"COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Mathematical optimization; Local search (optimization); Benchmark (surveying); Algorithm; Computer science; Quadratic equation; Convergence (economics); Operator (biology); Optimization problem; Function (biology); Genetic algorithm; Mathematics","score_opus":0.01582700624974915,"score_gpt":0.29988942850420613,"score_spread":0.284062422254457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131420534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009641016,0.00021445092,0.98677224,0.00006603465,0.000022688462,0.000040752082,0.000013820853,0.00022326883,0.003005726],"genre_scores_gemma":[0.5138453,0.00041116617,0.47876146,0.00022441741,0.00005233167,0.00040565012,0.00009971776,0.00015140173,0.006048505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999113,0.00038163655,0.000030448968,0.00010527414,0.0003141901,0.000055406574],"domain_scores_gemma":[0.9990907,0.0005559413,0.0000869231,0.00007007605,0.0001715843,0.000024751118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001604368,0.00068910926,0.0008384674,0.00083772716,0.00033161105,0.0007888836,0.0013631164,0.0008540306,0.0019762754],"category_scores_gemma":[0.002716335,0.0003099931,0.00081333285,0.00092526455,0.00080990983,0.00077090046,0.00088666665,0.00075618847,0.00044460982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005395473,0.0000419196,0.00032059828,0.000076944314,0.000076263736,0.00005924519,0.00006365405,0.922964,0.003032887,0.01960942,0.00066033663,0.0530408],"study_design_scores_gemma":[0.000018076556,0.000054298784,0.0000909297,0.000008289028,0.000012808019,0.000025660207,0.000008542369,0.9937265,0.00062404014,0.00451449,0.0009100831,0.0000063167345],"about_ca_topic_score_codex":0.0020375757,"about_ca_topic_score_gemma":0.0016472584,"teacher_disagreement_score":0.0020375757,"about_ca_system_score_codex":0.00068197463,"about_ca_system_score_gemma":0.00057394855,"threshold_uncertainty_score":0.008484781},"labels":[],"label_agreement":null},{"id":"W2131534747","doi":"10.1177/1063293x06063842","title":"Modeling of Non-linear Relations among Different Design and Manufacturing Evaluation Measures for Multiobjective Optimal Concurrent Design","year":2006,"lang":"en","type":"article","venue":"Concurrent Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":30,"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":"Measure (data warehouse); Weighting; Calipers; Relation (database); Multi-objective optimization; Concurrent engineering; Computer science; Engineering; Industrial engineering; Mathematical optimization; Mathematics; Data mining; Scheduling (production processes)","score_opus":0.03447491840577782,"score_gpt":0.2751872620252006,"score_spread":0.2407123436194228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131534747","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.0056291157,0.000048001657,0.99377006,0.00001766406,0.0000040679256,0.000022159478,0.0000048566953,0.000031053416,0.0004730585],"genre_scores_gemma":[0.5004064,0.00022159034,0.49660426,0.000042705346,0.000020994692,0.00046608312,0.000052524014,0.0000917839,0.002093758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965701,0.0014261223,0.0001329142,0.00047532926,0.0012464616,0.00014909694],"domain_scores_gemma":[0.99344206,0.0044765617,0.0009614817,0.000348116,0.0006879393,0.0000837996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054091495,0.001879198,0.001060802,0.0013491124,0.00044581425,0.0013543318,0.0017942274,0.00092062145,0.0011930173],"category_scores_gemma":[0.012642157,0.0009925474,0.0013787545,0.0011908313,0.0010613747,0.0022599192,0.001175827,0.00169713,0.00025360886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019921772,0.00004356484,0.00039270366,0.000051781128,0.000031352076,0.000026878583,0.00005105545,0.9720452,0.0014403152,0.010490269,0.000051913692,0.015355123],"study_design_scores_gemma":[0.0000026726157,0.000025130967,0.00009084952,0.0000043131263,0.0000061040705,0.000008303412,0.0000038712715,0.99573,0.00039600956,0.0035794175,0.0001478376,0.000005404097],"about_ca_topic_score_codex":0.0025304733,"about_ca_topic_score_gemma":0.0025341602,"teacher_disagreement_score":0.0054091495,"about_ca_system_score_codex":0.0014631595,"about_ca_system_score_gemma":0.0013038893,"threshold_uncertainty_score":0.028606653},"labels":[],"label_agreement":null},{"id":"W2135491697","doi":"10.2514/6.2006-7048","title":"Comparison of Three Surrogate Modeling Techniques: Datascape, Kriging, and Second Order Regression","year":2006,"lang":"en","type":"article","venue":"11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Kriging; Surrogate model; Robustness (evolution); Computer science; Data mining; Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.02758020689390097,"score_gpt":0.31733893492933113,"score_spread":0.2897587280354302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135491697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1843484,0.0017990627,0.80140966,0.0005131533,0.00009437545,0.0001523158,0.0006128757,0.001844077,0.009226037],"genre_scores_gemma":[0.6687882,0.0016260038,0.32460284,0.00008435725,0.000015899537,0.00026617816,0.0008159808,0.00034815108,0.0034524237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826247,0.00086944894,0.00012086763,0.000114254595,0.0005669522,0.000066068125],"domain_scores_gemma":[0.9947067,0.003224036,0.00048351497,0.0007258551,0.0007954981,0.00006438805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031409827,0.0009604169,0.00093163643,0.001336935,0.00029083635,0.0012314228,0.0007807509,0.00084059854,0.0014580236],"category_scores_gemma":[0.007845775,0.00042403408,0.00081111625,0.0020244468,0.00035521944,0.0014591493,0.00076849794,0.0007995451,0.0003307078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005746894,0.00019641953,0.004237842,0.0006055296,0.00017794441,0.00007417904,0.00014252166,0.7881762,0.006371578,0.010634128,0.0016428011,0.18716615],"study_design_scores_gemma":[0.000053135027,0.0002940997,0.0016000846,0.000035334142,0.00003738673,0.00006585253,0.000053499345,0.9832252,0.010209976,0.0016124758,0.0027726302,0.00004041664],"about_ca_topic_score_codex":0.0038319211,"about_ca_topic_score_gemma":0.005626572,"teacher_disagreement_score":0.0038319211,"about_ca_system_score_codex":0.00064940756,"about_ca_system_score_gemma":0.0008057745,"threshold_uncertainty_score":0.016611338},"labels":[],"label_agreement":null},{"id":"W2138002307","doi":"10.1007/s00158-009-0420-2","title":"Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions","year":2009,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":588,"is_retracted":false,"has_abstract":false,"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":"Computer science; Black box; Curse of dimensionality; Mathematical optimization; Engineering optimization; Optimization problem; Industrial engineering; Management science; Data science; Machine learning; Artificial intelligence; Algorithm; Engineering; Mathematics","score_opus":0.021485025260407235,"score_gpt":0.26375841630971775,"score_spread":0.2422733910493105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138002307","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.0014279829,0.006617754,0.9878328,0.00015828783,0.00006242577,0.00003781518,0.000045417743,0.0001790466,0.0036384962],"genre_scores_gemma":[0.06121519,0.026536211,0.90606403,0.00032173263,0.00024455934,0.00054501684,0.0003472377,0.00032106228,0.0044050124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00024024802,0.00006680066,0.00007462309,0.0003326612,0.000034136407],"domain_scores_gemma":[0.9989489,0.00061472115,0.00007740345,0.00012673294,0.00020470255,0.000027647788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018608237,0.0026430616,0.0031717375,0.0015895405,0.00070115464,0.0016938219,0.0028569754,0.0019773298,0.0036239212],"category_scores_gemma":[0.003034254,0.0014295215,0.0017402214,0.0026140509,0.0007711341,0.0017282425,0.0012627557,0.0020154037,0.0017945383],"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.00004773936,0.00015159634,0.0004109752,0.0014229367,0.00015862421,0.000060599137,0.000056130728,0.72695124,0.0021981655,0.061495997,0.003845731,0.20320024],"study_design_scores_gemma":[0.000017823726,0.00003375842,0.00008104151,0.000113877766,0.000030592113,0.000041634004,0.000010170646,0.9746449,0.0007355843,0.016276326,0.007997469,0.000016666796],"about_ca_topic_score_codex":0.0016498993,"about_ca_topic_score_gemma":0.0024262213,"teacher_disagreement_score":0.0036239212,"about_ca_system_score_codex":0.0005525927,"about_ca_system_score_gemma":0.0012683844,"threshold_uncertainty_score":0.012123287},"labels":[],"label_agreement":null},{"id":"W2139642264","doi":"10.1109/iwfhr.2004.105","title":"Unsupervised Feature Selection for Ensemble of Classifiers","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Random subspace method; Computer science; Artificial intelligence; Hidden Markov model; Feature selection; Pattern recognition (psychology); Feature (linguistics); Machine learning; Context (archaeology); Selection (genetic algorithm); Set (abstract data type); Cascading classifiers; Ensemble learning; Support vector machine","score_opus":0.015412840965242924,"score_gpt":0.2631135485831697,"score_spread":0.24770070761792679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139642264","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.013004685,0.00015728887,0.9858285,0.000043569456,0.000022796074,0.000042763477,0.000033072512,0.00035197788,0.00051536504],"genre_scores_gemma":[0.44705415,0.00021678828,0.5497525,0.0001043386,0.00011457768,0.00037729248,0.00047393562,0.0001342466,0.0017721143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891865,0.0003361042,0.000055152206,0.00022108186,0.00037206215,0.00009701351],"domain_scores_gemma":[0.99828327,0.00081461325,0.00015098629,0.00020258086,0.0004933555,0.000055181292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001646537,0.00087262905,0.0012253392,0.0014056026,0.0005246548,0.00060125085,0.0009366299,0.0007682798,0.0010265773],"category_scores_gemma":[0.004134131,0.00035280368,0.00081368984,0.0010445929,0.00033148716,0.0010242161,0.0006797435,0.00077896216,0.00045146185],"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.00013181678,0.0001633025,0.0032007766,0.00009728667,0.0002840439,0.00016318294,0.000112245696,0.3806537,0.017799832,0.007091843,0.0029747896,0.58732706],"study_design_scores_gemma":[0.000008931214,0.00007016682,0.00070707937,0.000008741813,0.000029817713,0.00005179335,0.0000147739775,0.9882246,0.0045290296,0.005018689,0.0013257025,0.000010618022],"about_ca_topic_score_codex":0.0012036585,"about_ca_topic_score_gemma":0.001831511,"teacher_disagreement_score":0.001646537,"about_ca_system_score_codex":0.00045025485,"about_ca_system_score_gemma":0.0005199131,"threshold_uncertainty_score":0.008707821},"labels":[],"label_agreement":null},{"id":"W2143083947","doi":"10.5267/j.ijiec.2013.09.007","title":"A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":51,"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; Computer science; Algorithm; Mathematics","score_opus":0.016273509657610593,"score_gpt":0.2571568847819251,"score_spread":0.2408833751243145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143083947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075822095,0.00023032598,0.9890076,0.00007260992,0.00003333899,0.00005760747,0.000018087623,0.0002705159,0.0027277449],"genre_scores_gemma":[0.241399,0.0002924276,0.7524505,0.00015454393,0.000058956848,0.00047727616,0.00017006189,0.00012212263,0.0048751556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00009811285,0.000020314326,0.000057116395,0.0001740126,0.000042586646],"domain_scores_gemma":[0.99956673,0.00021370543,0.000053332536,0.00002684684,0.00011116113,0.000028170443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081862597,0.0008113937,0.0010383036,0.00075922516,0.00040959753,0.00065625494,0.0014536177,0.0011414634,0.0026604382],"category_scores_gemma":[0.0015745508,0.00033661164,0.00074343465,0.0008312046,0.00046931658,0.0006659695,0.00097600854,0.00093922904,0.0005077116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058436344,0.00007982214,0.00047049168,0.00011917285,0.000046235946,0.000055219094,0.000050210143,0.8355452,0.0022875601,0.005901777,0.0014354804,0.15395032],"study_design_scores_gemma":[0.000013172366,0.000030350999,0.00005946859,0.000005183009,0.000004798183,0.000013848682,0.0000031015493,0.9982785,0.00031190412,0.0006534403,0.0006232534,0.0000030584508],"about_ca_topic_score_codex":0.0034126672,"about_ca_topic_score_gemma":0.003567352,"teacher_disagreement_score":0.0034126672,"about_ca_system_score_codex":0.00056566775,"about_ca_system_score_gemma":0.0011723718,"threshold_uncertainty_score":0.008899987},"labels":[],"label_agreement":null},{"id":"W2146220287","doi":"10.1177/0021998314568168","title":"Curved fiber paths optimization of a composite cylindrical shell via Kriging-based approach","year":2015,"lang":"en","type":"article","venue":"Journal of Composite Materials","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Materials science; Composite laminates; Sequential quadratic programming; Finite element method; Curvilinear coordinates; Fiber; Shell (structure); Buckling; Flexibility (engineering); Maximization; Minification; Displacement (psychology); Structural engineering; Kriging; Optimal design; Quadratic programming; Composite number; Computer science; Composite material; Mathematical optimization; Mathematics; Geometry; Engineering","score_opus":0.022358493526088357,"score_gpt":0.26567186096578954,"score_spread":0.2433133674397012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146220287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09612113,0.00020139078,0.90018946,0.00007982418,0.0000116517085,0.00005966218,0.00008555525,0.0003545612,0.0028967187],"genre_scores_gemma":[0.6441344,0.00016954646,0.35217336,0.00003512627,0.000006799454,0.00018856533,0.00018587911,0.00013914467,0.0029670908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987376,0.000044856737,0.000004771854,0.00002443943,0.00003185148,0.00002035524],"domain_scores_gemma":[0.9996313,0.00019339252,0.00005364783,0.000019590565,0.00008295804,0.0000191963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195977,0.0009299213,0.000750639,0.00061602,0.00031677377,0.00047293084,0.0005629902,0.000983402,0.0011993255],"category_scores_gemma":[0.00089949527,0.0005112928,0.0005302421,0.00042181165,0.00047752712,0.00037090408,0.00039062134,0.00042615688,0.00024068396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010570474,0.000006741133,0.00010826034,0.000013693568,0.0000044358253,0.000013822042,0.000008407344,0.995174,0.0011084367,0.0004694039,0.00004571467,0.0030364955],"study_design_scores_gemma":[0.000001733274,0.000008094132,0.000032692067,0.0000014973295,0.0000012894291,0.00000256088,0.0000023505472,0.9994497,0.0002533361,0.00017477582,0.00007026321,0.0000016805668],"about_ca_topic_score_codex":0.008366675,"about_ca_topic_score_gemma":0.010931862,"teacher_disagreement_score":0.008366675,"about_ca_system_score_codex":0.00065142405,"about_ca_system_score_gemma":0.0013254761,"threshold_uncertainty_score":0.016635954},"labels":[],"label_agreement":null},{"id":"W2147614493","doi":"10.1109/tmag.2010.2043512","title":"Reducing the Design Space of Standard Electromagnetic Devices Using Bayesian Response Surfaces","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Set (abstract data type); Space (punctuation); Bayesian probability; Bayesian optimization; Design of experiments; Parameter space; Artificial intelligence; Mathematics; Statistics; Programming language","score_opus":0.017158156437938898,"score_gpt":0.26733003916599435,"score_spread":0.25017188272805546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147614493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010700949,0.00010437545,0.98671365,0.00009129612,0.00000879724,0.000036256224,0.000038895545,0.00028116597,0.0020246739],"genre_scores_gemma":[0.28664157,0.00029990077,0.7088674,0.0001525738,0.000027032,0.00039618099,0.0002499607,0.0003099459,0.003055444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607325,0.0016460894,0.00013232848,0.00033860444,0.0016658455,0.00014399659],"domain_scores_gemma":[0.9949905,0.0034099487,0.0004511315,0.00061908906,0.000467351,0.000062016596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053796847,0.0013052933,0.0015196949,0.0017397502,0.00043052633,0.0014125354,0.0013461963,0.0009603996,0.003174309],"category_scores_gemma":[0.010195543,0.0011579986,0.001933303,0.0007029826,0.0010788814,0.0015653499,0.0016084418,0.0016028159,0.00067436503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013863514,0.000093480965,0.0009336047,0.00018501043,0.000079884114,0.000048049118,0.00010586691,0.884187,0.00453561,0.04177135,0.00074594765,0.06717559],"study_design_scores_gemma":[0.000028414073,0.00015049434,0.00024928895,0.000031640684,0.000028408167,0.00003507636,0.00002832236,0.957304,0.003297175,0.0355588,0.0032636619,0.00002473097],"about_ca_topic_score_codex":0.0012096311,"about_ca_topic_score_gemma":0.0016271553,"teacher_disagreement_score":0.0053796847,"about_ca_system_score_codex":0.0010916148,"about_ca_system_score_gemma":0.0013594733,"threshold_uncertainty_score":0.028450847},"labels":[],"label_agreement":null},{"id":"W2148259137","doi":"10.1109/cisda.2009.5356525","title":"Minimizing risk on a fleet mix problem with a multiobjective evolutionary algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Defence Research and Development Canada; University of Waterloo","funders":"","keywords":"Sorting; Mathematical optimization; Genetic algorithm; Computer science; Monte Carlo method; Multi-objective optimization; Set (abstract data type); Task (project management); Evolutionary algorithm; Pareto principle; Pareto optimal; Duration (music); Algorithm; Engineering; Mathematics","score_opus":0.006984395624691636,"score_gpt":0.2354641947237092,"score_spread":0.22847979909901756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148259137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04395619,0.00022203832,0.9522005,0.00021387149,0.000017078622,0.00009778928,0.000047731326,0.00009759465,0.0031473057],"genre_scores_gemma":[0.5908534,0.0003124368,0.40161955,0.0001028646,0.000041108873,0.0006201695,0.00014432931,0.00011375589,0.006192302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987607,0.0006542324,0.000044600587,0.0001306157,0.00030532532,0.0001045816],"domain_scores_gemma":[0.9986185,0.00092641276,0.00016066876,0.000064038104,0.00014131787,0.00008907878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027802626,0.0013384484,0.0014863089,0.0015371164,0.0006073204,0.0013201691,0.0011982191,0.0017428801,0.0023515676],"category_scores_gemma":[0.004539759,0.00093557796,0.0012098806,0.0012466557,0.00071403786,0.0015419553,0.0018601711,0.0010981158,0.00025633175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019081855,0.000016637126,0.00013686939,0.000014273492,0.000025367402,0.000022913822,0.000016474218,0.99135065,0.00024494473,0.0027694863,0.00009476959,0.0052885013],"study_design_scores_gemma":[0.0000085232905,0.00002405583,0.00005126588,0.0000052196974,0.000008338977,0.000009606573,0.000005819529,0.99652666,0.00012238784,0.0030676783,0.00016677762,0.0000035716162],"about_ca_topic_score_codex":0.0029419484,"about_ca_topic_score_gemma":0.0018810906,"teacher_disagreement_score":0.0029419484,"about_ca_system_score_codex":0.0014123255,"about_ca_system_score_gemma":0.001199321,"threshold_uncertainty_score":0.014703572},"labels":[],"label_agreement":null},{"id":"W2149775970","doi":"10.1098/rspa.2014.0697","title":"Reduced dimensional Gaussian process emulators of parametrized partial differential equations based on Isomap","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":32,"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":"Isomap; Dimensionality reduction; Emulation; Curse of dimensionality; Subspace topology; Gaussian process; Nonlinear dimensionality reduction; Mathematics; Kernel (algebra); Nonlinear system; Algorithm; Mathematical optimization; Computer science; Gaussian; Applied mathematics; Artificial intelligence","score_opus":0.009284712542864781,"score_gpt":0.23819348932994813,"score_spread":0.22890877678708335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149775970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002130418,0.00003764652,0.9969503,0.000039214345,0.000009846161,0.000016037702,0.000012341483,0.00011361903,0.00069057045],"genre_scores_gemma":[0.23496412,0.0004254312,0.75634354,0.00022040454,0.00005723866,0.0003813657,0.00027854572,0.0004888674,0.006840443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00023504155,0.000022016473,0.000066478664,0.00017011202,0.000030660183],"domain_scores_gemma":[0.99904054,0.00052240543,0.000069846225,0.00015192908,0.00017605754,0.000039323815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018181076,0.0009000697,0.0009391579,0.0005992208,0.00040539485,0.0011634745,0.0012031634,0.0010420518,0.0026897807],"category_scores_gemma":[0.004476533,0.0005259805,0.0012949915,0.0005915011,0.001115427,0.0019800796,0.0016646453,0.001684609,0.0011061429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007240763,0.000057536356,0.00045087968,0.00012610748,0.000060317256,0.000094260446,0.00017107767,0.7645715,0.0043337485,0.1525628,0.0015279212,0.07597143],"study_design_scores_gemma":[0.0000032104326,0.000010250621,0.000032958425,0.000004799099,0.0000022017055,0.000014570862,0.000005881156,0.9845014,0.00076579826,0.013841216,0.00080998964,0.0000076157107],"about_ca_topic_score_codex":0.0012159415,"about_ca_topic_score_gemma":0.0010764402,"teacher_disagreement_score":0.0026897807,"about_ca_system_score_codex":0.0006328871,"about_ca_system_score_gemma":0.0009008195,"threshold_uncertainty_score":0.009615183},"labels":[],"label_agreement":null},{"id":"W2151238122","doi":"10.1023/a:1012771025575","title":"A Taxonomy of Global Optimization Methods Based on Response Surfaces","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2137,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; RAND Corporation","keywords":"Mathematics; Simple (philosophy); Mathematical optimization; Theme (computing); Management science; Algorithm; Computer science; Epistemology; Engineering","score_opus":0.02457143740247184,"score_gpt":0.3308629553278328,"score_spread":0.3062915179253609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151238122","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.0008097886,0.0069435723,0.9875563,0.00027145352,0.000120254525,0.000077623576,0.000060730144,0.0003822264,0.0037780793],"genre_scores_gemma":[0.039644748,0.019852713,0.93358326,0.00032596177,0.00044528267,0.00063874555,0.00040349754,0.00057393836,0.0045317654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996443,0.0010356234,0.0003063528,0.00044192618,0.0016492235,0.00012385695],"domain_scores_gemma":[0.997472,0.0011540542,0.00018106894,0.0005317055,0.0005969719,0.00006422179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971481,0.002490816,0.0037346217,0.004114278,0.00081554824,0.0037797436,0.003399676,0.0028305438,0.0038835946],"category_scores_gemma":[0.006563186,0.001294294,0.0034307856,0.0054770485,0.0017119168,0.0036338505,0.0026382543,0.0042674053,0.0026103896],"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.00007366251,0.0001465707,0.0008011771,0.0018566665,0.00025394437,0.00010341215,0.00026191623,0.16009627,0.006364935,0.33135206,0.008934222,0.48975518],"study_design_scores_gemma":[0.000043689593,0.0002894021,0.0006460665,0.0005405967,0.00009939956,0.00033395475,0.00010453906,0.6537436,0.004136764,0.26191863,0.07798925,0.00015403103],"about_ca_topic_score_codex":0.0007798282,"about_ca_topic_score_gemma":0.0007620844,"teacher_disagreement_score":0.004114278,"about_ca_system_score_codex":0.0006656382,"about_ca_system_score_gemma":0.00093846157,"threshold_uncertainty_score":0.021003485},"labels":[],"label_agreement":null},{"id":"W2152762978","doi":"10.1109/cec.2007.4425018","title":"Virtual Reality High Dimensional Objective Spaces for Multi-objective Optimization: An Improved Representation","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"","keywords":"Multi-objective optimization; Mathematical optimization; Representation (politics); Mathematics; Knapsack problem; Pareto principle; Similarity (geometry); Space (punctuation); Genetic programming; Optimization problem; Computer science; Theoretical computer science; Algorithm; Artificial intelligence; Image (mathematics)","score_opus":0.03380054065247252,"score_gpt":0.33189549783470673,"score_spread":0.2980949571822342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152762978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028383443,0.00015519225,0.99534696,0.00007391627,0.000020221927,0.000016905562,0.000020259413,0.0000872388,0.0014408975],"genre_scores_gemma":[0.16110739,0.0005661889,0.835822,0.00010110127,0.00004336236,0.00022752018,0.00013283912,0.0001068914,0.0018927468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868125,0.00070636225,0.00006110476,0.00010459461,0.00038831923,0.00005833783],"domain_scores_gemma":[0.9987602,0.0006406934,0.00013341695,0.00023100073,0.0001966181,0.000038062397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221699,0.001188034,0.00092381367,0.0011769655,0.0004099018,0.0022345548,0.0011006063,0.0010064744,0.0025223116],"category_scores_gemma":[0.0038301377,0.00041650364,0.0013946627,0.0010026242,0.000913838,0.0021779817,0.0017422048,0.0019548035,0.00057152944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007623923,0.000052481922,0.00030524732,0.00021053418,0.000054738324,0.000111330795,0.00024445824,0.68192375,0.006346061,0.18338948,0.0013597329,0.12592602],"study_design_scores_gemma":[0.000014317655,0.0000696377,0.00015459867,0.000044285447,0.000014726135,0.00009326956,0.000041357776,0.9495455,0.0025992966,0.04081525,0.0065757534,0.000032037395],"about_ca_topic_score_codex":0.0009838645,"about_ca_topic_score_gemma":0.00069227477,"teacher_disagreement_score":0.0025223116,"about_ca_system_score_codex":0.0005974039,"about_ca_system_score_gemma":0.00059768645,"threshold_uncertainty_score":0.0096367},"labels":[],"label_agreement":null},{"id":"W2153365440","doi":"10.1155/2011/695087","title":"A Novel Ranking Method Based on Subjective Probability Theory for Evolutionary Multiobjective Optimization","year":2011,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ranking (information retrieval); Multi-objective optimization; Pareto principle; Mathematical optimization; Set (abstract data type); Preference; Computer science; Transitive relation; Pareto optimal; Decision maker; Mathematics; Artificial intelligence; Operations research; Statistics","score_opus":0.03152620258173917,"score_gpt":0.26019325520533504,"score_spread":0.22866705262359588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153365440","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.0011527117,0.00014694451,0.9976846,0.000037648424,0.00004351417,0.000025951771,0.000011380854,0.00006505753,0.00083216996],"genre_scores_gemma":[0.16499174,0.0006622412,0.82968706,0.0001261388,0.00019796462,0.0002593114,0.00013659487,0.000098880366,0.003840119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981908,0.00061520824,0.00012764179,0.00020236438,0.00079946645,0.0000643866],"domain_scores_gemma":[0.99845433,0.00075742864,0.000119951466,0.000115313516,0.00048406777,0.00006882258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022183182,0.0008559679,0.001136425,0.0020365599,0.0005716686,0.0013775969,0.001109659,0.0007824241,0.0021052794],"category_scores_gemma":[0.0045786365,0.00033783464,0.0011152889,0.0016327337,0.0007934811,0.001883461,0.00077460444,0.0011589598,0.00056953944],"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.00008580263,0.00013371395,0.0010683022,0.0004954979,0.00018827364,0.000236908,0.00018379411,0.33121118,0.013605431,0.17302103,0.006027191,0.4737429],"study_design_scores_gemma":[0.000022074211,0.00011452272,0.00036548707,0.000022294003,0.000037668895,0.0001716328,0.000020484404,0.9688251,0.002288664,0.022783326,0.0052931546,0.000055594042],"about_ca_topic_score_codex":0.001189927,"about_ca_topic_score_gemma":0.0012338725,"teacher_disagreement_score":0.0022183182,"about_ca_system_score_codex":0.0006928606,"about_ca_system_score_gemma":0.0009448072,"threshold_uncertainty_score":0.011731744},"labels":[],"label_agreement":null},{"id":"W2154275070","doi":"10.1109/tmtt.2007.902618","title":"Interpolated Coarse Models for Microwave Design Optimization With Space Mapping","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":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":"McMaster University","funders":"","keywords":"Space mapping; Interpolation (computer graphics); Surrogate model; Overhead (engineering); Computer science; Mathematical optimization; Reduction (mathematics); Parameter space; Space (punctuation); Microwave; Process (computing); Algorithm; Mathematics","score_opus":0.019762351674073093,"score_gpt":0.2545360727206209,"score_spread":0.2347737210465478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154275070","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.0070355157,0.00007197627,0.989824,0.000045774115,0.000013713663,0.000022770746,0.000036020116,0.00025413977,0.0026960925],"genre_scores_gemma":[0.3958584,0.000273619,0.5979813,0.000089932895,0.000030389354,0.00032980114,0.00021641348,0.00023976376,0.0049804565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972147,0.00009430932,0.000009063018,0.000024589084,0.0001319012,0.000018690393],"domain_scores_gemma":[0.9994962,0.00029293454,0.00003607411,0.000107452506,0.000053728534,0.000013566602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070121477,0.00067693193,0.00071226986,0.0006719752,0.0003009613,0.00072358176,0.00064718694,0.00083820627,0.0040382654],"category_scores_gemma":[0.0022110613,0.00042241628,0.0007040587,0.00050624635,0.0005194145,0.00088667125,0.0008986147,0.0009213138,0.0006255121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020759224,0.000013624091,0.000114223,0.000025529996,0.000005165404,0.000018808738,0.000022674758,0.9727349,0.001586744,0.010713684,0.00028467123,0.01445915],"study_design_scores_gemma":[0.0000037845691,0.000010085537,0.000027381544,0.0000028975517,0.0000017345521,0.0000049966984,0.0000035028427,0.99377835,0.0005626841,0.0047295373,0.00087222597,0.0000027672265],"about_ca_topic_score_codex":0.0021141134,"about_ca_topic_score_gemma":0.0024081487,"teacher_disagreement_score":0.0040382654,"about_ca_system_score_codex":0.0005975509,"about_ca_system_score_gemma":0.00069828756,"threshold_uncertainty_score":0.013509393},"labels":[],"label_agreement":null},{"id":"W2154884452","doi":"10.1139/tcsme-2000-0024","title":"DESIGN OPTIMIZATION OF A COMPLEX MECHANICAL SYSTEM USING ADAPTIVE RESPONSE SURFACE METHOD","year":2000,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":13,"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 Victoria","funders":"","keywords":"Response surface methodology; Computer science; Multi-objective optimization; Engineering optimization; Systems design; Scheme (mathematics); Optimization problem; Constraint (computer-aided design); Complex system; Mathematical optimization; Control engineering; Engineering; Mechanical engineering; Mathematics","score_opus":0.036057275624062336,"score_gpt":0.2602254478170133,"score_spread":0.22416817219295096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154884452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019693483,0.00013305238,0.97782296,0.000106312655,0.000016700395,0.000035416386,0.000015494054,0.00018416662,0.0019924685],"genre_scores_gemma":[0.68356586,0.00035053058,0.3108073,0.00008079429,0.000037458096,0.0003536427,0.00008871444,0.000095572905,0.004620141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968696,0.00013325692,0.000011954002,0.000051207684,0.0000924672,0.000024233083],"domain_scores_gemma":[0.9996865,0.00019976239,0.000031552187,0.000021491356,0.000051082647,0.000009637586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075715873,0.000599741,0.00079434505,0.00030825633,0.00021888789,0.0005707834,0.0004225961,0.00091993884,0.001855209],"category_scores_gemma":[0.00083777704,0.0002453978,0.0006022287,0.00029320145,0.0006265231,0.00038808276,0.0004834687,0.00051856687,0.00029312205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003170971,0.000015086241,0.00016057881,0.000056450826,0.000019319423,0.00003294513,0.000024631805,0.97622335,0.007112786,0.0025596765,0.00017556723,0.013587878],"study_design_scores_gemma":[0.0000064950987,0.000023884304,0.000039857714,0.0000016721949,0.0000028556788,0.0000050346175,0.0000036919196,0.9984402,0.00065293256,0.0005184746,0.00030236025,0.0000025192196],"about_ca_topic_score_codex":0.0013396454,"about_ca_topic_score_gemma":0.0009799527,"teacher_disagreement_score":0.001855209,"about_ca_system_score_codex":0.00026700558,"about_ca_system_score_gemma":0.00059813634,"threshold_uncertainty_score":0.0062062144},"labels":[],"label_agreement":null},{"id":"W2155752967","doi":"10.1109/tmtt.2003.820904","title":"Space Mapping: The State of the Art","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1038,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Uniqueness; Surrogate model; Computer science; Context (archaeology); Mathematical optimization; Optimization problem; Algorithm; Wedge (geometry); State space; Mathematics; Machine learning","score_opus":0.011819821801210958,"score_gpt":0.23438356695429435,"score_spread":0.2225637451530834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155752967","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.0050890767,0.19489253,0.7617581,0.001859164,0.0010246873,0.00006215627,0.00018743935,0.0011491281,0.033977658],"genre_scores_gemma":[0.17476845,0.35756943,0.43004635,0.0014436928,0.0028782017,0.00027645376,0.0011220268,0.0013075357,0.030587813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905926,0.00026623288,0.00005507329,0.00015768106,0.00040772744,0.00005410443],"domain_scores_gemma":[0.9987791,0.0006579499,0.00006498298,0.00021947535,0.00023324737,0.000045201414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011676708,0.0009934902,0.0015607881,0.0012625128,0.00044576603,0.0027811883,0.001886505,0.0016762967,0.011364258],"category_scores_gemma":[0.0033790588,0.00042558182,0.0008410729,0.0025361208,0.0009862111,0.0038904482,0.0019479452,0.0012637525,0.005660456],"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.000082142,0.000044113185,0.00029611294,0.0014855892,0.000043307555,0.00006742868,0.000097346514,0.03384327,0.0022841457,0.06874671,0.010142101,0.8828678],"study_design_scores_gemma":[0.000023214061,0.00021788188,0.0005048307,0.0009459945,0.00006550729,0.0009860803,0.00021411071,0.19328058,0.008202584,0.1460459,0.64942247,0.00009085164],"about_ca_topic_score_codex":0.00089733343,"about_ca_topic_score_gemma":0.00042600476,"teacher_disagreement_score":0.011364258,"about_ca_system_score_codex":0.00050110096,"about_ca_system_score_gemma":0.0007674847,"threshold_uncertainty_score":0.038017213},"labels":[],"label_agreement":null},{"id":"W2156410580","doi":"10.20381/ruor-4435","title":"New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems","year":2011,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Sorting; Pareto principle; Multi-objective optimization; Mathematical optimization; Genetic algorithm; Computation; Computer science; Domain (mathematical analysis); Algorithm; Evolutionary algorithm; Test functions for optimization; Population; Optimization problem; Mathematics; Multi-swarm optimization","score_opus":0.004694590886637776,"score_gpt":0.16741519583060122,"score_spread":0.16272060494396345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156410580","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.0042607435,0.0011930824,0.9927281,0.00010303695,0.000049239858,0.00005619916,0.000016626213,0.00012245735,0.0014705278],"genre_scores_gemma":[0.12127576,0.002104854,0.87417567,0.00014676197,0.000094368144,0.000432772,0.00008362468,0.00011817018,0.0015680938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987931,0.00047064121,0.00008838391,0.00012466386,0.0004731601,0.000049999904],"domain_scores_gemma":[0.9979494,0.0013528405,0.00021212145,0.00011267963,0.00033378103,0.000039104074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025914565,0.0016373331,0.0012898276,0.0015620281,0.00041426855,0.0009769552,0.0011017879,0.0011173998,0.001371614],"category_scores_gemma":[0.004672883,0.00080961664,0.0012520064,0.0013067337,0.00068205484,0.0010526307,0.0011888909,0.001750245,0.00031050155],"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.000028885432,0.000052653388,0.00054136483,0.00038303324,0.00014112577,0.00006592963,0.000069751746,0.89460766,0.0025229834,0.011356431,0.00050173455,0.089728385],"study_design_scores_gemma":[0.000014842617,0.000045081037,0.00020220515,0.00003954692,0.000018157169,0.000031059153,0.000011298615,0.99237293,0.00082018686,0.0041341237,0.0022980445,0.0000125228735],"about_ca_topic_score_codex":0.0020807595,"about_ca_topic_score_gemma":0.002116639,"teacher_disagreement_score":0.0025914565,"about_ca_system_score_codex":0.0005370347,"about_ca_system_score_gemma":0.0010008377,"threshold_uncertainty_score":0.013705134},"labels":[],"label_agreement":null},{"id":"W2157862026","doi":"10.1109/cefc-06.2006.1633022","title":"Dealing with Model Errors in Approximation Model-Based Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Computer science; Electromagnetics; Process (computing); Code (set theory); Data modeling; Bayesian optimization; Robust optimization; Mathematical optimization; Machine learning; Mathematics; Engineering","score_opus":0.011605774514861222,"score_gpt":0.23568275551314316,"score_spread":0.22407698099828194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157862026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027758216,0.00012879528,0.9964914,0.00008381299,0.000010584932,0.000008030803,0.0000066616817,0.000067037414,0.00042779534],"genre_scores_gemma":[0.4644259,0.0008114478,0.5319325,0.00018998595,0.000080261125,0.00026738047,0.00010186113,0.0003152688,0.0018753874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971506,0.0014347748,0.0000973238,0.0001934249,0.001016481,0.00010736968],"domain_scores_gemma":[0.9935195,0.0049764663,0.00045443332,0.00047419043,0.000500036,0.00007537443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050467355,0.0010088139,0.0017216884,0.0008768164,0.000593964,0.0014662043,0.0013741618,0.0021136669,0.0007841771],"category_scores_gemma":[0.01757476,0.0009076949,0.00081207906,0.0009437051,0.001132992,0.001633498,0.0019006369,0.0019817161,0.000246491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026530051,0.000011260292,0.0001699037,0.00003793158,0.00002716181,0.00001978317,0.000021865628,0.9770736,0.0005642883,0.009657262,0.00017230367,0.012218148],"study_design_scores_gemma":[0.0000049659525,0.000009939273,0.000038526585,0.000007645017,0.0000060649068,0.000009574781,0.0000026912012,0.99284416,0.00044621155,0.0063041453,0.00032080707,0.000005244146],"about_ca_topic_score_codex":0.003245658,"about_ca_topic_score_gemma":0.0022782614,"teacher_disagreement_score":0.0050467355,"about_ca_system_score_codex":0.00068231527,"about_ca_system_score_gemma":0.0012027113,"threshold_uncertainty_score":0.026690006},"labels":[],"label_agreement":null},{"id":"W2158942047","doi":"10.1109/icit.2004.1490788","title":"Multiobjective genetic estimation of DC motor parameters and load torque","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":32,"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":"Robustness (evolution); Control theory (sociology); Genetic algorithm; Sorting; Torque; DC motor; Computer science; Multi-objective optimization; Engineering; Algorithm; Artificial intelligence; Machine learning; Physics","score_opus":0.008715653474568326,"score_gpt":0.24905201107606506,"score_spread":0.24033635760149674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158942047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034948923,0.00007366001,0.9630893,0.00006274081,0.000017553546,0.000030018738,0.000022092989,0.00026743548,0.0014883677],"genre_scores_gemma":[0.6194705,0.00010639799,0.37767822,0.000061344675,0.000017745448,0.00015234255,0.00012034048,0.00007496164,0.0023181275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00011153382,0.000018420315,0.00008875273,0.00019233511,0.000035739475],"domain_scores_gemma":[0.9991997,0.00034288297,0.0001590476,0.00006564043,0.00021234143,0.000020431631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009696692,0.00081656105,0.00062868994,0.0009270793,0.00029660368,0.0007661383,0.0006576558,0.0008281833,0.00054960727],"category_scores_gemma":[0.0028299463,0.0004043984,0.00040606878,0.0005227144,0.0004368159,0.00059490424,0.0004097346,0.0005536769,0.00015679133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000391565,0.000049800685,0.0007809292,0.000037016565,0.000034781868,0.0000374935,0.000047092104,0.9304403,0.0063626203,0.002283985,0.00028516114,0.05960163],"study_design_scores_gemma":[0.00000596053,0.000012986357,0.0002898049,0.0000037036925,0.0000049625487,0.000013594927,0.00000476099,0.9967282,0.0021906372,0.0005202242,0.00022041642,0.00000473137],"about_ca_topic_score_codex":0.004839982,"about_ca_topic_score_gemma":0.0043933103,"teacher_disagreement_score":0.004839982,"about_ca_system_score_codex":0.00077013025,"about_ca_system_score_gemma":0.00094967487,"threshold_uncertainty_score":0.009623647},"labels":[],"label_agreement":null},{"id":"W2160331134","doi":"10.3390/s150717572","title":"Wireless Sensor Network Optimization: Multi-Objective Paradigm","year":2015,"lang":"en","type":"review","venue":"Sensors","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Optimization problem; Computer science; Software deployment; Key distribution in wireless sensor networks; Wireless network; Wireless; Distributed computing; Mathematical optimization; Computer network; Telecommunications; Mathematics","score_opus":0.05381203925768556,"score_gpt":0.33002241792906734,"score_spread":0.27621037867138176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160331134","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.0024836888,0.42548287,0.53391844,0.0038497758,0.0008591539,0.00012377114,0.00016818321,0.00017122398,0.032942872],"genre_scores_gemma":[0.09105763,0.6893817,0.20359963,0.0013770811,0.0018931491,0.00041312983,0.00029027977,0.00011941838,0.01186791],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992311,0.0002617739,0.00005025862,0.000096408476,0.00032741405,0.000032964308],"domain_scores_gemma":[0.99932647,0.0004000787,0.000082849976,0.0000341391,0.0001378414,0.000018709112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012840629,0.0014210003,0.0013056147,0.0013288998,0.00024614882,0.0015744338,0.0015015103,0.0014476017,0.0023235537],"category_scores_gemma":[0.0014685378,0.0004501649,0.0008959865,0.003251953,0.00089506834,0.001900314,0.0009231863,0.002140465,0.00084253994],"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.000050500563,0.00012592907,0.0005383589,0.007565465,0.00029584463,0.00021541759,0.000109608874,0.18067732,0.002806165,0.22832577,0.018775247,0.56051445],"study_design_scores_gemma":[0.000035663583,0.00025147456,0.0015431255,0.00286799,0.00019406113,0.0010802967,0.00018940234,0.2980354,0.0039504087,0.26839408,0.42334762,0.00011042895],"about_ca_topic_score_codex":0.00065502303,"about_ca_topic_score_gemma":0.00074511813,"teacher_disagreement_score":0.0023235537,"about_ca_system_score_codex":0.0009287029,"about_ca_system_score_gemma":0.0008955823,"threshold_uncertainty_score":0.0077731013},"labels":[],"label_agreement":null},{"id":"W2161762394","doi":"10.1109/cec.2006.1688478","title":"Virtual Reality Spaces for Visual Data Mining with Multiobjective Evolutionary Optimization: Implicit and Explicit Function Representations Mixing Unsupervised and Supervised Properties","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"","keywords":"Mixing (physics); Computer science; Function (biology); Virtual reality; Artificial intelligence; Evolutionary algorithm; Machine learning; Theoretical computer science","score_opus":0.0383133552738841,"score_gpt":0.284566148260437,"score_spread":0.24625279298655292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161762394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036373367,0.00012842668,0.9953885,0.00010767786,0.000010940916,0.00001708035,0.000015795555,0.0000668485,0.00062740705],"genre_scores_gemma":[0.20882465,0.0003886559,0.7885373,0.00010945186,0.000040191273,0.00031624586,0.00012651217,0.00008765974,0.0015693431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.00040613682,0.000040193743,0.00008773396,0.00015493699,0.000038953214],"domain_scores_gemma":[0.9985116,0.0009736063,0.00011879189,0.00017620514,0.00016391906,0.00005586178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017272572,0.0009168224,0.00096566527,0.0014081984,0.00047814345,0.002044742,0.001112317,0.0011163381,0.0013518314],"category_scores_gemma":[0.004419182,0.00047855856,0.0014155552,0.001218304,0.0013691239,0.0017119201,0.0020332169,0.0014229985,0.00028308146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041347008,0.000046212215,0.0004940428,0.000148459,0.00006026985,0.00007453712,0.0002122308,0.79577166,0.002274339,0.089134425,0.0008129857,0.110929504],"study_design_scores_gemma":[0.000005039129,0.000020181194,0.00009654933,0.000018969673,0.000006127741,0.00002297755,0.000028151448,0.97342515,0.0005071205,0.024755096,0.0011059247,0.00000879004],"about_ca_topic_score_codex":0.0014548884,"about_ca_topic_score_gemma":0.0013000903,"teacher_disagreement_score":0.002044742,"about_ca_system_score_codex":0.0009093843,"about_ca_system_score_gemma":0.00062270067,"threshold_uncertainty_score":0.00913471},"labels":[],"label_agreement":null},{"id":"W2162219390","doi":"10.1109/cca.2009.5280821","title":"Multi-objective optimal gating and riser design for metal-casting","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Windsor","funders":"","keywords":"Flexibility (engineering); Casting; Computer science; Multi-objective optimization; Gating; Process (computing); Key (lock); Evolutionary algorithm; Mathematical optimization; Optimal design; Engineering design process; Engineering; Mechanical engineering; Materials science; Mathematics; Machine learning","score_opus":0.0425162078338612,"score_gpt":0.30099854005851506,"score_spread":0.2584823322246539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162219390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03803874,0.00028379564,0.957558,0.000055253066,0.000020392114,0.0000929757,0.000024905077,0.00023451475,0.0036915224],"genre_scores_gemma":[0.67684126,0.00030771815,0.31901577,0.000041116942,0.00001425229,0.00023489319,0.000083916406,0.00008337158,0.0033776509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999634,0.0001098194,0.000012929704,0.00004425032,0.00015458671,0.000044355944],"domain_scores_gemma":[0.9998116,0.00007851577,0.000040793508,0.000013896656,0.00004210706,0.0000131693905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090955675,0.00082523824,0.00093771477,0.0007309605,0.0003047048,0.0006990557,0.00072949706,0.00071406923,0.0018139197],"category_scores_gemma":[0.0007990942,0.0005099304,0.00066050095,0.00040339617,0.00046566647,0.0004615009,0.0005285426,0.00048890547,0.00025085578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005195284,0.00004584136,0.00022504338,0.00009752453,0.000016130889,0.000050563078,0.000032673946,0.9538248,0.012022819,0.0037060645,0.00024750427,0.029679002],"study_design_scores_gemma":[0.00001484646,0.00009778388,0.00016109296,0.00000908917,0.000011194624,0.000016824157,0.000010367237,0.9948702,0.002890114,0.0010079849,0.0009028261,0.000007671379],"about_ca_topic_score_codex":0.0014884766,"about_ca_topic_score_gemma":0.002655247,"teacher_disagreement_score":0.0018139197,"about_ca_system_score_codex":0.0005674425,"about_ca_system_score_gemma":0.0010787253,"threshold_uncertainty_score":0.00606817},"labels":[],"label_agreement":null},{"id":"W2164040928","doi":"10.11575/prism/24742","title":"A Genetic Algorithm Optimizer with Applications to the SAGD Process","year":2013,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Calgary","keywords":"Genetic algorithm; Process (computing); Computer science; Algorithm; Machine learning; Programming language","score_opus":0.006435286983608043,"score_gpt":0.21937165554143143,"score_spread":0.21293636855782339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164040928","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.075109944,0.0005155478,0.9088089,0.00052818406,0.00008807997,0.00025209005,0.00018632504,0.0016520564,0.012858814],"genre_scores_gemma":[0.32458693,0.0003957917,0.66718304,0.00016542821,0.000030861658,0.0005285883,0.00032783695,0.00019007848,0.00659141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972516,0.00009129089,0.00001297095,0.000047175858,0.00009275999,0.000030602507],"domain_scores_gemma":[0.99940205,0.00038193376,0.000045002947,0.000024022338,0.00013098645,0.000016061971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008776564,0.00090519636,0.00068247225,0.00051732175,0.0004706889,0.0008078565,0.0007065002,0.0012050822,0.0020486854],"category_scores_gemma":[0.0018968115,0.00040917218,0.00065729587,0.00059112156,0.0004917676,0.00030823756,0.00046114562,0.000973476,0.00033756692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001855103,0.000025146936,0.00028487373,0.000026381524,0.000014045853,0.000027167303,0.000018361538,0.97905856,0.0008410138,0.0021867466,0.00036257046,0.017136583],"study_design_scores_gemma":[0.000008123897,0.000018242861,0.000058971284,0.0000032881849,0.0000034848929,0.0000036237327,0.0000035755938,0.9986512,0.0003951915,0.00032482127,0.00052715925,0.0000022948443],"about_ca_topic_score_codex":0.013879316,"about_ca_topic_score_gemma":0.008090883,"teacher_disagreement_score":0.013879316,"about_ca_system_score_codex":0.0010259467,"about_ca_system_score_gemma":0.0017119112,"threshold_uncertainty_score":0.02759707},"labels":[],"label_agreement":null},{"id":"W2164616507","doi":"10.1109/tmag.2008.2002779","title":"Sequential Optimization Method for the Design of Electromagnetic Device","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Toronto","funders":"","keywords":"Bayesian optimization; Computer science; Test functions for optimization; Kriging; Mathematical optimization; Sequential analysis; Process (computing); Optimization problem; Continuous optimization; Finite element method; Design of experiments; Algorithm; Optimal design; Multi-swarm optimization; Mathematics; Artificial intelligence; Machine learning","score_opus":0.04263268396322485,"score_gpt":0.295755138234833,"score_spread":0.2531224542716082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164616507","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.0009354563,0.00010374633,0.99772936,0.000024044331,0.000011928523,0.000021539146,0.000011495357,0.00008790766,0.0010744602],"genre_scores_gemma":[0.11321444,0.0005137452,0.8795963,0.00006918694,0.000032153657,0.00057650096,0.00012370471,0.00011306953,0.0057608746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993736,0.00018430562,0.000026465308,0.00006675998,0.00032005273,0.000028957886],"domain_scores_gemma":[0.99968696,0.00014498974,0.00003572579,0.000025769354,0.00009563626,0.000010845429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175045,0.0009755331,0.0009522307,0.00057927123,0.00037604236,0.0005112713,0.00085671945,0.0006309496,0.0041643255],"category_scores_gemma":[0.000994017,0.0006151836,0.0009811461,0.0006016355,0.0004044948,0.000494669,0.0006081713,0.0008190825,0.0008547401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007394978,0.000038752107,0.0003665578,0.00028525834,0.000082577775,0.000050239327,0.000063207015,0.8532204,0.010527427,0.017675882,0.0016710396,0.11594472],"study_design_scores_gemma":[0.000017309349,0.000059537357,0.00007912522,0.000010221285,0.000013145761,0.0000265964,0.0000058244736,0.9911409,0.0013835842,0.0033299718,0.0039262334,0.0000074777095],"about_ca_topic_score_codex":0.0023733997,"about_ca_topic_score_gemma":0.0033785498,"teacher_disagreement_score":0.0041643255,"about_ca_system_score_codex":0.0005340269,"about_ca_system_score_gemma":0.0013105209,"threshold_uncertainty_score":0.013931096},"labels":[],"label_agreement":null},{"id":"W2164634985","doi":"10.1504/ijmmno.2012.044711","title":"GATE: a genetic algorithm designed for expensive cost functions","year":2012,"lang":"en","type":"article","venue":"International Journal of Mathematical Modelling and Numerical Optimisation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Convergence (economics); Computer science; Algorithm; Heuristic; Genetic algorithm; Local search (optimization); Mathematical optimization; Gaussian; Function (biology); Mathematics","score_opus":0.03710974873704519,"score_gpt":0.2977458013577234,"score_spread":0.2606360526206782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164634985","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.0042820894,0.000118901284,0.99121475,0.000056694964,0.0000794772,0.00007174382,0.00005069779,0.00059058046,0.0035350427],"genre_scores_gemma":[0.13641858,0.00037438463,0.85542816,0.00019814949,0.00006557243,0.00043762673,0.0002563098,0.0004175865,0.0064036925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.00006561261,0.000009961624,0.000042376505,0.00010608913,0.00003249457],"domain_scores_gemma":[0.9996649,0.00020443885,0.000023615847,0.000029204817,0.00006073754,0.000017085977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050455856,0.00079482584,0.0008156053,0.0007682633,0.00040468745,0.00066156563,0.0012508348,0.0012577573,0.003504929],"category_scores_gemma":[0.0019041126,0.00032866886,0.00056749146,0.0008956173,0.00057137804,0.00068096304,0.00074638205,0.0009998488,0.0006715578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097182514,0.000056838668,0.0005800151,0.0001619297,0.00006733068,0.00013595595,0.00006798313,0.6832242,0.006935417,0.080553435,0.006105126,0.2220147],"study_design_scores_gemma":[0.000027904494,0.00005323698,0.00008181596,0.000014989183,0.000017559378,0.000070742906,0.0000072814887,0.978312,0.0018366349,0.011114981,0.008451829,0.000011044481],"about_ca_topic_score_codex":0.0031651468,"about_ca_topic_score_gemma":0.0032215852,"teacher_disagreement_score":0.003504929,"about_ca_system_score_codex":0.0006014428,"about_ca_system_score_gemma":0.0011048906,"threshold_uncertainty_score":0.011725187},"labels":[],"label_agreement":null},{"id":"W2165622730","doi":"10.1287/opre.1080.0685","title":"Percentile Optimization for Markov Decision Processes with Parameter Uncertainty","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Ambiguity; Computer science; Markov decision process; Mathematical optimization; Parametric statistics; Set (abstract data type); Percentile; Markov chain; Markov process; Process (computing); Decision process; Operations research; Machine learning; Mathematics; Management science; Statistics; Economics","score_opus":0.04191846451408229,"score_gpt":0.3783378437581784,"score_spread":0.33641937924409615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165622730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02780702,0.0010710505,0.9662752,0.00053032377,0.000043561195,0.000062968225,0.00014400916,0.00018980136,0.0038759985],"genre_scores_gemma":[0.85191077,0.0020826696,0.13872997,0.00018735108,0.00013635581,0.00040746428,0.00043938187,0.00014323543,0.005962742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649847,0.0020532943,0.00015326319,0.0003292563,0.00052055216,0.0004452219],"domain_scores_gemma":[0.98680216,0.011158246,0.0008317214,0.0003323768,0.00047380137,0.00040167267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006993933,0.0015769461,0.0024853554,0.0013458859,0.00087654655,0.0025925287,0.0011666651,0.0016910118,0.003782567],"category_scores_gemma":[0.02178892,0.0008654148,0.0011235939,0.001547827,0.0020901305,0.0030513622,0.0022257164,0.002370783,0.00037512643],"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.00007485536,0.000024176246,0.0004199674,0.000066660774,0.000030859377,0.00005775846,0.00005546414,0.8864178,0.00018937403,0.10272755,0.000651727,0.00928375],"study_design_scores_gemma":[0.00000878478,0.000021153026,0.000097959215,0.000014824608,0.000005395881,0.000010258858,0.000014194796,0.9088791,0.00010756622,0.09044347,0.00038722105,0.000009940942],"about_ca_topic_score_codex":0.0033533832,"about_ca_topic_score_gemma":0.0022559157,"teacher_disagreement_score":0.006993933,"about_ca_system_score_codex":0.0025897818,"about_ca_system_score_gemma":0.0020397322,"threshold_uncertainty_score":0.0369879},"labels":[],"label_agreement":null},{"id":"W2166062557","doi":"10.1109/tmag.2006.871954","title":"Selection of approximation models for electromagnetic device optimization","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Mathematical optimization; High frequency approximation; Approximation algorithm; Model selection; Approximation theory; Linear approximation; Algorithm; Artificial intelligence; Mathematics; Physics","score_opus":0.013548640877156808,"score_gpt":0.23927083241886593,"score_spread":0.2257221915417091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166062557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047193975,0.000336731,0.9938613,0.00009473356,0.00001807587,0.00001655254,0.000014312507,0.00011500242,0.0008238134],"genre_scores_gemma":[0.51381415,0.002280918,0.47913197,0.00021601343,0.00012034963,0.00030798634,0.00027776975,0.000250954,0.0035998635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903035,0.0005112325,0.000032006592,0.00007282051,0.00030256642,0.00005093052],"domain_scores_gemma":[0.9985404,0.00095154246,0.00013424813,0.00015918948,0.00018338609,0.00003113815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017153331,0.0010047805,0.0011222471,0.000760067,0.0003293941,0.00091545895,0.0009783743,0.0009104789,0.0006735602],"category_scores_gemma":[0.0054950695,0.00041421226,0.00093981985,0.0007264242,0.0005610596,0.0010728248,0.0006916443,0.0012401,0.00043704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008086782,0.000055195465,0.00056245975,0.00008962305,0.00004408182,0.000063783475,0.000052499585,0.90920764,0.0038281544,0.025744637,0.0012028913,0.059068166],"study_design_scores_gemma":[0.0000044155545,0.000018679819,0.000046971767,0.0000084715075,0.000007042819,0.00001502627,0.0000048546462,0.9937431,0.00059353077,0.004995817,0.00055745576,0.000004731721],"about_ca_topic_score_codex":0.0012822144,"about_ca_topic_score_gemma":0.0010098428,"teacher_disagreement_score":0.0017153331,"about_ca_system_score_codex":0.0005210725,"about_ca_system_score_gemma":0.0005266261,"threshold_uncertainty_score":0.009071648},"labels":[],"label_agreement":null},{"id":"W2166674691","doi":"10.1109/tsmcc.2007.900651","title":"Optimal Advertising Campaign Generation for Multiple Brands Using MOGA","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"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":"Greedy algorithm; Mathematical optimization; Heuristic; Genetic algorithm; Computer science; Variety (cybernetics); Encoding (memory); Pareto optimal; Set (abstract data type); Pareto principle; Optimization problem; Multi-objective optimization; Key (lock); Mathematics; Artificial intelligence","score_opus":0.03964088752379955,"score_gpt":0.29618822251481386,"score_spread":0.2565473349910143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166674691","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.048381723,0.00035117462,0.94342047,0.00026574038,0.00006221709,0.00010347995,0.00007351136,0.00028396302,0.007057726],"genre_scores_gemma":[0.4192017,0.00032755677,0.5754734,0.00014815878,0.000038955703,0.0003486804,0.00022784593,0.00011727749,0.004116403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966013,0.00012300319,0.000015603422,0.00006373379,0.00008587662,0.000051648105],"domain_scores_gemma":[0.9995511,0.00026444058,0.00006244898,0.000027735885,0.00006734388,0.000026910733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786397,0.0010439999,0.00093421055,0.0010857251,0.00043565134,0.00096392154,0.0010108877,0.0011329801,0.0019910708],"category_scores_gemma":[0.0016255156,0.0005533459,0.0010762905,0.00080850575,0.00053059956,0.0007213988,0.0007194507,0.0007053,0.00026090135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014608058,0.00001975462,0.00021415246,0.000020635409,0.000019810654,0.000030954503,0.00001922214,0.9806075,0.0005997409,0.0032098526,0.00029950918,0.014944308],"study_design_scores_gemma":[0.0000071607055,0.000014458913,0.00005327171,0.0000045815273,0.0000074773375,0.000008429074,0.000007816665,0.9974017,0.000248562,0.0017381684,0.0005052033,0.000003272993],"about_ca_topic_score_codex":0.003937911,"about_ca_topic_score_gemma":0.0034073824,"teacher_disagreement_score":0.003937911,"about_ca_system_score_codex":0.00093762367,"about_ca_system_score_gemma":0.0014262132,"threshold_uncertainty_score":0.007829964},"labels":[],"label_agreement":null},{"id":"W2168016899","doi":"10.1109/ijcnn.2007.4371305","title":"Multi-objective Evolutionary Optimization of Neural Networks for Virtual Reality Visual Data Mining: Application to Hydrochemistry","year":2007,"lang":"en","type":"article","venue":"IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Artificial neural network; Computer science; Visualization; Genetic algorithm; Data mining; Virtual reality; Set (abstract data type); Artificial intelligence; Domain (mathematical analysis); Multi-objective optimization; Data set; Similarity (geometry); Evolutionary computation; Pattern recognition (psychology); Machine learning; Image (mathematics); Mathematics","score_opus":0.07781558349810247,"score_gpt":0.3645663362506648,"score_spread":0.28675075275256234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168016899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013867762,0.00021100303,0.98426485,0.00015310472,0.000024001489,0.000034744837,0.000017305176,0.00010584582,0.0013214196],"genre_scores_gemma":[0.42575243,0.00029871144,0.5704936,0.00011107238,0.000035994675,0.0003936191,0.00007028334,0.00008555615,0.0027588315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996736,0.0001610107,0.000015787411,0.000038870803,0.00008506941,0.000025655134],"domain_scores_gemma":[0.9992429,0.0005113974,0.000060456,0.000033009714,0.00012112361,0.000031091786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012772444,0.0008676544,0.00077553734,0.00064461876,0.0003851648,0.0009950058,0.0007943223,0.0013009822,0.001133664],"category_scores_gemma":[0.0028687976,0.00044690544,0.00079281064,0.00064305257,0.0006386312,0.0005617552,0.0010665104,0.0010691009,0.00016422335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014454489,0.000018662076,0.00013034971,0.000025000712,0.000018362658,0.00002535311,0.000025698266,0.97562295,0.0008092745,0.0026825508,0.00014274412,0.020484455],"study_design_scores_gemma":[0.0000016770541,0.000004817916,0.000019483348,0.0000020674224,0.0000010920347,0.0000024148267,0.0000026129483,0.99912184,0.00011428274,0.00065353565,0.00007474816,0.0000013530405],"about_ca_topic_score_codex":0.0042912527,"about_ca_topic_score_gemma":0.0031909053,"teacher_disagreement_score":0.0042912527,"about_ca_system_score_codex":0.00089484703,"about_ca_system_score_gemma":0.0006678683,"threshold_uncertainty_score":0.008532584},"labels":[],"label_agreement":null},{"id":"W2168984786","doi":"10.1109/cec.2007.4425019","title":"Visualizing High Dimensional Objective Spaces for Multi-objective Optimization: A Virtual Reality Approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Embedding; Multi-objective optimization; Mathematical optimization; Virtual reality; Knapsack problem; Computer science; Pareto principle; Optimization problem; Mathematics; High dimensional; Theoretical computer science; Artificial intelligence","score_opus":0.03784962194572387,"score_gpt":0.3238311413234767,"score_spread":0.2859815193777528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168984786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039832625,0.00020202271,0.9935865,0.00012203139,0.000014940744,0.000021709959,0.000016894533,0.00012994536,0.0019227853],"genre_scores_gemma":[0.15097636,0.00065500743,0.84650975,0.00007229775,0.000025115562,0.00017607544,0.000080801015,0.000107233274,0.0013972472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896586,0.0006291472,0.00003362693,0.000074772,0.0002471681,0.000049383296],"domain_scores_gemma":[0.9988153,0.0007352032,0.00010091971,0.00017289359,0.00012203427,0.000053606796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017972942,0.0013660294,0.00069027074,0.001425093,0.00058220234,0.0030639048,0.0011407238,0.0008749606,0.0032354896],"category_scores_gemma":[0.0031569654,0.0005003404,0.001335486,0.0007049173,0.0013613041,0.0021505635,0.0023467925,0.001536106,0.0004525082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011294139,0.00008305591,0.00047436455,0.00039011665,0.0000995139,0.00021402341,0.0010183401,0.51438177,0.01550385,0.29875392,0.0016639968,0.16730414],"study_design_scores_gemma":[0.000043204684,0.00014184778,0.00041058892,0.00015063603,0.000040699877,0.00028322032,0.00039680532,0.8204927,0.011728754,0.14328322,0.022926986,0.00010139075],"about_ca_topic_score_codex":0.0007225362,"about_ca_topic_score_gemma":0.0007514886,"teacher_disagreement_score":0.0032354896,"about_ca_system_score_codex":0.0006593726,"about_ca_system_score_gemma":0.00060022937,"threshold_uncertainty_score":0.010823786},"labels":[],"label_agreement":null},{"id":"W2169003314","doi":"10.5555/1921427.1921443","title":"A Bayesian interactive optimization approach to procedural animation design","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"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; Animation; Bayesian optimization; Variety (cybernetics); Artificial intelligence; Human–computer interaction; Task (project management); Domain (mathematical analysis); Domain knowledge; Machine learning; Bayesian probability; Graphics; Computer graphics; Computer graphics (images)","score_opus":0.014259424015521412,"score_gpt":0.26299789057719214,"score_spread":0.24873846656167073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169003314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034787925,0.00002510034,0.99876994,0.000051280684,0.0000038196927,0.000012152291,0.0000064670885,0.000108163236,0.000675229],"genre_scores_gemma":[0.086235225,0.00021368518,0.9093625,0.00012112111,0.00004296138,0.00033673597,0.0000742207,0.0002853866,0.003328151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.0007559811,0.00006113288,0.00018550271,0.00063808326,0.000073699826],"domain_scores_gemma":[0.9979042,0.001433462,0.00014421396,0.00015169637,0.00027515515,0.000091389076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026971048,0.0011040495,0.0010010874,0.0012074439,0.0007743668,0.0013672307,0.0023132986,0.0015898509,0.004865348],"category_scores_gemma":[0.0073315287,0.0013545777,0.0011464488,0.00073613663,0.0018187065,0.0017273517,0.0021521265,0.0019711535,0.0008658878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000691828,0.00006927352,0.0002948357,0.00013940089,0.000062756604,0.00004942914,0.00028649395,0.8068476,0.0039698044,0.09925075,0.0020736146,0.08688687],"study_design_scores_gemma":[0.0000099048875,0.000014667738,0.00003704017,0.000013223815,0.0000068807763,0.000017038077,0.000007889608,0.97596145,0.00060526247,0.020743854,0.0025723442,0.000010418039],"about_ca_topic_score_codex":0.0045466665,"about_ca_topic_score_gemma":0.005435781,"teacher_disagreement_score":0.004865348,"about_ca_system_score_codex":0.0012276535,"about_ca_system_score_gemma":0.0014704445,"threshold_uncertainty_score":0.01627624},"labels":[],"label_agreement":null},{"id":"W2169196235","doi":"10.1109/ccece.2005.1557046","title":"Multi-objective optimization for process control of the in-situ bioremediation system","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Normalization (sociology); Computer science; Bioremediation; Process (computing); Set (abstract data type); Controller (irrigation); Control system; Optimal control; Process control; Multi-objective optimization; Decision maker; Mathematical optimization; Control engineering; Engineering; Machine learning; Mathematics; Operations research","score_opus":0.007996387483837028,"score_gpt":0.24373814782665326,"score_spread":0.23574176034281624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169196235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047530334,0.00021809456,0.9486486,0.00011125867,0.000016222126,0.00009270857,0.000027770298,0.00021348172,0.0031414574],"genre_scores_gemma":[0.8468028,0.00019439486,0.14975913,0.00006137076,0.000017867236,0.00040794327,0.00006637204,0.00004571687,0.0026444444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00030779082,0.000024134957,0.00009483677,0.00016520011,0.000046630572],"domain_scores_gemma":[0.9991999,0.00053792575,0.000091485934,0.000022940992,0.0001262855,0.000021459822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014909131,0.001167047,0.0007747352,0.0004149159,0.000434175,0.00083183846,0.0006740145,0.0009316595,0.0018507323],"category_scores_gemma":[0.0019256832,0.00029710436,0.00051527284,0.0003720614,0.00039924643,0.00045992783,0.00061072037,0.00086425734,0.00015954197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049423983,0.00004857882,0.00016409432,0.000064205735,0.00002144047,0.00003295253,0.00004329814,0.98074305,0.00375462,0.0013515741,0.0001132935,0.013613405],"study_design_scores_gemma":[0.0000075430844,0.000043072487,0.00009903446,0.000003114209,0.000006326052,0.000004457994,0.000005011416,0.99822265,0.0009788874,0.00043089845,0.00019602991,0.0000030530166],"about_ca_topic_score_codex":0.0051099486,"about_ca_topic_score_gemma":0.0035468978,"teacher_disagreement_score":0.0051099486,"about_ca_system_score_codex":0.00085929316,"about_ca_system_score_gemma":0.00074012787,"threshold_uncertainty_score":0.010160387},"labels":[],"label_agreement":null},{"id":"W2170491249","doi":"10.1115/detc2013-12352","title":"Accounting for Test Variability Through Sizing Local Domains in Sequential Design Optimization With Concurrent Calibration-Based Model Validation","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Sizing; Domain (mathematical analysis); Calibration; Sequential analysis; Design of experiments; Mathematical optimization; Mathematics; Statistics","score_opus":0.02942634739263835,"score_gpt":0.2735618950461124,"score_spread":0.24413554765347403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170491249","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.008522542,0.000042016683,0.99087745,0.00002606453,0.000004639462,0.000035506055,0.0000065212057,0.00021406602,0.00027119747],"genre_scores_gemma":[0.30537844,0.000050794668,0.69343,0.000073178235,0.000016118629,0.00034785122,0.00005857397,0.0001337205,0.0005112536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944623,0.0029181184,0.00026014596,0.00062809937,0.0014929421,0.00023843306],"domain_scores_gemma":[0.9790526,0.014936963,0.0014772138,0.002689964,0.0016575374,0.00018571214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009284933,0.0015179998,0.0015531715,0.0012246694,0.0004999318,0.0008605263,0.0016213708,0.0008816696,0.0011414367],"category_scores_gemma":[0.02014402,0.00089166354,0.0014719828,0.0007830958,0.0014413409,0.0015185139,0.002009443,0.0021222995,0.0002671454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018490886,0.00014349431,0.0018725515,0.0000944695,0.00008622596,0.00006399568,0.000118956756,0.8790316,0.009125122,0.0063342284,0.0002274214,0.10271701],"study_design_scores_gemma":[0.000025501246,0.00016043367,0.00037155792,0.000012605927,0.000019247074,0.000028508883,0.000012623767,0.98719007,0.0069750254,0.004679732,0.00051083567,0.0000138200885],"about_ca_topic_score_codex":0.0020337987,"about_ca_topic_score_gemma":0.002563725,"teacher_disagreement_score":0.009284933,"about_ca_system_score_codex":0.00091235165,"about_ca_system_score_gemma":0.0021632984,"threshold_uncertainty_score":0.049103975},"labels":[],"label_agreement":null},{"id":"W2178163879","doi":"10.1007/s10479-015-2008-0","title":"On the use of the $$L_{p}$$ L p distance in reference point-based approaches for multiobjective optimization","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Theory of computation; Multi-objective optimization; Point (geometry); Mathematical optimization; Mathematics; Computer science; Algorithm; Geometry","score_opus":0.6088702347949255,"score_gpt":0.4441123919419863,"score_spread":0.1647578428529392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178163879","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.0017187766,0.0007482645,0.994786,0.00023141112,0.00009525285,0.000022536675,0.000015797725,0.000050315113,0.002331505],"genre_scores_gemma":[0.11176598,0.0017838911,0.8822338,0.00036360067,0.00019236264,0.00022265223,0.000107864085,0.00032888143,0.0030009346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369264,0.00403571,0.00028221888,0.0005019647,0.001351149,0.00013645054],"domain_scores_gemma":[0.99031746,0.007020982,0.0003667081,0.0009260588,0.0011915509,0.00017725541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009242203,0.0015755728,0.0021926558,0.0019411349,0.0013872789,0.0025733635,0.003999277,0.0027416444,0.0043616057],"category_scores_gemma":[0.027262354,0.0007106206,0.0018885866,0.003193925,0.0032461502,0.00538348,0.0053197695,0.004612932,0.0011926475],"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.00018640446,0.00014251178,0.00042626128,0.00034450396,0.00011303226,0.00009500088,0.00021569745,0.28079507,0.00223499,0.48723608,0.0036043057,0.22460605],"study_design_scores_gemma":[0.000025441619,0.0001992221,0.00019958569,0.00014418058,0.00004355934,0.00008398445,0.00004587101,0.8375196,0.0013314282,0.15208577,0.008268559,0.00005282572],"about_ca_topic_score_codex":0.0033260805,"about_ca_topic_score_gemma":0.0034579802,"teacher_disagreement_score":0.009242203,"about_ca_system_score_codex":0.0011710129,"about_ca_system_score_gemma":0.0015679969,"threshold_uncertainty_score":0.048878074},"labels":[],"label_agreement":null},{"id":"W2185256081","doi":"10.1115/1.4031982","title":"Optimization on Metamodeling-Supported Iterative Decomposition","year":2015,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Metamodeling; Optimization problem; Computer science; Variable (mathematics); Decomposition; Algorithm; Mathematics","score_opus":0.06555496768357283,"score_gpt":0.32385930365157944,"score_spread":0.2583043359680066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185256081","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.0077311113,0.000067279514,0.9907018,0.00003354146,0.000009575045,0.000024921002,0.000016719223,0.00011478888,0.0013001307],"genre_scores_gemma":[0.35290483,0.00020851115,0.6439853,0.00009167551,0.000018855519,0.0004173758,0.00019080557,0.00014630075,0.0020364672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.00019082529,0.000018029787,0.000077238445,0.00013351387,0.000040411487],"domain_scores_gemma":[0.99947387,0.00029102477,0.00004912439,0.000052786025,0.0001144917,0.000018754854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010329743,0.0011201185,0.00094183005,0.000634282,0.00035130058,0.00060742366,0.0009163067,0.00093397166,0.0014571443],"category_scores_gemma":[0.0017032778,0.00046723807,0.00091753376,0.0006336693,0.0006390611,0.0006834164,0.0009976303,0.0009461585,0.00030531487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021654861,0.000023179116,0.0002719888,0.0000514951,0.000022293456,0.00002931269,0.00003192251,0.96715075,0.003548885,0.0063867047,0.0002955994,0.022166226],"study_design_scores_gemma":[0.000002271254,0.000008891064,0.000027416274,0.0000023422565,0.0000019336862,0.000004017546,0.0000023980324,0.9984028,0.00035760188,0.0009985459,0.00019009625,0.0000017566882],"about_ca_topic_score_codex":0.0023791578,"about_ca_topic_score_gemma":0.0017734895,"teacher_disagreement_score":0.0023791578,"about_ca_system_score_codex":0.0005118313,"about_ca_system_score_gemma":0.0009895746,"threshold_uncertainty_score":0.005463004},"labels":[],"label_agreement":null},{"id":"W2189581131","doi":"10.1007/0-306-48102-2_19","title":"Random Search Under Additive Noise","year":2002,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University; McGill University","funders":"","keywords":"Random noise; Noise (video); Computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.06007800885750432,"score_gpt":0.39346730394705137,"score_spread":0.33338929508954707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189581131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044399947,0.006471408,0.8920146,0.0025570819,0.00045475314,0.00007370635,0.00020245204,0.0005862358,0.053239807],"genre_scores_gemma":[0.7791868,0.0034783783,0.16115688,0.0007356399,0.0006620314,0.00024737878,0.00039992383,0.00038070817,0.05375238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00041963387,0.000032768705,0.00015129267,0.0002173159,0.00008084833],"domain_scores_gemma":[0.99591345,0.0033575953,0.0001811443,0.0002573475,0.00020175449,0.00008865467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750816,0.0006763129,0.0015723791,0.0009323082,0.0005269681,0.001597491,0.0009925006,0.0017598355,0.0057979124],"category_scores_gemma":[0.009069545,0.00060812,0.000739771,0.0013657251,0.0014101148,0.001892042,0.0012354231,0.0014322065,0.0011015759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019593518,0.00006819145,0.0003333739,0.00016130811,0.00013012934,0.00007295857,0.000040551677,0.54027754,0.0010362831,0.39799836,0.007757931,0.051927425],"study_design_scores_gemma":[0.000041215742,0.000034227334,0.00014810305,0.000022132046,0.000019292724,0.0000371339,0.000007959227,0.86326,0.00038582136,0.13441496,0.0016154501,0.0000136702865],"about_ca_topic_score_codex":0.0008617928,"about_ca_topic_score_gemma":0.00089115906,"teacher_disagreement_score":0.0057979124,"about_ca_system_score_codex":0.0008849123,"about_ca_system_score_gemma":0.0006950963,"threshold_uncertainty_score":0.019396007},"labels":[],"label_agreement":null},{"id":"W2190344412","doi":"10.1145/2832987.2833057","title":"An Extension of DIRECT Algorithm Using Kriging Metamodel for Global Optimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Metamodeling; Kriging; Mathematical optimization; Benchmark (surveying); Computer science; Computation; Algorithm; Global optimization; Black box; Function (biology); Mathematics; Machine learning; Artificial intelligence","score_opus":0.06137164201412445,"score_gpt":0.34704289690860424,"score_spread":0.2856712548944798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190344412","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.003994613,0.00018693219,0.9933095,0.000036191796,0.000025985866,0.000041116058,0.000025568237,0.00037598575,0.0020041084],"genre_scores_gemma":[0.12628634,0.00040960123,0.8690047,0.00006908422,0.00002266402,0.0002607602,0.00015921005,0.00017164089,0.0036159265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996276,0.00010171331,0.000019041832,0.0000747281,0.00015224569,0.000024559613],"domain_scores_gemma":[0.99962616,0.00014848262,0.00003254599,0.00006695094,0.00011256077,0.00001318786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822856,0.000814085,0.0010067457,0.0005959259,0.00035258933,0.0006396223,0.0011561892,0.00089582725,0.002349251],"category_scores_gemma":[0.0012678329,0.00048645498,0.0009870642,0.0007527708,0.000336552,0.0006866971,0.00082255015,0.0009275211,0.0007404199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007453851,0.000090646994,0.0014291946,0.0003241015,0.00011673799,0.000110919056,0.00015414236,0.67110497,0.013094321,0.014989766,0.0020987503,0.29641196],"study_design_scores_gemma":[0.000020228392,0.00006251163,0.00017674413,0.000013646186,0.00001544532,0.00008002498,0.000012394979,0.9902524,0.0022542174,0.0021500632,0.0049493867,0.000013053533],"about_ca_topic_score_codex":0.0046521416,"about_ca_topic_score_gemma":0.005481164,"teacher_disagreement_score":0.0046521416,"about_ca_system_score_codex":0.00039573773,"about_ca_system_score_gemma":0.0011336587,"threshold_uncertainty_score":0.009250104},"labels":[],"label_agreement":null},{"id":"W2206713289","doi":"10.5539/ijsp.v5n1p98","title":"Rules for Identifying the Initial Design Points for Use in the Quick Convergent Inflow Algorithm","year":2015,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Vertex (graph theory); Boundary (topology); Mathematics; Interior point method; Inflow; Mathematical optimization; Algorithm; Point (geometry); Convergence (economics); Combinatorics; Geometry; Mathematical analysis; Graph","score_opus":0.12476307881015815,"score_gpt":0.3674341375937134,"score_spread":0.24267105878355527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206713289","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.017046038,0.00010050594,0.97906876,0.000046097506,0.000014493608,0.00032386434,0.000032147535,0.0004471984,0.0029209747],"genre_scores_gemma":[0.15666345,0.00009524745,0.8410339,0.000057232217,0.000010142728,0.0007121456,0.00010405406,0.00020043101,0.0011234238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996512,0.0013000288,0.00036770213,0.0003607974,0.0011945346,0.000264975],"domain_scores_gemma":[0.9882135,0.006368251,0.0012292152,0.00096047693,0.0029794439,0.0002492931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00654228,0.0012029175,0.0012469776,0.0017968144,0.0008283309,0.002048203,0.0018681998,0.0012594855,0.003351779],"category_scores_gemma":[0.025085006,0.0007620012,0.0006412657,0.00074497575,0.0014671666,0.0015559226,0.0016231549,0.0014362753,0.0012834296],"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.0011695583,0.00031079177,0.005053732,0.00073288195,0.00006238411,0.0004684836,0.0010065174,0.509109,0.048661474,0.045254473,0.0036464827,0.3845241],"study_design_scores_gemma":[0.00026086273,0.00057415006,0.0013910017,0.00037292595,0.00008816017,0.00027516068,0.00025053447,0.9070974,0.059077024,0.02297818,0.0075451354,0.000089456655],"about_ca_topic_score_codex":0.001587621,"about_ca_topic_score_gemma":0.001962106,"teacher_disagreement_score":0.00654228,"about_ca_system_score_codex":0.0006212865,"about_ca_system_score_gemma":0.001904662,"threshold_uncertainty_score":0.034599304},"labels":[],"label_agreement":null},{"id":"W2207562545","doi":"10.1115/omae2015-41392","title":"Response Surface Models for Analyzing Sinkage and Trim Effects on Planing Hull Motions in a Vertical Plane","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Memorial University of Newfoundland","funders":"","keywords":"Trim; Hull; Center of gravity; Vertical plane; Marine engineering; Engineering; Plane (geometry); Structural engineering; Geometry; Mathematics","score_opus":0.03662129864729768,"score_gpt":0.29212999300101805,"score_spread":0.25550869435372037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207562545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030951036,0.00014136921,0.9668996,0.00006100136,0.00002205098,0.00011053232,0.0001201185,0.0003965448,0.0012977674],"genre_scores_gemma":[0.81940055,0.000493492,0.17478904,0.00009046283,0.000016835555,0.0010275256,0.00044387876,0.00012917559,0.0036090617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.00057541183,0.00005209274,0.00014704037,0.00027171304,0.000067984525],"domain_scores_gemma":[0.99851483,0.0010318541,0.00016171363,0.000084260035,0.00018863053,0.000018595692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107305,0.0011159872,0.0007327156,0.00066690316,0.00017161245,0.00061218604,0.00066734565,0.0009888686,0.0017666505],"category_scores_gemma":[0.003759496,0.00037142175,0.0015870655,0.000701663,0.00033490604,0.0004645758,0.00039549603,0.0010760233,0.0004781473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007487873,0.000061347986,0.00062159856,0.000101525446,0.00005000187,0.000021142825,0.000046343324,0.96801746,0.00915518,0.002090987,0.00020140166,0.019558113],"study_design_scores_gemma":[0.0000060174657,0.00010472546,0.00037602926,0.0000044966123,0.000009936293,0.000005022825,0.000011892378,0.9968951,0.0015063168,0.0006698455,0.0004034178,0.0000072972753],"about_ca_topic_score_codex":0.0028663953,"about_ca_topic_score_gemma":0.0021091367,"teacher_disagreement_score":0.0028663953,"about_ca_system_score_codex":0.0005135202,"about_ca_system_score_gemma":0.00061150786,"threshold_uncertainty_score":0.011144638},"labels":[],"label_agreement":null},{"id":"W2221306040","doi":"10.1007/s11081-015-9301-2","title":"Use of a biobjective direct search algorithm in the process design of material science applications","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Group for Research in Decision Analysis; McGill University; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Process (computing); Search algorithm; Mathematical optimization; Software; Algorithm; Mathematics; Programming language","score_opus":0.03504315994626296,"score_gpt":0.2741445349296213,"score_spread":0.23910137498335837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221306040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009679583,0.00042623843,0.9832653,0.00011518117,0.00008346439,0.00008807621,0.00001691197,0.00018458176,0.0061406996],"genre_scores_gemma":[0.15505031,0.00046441605,0.8401062,0.00011474152,0.000033987988,0.0003266538,0.000038743347,0.00009513459,0.0037698024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.0001546797,0.000016603168,0.0000412063,0.0002189476,0.000017003807],"domain_scores_gemma":[0.9993561,0.0004142535,0.00004095513,0.00003393328,0.00013305742,0.000021651269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739664,0.0007775927,0.0008858893,0.00081112125,0.0006985402,0.0010108189,0.0007900997,0.0015974158,0.002060694],"category_scores_gemma":[0.0020298285,0.00052609056,0.0006356824,0.0008554372,0.0006513567,0.00066578545,0.00069167535,0.0010444297,0.00048073442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001577622,0.00021090028,0.0003713132,0.00032470337,0.000059792645,0.000109297136,0.000078676116,0.83034706,0.018512916,0.026793616,0.00077279605,0.122261144],"study_design_scores_gemma":[0.000019279867,0.000067296816,0.00006122462,0.000010015836,0.000010099996,0.000023357512,0.000004681568,0.99439764,0.0020846098,0.0018751043,0.0014396785,0.000007081818],"about_ca_topic_score_codex":0.001575362,"about_ca_topic_score_gemma":0.0024703415,"teacher_disagreement_score":0.002060694,"about_ca_system_score_codex":0.00048942445,"about_ca_system_score_gemma":0.0013138915,"threshold_uncertainty_score":0.0068936944},"labels":[],"label_agreement":null},{"id":"W2246906915","doi":"10.1109/iisa.2015.7388081","title":"An effective identification of the induction machine parameters using a classic genetic algorithm, NSGA II and θ-NSGA III","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Genetic algorithm; Stator; Induction motor; Robustness (evolution); Identification (biology); Computer science; Automation; Inductance; Engineering; Algorithm; Voltage; Machine learning","score_opus":0.022223546437156575,"score_gpt":0.280275502639169,"score_spread":0.25805195620201243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246906915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035353594,0.00036075813,0.9585377,0.00016932792,0.00006913587,0.00011643288,0.000051986262,0.00037484837,0.0049662963],"genre_scores_gemma":[0.5653395,0.0005000614,0.4283384,0.00022510166,0.000033197208,0.0004994308,0.0002501856,0.00007755919,0.0047364547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995913,0.00017401419,0.0000204804,0.00007073677,0.00010619779,0.000037303504],"domain_scores_gemma":[0.9994685,0.00031049506,0.00006284312,0.00003737163,0.00010048922,0.00002041101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242675,0.0009600076,0.0005294126,0.00066631543,0.00026974827,0.00056056195,0.00067261275,0.00077740307,0.0011055861],"category_scores_gemma":[0.0022562183,0.0002445828,0.00049897446,0.0005604834,0.0004521667,0.00047687438,0.00036382655,0.00064894353,0.00023485842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006986638,0.000057026704,0.0010678368,0.000091414084,0.000060950737,0.00006632971,0.00005651394,0.8981535,0.0035512457,0.0063649653,0.0010137621,0.089446604],"study_design_scores_gemma":[0.000020968242,0.00006366908,0.0005668868,0.00001724664,0.000017589702,0.0000476047,0.000021439793,0.99409664,0.0013917581,0.0023316562,0.0014148457,0.000009828629],"about_ca_topic_score_codex":0.0049881926,"about_ca_topic_score_gemma":0.004265287,"teacher_disagreement_score":0.0049881926,"about_ca_system_score_codex":0.0006888601,"about_ca_system_score_gemma":0.0011857084,"threshold_uncertainty_score":0.009918332},"labels":[],"label_agreement":null},{"id":"W2256082675","doi":"10.1002/cjce.22353","title":"Optimization of both operating costs and energy efficiency in the alumina evaporation process by a multi‐objective state transition algorithm","year":2015,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"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":"Mathematical optimization; Benchmark (surveying); Pareto principle; Process (computing); Task (project management); Computer science; Evolutionary algorithm; Multi-objective optimization; Optimization problem; Operating cost; Algorithm; Mathematics; Engineering","score_opus":0.007813357490828723,"score_gpt":0.2198140969412945,"score_spread":0.21200073945046577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256082675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118876494,0.00045415194,0.87591326,0.00021241872,0.00003135349,0.00011828363,0.00004956698,0.00027540323,0.004069045],"genre_scores_gemma":[0.8480915,0.0002658453,0.14864835,0.00007957376,0.000017971164,0.0003489856,0.00010725725,0.00003899083,0.002401583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996772,0.00011793146,0.00001972852,0.00005648967,0.000076251345,0.00005232957],"domain_scores_gemma":[0.99943095,0.00035982628,0.00006674363,0.000019273893,0.000098376804,0.000024835104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182397,0.00081611297,0.0010749133,0.0007472108,0.00044861142,0.0012241814,0.000816181,0.0013261404,0.0013517329],"category_scores_gemma":[0.0013979572,0.00054228934,0.00095962296,0.0006916437,0.0005375994,0.0008144237,0.0007133265,0.0008766477,0.00015823693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029284294,0.00003117588,0.00027926365,0.000027016009,0.000018955132,0.000019831852,0.00001766351,0.9878825,0.0007976373,0.0010207264,0.0001109554,0.009765063],"study_design_scores_gemma":[0.0000070057463,0.000019100944,0.000056150966,0.000002080779,0.000005039788,0.0000030026893,0.0000029893122,0.99946934,0.00019059483,0.00018630917,0.00005673148,0.0000017130131],"about_ca_topic_score_codex":0.005105604,"about_ca_topic_score_gemma":0.0030317758,"teacher_disagreement_score":0.005105604,"about_ca_system_score_codex":0.00078218896,"about_ca_system_score_gemma":0.0015204288,"threshold_uncertainty_score":0.0101518035},"labels":[],"label_agreement":null},{"id":"W2264467697","doi":"10.1007/s12206-015-0422-5","title":"Development of a metamodel assisted sampling approach to aerodynamic shape optimization problems","year":2015,"lang":"en","type":"article","venue":"Journal of Mechanical Science and Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Victoria; Simon Fraser University","funders":"","keywords":"Airfoil; Metamodeling; Aerodynamics; Turbomachinery; Computer science; Surrogate model; Mathematical optimization; Shape optimization; Sampling (signal processing); Engineering; Aerospace engineering; Mathematics; Finite element method; Structural engineering","score_opus":0.059395005705395514,"score_gpt":0.2959650373075293,"score_spread":0.2365700316021338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264467697","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.003085572,0.000026372192,0.99559623,0.00002130526,0.000012598224,0.00002501848,0.000017621933,0.00011930836,0.0010960663],"genre_scores_gemma":[0.15980884,0.00012486162,0.8373457,0.000090553665,0.000037501017,0.00023647591,0.00015271294,0.00016587571,0.0020374206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997509,0.000088347086,0.000010799501,0.000024636916,0.000105871004,0.00001939357],"domain_scores_gemma":[0.99937433,0.00030774964,0.000036565885,0.000068351874,0.00017325486,0.00003980015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469868,0.00051068224,0.0007160082,0.00051370624,0.000304386,0.0004872706,0.0012241337,0.0007813497,0.0030140309],"category_scores_gemma":[0.0019397562,0.00046249005,0.000653605,0.00043715184,0.00029687953,0.00050536357,0.0009527086,0.0010449771,0.00075352733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072821225,0.00017735982,0.00083221146,0.00012223252,0.000052337287,0.00010332509,0.0000671242,0.83576006,0.015269278,0.024989367,0.0013810998,0.121172875],"study_design_scores_gemma":[0.000003022069,0.000012019751,0.000026078698,0.0000019972065,0.000001214225,0.000006264865,0.000002505369,0.9983051,0.00032426245,0.00090591767,0.00041004884,0.0000015343345],"about_ca_topic_score_codex":0.0021141716,"about_ca_topic_score_gemma":0.0030529303,"teacher_disagreement_score":0.0030140309,"about_ca_system_score_codex":0.0002650263,"about_ca_system_score_gemma":0.0006778177,"threshold_uncertainty_score":0.0100829005},"labels":[],"label_agreement":null},{"id":"W2277109028","doi":"10.1504/ijedpo.2015.072803","title":"Distance correlation-based nearly orthogonal space-filling experimental designs","year":2015,"lang":"en","type":"article","venue":"International Journal of Experimental Design and Process Optimisation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Orthogonality; Computer science; Design of experiments; Metric (unit); Context (archaeology); Correlation; Orthogonal array; Function (biology); Sampling (signal processing); Space (punctuation); Algorithm; Mathematical optimization; Mathematics; Statistics; Machine learning; Geometry; Taguchi methods","score_opus":0.048761867406958544,"score_gpt":0.32687539531102355,"score_spread":0.278113527904065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277109028","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.008474035,0.00019793723,0.9903346,0.00003857968,0.000020185169,0.00023727836,0.000034717785,0.00011723502,0.00054557266],"genre_scores_gemma":[0.20064287,0.00028523355,0.7964873,0.00013034581,0.00002803323,0.001496418,0.00010412928,0.000059896345,0.00076578354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9813851,0.013109921,0.000941433,0.0015914759,0.0026570968,0.00031497356],"domain_scores_gemma":[0.9665622,0.023016328,0.0042393943,0.003055138,0.0027035628,0.00042331667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017166102,0.0014402453,0.0020096772,0.0014696192,0.00043875937,0.0012805851,0.0018438322,0.0015706823,0.0019825678],"category_scores_gemma":[0.04148302,0.0008138488,0.0012506644,0.0011649955,0.002153161,0.0017754498,0.002498189,0.001377339,0.0003911632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017564365,0.0004521021,0.0015668353,0.0012620795,0.00021781866,0.000118057105,0.00029329062,0.6564092,0.026551858,0.105968826,0.0006112658,0.2047922],"study_design_scores_gemma":[0.00031549204,0.0032786042,0.00080693205,0.00012002418,0.000106022635,0.00012091248,0.000042167503,0.92993385,0.020216752,0.041031078,0.003923938,0.00010423467],"about_ca_topic_score_codex":0.0004048221,"about_ca_topic_score_gemma":0.00039900097,"teacher_disagreement_score":0.017166102,"about_ca_system_score_codex":0.0010525786,"about_ca_system_score_gemma":0.0017813687,"threshold_uncertainty_score":0.09078413},"labels":[],"label_agreement":null},{"id":"W2278053714","doi":"10.1214/15-sts531","title":"Analysis Methods for Computer Experiments: How to Assess and What Counts?","year":2016,"lang":"en","type":"article","venue":"Statistical Science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Smoothness; Computer science; Gaussian process; Bayesian probability; Bayes' theorem; Regression; Regression analysis; Code (set theory); Exponential function; Function (biology); Machine learning; Statistics; Algorithm; Econometrics; Artificial intelligence; Gaussian; Data mining; Mathematics","score_opus":0.050557874987754145,"score_gpt":0.425066255779265,"score_spread":0.37450838079151083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278053714","genre_codex":"methods","genre_gemma":"methods","domain_codex":"methods","domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":"methods","prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001989025,0.07277792,0.81584483,0.083573945,0.008605572,0.0027719163,0.0012520096,0.0027632236,0.010421566],"genre_scores_gemma":[0.042077396,0.019997554,0.8899535,0.022387464,0.006686893,0.015438974,0.00050651876,0.0015564656,0.0013952592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.24567322,0.672683,0.021521471,0.010655104,0.04833868,0.0011285066],"domain_scores_gemma":[0.08195647,0.8200286,0.02088174,0.04930747,0.025154117,0.0026716024],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.42719567,0.0056576706,0.013810332,0.0146967145,0.003945997,0.023361724,0.009501281,0.015655644,0.0071373805],"category_scores_gemma":[0.79039556,0.003881684,0.005368977,0.014627782,0.03213136,0.033779778,0.011579398,0.024507733,0.0036636544],"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.000988444,0.00038754844,0.005190177,0.016556002,0.004605703,0.00018471216,0.0021576441,0.008305673,0.0008468534,0.40667152,0.099526666,0.4545792],"study_design_scores_gemma":[0.00062086846,0.00052397395,0.0020763653,0.011538086,0.0008850068,0.00020681064,0.0007645473,0.017808907,0.0008864639,0.8782441,0.08604413,0.00040080817],"about_ca_topic_score_codex":0.0022352415,"about_ca_topic_score_gemma":0.0019306659,"teacher_disagreement_score":0.57280433,"about_ca_system_score_codex":0.00792277,"about_ca_system_score_gemma":0.015038426,"threshold_uncertainty_score":0.70636976},"labels":[],"label_agreement":null},{"id":"W2279033113","doi":"10.1080/00401706.2015.1044119","title":"Comment: Expected Improvement for Efficient Blackbox Constrained Optimization","year":2016,"lang":"en","type":"article","venue":"Technometrics","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"University of British Columbia","funders":"University of Florida","keywords":"Computer science; Image (mathematics); Work (physics); Artificial intelligence; Engineering","score_opus":0.015552989953244714,"score_gpt":0.25632255971756585,"score_spread":0.24076956976432112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279033113","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.0022199492,0.0023365023,0.05790101,0.70212704,0.11571376,0.00029544526,0.006924284,0.01470435,0.0977777],"genre_scores_gemma":[0.076102145,0.003229359,0.08428916,0.49968472,0.061164316,0.00078926893,0.0060149212,0.007648482,0.26107773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976248,0.00042069936,0.00013797857,0.00029924384,0.0012944316,0.00022289256],"domain_scores_gemma":[0.98315454,0.0075140297,0.00046779885,0.0014428827,0.0067202044,0.00070056156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628807,0.0011601648,0.00070574816,0.0005966014,0.0012586986,0.0019264861,0.0018235833,0.006021455,0.21463105],"category_scores_gemma":[0.043208238,0.0004050236,0.0011683555,0.0005802366,0.0010927416,0.0036631182,0.0013759958,0.0055429996,0.07850457],"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.00013736018,0.000018191948,0.00013673374,0.000117610565,0.000009664601,0.00009200378,0.000009600702,0.0006417447,0.0005711264,0.0050846036,0.97912973,0.014051598],"study_design_scores_gemma":[0.0004212909,0.00014953398,0.001294047,0.00036091774,0.000037368416,0.0006532693,0.000107770014,0.0152723035,0.00606098,0.04341082,0.9321295,0.000102161175],"about_ca_topic_score_codex":0.006124467,"about_ca_topic_score_gemma":0.0067187273,"teacher_disagreement_score":0.21463105,"about_ca_system_score_codex":0.0015774064,"about_ca_system_score_gemma":0.0017502544,"threshold_uncertainty_score":0.7180124},"labels":[],"label_agreement":null},{"id":"W2287252250","doi":"10.1109/tmag.2015.2491301","title":"Kriging-Assisted Multi-Objective Design of Permanent Magnet Motor for Position Sensorless Control","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":30,"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":"Torque ripple; Kriging; Computer science; Torque; Control theory (sociology); Surrogate model; Computation; Magnet; Position (finance); Finite element method; Ripple; Evolutionary algorithm; Mathematical optimization; Direct torque control; Control engineering; Control (management); Algorithm; Mathematics; Induction motor; Power (physics); Engineering; Artificial intelligence; Machine learning; Mechanical engineering; Physics; Voltage","score_opus":0.042524462057089894,"score_gpt":0.28266874074291504,"score_spread":0.24014427868582514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287252250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013700857,0.00013259509,0.9845234,0.000037490972,0.000012318875,0.000025120105,0.000011982205,0.00015108113,0.0014051012],"genre_scores_gemma":[0.7090711,0.00019848759,0.28856364,0.000040669463,0.000011066092,0.00019972923,0.0000644326,0.00006360953,0.0017872751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997801,0.000072060364,0.000008544213,0.000026222826,0.00009416036,0.000018888459],"domain_scores_gemma":[0.9997732,0.0000941167,0.00004151366,0.000016808537,0.00006459589,0.000009785799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005483632,0.0006056077,0.0005642962,0.00031607327,0.00024810186,0.0004138444,0.00051511935,0.0005804515,0.00075735716],"category_scores_gemma":[0.00093205593,0.0003806734,0.0005120926,0.00029170304,0.00026650226,0.00032057444,0.00031809747,0.0006036372,0.00019044038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021995076,0.000014304624,0.0001308008,0.000046393634,0.00001539448,0.000015591104,0.00001739005,0.9753415,0.0037894861,0.0010353656,0.0001317176,0.01944004],"study_design_scores_gemma":[0.0000033870056,0.00002573573,0.000057286634,0.0000027799754,0.0000028369125,0.0000050205904,0.0000018627437,0.998792,0.00065771845,0.00022002011,0.00022935466,0.0000021506357],"about_ca_topic_score_codex":0.0018749018,"about_ca_topic_score_gemma":0.002333256,"teacher_disagreement_score":0.0018749018,"about_ca_system_score_codex":0.00032817415,"about_ca_system_score_gemma":0.0006750141,"threshold_uncertainty_score":0.003728032},"labels":[],"label_agreement":null},{"id":"W2291284919","doi":"10.1109/tmag.2015.2487969","title":"On the Role of Robustness in Multi-Objective Robust Optimization: Application to an IPM Motor Design Problem","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Robust optimization; Mathematical optimization; Optimization problem; Control theory (sociology); Control engineering; Mathematics; Artificial intelligence; Engineering; Algorithm","score_opus":0.036092940105732836,"score_gpt":0.2628985279704792,"score_spread":0.22680558786474636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291284919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070443954,0.00048130064,0.9887416,0.00033675876,0.000027983202,0.000024014458,0.00000963431,0.000040698545,0.0032935203],"genre_scores_gemma":[0.61168456,0.0021972382,0.3820435,0.00032303255,0.00026169955,0.00017483026,0.000045285702,0.00016475712,0.0031050483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870753,0.0008075921,0.000059932812,0.00011983173,0.0002511078,0.000054047538],"domain_scores_gemma":[0.9910404,0.008082793,0.00031555444,0.00017165496,0.00033497153,0.000054682543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036573906,0.001193883,0.00094501156,0.0005970963,0.0005144878,0.0009961477,0.00058515917,0.0013951642,0.0017074959],"category_scores_gemma":[0.008923083,0.00033521972,0.0009403197,0.0004970808,0.0014294261,0.0015108997,0.001334589,0.0014615267,0.00022243205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008960157,0.000036439407,0.00029691993,0.00024060033,0.00005406014,0.00020704426,0.00008436022,0.9219387,0.0035040763,0.03379478,0.00043290967,0.039320394],"study_design_scores_gemma":[0.000008221585,0.00011605318,0.00015480097,0.000032046286,0.000018768764,0.000047390848,0.000018018527,0.97923446,0.0018379476,0.017490052,0.0010228871,0.000019275096],"about_ca_topic_score_codex":0.0007663081,"about_ca_topic_score_gemma":0.00046614592,"teacher_disagreement_score":0.0036573906,"about_ca_system_score_codex":0.00034777753,"about_ca_system_score_gemma":0.00033347646,"threshold_uncertainty_score":0.019342363},"labels":[],"label_agreement":null},{"id":"W2293460382","doi":"10.1162/evco_a_00175","title":"Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front","year":2016,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":70,"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":"Ministry of Economic Affairs","keywords":"Multi-objective optimization; Evolutionary algorithm; Weighting; Mathematical optimization; Nadir; Weight; Metric (unit); Mathematics; Set (abstract data type); Function (biology); Genetic algorithm; Pareto principle; Algorithm; Weight function; Global optimization; Computer science; Statistics","score_opus":0.010317740785484399,"score_gpt":0.26596375357615065,"score_spread":0.25564601279066623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293460382","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.008262783,0.00042898965,0.9888905,0.000058989226,0.000051807892,0.00004947723,0.000022111743,0.00025890366,0.0019764598],"genre_scores_gemma":[0.2027866,0.00069282565,0.7914828,0.00013381406,0.000051663028,0.0003660962,0.00021907873,0.00014607744,0.0041209674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.00016892362,0.000022609493,0.000090503454,0.00020572076,0.000054687403],"domain_scores_gemma":[0.99969614,0.00012346244,0.000030492842,0.00003784086,0.00009384944,0.000018144767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012825484,0.0013625978,0.0012239931,0.0013495827,0.0005311359,0.0008552,0.0011749638,0.0012426783,0.0014557934],"category_scores_gemma":[0.0014094006,0.00033855377,0.0014374419,0.001208571,0.0005558973,0.0009062492,0.0009205666,0.0011688593,0.00036548008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004753794,0.000051478823,0.0011029731,0.00013204833,0.0001331617,0.000119496,0.00009926739,0.81038094,0.0050985543,0.0154704265,0.0015155384,0.16584855],"study_design_scores_gemma":[0.00001834129,0.00008026058,0.00029127192,0.00002599068,0.000028872488,0.00009015304,0.000020605232,0.9879154,0.0015555753,0.0052703638,0.004688466,0.000014583719],"about_ca_topic_score_codex":0.0025579468,"about_ca_topic_score_gemma":0.0022937888,"teacher_disagreement_score":0.0025579468,"about_ca_system_score_codex":0.00056044414,"about_ca_system_score_gemma":0.0010692094,"threshold_uncertainty_score":0.0067828298},"labels":[],"label_agreement":null},{"id":"W2300775146","doi":"10.1115/detc2015-47535","title":"Constrained Multi-Objective Wind Farm Layout Optimization: Introducing a Novel Constraint Handling Approach Based on Constraint Programming","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Constraint (computer-aided design); Mathematical optimization; Computer science; Wind power; Optimization problem; Constraint logic programming; Constraint programming; Constrained optimization; Genetic algorithm; Global optimization; Stochastic programming; Engineering; Mathematics","score_opus":0.038412644678301584,"score_gpt":0.27547881905220367,"score_spread":0.2370661743739021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300775146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055717905,0.00008915332,0.99162334,0.000084422514,0.000023847255,0.000062966996,0.00006044174,0.00014167695,0.0023422937],"genre_scores_gemma":[0.16843152,0.00025375333,0.82714665,0.00015251583,0.00004888283,0.00046291514,0.00026167577,0.00019216606,0.003049882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928755,0.00028798595,0.000036990597,0.00010138744,0.00023490074,0.000051113373],"domain_scores_gemma":[0.9986821,0.00082277204,0.00015506792,0.000076233366,0.00022310854,0.000040729898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094285986,0.0012379226,0.0008288848,0.0007203738,0.0003710089,0.001121849,0.0012421724,0.0011375394,0.0027571006],"category_scores_gemma":[0.0027149622,0.00053764187,0.0007930974,0.0012763701,0.0005014916,0.0009091032,0.00093040743,0.0013532399,0.00035157264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017374601,0.000034522523,0.00020442034,0.000079567246,0.00003145807,0.00007379099,0.000022312513,0.97159743,0.0018779598,0.004556474,0.0006502431,0.02085445],"study_design_scores_gemma":[0.0000073849696,0.000022934135,0.00006441564,0.000008774512,0.0000061825367,0.000021859854,0.0000059770127,0.9972174,0.00062156876,0.00093732483,0.0010804646,0.000005629596],"about_ca_topic_score_codex":0.004644762,"about_ca_topic_score_gemma":0.0044004787,"teacher_disagreement_score":0.004644762,"about_ca_system_score_codex":0.00050141604,"about_ca_system_score_gemma":0.0012391809,"threshold_uncertainty_score":0.009235442},"labels":[],"label_agreement":null},{"id":"W2312272181","doi":"10.2514/6.2005-2204","title":"Collaboration Pursuing Method for MDO Problems","year":2005,"lang":"en","type":"article","venue":"46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.011503235781471341,"score_gpt":0.2876740148508082,"score_spread":0.27617077906933685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312272181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015525338,0.00010396509,0.9969805,0.00007039045,0.00002062656,0.000040158597,0.00001542691,0.0000552939,0.0011611137],"genre_scores_gemma":[0.15061453,0.00035142072,0.8452877,0.00013252674,0.000076481825,0.0007604059,0.00013676737,0.00012246484,0.0025177284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878985,0.0007060222,0.000048888753,0.00009158785,0.00030669154,0.00005692169],"domain_scores_gemma":[0.9970119,0.002218035,0.00018286439,0.00014200872,0.00032991578,0.00011514934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003367611,0.0010584913,0.0011083474,0.00084107846,0.00058692787,0.0007469335,0.0014282485,0.0013780929,0.0036032605],"category_scores_gemma":[0.006502119,0.00042225845,0.0011295091,0.00080648815,0.0008819103,0.0009356492,0.0020051082,0.0017048238,0.00057852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001224551,0.0000746831,0.0008006908,0.00023191668,0.00008983081,0.000110130735,0.00008273598,0.83070594,0.002254069,0.06756357,0.0016698034,0.09629409],"study_design_scores_gemma":[0.000019854633,0.00003625263,0.00003836813,0.000009546338,0.000006376357,0.000015761587,0.0000056097765,0.98916817,0.0003848894,0.008742015,0.0015679647,0.000005178482],"about_ca_topic_score_codex":0.0015814699,"about_ca_topic_score_gemma":0.0014716057,"teacher_disagreement_score":0.0036032605,"about_ca_system_score_codex":0.0006289722,"about_ca_system_score_gemma":0.0015791758,"threshold_uncertainty_score":0.017809868},"labels":[],"label_agreement":null},{"id":"W2315532451","doi":"10.2514/6.2006-6930","title":"Optimal Design for Uncertain Load Cases Using Convex Hulls","year":2006,"lang":"en","type":"article","venue":"11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Hull; Convex hull; Computer science; Regular polygon; Mathematical optimization; Mathematics; Engineering; Marine engineering; Geometry","score_opus":0.04647131534114375,"score_gpt":0.31098976970359415,"score_spread":0.2645184543624504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315532451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008554459,0.000114303795,0.9884919,0.00006602872,0.00001182893,0.000031741652,0.00002023673,0.00008617001,0.0026233296],"genre_scores_gemma":[0.7350852,0.0005629923,0.2586603,0.000104942286,0.00004718914,0.00047521232,0.00020014982,0.00016895407,0.004695107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.00035862517,0.00004935958,0.00010973128,0.00041591405,0.00013618653],"domain_scores_gemma":[0.9985973,0.0008360258,0.00019364755,0.00008623696,0.00023003387,0.00005672692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035776,0.0014135998,0.0015653513,0.0010708256,0.00049910264,0.0014565061,0.0008707195,0.0011254728,0.0026675253],"category_scores_gemma":[0.0036348002,0.0010403993,0.0012057435,0.00065961713,0.0012030344,0.0011175441,0.0012596888,0.0011619444,0.00049628544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010946082,0.000008432179,0.000042386422,0.000017990313,0.000006086645,0.000013487029,0.000016090296,0.9925996,0.0004334115,0.0023876326,0.00010919614,0.004354784],"study_design_scores_gemma":[0.0000023402733,0.000011916508,0.000017850947,0.0000036797587,0.0000018555614,0.0000025513507,0.0000045799443,0.99806935,0.00020992765,0.0015196671,0.00015385008,0.0000025219392],"about_ca_topic_score_codex":0.0050001154,"about_ca_topic_score_gemma":0.003283097,"teacher_disagreement_score":0.0050001154,"about_ca_system_score_codex":0.0011031454,"about_ca_system_score_gemma":0.0013725302,"threshold_uncertainty_score":0.009941995},"labels":[],"label_agreement":null},{"id":"W2316430657","doi":"10.2514/6.2008-5808","title":"A Strategy for Multi-Objective Shape Optimization for Turbine Stages in Three-Dimensional Flow","year":2008,"lang":"en","type":"article","venue":"12th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Computer science; Turbine; Flow (mathematics); Mechanical engineering; Engineering; Mechanics; Physics","score_opus":0.05073634765538736,"score_gpt":0.30925384147323776,"score_spread":0.2585174938178504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316430657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006263243,0.00007649608,0.9904062,0.000076786186,0.000028380804,0.0000694074,0.000014298501,0.00008933972,0.0029758716],"genre_scores_gemma":[0.38406998,0.00022728145,0.60725874,0.000218216,0.00006499035,0.00061943504,0.00008696414,0.00022082827,0.007233623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997905,0.00006582856,0.000011925769,0.0000295258,0.00008093043,0.000021355756],"domain_scores_gemma":[0.9997116,0.0001234208,0.000028659424,0.000024157163,0.00008726792,0.000024933861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090298767,0.0011808067,0.0010854448,0.0007552746,0.0006024623,0.00085670565,0.0013084369,0.0015319342,0.0035719974],"category_scores_gemma":[0.00145208,0.0007402516,0.001052933,0.00058134977,0.00072225695,0.0008180852,0.0013450807,0.00084978965,0.00060202956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051365612,0.00006682754,0.00018856992,0.00008826698,0.000038476384,0.00009311735,0.00007724265,0.92299896,0.009277622,0.013820169,0.0007562175,0.052543167],"study_design_scores_gemma":[0.00000717375,0.000039859853,0.000035220302,0.000004904812,0.000005397496,0.0000120320365,0.0000064297783,0.9972766,0.000525899,0.0016831834,0.00039840792,0.000004878836],"about_ca_topic_score_codex":0.0023583656,"about_ca_topic_score_gemma":0.0028211542,"teacher_disagreement_score":0.0035719974,"about_ca_system_score_codex":0.0006234097,"about_ca_system_score_gemma":0.0006882147,"threshold_uncertainty_score":0.01194948},"labels":[],"label_agreement":null},{"id":"W2317669480","doi":"10.1016/j.ifacol.2015.06.285","title":"Inventory replenishment planning and staggering","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Advanced Multi-Objective Optimization Algorithms","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é Laval","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Pareto principle; Pareto optimal; Population; Heuristic; Operations research; Order (exchange); Space (punctuation); Multi-objective optimization; Mathematics; Economics","score_opus":0.04709039033167884,"score_gpt":0.29784809703990955,"score_spread":0.2507577067082307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317669480","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.03175845,0.0025852197,0.9446382,0.00034366758,0.000075410135,0.00010850964,0.00020415432,0.00039244138,0.019893914],"genre_scores_gemma":[0.64605135,0.0029527822,0.3299487,0.000110828885,0.00007429837,0.00016051202,0.0004350816,0.00012272719,0.020143677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00018735198,0.00003102532,0.00010375511,0.0002052661,0.00007325064],"domain_scores_gemma":[0.99970883,0.00014646928,0.00003858924,0.000035717203,0.000050288116,0.00002008522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099346,0.0009214841,0.0009255467,0.00082125206,0.0006228642,0.0015863464,0.001116313,0.0011731717,0.003493735],"category_scores_gemma":[0.0013302908,0.00048898894,0.00078237493,0.002373448,0.00068879966,0.0013333433,0.00073169963,0.00083934073,0.00061416836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008610373,0.000061555285,0.00045241928,0.00018932429,0.000037606464,0.00018109263,0.00010616504,0.8347388,0.0023391666,0.052566484,0.0013873146,0.10785406],"study_design_scores_gemma":[0.000013815856,0.00005984714,0.00027559052,0.000024078789,0.000017766002,0.000079107245,0.00003860545,0.95241016,0.0017826031,0.03874792,0.0065318276,0.000018655881],"about_ca_topic_score_codex":0.0072164703,"about_ca_topic_score_gemma":0.007415088,"teacher_disagreement_score":0.0072164703,"about_ca_system_score_codex":0.0010428946,"about_ca_system_score_gemma":0.0018119222,"threshold_uncertainty_score":0.014348984},"labels":[],"label_agreement":null},{"id":"W2321338579","doi":"10.2514/6.2013-2652","title":"Sensitivity-Based Sequential Sampling of Cokriging Response Surfaces for Aerodynamic Data","year":2013,"lang":"en","type":"article","venue":"31st AIAA Applied Aerodynamics Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"McGill University","funders":"Compute Canada; McGill University","keywords":"Sensitivity (control systems); Aerodynamics; Sampling (signal processing); Computer science; Engineering; Aerospace engineering; Electronic engineering; Computer vision","score_opus":0.05740063859704398,"score_gpt":0.30207328786964016,"score_spread":0.2446726492725962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321338579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061240993,0.00011333979,0.9375077,0.000046768408,0.000011351043,0.00004852189,0.00007166995,0.0004297006,0.0005299219],"genre_scores_gemma":[0.704197,0.00015870773,0.29429996,0.00003793821,0.000014757164,0.0001293345,0.00044537906,0.00012074032,0.000596172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857223,0.0006751198,0.00007461363,0.00022684054,0.00036598142,0.00008521631],"domain_scores_gemma":[0.9951994,0.0033311434,0.00029693768,0.0005187318,0.0005917273,0.00006210775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029906954,0.00068636663,0.00068792555,0.00085151935,0.0002904401,0.00051835115,0.00061016565,0.00048755915,0.0006124548],"category_scores_gemma":[0.009585838,0.00043085232,0.00077867386,0.0007727874,0.0004863071,0.00059862173,0.0008416726,0.0008092198,0.00020026173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023792373,0.0000783919,0.0046147644,0.00014097051,0.00007080301,0.00008495907,0.00016881377,0.8936328,0.014450919,0.0043125786,0.0003626781,0.08184448],"study_design_scores_gemma":[0.000003876588,0.000025886038,0.000979506,0.000004460793,0.0000043477958,0.000017596118,0.00000988247,0.99512804,0.0027224957,0.0008340379,0.0002620495,0.000007863597],"about_ca_topic_score_codex":0.008654834,"about_ca_topic_score_gemma":0.008051222,"teacher_disagreement_score":0.008654834,"about_ca_system_score_codex":0.0006750942,"about_ca_system_score_gemma":0.0008621563,"threshold_uncertainty_score":0.017208934},"labels":[],"label_agreement":null},{"id":"W2323402416","doi":"10.2514/6.2002-5464","title":"Effective Multi-Mission Aircraft Conceptual Design Optimization Using a Hybrid Multi-Objective Evolutionary Method","year":2002,"lang":"en","type":"article","venue":"9th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Conceptual design; Computer science; Evolutionary algorithm; Evolutionary computation; Multi-objective optimization; Systems engineering; Engineering; Artificial intelligence; Human–computer interaction; Machine learning","score_opus":0.03141683009952633,"score_gpt":0.3019477032560249,"score_spread":0.27053087315649854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323402416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017736116,0.0001668216,0.97698045,0.00009099738,0.000050154133,0.000060246402,0.000022015782,0.00010235502,0.0047908393],"genre_scores_gemma":[0.46451664,0.00022866587,0.5301819,0.00014112103,0.000060328133,0.00046678894,0.00008458911,0.00011501749,0.004204977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956733,0.0001665174,0.000017684848,0.00003732346,0.00017485925,0.00003634226],"domain_scores_gemma":[0.9993771,0.0003278062,0.000055152475,0.000045624787,0.00015906735,0.00003536555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283561,0.00082505826,0.0011308495,0.0012636514,0.00062311057,0.0010609864,0.0013252256,0.0017060798,0.002258175],"category_scores_gemma":[0.0018539609,0.00071052415,0.0010817111,0.0008431279,0.0005944774,0.00087222084,0.00093660224,0.00077326,0.00030204357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002138628,0.000024676638,0.00010004825,0.00002473552,0.00002469213,0.00002260393,0.000011188092,0.9847134,0.0010955151,0.0028826073,0.000099735975,0.010979425],"study_design_scores_gemma":[0.000005969176,0.0000119518,0.00002592395,0.000002040991,0.0000036526687,0.000004071758,0.0000017413041,0.9993236,0.0001269116,0.00037468053,0.000117476855,0.0000020055536],"about_ca_topic_score_codex":0.0019195435,"about_ca_topic_score_gemma":0.0019694318,"teacher_disagreement_score":0.002258175,"about_ca_system_score_codex":0.0005497319,"about_ca_system_score_gemma":0.0008112785,"threshold_uncertainty_score":0.0075543523},"labels":[],"label_agreement":null},{"id":"W2323491979","doi":"10.1080/01621459.2016.1159211","title":"A Method of Constructing Space-Filling Orthogonal Designs","year":2016,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Orthogonality; Generality; Orthogonal array; Simplicity; Space (punctuation); Class (philosophy); Latin hypercube sampling; Hypercube; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Mathematical optimization; Pure mathematics; Discrete mathematics; Artificial intelligence; Geometry; Statistics; Monte Carlo method","score_opus":0.016654755919725307,"score_gpt":0.30833159826350426,"score_spread":0.29167684234377894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323491979","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.0011275676,0.000036496796,0.9977277,0.00002056376,0.00003614346,0.00015815053,0.000044005446,0.00014402093,0.00070544926],"genre_scores_gemma":[0.01325802,0.000077326484,0.9846223,0.000053179734,0.000041770243,0.001053791,0.00008527754,0.00007489867,0.00073338917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867007,0.009381565,0.0005214593,0.001118324,0.0019743498,0.00030361227],"domain_scores_gemma":[0.9829606,0.010804525,0.0011697259,0.0026939383,0.0021197116,0.0002516064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012324526,0.0015871215,0.0015094567,0.0025100806,0.0010383214,0.0011614818,0.001401569,0.0010454028,0.009480459],"category_scores_gemma":[0.035405934,0.0010077553,0.0016870559,0.0019619854,0.0017665522,0.0015812169,0.00231432,0.0023446165,0.0022758837],"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.00084370916,0.0002789668,0.0011729286,0.0006550782,0.00026058493,0.00016012015,0.00051719544,0.051208895,0.013645807,0.26980788,0.0044567133,0.6569922],"study_design_scores_gemma":[0.0013141122,0.0037721666,0.0018046701,0.00042357665,0.00036323705,0.00090545596,0.00030346148,0.3914929,0.035624847,0.46859276,0.09503158,0.00037124983],"about_ca_topic_score_codex":0.0004895411,"about_ca_topic_score_gemma":0.000581005,"teacher_disagreement_score":0.012324526,"about_ca_system_score_codex":0.0005442114,"about_ca_system_score_gemma":0.0022225883,"threshold_uncertainty_score":0.06517911},"labels":[],"label_agreement":null},{"id":"W2325647503","doi":"10.1115/detc2015-47532","title":"Optimization of Cutting Conditions in Vibration Assisted Drilling of Composites via a Multi-Objective EGO Implementation","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University; National Research Council Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pareto principle; Computer science; Vibration; Multi-objective optimization; Mathematical optimization; Kriging; Task (project management); Mathematics; Engineering; Machine learning","score_opus":0.03348011170114482,"score_gpt":0.3294746287325604,"score_spread":0.29599451703141555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325647503","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.13839656,0.00020604326,0.85751915,0.00007638513,0.000017401695,0.00010066167,0.0000563794,0.00034992496,0.0032774226],"genre_scores_gemma":[0.7529115,0.0001051139,0.24535698,0.000045442037,0.0000061013193,0.00019663777,0.00009380737,0.000057718462,0.0012267275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979323,0.00007826165,0.000009388671,0.000032583204,0.000054755823,0.000031776523],"domain_scores_gemma":[0.9996686,0.00018821846,0.000048174297,0.000019084702,0.000060208393,0.000015749138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068341446,0.00065927743,0.0006127703,0.00052862195,0.00022612457,0.0006370124,0.0006463616,0.0007756959,0.0011087861],"category_scores_gemma":[0.0008767437,0.00045298465,0.00066801795,0.00028517868,0.00033117883,0.0004746443,0.0006334456,0.0005577259,0.00017829835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003972752,0.000034534143,0.0002765825,0.00005398158,0.000015973765,0.0000220651,0.00002475422,0.9812593,0.00355162,0.0008514687,0.00006665937,0.013803413],"study_design_scores_gemma":[0.0000046928913,0.00005135834,0.000091154674,0.000004080351,0.0000043641057,0.0000055810206,0.000010578278,0.9987087,0.00073610974,0.0002526705,0.00012820162,0.0000024716126],"about_ca_topic_score_codex":0.0020832086,"about_ca_topic_score_gemma":0.0027031898,"teacher_disagreement_score":0.0020832086,"about_ca_system_score_codex":0.00031706714,"about_ca_system_score_gemma":0.0007379719,"threshold_uncertainty_score":0.0041421056},"labels":[],"label_agreement":null},{"id":"W2325902698","doi":"10.1109/jsyst.2015.2406874","title":"MOSOA-Based Multiobjective Design of Power Distribution Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University; Hydro-Québec","funders":"","keywords":"Recloser; Sorting; Reliability engineering; Pareto principle; Reliability (semiconductor); Genetic algorithm; Mathematical optimization; Multi-objective optimization; Computer science; Metaheuristic; Evolutionary algorithm; Failure rate; Fault (geology); Automation; Engineering; Electric power system; Power (physics); Circuit breaker; Algorithm; Mathematics","score_opus":0.04356989531453067,"score_gpt":0.27602803322796865,"score_spread":0.23245813791343797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325902698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0259036,0.00023547147,0.9671061,0.00006755223,0.000024154853,0.00008323302,0.0000481843,0.00015570171,0.0063759973],"genre_scores_gemma":[0.63222766,0.00032391312,0.36278114,0.000084216124,0.000024264284,0.00046182447,0.000121261386,0.000068520654,0.0039072107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997756,0.00008994447,0.0000089819105,0.00002626989,0.00007459084,0.000024668725],"domain_scores_gemma":[0.9997694,0.00011872484,0.00003450066,0.000011873997,0.00005090922,0.00001467513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005961097,0.000707012,0.0004502364,0.0007366637,0.0003011212,0.00053856306,0.0005419739,0.00052231445,0.0018424558],"category_scores_gemma":[0.0010055528,0.00031018557,0.0005455251,0.0005036173,0.00029783492,0.0003517926,0.0005758656,0.00042417154,0.0001927607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016791735,0.000014822922,0.00022764859,0.00003299353,0.00001472031,0.000022106888,0.00001540761,0.97692955,0.0013632609,0.0037328315,0.0001457393,0.017484028],"study_design_scores_gemma":[0.0000059278354,0.000031294167,0.00006463773,0.0000055382384,0.0000041950907,0.000008303865,0.000004965491,0.99782526,0.00035680708,0.0010567902,0.00063442136,0.0000019166437],"about_ca_topic_score_codex":0.0017222761,"about_ca_topic_score_gemma":0.0021073963,"teacher_disagreement_score":0.0018424558,"about_ca_system_score_codex":0.00050492835,"about_ca_system_score_gemma":0.00068581285,"threshold_uncertainty_score":0.0061636567},"labels":[],"label_agreement":null},{"id":"W2329042936","doi":"10.2514/6.2002-3000","title":"Adaptive Response Surface Method for Thermal Optimization: Application to Aircraft Engine Cooling System","year":2002,"lang":"en","type":"article","venue":"8th AIAA/ASME Joint Thermophysics and Heat Transfer Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite element method; Quadrilateral; Discretization; Thermal; Surface (topology); Mechanical engineering; Thermal conduction; Computer science; Control theory (sociology); Engineering; Materials science; Structural engineering; Mathematics; Physics; Thermodynamics; Mathematical analysis; Geometry","score_opus":0.029009069144137926,"score_gpt":0.2514149912023029,"score_spread":0.22240592205816495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329042936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011861811,0.00017139097,0.9857018,0.000088487584,0.000030548254,0.000020502828,0.000010146443,0.0003372411,0.001778187],"genre_scores_gemma":[0.47083354,0.0004076643,0.5236681,0.000099707926,0.00006167905,0.00023521154,0.00006497915,0.00031504245,0.0043140133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.00015411788,0.0000083755085,0.00002801216,0.000087814304,0.000015087624],"domain_scores_gemma":[0.9996737,0.00020118627,0.000019303669,0.00002104361,0.0000751533,0.000009608023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659902,0.0005698541,0.0006826323,0.000327623,0.0001926238,0.00027568254,0.0005140616,0.00066713005,0.00204789],"category_scores_gemma":[0.0011261061,0.00022141448,0.000516922,0.0003430785,0.00042289833,0.00031075033,0.00035904555,0.00065504765,0.00049683853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060919734,0.000047759433,0.00022115499,0.00008658985,0.00003444549,0.000043188298,0.000037456823,0.93397754,0.01186299,0.0055048885,0.00043108658,0.047691856],"study_design_scores_gemma":[0.000005079432,0.000016702297,0.000024220251,0.0000018602617,0.0000016833075,0.0000053226204,0.0000024459441,0.9981558,0.00079364126,0.0004992946,0.0004915728,0.000002464653],"about_ca_topic_score_codex":0.0011506035,"about_ca_topic_score_gemma":0.0008356355,"teacher_disagreement_score":0.00204789,"about_ca_system_score_codex":0.00016871323,"about_ca_system_score_gemma":0.00031758053,"threshold_uncertainty_score":0.0068508983},"labels":[],"label_agreement":null},{"id":"W2330289077","doi":"10.2514/6.2014-1486","title":"Surrogate-assisted Self-accelerated Particle Swarm Optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"","keywords":"Particle swarm optimization; Surrogate model; Computer science; Mathematical optimization; Algorithm; Mathematics; Machine learning","score_opus":0.0176824750901915,"score_gpt":0.25356721563116885,"score_spread":0.23588474054097736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330289077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010483505,0.00015407622,0.98536325,0.000079034464,0.00006262548,0.000029236424,0.000025823207,0.0002719025,0.0035305806],"genre_scores_gemma":[0.5866296,0.0004339014,0.40576947,0.00012035192,0.000064960725,0.0002515385,0.00034175842,0.00013971682,0.006248651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.0001896011,0.000019656152,0.000042809555,0.00018452072,0.00003152866],"domain_scores_gemma":[0.9993655,0.00026263212,0.00006635353,0.000082967315,0.000193328,0.000029221863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009111202,0.00058248127,0.0009918758,0.0004993872,0.0002918869,0.00070667564,0.00081231666,0.00094246824,0.0013199402],"category_scores_gemma":[0.0017690227,0.00029001647,0.0007303043,0.0006726041,0.00037329886,0.0005849991,0.0007566065,0.00078505743,0.00042110198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005519385,0.000044139964,0.00038962226,0.00007854839,0.000040953033,0.000058480862,0.000029653876,0.9492057,0.0040953485,0.007764158,0.0011059856,0.037132204],"study_design_scores_gemma":[0.00000340139,0.0000128679285,0.000033744163,0.0000016414043,0.0000014178913,0.000007729306,0.0000011207441,0.99874324,0.00034663884,0.0004900184,0.00035636133,0.0000017804161],"about_ca_topic_score_codex":0.0009205872,"about_ca_topic_score_gemma":0.00067844713,"teacher_disagreement_score":0.0013199402,"about_ca_system_score_codex":0.00028493788,"about_ca_system_score_gemma":0.00065710075,"threshold_uncertainty_score":0.004818499},"labels":[],"label_agreement":null},{"id":"W2330340987","doi":"10.2514/6.2007-1330","title":"Characterizing Global Behavior of Approximation Functions","year":2007,"lang":"en","type":"article","venue":"45th AIAA Aerospace Sciences Meeting and Exhibit","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science","score_opus":0.016788751471541758,"score_gpt":0.28049530853826926,"score_spread":0.2637065570667275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330340987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39577815,0.00041713013,0.5967788,0.0002627174,0.000025121233,0.000033079457,0.000111871996,0.0003936815,0.0061994684],"genre_scores_gemma":[0.9674759,0.0002330117,0.030501224,0.00004027919,0.000017858278,0.00003608737,0.000148994,0.00018118817,0.0013653636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992943,0.00027456164,0.000024535437,0.0001278926,0.00017197873,0.00010669118],"domain_scores_gemma":[0.9933611,0.0044210786,0.0005883095,0.0007104374,0.000682137,0.00023701433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023486977,0.0012532288,0.0008717627,0.0012456736,0.0005175363,0.0016251218,0.0007865607,0.0011400953,0.0016335011],"category_scores_gemma":[0.012148303,0.0005476588,0.0005987641,0.00066779484,0.0012577585,0.0020125054,0.0015247545,0.0013521456,0.0002765816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000413168,0.00013377359,0.009989255,0.00014229387,0.00010202837,0.00019604088,0.00035900783,0.86357147,0.032348976,0.04703318,0.0010063727,0.044704504],"study_design_scores_gemma":[0.000005533018,0.00009273536,0.0013318992,0.0000148127865,0.000013744841,0.000045631426,0.000055275937,0.985906,0.0030901972,0.009179003,0.00025811268,0.000007005171],"about_ca_topic_score_codex":0.0007166926,"about_ca_topic_score_gemma":0.0006870201,"teacher_disagreement_score":0.0023486977,"about_ca_system_score_codex":0.0008551246,"about_ca_system_score_gemma":0.00042382188,"threshold_uncertainty_score":0.012421191},"labels":[],"label_agreement":null},{"id":"W2330813385","doi":"10.2514/6.2008-5932","title":"Progressive Validity Trust Region Optimization","year":2008,"lang":"en","type":"article","venue":"12th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Trust region; Computer science; Computer security","score_opus":0.04354315104184983,"score_gpt":0.28348413629810026,"score_spread":0.23994098525625043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330813385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022400927,0.00007352655,0.99628603,0.000032549513,0.000011234295,0.000058279504,0.000018185097,0.00010722983,0.0011728351],"genre_scores_gemma":[0.2145854,0.0002663967,0.7798511,0.00012085435,0.000041436295,0.000660827,0.0002530416,0.00038724396,0.003833748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482346,0.0029181065,0.00020454559,0.0005866002,0.0012254327,0.00024191008],"domain_scores_gemma":[0.9874566,0.008928178,0.00083073816,0.0009136848,0.0017046251,0.00016617759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00831046,0.0018566172,0.0019597933,0.0013830133,0.0007694891,0.0016910849,0.0025127612,0.00161768,0.0036744114],"category_scores_gemma":[0.024510404,0.0010596389,0.0020277954,0.0010639689,0.0014770614,0.0019259463,0.0027886382,0.0021278712,0.001148611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012785585,0.00006597342,0.00078592665,0.00016601857,0.000077374156,0.00006195053,0.00012295942,0.9199862,0.0018518317,0.02471017,0.0007121434,0.051331606],"study_design_scores_gemma":[0.00001479255,0.000054700376,0.000076037875,0.000018398392,0.0000125898605,0.0000149095795,0.000014634217,0.9926938,0.0010623344,0.0048032654,0.0012256189,0.000008969962],"about_ca_topic_score_codex":0.0061073434,"about_ca_topic_score_gemma":0.003205005,"teacher_disagreement_score":0.00831046,"about_ca_system_score_codex":0.0016171248,"about_ca_system_score_gemma":0.0026964687,"threshold_uncertainty_score":0.04395038},"labels":[],"label_agreement":null},{"id":"W2330990173","doi":"10.2514/6.2009-2203","title":"A Comparison of Surrogate Models in the Framework of an MDO Tool for Wing Design","year":2009,"lang":"en","type":"article","venue":"50th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Wing; Surrogate model; Computer science; Engineering; Aerospace engineering; Machine learning","score_opus":0.03670067804279188,"score_gpt":0.32314822911510355,"score_spread":0.2864475510723117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330990173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0372557,0.00030321715,0.9533186,0.00027368867,0.0000564997,0.00006828958,0.0001333744,0.00037354833,0.008217088],"genre_scores_gemma":[0.65555567,0.0005280259,0.33990297,0.000083509105,0.000024339206,0.00031555875,0.0002815844,0.00020593032,0.0031025978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.00035597614,0.000023489776,0.00003449637,0.00016497936,0.000027447199],"domain_scores_gemma":[0.9983126,0.0011890354,0.00007598889,0.00017636518,0.00020578122,0.00004024344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016980667,0.0004771024,0.0008155859,0.00052980456,0.00024898624,0.0007558031,0.0006752344,0.00086312706,0.0023073943],"category_scores_gemma":[0.0052172267,0.00025511027,0.0005065877,0.00058509473,0.00028051436,0.0007292973,0.0006425566,0.0008700651,0.00050320296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012767725,0.00006098666,0.0004480716,0.000060575854,0.00002404672,0.000023263732,0.000024169633,0.9573272,0.00082378875,0.011422617,0.0002551453,0.029402537],"study_design_scores_gemma":[0.000005645314,0.000032999324,0.00005956488,0.0000062555964,0.0000025060751,0.0000052818255,0.000005180614,0.9981675,0.00023223273,0.00096224615,0.0005178811,0.000002625753],"about_ca_topic_score_codex":0.0014953448,"about_ca_topic_score_gemma":0.0017242669,"teacher_disagreement_score":0.0023073943,"about_ca_system_score_codex":0.0003688067,"about_ca_system_score_gemma":0.00081650814,"threshold_uncertainty_score":0.008980334},"labels":[],"label_agreement":null},{"id":"W2335942837","doi":"10.1007/s00158-016-1450-1","title":"Multi-start Space Reduction (MSSR) surrogate-based global optimization method","year":2016,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":79,"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 Victoria","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematical optimization; Surrogate model; Kriging; Sequential quadratic programming; Reduction (mathematics); Robustness (evolution); Nonlinear programming; Optimization problem; Global optimization; Mathematics; Latin hypercube sampling; Solver; Computer science; Quadratic programming; Nonlinear system; Machine learning","score_opus":0.01701809646615257,"score_gpt":0.29994265240356777,"score_spread":0.28292455593741517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335942837","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.0031571526,0.00015326963,0.9910104,0.000066437664,0.00004862811,0.000024422596,0.00003434076,0.00014826079,0.005357049],"genre_scores_gemma":[0.28014576,0.000456873,0.70884913,0.00020768607,0.000089461755,0.00033515925,0.00037913217,0.00026977767,0.009266946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.00019077322,0.00001777077,0.000041401938,0.00023445845,0.000023411912],"domain_scores_gemma":[0.9996189,0.00012836093,0.000040087092,0.000060624156,0.00013095804,0.000021155702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009219495,0.0007283679,0.0011402408,0.00060201663,0.0003672237,0.0006471423,0.0008738571,0.0011260691,0.0036614307],"category_scores_gemma":[0.001344578,0.00036236146,0.00096115284,0.00070319936,0.0004237991,0.0006559486,0.0011159802,0.0011620235,0.0011442394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056170364,0.00004374248,0.00018083578,0.00011397633,0.000032586202,0.000052717078,0.00003387266,0.93037397,0.0047811815,0.016172817,0.0017915801,0.046366543],"study_design_scores_gemma":[0.0000036176054,0.000019874169,0.000039084076,0.000006938351,0.00000388075,0.000012968778,0.0000026205707,0.99701774,0.00056386285,0.0013930775,0.0009330888,0.000003332138],"about_ca_topic_score_codex":0.00052279036,"about_ca_topic_score_gemma":0.00065121544,"teacher_disagreement_score":0.0036614307,"about_ca_system_score_codex":0.000254434,"about_ca_system_score_gemma":0.0007046923,"threshold_uncertainty_score":0.012248695},"labels":[],"label_agreement":null},{"id":"W235895081","doi":"10.1007/978-3-319-15892-1_17","title":"An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Multi-objective optimization; Mathematical optimization; Evolutionary algorithm; Convergence (economics); Preference; Point (geometry); Optimization problem; Genetic algorithm; Evolutionary computation; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.021300083924614695,"score_gpt":0.31953897782211965,"score_spread":0.29823889389750496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W235895081","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.010633646,0.00030101262,0.9645454,0.000109699955,0.0001645096,0.00008545039,0.00012532645,0.0016948917,0.02233994],"genre_scores_gemma":[0.16799402,0.00029765212,0.81851083,0.00016188808,0.000052955438,0.00038142246,0.00024798643,0.00047231064,0.011880895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.000042532007,0.0000055909154,0.000020514242,0.000059847865,0.000017797181],"domain_scores_gemma":[0.99984634,0.00007277498,0.000007820817,0.000019164721,0.000041088228,0.000012741377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003999595,0.0007352627,0.00066529424,0.0004851059,0.0004507092,0.00059922395,0.0013984098,0.001126767,0.009416333],"category_scores_gemma":[0.0007478412,0.00033139897,0.00084833696,0.0005337099,0.00030210838,0.00047834328,0.0010849595,0.00089075963,0.0012843149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172215,0.0001348649,0.0005370941,0.00035279433,0.00011066631,0.0002873524,0.00014511813,0.68214935,0.016885336,0.025241006,0.0085819,0.26544276],"study_design_scores_gemma":[0.00003302783,0.000045197758,0.00013853046,0.00002651814,0.000022907445,0.00008641281,0.000015297326,0.9826178,0.0022643537,0.004887085,0.009848261,0.000014599485],"about_ca_topic_score_codex":0.0017518338,"about_ca_topic_score_gemma":0.0023808065,"teacher_disagreement_score":0.009416333,"about_ca_system_score_codex":0.00026410184,"about_ca_system_score_gemma":0.00043025368,"threshold_uncertainty_score":0.031500816},"labels":[],"label_agreement":null},{"id":"W2376402869","doi":"","title":"Optimal design of heat pipe based on clonal selection algorithm","year":2011,"lang":"en","type":"article","venue":"Chemical Engineering(China)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Heat pipe; Heat transfer; Computer science; Selection (genetic algorithm); Loop heat pipe; Nominal Pipe Size; Work (physics); Limit (mathematics); Mathematical optimization; Algorithm; Engineering; Mechanical engineering; Mathematics; Materials science; Artificial intelligence; Thermodynamics","score_opus":0.012244836426777,"score_gpt":0.2097259187156755,"score_spread":0.1974810822888985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376402869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04681151,0.0001604213,0.9491787,0.00007019264,0.000027103593,0.00007571748,0.000018409546,0.00017799338,0.0034798984],"genre_scores_gemma":[0.7884415,0.00024551034,0.2072795,0.00007277134,0.000027515358,0.00037868414,0.000076143515,0.00004243545,0.0034359873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996138,0.00011051689,0.00001822238,0.000080973026,0.00011831013,0.000058138812],"domain_scores_gemma":[0.9994035,0.00030275964,0.000056484543,0.000028243767,0.00017988504,0.000029100273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040881,0.00075868337,0.0010656249,0.00087582564,0.000529235,0.00070155604,0.0010124125,0.001305404,0.0016448927],"category_scores_gemma":[0.0015268386,0.0004492495,0.0007726744,0.000735834,0.0007900993,0.00061998726,0.0006135424,0.00042379746,0.00016455754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018572646,0.00001595669,0.00031735408,0.000024229672,0.0000149314255,0.000040056202,0.000034893852,0.9786524,0.002928253,0.0035389096,0.00021754236,0.014196987],"study_design_scores_gemma":[0.0000065613476,0.000016727878,0.00005856856,0.0000017623053,0.000004570444,0.00000646723,0.0000032397622,0.9986565,0.00040325915,0.0007109762,0.00012859433,0.0000027346314],"about_ca_topic_score_codex":0.003808038,"about_ca_topic_score_gemma":0.002459723,"teacher_disagreement_score":0.003808038,"about_ca_system_score_codex":0.0007668092,"about_ca_system_score_gemma":0.001122763,"threshold_uncertainty_score":0.007571757},"labels":[],"label_agreement":null},{"id":"W2395916875","doi":"10.48550/arxiv.1605.06394","title":"Bayesian Hyperparameter Optimization for Ensemble Learning","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure; Université Laval","funders":"","keywords":"Hyperparameter; Hyperparameter optimization; Bayesian optimization; Ensemble learning; Computer science; Machine learning; Artificial intelligence; Bayesian probability; Classifier (UML); Greedy algorithm; Algorithm; Support vector machine","score_opus":0.05067038483577868,"score_gpt":0.2047557273018738,"score_spread":0.15408534246609512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395916875","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.0032979304,0.00032015704,0.99550194,0.00010552747,0.000017788752,0.000017521581,0.000030411913,0.00017610511,0.0005326629],"genre_scores_gemma":[0.33808157,0.0010182349,0.65550035,0.00039383612,0.00028680728,0.0005779341,0.00078007893,0.0005439133,0.0028173013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716944,0.0016371191,0.0001146341,0.00043804705,0.0005034641,0.00013743086],"domain_scores_gemma":[0.99596727,0.002730198,0.00027366052,0.0004275049,0.000481035,0.00012023375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046469225,0.0022535578,0.0026918,0.0016217715,0.0008363899,0.00167863,0.0021597473,0.0023190957,0.002061459],"category_scores_gemma":[0.012021953,0.0011541157,0.0016777575,0.0014636716,0.0012325082,0.002335927,0.0024028819,0.003249863,0.0008643302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035550627,0.000031757914,0.0004534052,0.000046965644,0.00012721715,0.000023629416,0.00004060346,0.9461175,0.0006464922,0.012866238,0.001020349,0.03859026],"study_design_scores_gemma":[0.0000039858774,0.000011329839,0.00004817715,0.000008709211,0.000010326981,0.0000072177663,0.0000044600815,0.9862185,0.00024077437,0.013063345,0.00037666518,0.0000066046296],"about_ca_topic_score_codex":0.0033286281,"about_ca_topic_score_gemma":0.0028355494,"teacher_disagreement_score":0.0046469225,"about_ca_system_score_codex":0.0011725175,"about_ca_system_score_gemma":0.0012759907,"threshold_uncertainty_score":0.024575591},"labels":[],"label_agreement":null},{"id":"W2398485474","doi":"10.1007/978-3-319-00795-3_76","title":"On the Application of a Multi-Objective Genetic Algorithm to the LORA-Spares Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Operations research proceedings","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Department of National Defence; University of Waterloo","funders":"","keywords":"Computer science; Genetic algorithm; Algorithm; Machine learning","score_opus":0.05072552233507193,"score_gpt":0.33448200437743697,"score_spread":0.28375648204236503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398485474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008372946,0.001546157,0.9563537,0.0005715263,0.00025749052,0.000085357016,0.000031490756,0.00013532148,0.03264596],"genre_scores_gemma":[0.24310832,0.00390113,0.73394126,0.0004213188,0.00030050572,0.00024639835,0.00010742641,0.00023976805,0.01773395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995596,0.00022020495,0.000013566504,0.000040268933,0.00013559824,0.000030688996],"domain_scores_gemma":[0.9993869,0.00047232522,0.000022969172,0.000029910205,0.00007075044,0.00001702356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011797604,0.0011339993,0.0009453736,0.0009844388,0.0006395896,0.0010515547,0.0014951021,0.0016530346,0.004829341],"category_scores_gemma":[0.00314507,0.00038844603,0.0010790736,0.002044994,0.00096243585,0.0010025554,0.0013559886,0.0017258576,0.00056817714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030730844,0.000047311387,0.000148208,0.0000774063,0.000032188083,0.000071168986,0.000054220942,0.86256194,0.0006626184,0.05127083,0.0022322417,0.08281109],"study_design_scores_gemma":[0.0000073097117,0.000026034875,0.00006383374,0.000023001436,0.000007882884,0.000025661424,0.0000102801705,0.97699034,0.00021308476,0.020612275,0.0020145122,0.000005891959],"about_ca_topic_score_codex":0.006198921,"about_ca_topic_score_gemma":0.0052895243,"teacher_disagreement_score":0.006198921,"about_ca_system_score_codex":0.00086266367,"about_ca_system_score_gemma":0.0008545573,"threshold_uncertainty_score":0.01615578},"labels":[],"label_agreement":null},{"id":"W2407184141","doi":"10.1007/s10479-016-2221-5","title":"Multiobjective variable mesh optimization","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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 Ottawa","funders":"Eurostars; Erasmus+; European Commission","keywords":"Mathematical optimization; Benchmark (surveying); Multi-objective optimization; Crossover; Theory of computation; Metaheuristic; Pareto principle; Evolutionary algorithm; Computer science; Population; Mathematics; Operator (biology); Algorithm; Artificial intelligence","score_opus":0.14629043189146912,"score_gpt":0.4340246466199914,"score_spread":0.2877342147285223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407184141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013760823,0.0018459819,0.9643132,0.0005282362,0.00049519434,0.000055204153,0.00013049219,0.00009016846,0.018780675],"genre_scores_gemma":[0.38242695,0.0024830014,0.58626735,0.00025290117,0.0003900833,0.00034826432,0.00042022322,0.0003131378,0.027098095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994247,0.00027657964,0.00002701813,0.00007794207,0.00015964042,0.00003414096],"domain_scores_gemma":[0.99910516,0.0005604992,0.000077305485,0.00008252452,0.00014139227,0.000033125336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862117,0.0011978734,0.0014683357,0.0012241226,0.00048273077,0.0015824023,0.00086107745,0.0015674,0.006337861],"category_scores_gemma":[0.0033411346,0.00052683527,0.0011479346,0.0013146326,0.0007129952,0.0011839742,0.0012072766,0.0015679477,0.00078848377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006190854,0.00006803973,0.00039482556,0.00018680128,0.000096682474,0.000044600532,0.000024948795,0.844255,0.0014842302,0.048254475,0.004296276,0.1008322],"study_design_scores_gemma":[0.0000071683007,0.000024610541,0.0001276366,0.000026656466,0.00001658984,0.00001806309,0.000008995944,0.9749323,0.0004949079,0.021692526,0.0026447258,0.000005893594],"about_ca_topic_score_codex":0.0009859726,"about_ca_topic_score_gemma":0.0010161313,"teacher_disagreement_score":0.006337861,"about_ca_system_score_codex":0.00073052116,"about_ca_system_score_gemma":0.00059740257,"threshold_uncertainty_score":0.021202207},"labels":[],"label_agreement":null},{"id":"W2411403232","doi":"10.1007/s00158-016-1495-1","title":"An evaluation of constraint aggregation strategies for wing box mass minimization","year":2016,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":77,"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":"Constraint (computer-aided design); Mathematical optimization; Minification; Computer science; Work (physics); Function (biology); Optimal design; Mathematics; Algorithm; Engineering","score_opus":0.025040273695040215,"score_gpt":0.3142377028888736,"score_spread":0.2891974291938334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411403232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31427047,0.002400948,0.6471775,0.0004195816,0.00016166795,0.00042397683,0.00024473277,0.00030522415,0.03459597],"genre_scores_gemma":[0.8220858,0.00058968907,0.17422211,0.00009056155,0.00003546668,0.00016831624,0.00012923975,0.00010155257,0.0025771833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.00020777507,0.000020388103,0.000032204887,0.0001434825,0.000047035937],"domain_scores_gemma":[0.99855095,0.0009529824,0.00007939304,0.00008455731,0.00028031017,0.00005173866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018683438,0.00085027685,0.0008521021,0.00075881963,0.00048686875,0.0009031193,0.0006345565,0.0008963669,0.0028110591],"category_scores_gemma":[0.0035505856,0.00023088549,0.00048024574,0.0008709614,0.00026891992,0.00073701376,0.0006260157,0.00046279212,0.00020957974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000315796,0.0002509894,0.0009865215,0.00019393717,0.00010049686,0.00006001777,0.000059451293,0.87863505,0.0031902099,0.009706107,0.0009726608,0.10552871],"study_design_scores_gemma":[0.000016637447,0.00013408408,0.00024923123,0.000013521673,0.000018136221,0.0000100166035,0.000021114583,0.9973659,0.0009645008,0.0008358262,0.00036749584,0.0000036040208],"about_ca_topic_score_codex":0.0034984315,"about_ca_topic_score_gemma":0.0046626767,"teacher_disagreement_score":0.0034984315,"about_ca_system_score_codex":0.0005468787,"about_ca_system_score_gemma":0.00084502314,"threshold_uncertainty_score":0.009880841},"labels":[],"label_agreement":null},{"id":"W2413296822","doi":"10.1080/00401706.2015.1115674","title":"RETRACTED: Design and Analysis of Experiments on Nonconvex Regions","year":2015,"lang":"en","type":"article","venue":"Technometrics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"is_retracted":true,"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":"Computer science; Scaling; Geodesic; Engineering design process; Process (computing); Metamodeling; Multidimensional scaling; Gaussian process; Mathematical optimization; Emphasis (telecommunications); Industrial engineering; Gaussian; Algorithm; Mathematics; Machine learning; Engineering; Software engineering; Mechanical engineering","score_opus":0.0923340093963908,"score_gpt":0.32333102581249307,"score_spread":0.23099701641610226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413296822","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.011813867,0.001587224,0.9383347,0.008490626,0.016566247,0.0020488095,0.0035776456,0.007129006,0.0104517685],"genre_scores_gemma":[0.10275956,0.002155994,0.8263656,0.0077300994,0.00315965,0.008462644,0.0046364563,0.0039776666,0.04075232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914206,0.003602184,0.0005498662,0.0014121874,0.0026226696,0.0003923762],"domain_scores_gemma":[0.9380926,0.026481401,0.0023044653,0.015585887,0.014875682,0.002660018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021943357,0.002185646,0.0020820491,0.0010433596,0.0009090066,0.0017311554,0.0042684814,0.0030681153,0.05269519],"category_scores_gemma":[0.071897164,0.0009065925,0.002368046,0.0008836456,0.001970224,0.0021380282,0.002434625,0.0047420166,0.011957464],"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.0045396416,0.0007442957,0.0022230803,0.0043462873,0.0005429904,0.0009347951,0.0005374506,0.06059385,0.058920722,0.08037775,0.2726535,0.5135856],"study_design_scores_gemma":[0.0021618416,0.00553909,0.003828652,0.0014527959,0.00047315852,0.0007603208,0.0002654417,0.2413405,0.066675864,0.098322496,0.57887554,0.00030429818],"about_ca_topic_score_codex":0.0012088772,"about_ca_topic_score_gemma":0.0012185536,"teacher_disagreement_score":0.05269519,"about_ca_system_score_codex":0.0014005223,"about_ca_system_score_gemma":0.0044234362,"threshold_uncertainty_score":0.17628294},"labels":[],"label_agreement":null},{"id":"W2460058546","doi":"10.1007/s00158-016-1489-z","title":"Numerical investigation of non-hierarchical coordination for distributed multidisciplinary design optimization with fixed computational budget","year":2016,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada); McGill University; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multidisciplinary design optimization; Multidisciplinary approach; Engineering design process; Computer science; Mathematical optimization; Industrial engineering; Control engineering; Engineering; Mathematics; Mechanical engineering; Sociology","score_opus":0.01323132199692577,"score_gpt":0.2644054959547941,"score_spread":0.25117417395786834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460058546","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.6315182,0.0006796196,0.33212793,0.00094513403,0.00014423148,0.00013172264,0.00020521728,0.00027593205,0.03397208],"genre_scores_gemma":[0.97843987,0.00005755143,0.020017916,0.000042084655,0.000010240292,0.00005242907,0.000037581598,0.000027378426,0.0013149718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963534,0.00014837837,0.000011734601,0.00005445319,0.00007637515,0.00007373772],"domain_scores_gemma":[0.9971819,0.0020280501,0.000232225,0.0001637384,0.00022237415,0.00017167395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012230293,0.0006119019,0.0010008671,0.00057324796,0.00069173693,0.0009782023,0.0011312013,0.001527565,0.0031358507],"category_scores_gemma":[0.0054639312,0.00045279425,0.00052536867,0.0006892679,0.0011268846,0.001052379,0.0010933502,0.0008398536,0.00016709656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056513218,0.000039120936,0.0003335048,0.000026343596,0.000009732994,0.00003681902,0.000018588387,0.99413645,0.00036677028,0.003584106,0.00016375163,0.0012281758],"study_design_scores_gemma":[0.000011979993,0.000013372209,0.00009082493,0.0000015657575,0.0000026286475,0.0000027748224,0.000011494237,0.9992441,0.00007602586,0.0005045226,0.000039361883,0.0000014010539],"about_ca_topic_score_codex":0.00783949,"about_ca_topic_score_gemma":0.0052098795,"teacher_disagreement_score":0.00783949,"about_ca_system_score_codex":0.0008832903,"about_ca_system_score_gemma":0.0010349818,"threshold_uncertainty_score":0.015587747},"labels":[],"label_agreement":null},{"id":"W2460675832","doi":"10.7939/r34p5w","title":"Regularization in reinforcement learning","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Alberta","funders":"","keywords":"Reinforcement learning; Markov decision process; Minimax; Regularization (linguistics); Mathematical optimization; Bellman equation; Estimator; Computer science; Mathematics; Algorithm; Markov process; Artificial intelligence","score_opus":0.013995230567726578,"score_gpt":0.22862049801719714,"score_spread":0.21462526744947055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460675832","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.006707109,0.00210168,0.9820096,0.0012239121,0.00019510191,0.000057634956,0.00004232836,0.00014353228,0.007519045],"genre_scores_gemma":[0.6577846,0.0044956724,0.32076603,0.0012126399,0.0010582503,0.000722755,0.0002359872,0.0002673695,0.013456685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981,0.00092075753,0.00009436904,0.00035328994,0.00041581225,0.00011583218],"domain_scores_gemma":[0.99093705,0.007472861,0.00047459212,0.00040756122,0.0005204784,0.00018747967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476276,0.0013421273,0.0016947897,0.0007699728,0.00064993143,0.001858947,0.0014782856,0.0022955418,0.0027016131],"category_scores_gemma":[0.016620573,0.00069033547,0.0011757666,0.00070786965,0.0032849605,0.0023138677,0.0019961228,0.003949914,0.00046280096],"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.000067468274,0.00006810542,0.0008311051,0.00029235866,0.00010340435,0.000088056084,0.000119776596,0.57565385,0.00081739336,0.38553086,0.0023867434,0.034040913],"study_design_scores_gemma":[0.0000205173,0.000040097475,0.00010985644,0.00003523994,0.000012175961,0.000020479942,0.000009942622,0.8430735,0.00023645116,0.1543582,0.0020711122,0.000012367611],"about_ca_topic_score_codex":0.0036951746,"about_ca_topic_score_gemma":0.0019018314,"teacher_disagreement_score":0.0036951746,"about_ca_system_score_codex":0.0023982145,"about_ca_system_score_gemma":0.0016142044,"threshold_uncertainty_score":0.018384516},"labels":[],"label_agreement":null},{"id":"W2464411218","doi":"10.1007/s11227-016-1806-8","title":"A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","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":"","keywords":"Initialization; Benchmark (surveying); Computer science; Convergence (economics); Point (geometry); Feature (linguistics); Mathematical optimization; Population; Optimization algorithm; Interior point method; Algorithm; Mathematics","score_opus":0.04898033443481277,"score_gpt":0.30189309775653383,"score_spread":0.2529127633217211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464411218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370057,0.00007626169,0.98554265,0.000029463226,0.000015722173,0.000040037517,0.000031880987,0.00025333103,0.0036405763],"genre_scores_gemma":[0.46162704,0.00017381416,0.53201574,0.00006704048,0.000027996193,0.00033374658,0.0001741201,0.00017769322,0.00540286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998776,0.000020212748,0.0000045028287,0.00002300207,0.000060558934,0.00001410316],"domain_scores_gemma":[0.9998951,0.00003732061,0.000012466122,0.000009291995,0.000037075763,0.000008739951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039533,0.0006580186,0.0007646657,0.00031936372,0.00035609677,0.00040542477,0.0014126397,0.0011163454,0.0036484196],"category_scores_gemma":[0.00044643943,0.00035381483,0.0006640874,0.0002520377,0.0003057212,0.00032590373,0.00064098433,0.00053717446,0.0005374846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029700037,0.000032151824,0.00022085606,0.00008640134,0.000023469334,0.00008283287,0.000032039246,0.94775844,0.00795174,0.0066771195,0.00057170494,0.036533486],"study_design_scores_gemma":[0.0000047553526,0.00002027458,0.000033007113,0.0000028045774,0.0000029085497,0.000009501064,0.000003352209,0.9983127,0.0005172869,0.0005162958,0.00057500636,0.0000020835507],"about_ca_topic_score_codex":0.0033138648,"about_ca_topic_score_gemma":0.004667851,"teacher_disagreement_score":0.0036484196,"about_ca_system_score_codex":0.0003453997,"about_ca_system_score_gemma":0.00061371253,"threshold_uncertainty_score":0.012205243},"labels":[],"label_agreement":null},{"id":"W2468065612","doi":"10.1007/978-3-319-50349-3_3","title":"MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Configurator; Computer science; Algorithm; Set (abstract data type); State (computer science); Range (aeronautics)","score_opus":0.015865622772823666,"score_gpt":0.27262503268348987,"score_spread":0.2567594099106662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468065612","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.0014537363,0.00012559112,0.98208296,0.000037130794,0.000038682854,0.00005661392,0.0001531814,0.013469626,0.0025825584],"genre_scores_gemma":[0.06322268,0.00013480087,0.92944825,0.00009396994,0.000041325628,0.0003419648,0.00057204126,0.0031566685,0.0029882377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00023158877,0.000038723523,0.00012407952,0.00031780082,0.000080867],"domain_scores_gemma":[0.99929893,0.00032578793,0.00005655123,0.0001403276,0.00013256421,0.000045826077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012221908,0.0014707897,0.0010254214,0.0011026253,0.00066226244,0.0015725334,0.003088852,0.0012611474,0.01704495],"category_scores_gemma":[0.0026402462,0.00083663984,0.0014716197,0.000744886,0.0005947491,0.001637556,0.0021533414,0.002391185,0.00398788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034367703,0.00017002298,0.0004973249,0.00052510796,0.00015312864,0.00014508453,0.00007930266,0.5230846,0.009988798,0.037873752,0.021787036,0.40535212],"study_design_scores_gemma":[0.000045902114,0.000047622616,0.00010090182,0.00003097536,0.000016578682,0.00004462835,0.000008170479,0.9746651,0.003981175,0.012593762,0.008440993,0.000024187953],"about_ca_topic_score_codex":0.0014401473,"about_ca_topic_score_gemma":0.0027000166,"teacher_disagreement_score":0.01704495,"about_ca_system_score_codex":0.00054542423,"about_ca_system_score_gemma":0.0010858808,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2475118633","doi":"10.4236/ojs.2016.63045","title":"Inverse Problem for a Time-Series Valued Computer Simulator via Scalarization","year":2016,"lang":"en","type":"article","venue":"Open Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Acadia University","funders":"Acadia University","keywords":"Computer science; Inverse; Focus (optics); Set (abstract data type); Simulation; Series (stratigraphy); Inverse problem; Mathematical optimization; Algorithm; Scalar (mathematics); Applied mathematics; Mathematics; Mathematical analysis","score_opus":0.01456073951975799,"score_gpt":0.2751931832559599,"score_spread":0.26063244373620187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475118633","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.0057403506,0.000029777704,0.9933489,0.000098010125,0.0000070677947,0.00002810148,0.000012872621,0.00007823011,0.0006566871],"genre_scores_gemma":[0.59959924,0.00016738636,0.39519683,0.00014982524,0.0000452501,0.00028952787,0.00012975387,0.0001160613,0.0043062028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989598,0.00045558115,0.000044409888,0.00019123084,0.00030781658,0.0000411026],"domain_scores_gemma":[0.9967615,0.002437003,0.0002379146,0.00020403667,0.00031465554,0.000044972177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429276,0.00059860206,0.00070252386,0.00034172318,0.00021912677,0.00075275893,0.00055702624,0.0009554274,0.0027068995],"category_scores_gemma":[0.0072536482,0.00032463946,0.00057992776,0.0003014377,0.001265595,0.0012156848,0.0009504484,0.0012479417,0.0003478127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001738111,0.00005466706,0.00076394225,0.0001772169,0.000040905135,0.00006887431,0.000114113194,0.90702194,0.011749472,0.039170086,0.0004510495,0.040213916],"study_design_scores_gemma":[0.000013141238,0.00009888956,0.00016339109,0.000007205764,0.000009024488,0.000037742906,0.00001067492,0.9873542,0.0032278846,0.008427852,0.00064107304,0.0000089441955],"about_ca_topic_score_codex":0.0011846072,"about_ca_topic_score_gemma":0.0006713226,"teacher_disagreement_score":0.0027068995,"about_ca_system_score_codex":0.00072958885,"about_ca_system_score_gemma":0.001013654,"threshold_uncertainty_score":0.012919605},"labels":[],"label_agreement":null},{"id":"W2479558876","doi":"10.1145/2908961.2931652","title":"Maintaining Diversity in The Bounded Pareto-Set","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Multi-objective optimization; Pareto principle; Mathematical optimization; Computer science; Population; Benchmark (surveying); Optimization problem; Machine learning; Mathematics; Geography","score_opus":0.03961643472876244,"score_gpt":0.27795692221809387,"score_spread":0.23834048748933143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479558876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114477955,0.00071139866,0.8700664,0.00029979492,0.000031666375,0.00005027582,0.000034051234,0.00021599565,0.014112478],"genre_scores_gemma":[0.8824128,0.00043286575,0.11388664,0.00015183285,0.000028863262,0.0001575055,0.00007025673,0.00008835679,0.0027708851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988128,0.0004942446,0.000036373855,0.00012625092,0.00041778642,0.00011254783],"domain_scores_gemma":[0.99752873,0.0016741048,0.00015055036,0.00027433646,0.0002751689,0.00009716212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022046336,0.00062928523,0.0009361125,0.001000472,0.0010458495,0.0014660025,0.0012520363,0.0010229181,0.0011732293],"category_scores_gemma":[0.0070402157,0.0003548294,0.00065003015,0.0006285749,0.0016372919,0.0011707229,0.002555718,0.001060981,0.00038450223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010579422,0.000060020222,0.00088575354,0.00013611844,0.00007722906,0.000274323,0.00035512174,0.8299405,0.012340663,0.1037363,0.0009957898,0.051092405],"study_design_scores_gemma":[0.000027288072,0.00012749323,0.0003438154,0.0000521914,0.000022609729,0.00015438441,0.0000756202,0.90246123,0.004662184,0.08938722,0.0026653162,0.000020687572],"about_ca_topic_score_codex":0.00065244583,"about_ca_topic_score_gemma":0.0004397258,"teacher_disagreement_score":0.0022046336,"about_ca_system_score_codex":0.0007736359,"about_ca_system_score_gemma":0.00072111527,"threshold_uncertainty_score":0.011659324},"labels":[],"label_agreement":null},{"id":"W2512575610","doi":"10.5539/ijef.v2n3p152","title":"Using Multiobjective Algorithms to Solve the Discrete Mean-Variance Portfolio Selection","year":2010,"lang":"en","type":"article","venue":"International Journal of Economics and Finance","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematical optimization; Benchmark (surveying); Multi-objective optimization; Maximization; Set (abstract data type); Selection (genetic algorithm); Portfolio; Variance (accounting); Minification; Computer science; Population; Integer (computer science); Evolutionary algorithm; Pareto principle; Mathematics; Economics; Artificial intelligence; Finance","score_opus":0.016374436807119485,"score_gpt":0.28027030077976783,"score_spread":0.26389586397264836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512575610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006918083,0.00020146127,0.9915039,0.00014260996,0.000023885603,0.00003931334,0.00001414209,0.000071467046,0.0010851072],"genre_scores_gemma":[0.19423543,0.0003887494,0.80200505,0.00020429194,0.00007732204,0.00041903832,0.00010091583,0.00006775118,0.002501324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899393,0.0006086478,0.000042463264,0.00010658499,0.00019842008,0.000049868173],"domain_scores_gemma":[0.99678016,0.002679708,0.000198477,0.00010599997,0.00018924582,0.000046376947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032404743,0.0013131946,0.0014548142,0.0011263818,0.00044924265,0.0013464675,0.0011757279,0.0018555721,0.0015380322],"category_scores_gemma":[0.0060873604,0.00062748283,0.00075806584,0.0010817241,0.0007211964,0.00093935925,0.0011017948,0.001408896,0.00033975835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017163127,0.00004839538,0.00038232328,0.00005113458,0.00007035855,0.00003196361,0.000019676268,0.96202326,0.00032863507,0.00979219,0.00026343763,0.026971517],"study_design_scores_gemma":[0.000014903485,0.000018950972,0.000051235154,0.0000066579387,0.000006894618,0.000009797901,0.0000045856373,0.9938583,0.00017431128,0.0055485126,0.000302379,0.0000034473305],"about_ca_topic_score_codex":0.001937338,"about_ca_topic_score_gemma":0.0020504752,"teacher_disagreement_score":0.0032404743,"about_ca_system_score_codex":0.00077298004,"about_ca_system_score_gemma":0.0011306211,"threshold_uncertainty_score":0.017137527},"labels":[],"label_agreement":null},{"id":"W2515178122","doi":"10.1007/s11590-017-1226-6","title":"Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Algorithm; Noise (video); Computational intelligence; Mathematical optimization; Optimization problem; Resampling; Function (biology); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.0369056004540894,"score_gpt":0.2605318215021814,"score_spread":0.223626221048092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515178122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004953342,0.0001512674,0.99309534,0.00010000369,0.00005014718,0.000018059924,0.000019841227,0.00011289101,0.0014989377],"genre_scores_gemma":[0.4004136,0.000360968,0.5924959,0.00017038552,0.00012985582,0.00036827865,0.00015584273,0.00034494975,0.0055602933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.00034229053,0.000026138629,0.00008586488,0.00019565647,0.000038325747],"domain_scores_gemma":[0.998054,0.0014067454,0.00015678248,0.00012949841,0.0001894219,0.00006348453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020930574,0.0010526689,0.0021057744,0.00060918886,0.00041707457,0.0012471154,0.0014017326,0.0018768231,0.0025987271],"category_scores_gemma":[0.0066590616,0.00070929003,0.000794177,0.0005878183,0.0012373239,0.0013995484,0.002071691,0.0013178737,0.00043925966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013336443,0.000026163696,0.00016021216,0.00009642666,0.00005855102,0.000047850663,0.000029325658,0.96134424,0.0015190964,0.020711286,0.0007261102,0.015147355],"study_design_scores_gemma":[0.000006615142,0.000005642937,0.000011905472,0.0000032787198,0.0000018434782,0.0000026901967,0.0000011349555,0.9972972,0.00015880232,0.002387419,0.000121296456,0.000002142146],"about_ca_topic_score_codex":0.0019077727,"about_ca_topic_score_gemma":0.0014305495,"teacher_disagreement_score":0.0025987271,"about_ca_system_score_codex":0.0005849392,"about_ca_system_score_gemma":0.0009916291,"threshold_uncertainty_score":0.011069298},"labels":[],"label_agreement":null},{"id":"W2520360696","doi":"10.1109/hpcsim.2016.7568398","title":"MultiObjective GPU design space exploration optimization","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; Western Canada Research Grid; University of Victoria","keywords":"Pareto principle; Computer science; Multi-objective optimization; Range (aeronautics); Mathematical optimization; Pareto optimal; Power (physics); Space (punctuation); Design space exploration; Optimal design; General-purpose computing on graphics processing units; Software; Graphics; Mathematics; Engineering; Machine learning","score_opus":0.030664163677567333,"score_gpt":0.26001078807122846,"score_spread":0.22934662439366113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520360696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32734114,0.00059079466,0.6511485,0.00041687864,0.000036667323,0.00014855621,0.00026211215,0.0004872076,0.019568061],"genre_scores_gemma":[0.87723,0.00019171098,0.11749239,0.00008063666,0.00000880127,0.00031189603,0.00017824903,0.000102587706,0.00440386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976903,0.000089899986,0.000006809601,0.000035485114,0.00006441353,0.000034461515],"domain_scores_gemma":[0.9996006,0.00024981014,0.000041821986,0.000031233223,0.000060657803,0.000015913076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058487174,0.0008423698,0.00067330827,0.00060688116,0.00030910183,0.0007444797,0.00062496564,0.000948324,0.0016941112],"category_scores_gemma":[0.0015396667,0.0003884512,0.0006686851,0.00044689796,0.00049495505,0.0005046976,0.00060544466,0.0005605147,0.00020043788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000960611,0.000009912269,0.00019595465,0.00001115948,0.0000071988034,0.000010318697,0.0000063691973,0.99581355,0.00045918027,0.00052267854,0.00007817063,0.002875955],"study_design_scores_gemma":[0.0000031955972,0.000013092778,0.00008495589,0.0000025230527,0.0000022154513,0.0000045076613,0.0000053758185,0.99895585,0.00024942818,0.0005497959,0.00012757271,0.0000013633311],"about_ca_topic_score_codex":0.0027444593,"about_ca_topic_score_gemma":0.002689599,"teacher_disagreement_score":0.0027444593,"about_ca_system_score_codex":0.0009424624,"about_ca_system_score_gemma":0.0008083073,"threshold_uncertainty_score":0.006838143},"labels":[],"label_agreement":null},{"id":"W2521992880","doi":"10.1115/gt2016-56741","title":"A High-Dimensional Model Representation Guided PSO Methodology With Application on Compressor Airfoil Shape Optimization","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Metamodeling; Particle swarm optimization; Metaheuristic; Mathematical optimization; Computer science; Benchmark (surveying); Airfoil; Parallel metaheuristic; Black box; Multi-swarm optimization; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.06024691598685311,"score_gpt":0.32695195456930554,"score_spread":0.2667050385824524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521992880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00781598,0.00020788738,0.9886718,0.0000942451,0.000039889146,0.000033182518,0.000013933936,0.00019342598,0.0029297576],"genre_scores_gemma":[0.5408096,0.000766892,0.4533425,0.000114233604,0.00006542254,0.00027031786,0.00013210335,0.000100421326,0.0043985676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998759,0.00003253646,0.000005767055,0.000018368924,0.0000566637,0.000010796402],"domain_scores_gemma":[0.99989796,0.000029063876,0.000015021662,0.00001344057,0.00003624264,0.00000823687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029486208,0.00058238936,0.000594071,0.00039183663,0.0003003382,0.0004901142,0.00056750636,0.00082886114,0.00095214095],"category_scores_gemma":[0.00053480547,0.00024273127,0.0006792031,0.0004687142,0.00032910783,0.00040807755,0.00056001777,0.0005451992,0.0002153289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022025664,0.000034255245,0.0004190763,0.00008324315,0.000027508173,0.00011694738,0.000051836076,0.92874205,0.008220104,0.009693767,0.00073788606,0.051851407],"study_design_scores_gemma":[0.0000028325817,0.000014026649,0.00006188058,0.0000029439923,0.0000025309769,0.000017312293,0.000003344715,0.9983463,0.0004961236,0.0004926499,0.00055678765,0.0000032114685],"about_ca_topic_score_codex":0.0024789965,"about_ca_topic_score_gemma":0.0012351131,"teacher_disagreement_score":0.0024789965,"about_ca_system_score_codex":0.00020847996,"about_ca_system_score_gemma":0.00053824874,"threshold_uncertainty_score":0.004929185},"labels":[],"label_agreement":null},{"id":"W2530530944","doi":"10.11159/cdsr16.123","title":"Automated Model Tuning Using A Genetic Algorithm","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference of Control, Dynamic systems, and Robotics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ontario Centres of Excellence","keywords":"Computer science; Genetic algorithm; Algorithm; Machine learning","score_opus":0.02311677357971546,"score_gpt":0.2637542770978292,"score_spread":0.24063750351811378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530530944","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.019274054,0.00005850662,0.9750924,0.00005738507,0.00001942398,0.000107525,0.000033333014,0.0025055136,0.0028518187],"genre_scores_gemma":[0.40614748,0.0000819343,0.5909324,0.00007466395,0.000013577424,0.0002908697,0.00013797323,0.00033806617,0.0019829974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00010496973,0.000022735769,0.00011528417,0.00017597187,0.00005194783],"domain_scores_gemma":[0.99932885,0.00029512096,0.00007030759,0.00012485046,0.00015746434,0.000023388897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009301977,0.0009849425,0.0008765912,0.00087603345,0.00068363396,0.00088144233,0.0012324625,0.0011244917,0.0019666532],"category_scores_gemma":[0.0022959658,0.0005501387,0.0008869024,0.0004480541,0.00054658065,0.0006343412,0.000813767,0.0009922533,0.00053782127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035966925,0.000051110772,0.00070486474,0.000035137902,0.00003566474,0.000080324455,0.000073236835,0.9149578,0.010100376,0.0031137809,0.00053063687,0.07028103],"study_design_scores_gemma":[0.000008431076,0.00001776285,0.000098908204,0.0000041900967,0.000006191947,0.000016215083,0.000005934928,0.9967694,0.0016764926,0.0006644792,0.00072623295,0.0000058103756],"about_ca_topic_score_codex":0.0071237213,"about_ca_topic_score_gemma":0.0048829187,"teacher_disagreement_score":0.0071237213,"about_ca_system_score_codex":0.00079808134,"about_ca_system_score_gemma":0.001332699,"threshold_uncertainty_score":0.014164507},"labels":[],"label_agreement":null},{"id":"W2532756054","doi":"10.1109/icmmt.2004.1411647","title":"Space mapping: a novel design and modeling methodology","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Computer science; Space mapping; Space (punctuation); Surrogate model; Design space exploration; Solid modeling; Systems engineering; Algorithm; Artificial intelligence; Engineering; Machine learning; Embedded system","score_opus":0.1728761670291491,"score_gpt":0.33522813430809806,"score_spread":0.16235196727894896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532756054","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.0006887027,0.00048596697,0.9949515,0.00021395569,0.000094482595,0.000021309788,0.000019850768,0.00011569562,0.0034086315],"genre_scores_gemma":[0.10180426,0.0034266019,0.8749898,0.00049904897,0.00037150353,0.0004990976,0.0001360298,0.00023714469,0.01803652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993187,0.00020505837,0.000030892443,0.00010234987,0.00031152036,0.00003152338],"domain_scores_gemma":[0.9996834,0.00011844605,0.00003876978,0.000060040136,0.00007719849,0.000022144077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089072686,0.0010356244,0.0008170424,0.0008491716,0.000491199,0.0016364129,0.0015296843,0.0013601785,0.0051866514],"category_scores_gemma":[0.0011758674,0.00046350513,0.0009467049,0.00084622495,0.001087989,0.0019093235,0.001976548,0.0013938693,0.0016209757],"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.000048143604,0.000048311253,0.0003101959,0.0003771935,0.000055729397,0.00013196199,0.00018614274,0.19404097,0.010950149,0.5657361,0.0071058436,0.22100931],"study_design_scores_gemma":[0.000027234211,0.00020604284,0.00016882014,0.000101728045,0.000040661987,0.00046088573,0.00005834696,0.62709796,0.006317638,0.20179567,0.16367495,0.00005001787],"about_ca_topic_score_codex":0.0006742422,"about_ca_topic_score_gemma":0.00052088604,"teacher_disagreement_score":0.0051866514,"about_ca_system_score_codex":0.0005135309,"about_ca_system_score_gemma":0.0010312604,"threshold_uncertainty_score":0.01735109},"labels":[],"label_agreement":null},{"id":"W2533175436","doi":"10.1007/s40860-016-0030-x","title":"Optimization of sensor deployment using multi-objective evolutionary algorithms","year":2016,"lang":"en","type":"article","venue":"Journal of Reliable Intelligent Environments","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"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":"Agence Universitaire de la Francophonie","keywords":"Wireless sensor network; Computer science; Cover (algebra); Evolutionary algorithm; Software deployment; Key distribution in wireless sensor networks; Position (finance); Algorithm; Point (geometry); Multi-objective optimization; Field (mathematics); Real-time computing; Mathematical optimization; Wireless; Wireless network; Computer network; Artificial intelligence; Machine learning; Mathematics; Telecommunications; Engineering","score_opus":0.02495240038548186,"score_gpt":0.27026518915702813,"score_spread":0.24531278877154628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533175436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056446314,0.00044347512,0.9384722,0.00024531814,0.00006329059,0.000074557254,0.000049053895,0.00017385378,0.004032042],"genre_scores_gemma":[0.82550883,0.00034852664,0.17056333,0.00007133629,0.00003100796,0.0002204121,0.0000930887,0.000073677715,0.0030898177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993988,0.00027750432,0.000023813847,0.00008230478,0.00013753244,0.00008002458],"domain_scores_gemma":[0.99872774,0.0008520504,0.00012874157,0.000050818217,0.000194613,0.000045977293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015104782,0.0012833282,0.0012889906,0.001003816,0.00046297172,0.0010470374,0.0010844815,0.0014486884,0.001427729],"category_scores_gemma":[0.004622687,0.0008167178,0.0007781368,0.0010979825,0.0006646256,0.0012133181,0.0010237796,0.00088413275,0.00022039485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011525865,0.00000989466,0.00010163614,0.000011025414,0.000010310498,0.00001325338,0.000006476471,0.9955473,0.00023586734,0.0005587475,0.000066654415,0.003427321],"study_design_scores_gemma":[0.0000030155309,0.000009153078,0.000040257422,0.0000017175917,0.0000024871667,0.0000025715785,0.0000034312295,0.99951017,0.000080155485,0.0003069956,0.000038841994,0.0000011104909],"about_ca_topic_score_codex":0.0033497547,"about_ca_topic_score_gemma":0.0029914733,"teacher_disagreement_score":0.0033497547,"about_ca_system_score_codex":0.00086390163,"about_ca_system_score_gemma":0.0008191976,"threshold_uncertainty_score":0.0079882145},"labels":[],"label_agreement":null},{"id":"W2545690268","doi":"10.1109/mesa.2006.296978","title":"Fuzzy Modeling in Response Surface Method for Complex Computer Model Based Design Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Computer science; Fuzzy logic; Surrogate model; Computation; Response surface methodology; Black box; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.06820640544669193,"score_gpt":0.3186955791557559,"score_spread":0.250489173709064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545690268","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.0013373949,0.00015295256,0.99698573,0.00007812901,0.000019707704,0.000015237854,0.000009656975,0.0001189418,0.0012823218],"genre_scores_gemma":[0.23659387,0.00090202986,0.7563849,0.00015848919,0.000069117275,0.00041383965,0.00012533009,0.0001497979,0.0052026086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993691,0.00031523782,0.000019609759,0.00005546323,0.00021914722,0.000021317417],"domain_scores_gemma":[0.9996486,0.00020023316,0.000022345324,0.0000412495,0.00007983805,0.00000771444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011832995,0.0006988115,0.0007129629,0.0004624078,0.00028394695,0.0007409451,0.0006833096,0.0009728442,0.0025968344],"category_scores_gemma":[0.0016003272,0.00026390626,0.00078191055,0.00058816996,0.0005597152,0.0006646554,0.00056463975,0.001298377,0.0007451668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005614463,0.00004164546,0.0001851885,0.00018494458,0.00004626133,0.00007462723,0.000098502496,0.8147165,0.011878316,0.08949535,0.0016261705,0.08159639],"study_design_scores_gemma":[0.0000061623673,0.000023596807,0.000033995057,0.000008534893,0.0000047126377,0.000013082086,0.0000057072975,0.98842305,0.0011930333,0.0076548285,0.0026260205,0.0000072700855],"about_ca_topic_score_codex":0.0016680912,"about_ca_topic_score_gemma":0.001283817,"teacher_disagreement_score":0.0025968344,"about_ca_system_score_codex":0.00043375802,"about_ca_system_score_gemma":0.00058528443,"threshold_uncertainty_score":0.008687258},"labels":[],"label_agreement":null},{"id":"W2551080769","doi":"10.5267/j.ijiec.2016.11.002","title":"Comments on “A note on multi-objective improved teaching-learning based optimization algorithm (MO-ITLBO)”","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Optimization algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.019908308112149244,"score_gpt":0.2859615023326546,"score_spread":0.2660531942205054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551080769","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.00068307016,0.0023168263,0.004694809,0.7700923,0.21170667,0.00009218897,0.0004987366,0.00052290614,0.009392533],"genre_scores_gemma":[0.0067447266,0.0017934365,0.003964466,0.8505701,0.069717206,0.00015786123,0.00022984888,0.0003548993,0.06646755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954412,0.0008626395,0.00057559117,0.0006253802,0.0020754696,0.00041960244],"domain_scores_gemma":[0.9799361,0.007137547,0.0011735446,0.00053921883,0.010189158,0.0010244363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003591266,0.0012484994,0.0010392164,0.000743146,0.0026653504,0.002689988,0.0028016544,0.015842937,0.01884279],"category_scores_gemma":[0.03999867,0.0006025513,0.0015625957,0.0008907299,0.001486878,0.0027616695,0.0017346952,0.018055419,0.01683383],"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.000035102006,0.000010133354,0.00014211638,0.000049632094,0.000008713482,0.00013843781,0.000052327283,0.0001405176,0.00028709203,0.0010535485,0.99342763,0.0046547423],"study_design_scores_gemma":[0.000023409691,0.000033006378,0.00096964295,0.00011446043,0.000015803456,0.0001871787,0.00014073063,0.000571222,0.0006375472,0.0015905813,0.9956577,0.00005876262],"about_ca_topic_score_codex":0.025238207,"about_ca_topic_score_gemma":0.02855497,"teacher_disagreement_score":0.025238207,"about_ca_system_score_codex":0.0033226176,"about_ca_system_score_gemma":0.0033253757,"threshold_uncertainty_score":0.06303543},"labels":[],"label_agreement":null},{"id":"W2559258189","doi":"10.1109/cec.2016.7744255","title":"Pareto-based many-objective optimization using knee points","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Brock University","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Pareto principle; Computer science; Metric (unit); Particle swarm optimization; Optimization problem; Evolutionary algorithm; Point (geometry); Set (abstract data type); Mathematics; Engineering","score_opus":0.018446446833743173,"score_gpt":0.26396857241189736,"score_spread":0.2455221255781542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559258189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021812802,0.00044752072,0.97136396,0.000079695965,0.000036087426,0.00007597132,0.00002641895,0.00021846099,0.0059390455],"genre_scores_gemma":[0.5640003,0.0007438739,0.43033206,0.00013343157,0.000036028632,0.00040380858,0.00019570292,0.00009343861,0.0040613576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958545,0.000119580625,0.000022101382,0.000037702135,0.0002041078,0.000031057803],"domain_scores_gemma":[0.99950373,0.00023400053,0.000057443973,0.000037943748,0.00014016319,0.000026775497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010673155,0.0010677995,0.0008418378,0.0010390289,0.0004422988,0.0008884358,0.0009954941,0.00081847975,0.0014519154],"category_scores_gemma":[0.0017269277,0.0003791826,0.00075174536,0.0008549388,0.000555042,0.00081014563,0.0010972469,0.00087886734,0.00033033313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028932753,0.000051488954,0.000476062,0.00010842236,0.00003823533,0.000052374857,0.000048649887,0.9259065,0.0029514036,0.011504303,0.0005646142,0.058268994],"study_design_scores_gemma":[0.000010934083,0.00006285947,0.00012922956,0.000017028142,0.0000071274935,0.000021168273,0.000013074383,0.99412954,0.0009377469,0.0036579056,0.0010054853,0.000007996502],"about_ca_topic_score_codex":0.001825512,"about_ca_topic_score_gemma":0.0015036487,"teacher_disagreement_score":0.001825512,"about_ca_system_score_codex":0.0005052179,"about_ca_system_score_gemma":0.0008472871,"threshold_uncertainty_score":0.00564456},"labels":[],"label_agreement":null},{"id":"W2559295340","doi":"10.1109/cec.2016.7743865","title":"3D-RadVis: Visualization of Pareto front in many-objective optimization","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":69,"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":"Visualization; Multi-objective optimization; Computer science; Mathematical optimization; Parallel coordinates; Convergence (economics); Benchmark (surveying); Pareto principle; Range (aeronautics); Process (computing); Data visualization; Mathematics; Data mining; Engineering","score_opus":0.010264703657065201,"score_gpt":0.2659576627734646,"score_spread":0.2556929591163994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559295340","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.012289948,0.0006851553,0.96178865,0.0005515599,0.00014306055,0.00012330532,0.0011351757,0.01466767,0.0086154165],"genre_scores_gemma":[0.17194161,0.0015801602,0.81574416,0.00028830642,0.00009921683,0.0006128598,0.0019092535,0.002712149,0.0051122936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.00023819218,0.000036551857,0.000053019776,0.00020319481,0.00005696177],"domain_scores_gemma":[0.9991283,0.00046506128,0.00007013371,0.00008124543,0.00019568378,0.000059576287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014048002,0.002008748,0.0008232363,0.002289162,0.00064213725,0.0020862897,0.0010441054,0.0012962674,0.012054762],"category_scores_gemma":[0.0026520325,0.0004996031,0.0012440864,0.0015280284,0.0004149796,0.0015222823,0.0018856487,0.001985048,0.0019026245],"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.0005127475,0.00028361412,0.0025717365,0.0017491776,0.00019274351,0.0007206487,0.0018552084,0.2816064,0.05799646,0.06963757,0.07983851,0.5030352],"study_design_scores_gemma":[0.00012477768,0.00012322159,0.0015227179,0.00028246455,0.000047511407,0.00045285298,0.00025146457,0.84777296,0.03688109,0.03741337,0.07494053,0.00018705911],"about_ca_topic_score_codex":0.0024461744,"about_ca_topic_score_gemma":0.0021046435,"teacher_disagreement_score":0.012054762,"about_ca_system_score_codex":0.00051474315,"about_ca_system_score_gemma":0.0011242459,"threshold_uncertainty_score":0.04032725},"labels":[],"label_agreement":null},{"id":"W2566765582","doi":"10.1016/j.compchemeng.2016.12.011","title":"Practical optimization for cost reduction of a liquefier in an industrial air separation plant","year":2016,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Particle swarm optimization; Reduction (mathematics); Process engineering; Engineering; Power station; Automotive engineering; Mathematical optimization; Mathematics; Electrical engineering","score_opus":0.03405805684388455,"score_gpt":0.29980101122934877,"score_spread":0.26574295438546425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566765582","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.7181641,0.0009811284,0.25259334,0.0011561732,0.00013498231,0.0002643612,0.00033180148,0.00041831227,0.025955878],"genre_scores_gemma":[0.9780833,0.00014955105,0.01826254,0.00003363328,0.000013479569,0.00008904902,0.00007844038,0.000033986475,0.003256011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997317,0.00008302503,0.000008141627,0.00003818264,0.00006966915,0.00006921194],"domain_scores_gemma":[0.99971646,0.00016412513,0.000021246613,0.0000127572785,0.000061641316,0.00002382244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864707,0.0010095263,0.0012677979,0.0008011131,0.0015024836,0.0013447119,0.0006418704,0.0016677085,0.004364],"category_scores_gemma":[0.0009830929,0.0005887148,0.0007917341,0.00073745137,0.00046789527,0.00062453933,0.0006664923,0.00090045104,0.00026948584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017252295,0.00007252963,0.000395051,0.00010083878,0.000013507103,0.00009109642,0.000025865453,0.9854929,0.0030224067,0.0007445706,0.00034752488,0.009521084],"study_design_scores_gemma":[0.000016644764,0.0000858581,0.00034348477,0.0000042325128,0.000012962437,0.000010868897,0.00003385243,0.9980215,0.001003467,0.0002488816,0.0002130097,0.000005296729],"about_ca_topic_score_codex":0.02468228,"about_ca_topic_score_gemma":0.01884441,"teacher_disagreement_score":0.02468228,"about_ca_system_score_codex":0.0017085562,"about_ca_system_score_gemma":0.0017724077,"threshold_uncertainty_score":0.049077213},"labels":[],"label_agreement":null},{"id":"W2573849483","doi":"10.1109/cefc.2016.7816151","title":"Surrogate-based MOEA/D for electric motor design with scarce function evaluations","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Surrogate model; Decomposition; Computer science; Mathematical optimization; Evolutionary algorithm; Function (biology); Algorithm design; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.028464992318812783,"score_gpt":0.2765254300905267,"score_spread":0.24806043777171394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573849483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043534976,0.0001653842,0.994208,0.000030673167,0.000016100961,0.000013678737,0.000008730029,0.000092543174,0.0011114378],"genre_scores_gemma":[0.3282926,0.00048420887,0.66795444,0.00009198433,0.000027298784,0.00027273165,0.00016829629,0.00013010587,0.0025783167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996408,0.00016413823,0.000013409961,0.000028841478,0.00012694136,0.000025814456],"domain_scores_gemma":[0.9996278,0.00021579152,0.00003167817,0.000031726515,0.00007125645,0.000021658332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009345026,0.00088895747,0.0009371088,0.00058801385,0.0003202363,0.00046522458,0.0006071717,0.0007424923,0.00114964],"category_scores_gemma":[0.0018727409,0.00044778344,0.00082230644,0.0005781821,0.00038737734,0.00044555427,0.0007355153,0.0009868832,0.0003546444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004797949,0.000027662541,0.00024291588,0.00007109978,0.000038160837,0.000028095403,0.000021481834,0.94975775,0.0034476218,0.005879319,0.00043586595,0.040002063],"study_design_scores_gemma":[0.000005419757,0.000021362739,0.000033738816,0.000005335406,0.0000033348592,0.000009312809,0.0000020800785,0.9974153,0.00057521067,0.0012549685,0.0006718246,0.0000020820153],"about_ca_topic_score_codex":0.0007937196,"about_ca_topic_score_gemma":0.0007761602,"teacher_disagreement_score":0.00114964,"about_ca_system_score_codex":0.00032607777,"about_ca_system_score_gemma":0.0005862768,"threshold_uncertainty_score":0.0049421787},"labels":[],"label_agreement":null},{"id":"W2573944554","doi":"10.1109/cefc.2016.7816205","title":"Feature selection for facilitation of evolutionary multi-objective design optimization: Application to IPM motor design problems","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Curse of dimensionality; Feature selection; Computer science; Dimensionality reduction; Selection (genetic algorithm); Artificial intelligence; Mathematical optimization; Machine learning; Evolutionary computation; Feature (linguistics); Dimension (graph theory); Optimization problem; Mathematics; Algorithm","score_opus":0.02634091715086941,"score_gpt":0.27072385242484365,"score_spread":0.24438293527397423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573944554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030331895,0.00029903674,0.9673222,0.00018226742,0.000030765343,0.000051585583,0.000028527576,0.00028441724,0.0014693164],"genre_scores_gemma":[0.62975985,0.00024040001,0.3686186,0.000078650555,0.000043699878,0.00023283617,0.00008049336,0.00008315381,0.0008622646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995284,0.00022047818,0.000022212023,0.00005656298,0.00014060538,0.000031789772],"domain_scores_gemma":[0.99830675,0.0012511882,0.000078587276,0.00006878806,0.00026359805,0.00003106286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013348045,0.0008455741,0.000721864,0.0006744482,0.0004016795,0.0004581445,0.00046298563,0.00069349835,0.0012286765],"category_scores_gemma":[0.0037373337,0.00026684473,0.00048690313,0.000785508,0.0003391223,0.00031183235,0.0004445727,0.0005662466,0.0001580284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001416779,0.00015958771,0.0017352805,0.00019457725,0.000054761946,0.00026623294,0.000095499425,0.6579631,0.012515988,0.0072851162,0.0015557356,0.3180324],"study_design_scores_gemma":[0.000013251621,0.00007051162,0.00045535402,0.000007120795,0.000009900708,0.000033344924,0.000008692141,0.99453074,0.0022633101,0.0016511455,0.00095119124,0.000005388798],"about_ca_topic_score_codex":0.0013836062,"about_ca_topic_score_gemma":0.0013418078,"teacher_disagreement_score":0.0013836062,"about_ca_system_score_codex":0.00028814675,"about_ca_system_score_gemma":0.0004913974,"threshold_uncertainty_score":0.0070592165},"labels":[],"label_agreement":null},{"id":"W2577458315","doi":"10.1109/cefc.2016.7816203","title":"Projection-based objective space reduction for many-objective optimization problems: Application to an induction motor design","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Induction motor; Reduction (mathematics); Projection (relational algebra); Computer science; Space (punctuation); Mathematical optimization; Mathematics; Algorithm; Engineering; Electrical engineering","score_opus":0.023152251847343663,"score_gpt":0.2773372420602802,"score_spread":0.25418499021293656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577458315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006588995,0.00015537723,0.99194616,0.000059774633,0.000010956833,0.000031444633,0.0000066279267,0.0000840312,0.0011166877],"genre_scores_gemma":[0.18077372,0.0004567073,0.81651676,0.000058972557,0.000028118662,0.00022556855,0.00006092282,0.000090044785,0.0017892148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995436,0.00021680263,0.00001656756,0.0000329749,0.00016733265,0.00002274835],"domain_scores_gemma":[0.99949145,0.00033635207,0.000029588104,0.000032973177,0.00009488042,0.000014832724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011582479,0.0008689744,0.0008221306,0.00039061523,0.00032168423,0.00053575065,0.00045003986,0.00064169546,0.0014878744],"category_scores_gemma":[0.0015445027,0.00031573055,0.00075436756,0.00044860505,0.00041184475,0.0004834634,0.0007404439,0.0013159547,0.00034023484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007208325,0.00015038993,0.0002965495,0.00033205887,0.00008400369,0.000104392646,0.00011537594,0.79286075,0.013378402,0.010065784,0.0007379445,0.18180233],"study_design_scores_gemma":[0.000007896155,0.0000799012,0.00009067766,0.000008088195,0.000007676431,0.000032763663,0.000012288013,0.9944218,0.0021916137,0.0023558438,0.0007860493,0.000005344778],"about_ca_topic_score_codex":0.0008441588,"about_ca_topic_score_gemma":0.0009276921,"teacher_disagreement_score":0.0014878744,"about_ca_system_score_codex":0.00017355323,"about_ca_system_score_gemma":0.0005776225,"threshold_uncertainty_score":0.0061255097},"labels":[],"label_agreement":null},{"id":"W2577945521","doi":"10.1007/978-3-319-47715-2_8","title":"Planning Robust Sensor Relocation Trajectories for a Mobile Robot with Evolutionary Multi-objective Optimization","year":2017,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wireless sensor network; Relocation; Robot; Computer science; Trajectory; Mobile robot; Real-time computing; Simulation; Artificial intelligence; Computer network","score_opus":0.11252698568355275,"score_gpt":0.368449150476389,"score_spread":0.25592216479283625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577945521","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.009230918,0.00030185812,0.9867177,0.000085732325,0.000034249642,0.000032753433,0.00002611349,0.00020149164,0.00336917],"genre_scores_gemma":[0.5105023,0.0007672807,0.4781962,0.00007989905,0.000046853955,0.00031452283,0.0001880677,0.00020077925,0.009704123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985564,0.000027883436,0.0000072432877,0.000044506683,0.000047787147,0.000016833746],"domain_scores_gemma":[0.9998281,0.00008506366,0.000029245457,0.000018303243,0.000029139608,0.0000101858695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035708467,0.0010338569,0.00070135854,0.00039558666,0.0003427228,0.00059544254,0.0010077063,0.0010698228,0.0018739366],"category_scores_gemma":[0.0010192567,0.0006007018,0.0007637321,0.00061627955,0.0005904709,0.0007699912,0.0010581319,0.00086509436,0.00043073198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019530602,0.000007907823,0.00007039668,0.00003955635,0.0000159859,0.000048353733,0.000030109592,0.9733987,0.0013545008,0.0035776289,0.00035452048,0.02108289],"study_design_scores_gemma":[0.0000032300416,0.000015560277,0.00003300545,0.0000051588404,0.0000033855515,0.000012609803,0.000006641927,0.99704736,0.0002997005,0.0021392214,0.00043097624,0.0000031760726],"about_ca_topic_score_codex":0.0038540564,"about_ca_topic_score_gemma":0.0030672068,"teacher_disagreement_score":0.0038540564,"about_ca_system_score_codex":0.00052347773,"about_ca_system_score_gemma":0.0007166219,"threshold_uncertainty_score":0.00766325},"labels":[],"label_agreement":null},{"id":"W2588372621","doi":"10.1007/978-3-319-54157-0_5","title":"Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Iterated local search; Leverage (statistics); Local search (optimization); Component (thermodynamics); Mathematical optimization; Guided Local Search; Context (archaeology); Machine learning; Artificial intelligence; Mathematics","score_opus":0.04043317929019216,"score_gpt":0.3127122113113464,"score_spread":0.2722790320211542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588372621","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.042974077,0.0004987258,0.9457491,0.00007097654,0.00009257987,0.00012800132,0.00009925268,0.0054695597,0.004917839],"genre_scores_gemma":[0.3622359,0.00015461037,0.6322209,0.00012279986,0.000027988459,0.00027884915,0.00035577433,0.0014053928,0.003197683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.00013942056,0.000037399775,0.00014704514,0.00016182526,0.000055778088],"domain_scores_gemma":[0.9989518,0.0005172117,0.000089981426,0.00019416942,0.00017704214,0.00006973155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888241,0.001498393,0.001621929,0.00095388707,0.00046782658,0.0012178766,0.0020533723,0.0013208261,0.005096379],"category_scores_gemma":[0.0028536099,0.0008539309,0.0010287768,0.0009290118,0.00052533165,0.001587757,0.0019092107,0.0012748361,0.001684524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042735747,0.0002631544,0.0012208301,0.0003601506,0.00014607736,0.00022537174,0.00015434084,0.63483244,0.031501934,0.0028317177,0.004347743,0.32368892],"study_design_scores_gemma":[0.000015823198,0.000044938104,0.0001587979,0.000011118973,0.00001411654,0.000026524358,0.000014201311,0.9953644,0.0029736285,0.0007879726,0.000579634,0.000008771514],"about_ca_topic_score_codex":0.0016154221,"about_ca_topic_score_gemma":0.0024470005,"teacher_disagreement_score":0.005096379,"about_ca_system_score_codex":0.0005540892,"about_ca_system_score_gemma":0.00053490157,"threshold_uncertainty_score":0.017049074},"labels":[],"label_agreement":null},{"id":"W2591485304","doi":"10.1007/s11081-017-9370-5","title":"Locally weighted regression models for surrogate-assisted design optimization","year":2017,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":23,"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; McGill University; Group for Research in Decision Analysis","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Mathematical optimization; Metric (unit); Surrogate model; Optimization problem; Computer science; Smoothing; Continuous optimization; Mathematics; Multi-swarm optimization; Statistics; Engineering","score_opus":0.027546568764959138,"score_gpt":0.25657014413999807,"score_spread":0.22902357537503892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591485304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011879931,0.00015548595,0.9979594,0.000040855124,0.000013447687,0.000009092117,0.000021580569,0.000108675944,0.0005036191],"genre_scores_gemma":[0.343059,0.0011892227,0.6401634,0.00024301508,0.00014540627,0.0006794127,0.0006714964,0.0007591256,0.013089936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815303,0.001211282,0.000050909384,0.00014872378,0.0003802876,0.00005577067],"domain_scores_gemma":[0.9962966,0.0024523912,0.00032056513,0.00034847212,0.0005067365,0.0000752694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033954035,0.0016070864,0.0021792909,0.000972561,0.0003080745,0.001206923,0.0019828207,0.0019052995,0.0034124951],"category_scores_gemma":[0.0095456755,0.0010190605,0.0012541752,0.0014243807,0.0008601681,0.001694108,0.0017964363,0.0024060532,0.0012905563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003712661,0.000036085275,0.00010693856,0.00008052294,0.000049566417,0.00001455468,0.000018155824,0.9567966,0.0010054997,0.021461945,0.0008389419,0.019554025],"study_design_scores_gemma":[0.0000020120608,0.000007810675,0.000011236243,0.0000035021624,0.0000034008217,0.0000022198835,0.0000010687595,0.99524313,0.00013172346,0.004305165,0.0002867255,0.000002104433],"about_ca_topic_score_codex":0.0016094606,"about_ca_topic_score_gemma":0.0020054118,"teacher_disagreement_score":0.0034124951,"about_ca_system_score_codex":0.00071942055,"about_ca_system_score_gemma":0.000940222,"threshold_uncertainty_score":0.017956853},"labels":[],"label_agreement":null},{"id":"W2593689740","doi":"","title":"Global Robust Optimization of Computationally Expensive Systems: A Lavel Rotor Suspended by Fluid Film Bearings","year":2016,"lang":"en","type":"article","venue":"Research Repository (Delft University of Technology)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Kriging; Mathematical optimization; Sensitivity (control systems); Rotor (electric); Computer science; Stochastic optimization; Optimization problem; Process (computing); Control theory (sociology); Engineering; Mathematics; Artificial intelligence; Machine learning","score_opus":0.019480658537162462,"score_gpt":0.25961022969451936,"score_spread":0.2401295711573569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593689740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41788483,0.000488883,0.5742923,0.00036398883,0.000051011473,0.000070165595,0.00015148993,0.00042267883,0.0062746536],"genre_scores_gemma":[0.957251,0.000105489766,0.04009181,0.000013119396,0.00000792993,0.000040454543,0.00006305477,0.000030068595,0.0023971554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998834,0.00004268671,0.0000043998634,0.000025847772,0.000029889783,0.000013650858],"domain_scores_gemma":[0.99976546,0.00014930594,0.000024193605,0.00001966294,0.00003020108,0.000011195082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044752506,0.00045163473,0.00053718034,0.00019805953,0.00024586383,0.000596904,0.0003561679,0.0006715997,0.0012880457],"category_scores_gemma":[0.0008902539,0.00020831644,0.00040890192,0.0001774278,0.0004013976,0.0002845063,0.00046997156,0.00040679544,0.00014476282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005353298,0.000024982313,0.00021273174,0.000031924294,0.000011977206,0.000043438118,0.00001694919,0.9862661,0.004309359,0.0010570548,0.00012283739,0.007849121],"study_design_scores_gemma":[0.000007261119,0.000037885762,0.00009445188,0.0000012096522,0.0000029485898,0.000003320023,0.0000035544776,0.9986389,0.00090410485,0.00017195694,0.00013209289,0.00000226518],"about_ca_topic_score_codex":0.005828759,"about_ca_topic_score_gemma":0.004639949,"teacher_disagreement_score":0.005828759,"about_ca_system_score_codex":0.00036399483,"about_ca_system_score_gemma":0.00047774526,"threshold_uncertainty_score":0.011589706},"labels":[],"label_agreement":null},{"id":"W2602717365","doi":"","title":"Multiobjective Optimization Through a Series of Single-Objective Formulations","year":2007,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Multi-objective optimization; Mathematical optimization; Pareto principle; Series (stratigraphy); Mathematics; Disjoint sets; Optimization problem; Property (philosophy); Pareto analysis","score_opus":0.013955102962833931,"score_gpt":0.2527729620857711,"score_spread":0.23881785912293718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602717365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026988387,0.00022787266,0.9939786,0.00008745642,0.00003343838,0.00005979341,0.00002400034,0.000029930667,0.00286003],"genre_scores_gemma":[0.1486698,0.0012098168,0.8393631,0.00019677318,0.0000900091,0.0008508139,0.00015992878,0.00011172647,0.009348129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991635,0.0002930706,0.000042788226,0.0000953501,0.00036583235,0.000039522554],"domain_scores_gemma":[0.9993717,0.00037255886,0.00007266999,0.00004819169,0.00011098553,0.000023814973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020490442,0.0014304699,0.0009909369,0.00095039257,0.00046534144,0.0012228115,0.0011031689,0.0012645562,0.0030393605],"category_scores_gemma":[0.0025264013,0.00065526686,0.0014837959,0.0007666561,0.0009623588,0.0013813963,0.0011918378,0.0017803278,0.00047391324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010560705,0.000033853124,0.00015042354,0.00012724249,0.00003506571,0.000054036656,0.000043828757,0.9152427,0.001385752,0.059222937,0.0006712595,0.02302243],"study_design_scores_gemma":[0.000004260293,0.000021842436,0.000031697557,0.000020481395,0.0000062449235,0.000017837414,0.0000051920915,0.98584586,0.0004458237,0.012107448,0.0014880971,0.0000052458704],"about_ca_topic_score_codex":0.0010786195,"about_ca_topic_score_gemma":0.0013318767,"teacher_disagreement_score":0.0030393605,"about_ca_system_score_codex":0.00097019883,"about_ca_system_score_gemma":0.0010694728,"threshold_uncertainty_score":0.010836482},"labels":[],"label_agreement":null},{"id":"W2605533099","doi":"10.1016/j.swevo.2017.04.005","title":"Micro-time variant multi-objective particle swarm optimization (micro-TVMOPSO) of a solar thermal combisystem","year":2017,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Economic Affairs; Concordia University","keywords":"Benchmark (surveying); Computer science; Multi-objective optimization; Mathematical optimization; Pareto principle; Particle swarm optimization; Evolutionary algorithm; Multi-swarm optimization; Metaheuristic; Optimization problem; Population; Engineering optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.01362871856067218,"score_gpt":0.2526617303293274,"score_spread":0.23903301176865524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605533099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10784395,0.00047192845,0.8849508,0.00015285386,0.00009886432,0.00010114148,0.000059005542,0.00023279017,0.006088651],"genre_scores_gemma":[0.72425556,0.00035926647,0.27106366,0.00008665111,0.000033549823,0.00023755983,0.00012243095,0.000043569835,0.0037977307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998679,0.000037421698,0.000008118218,0.000028042983,0.00004577038,0.000012739903],"domain_scores_gemma":[0.99977726,0.00011493402,0.000039096387,0.000021176696,0.000036363104,0.0000111616555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039083892,0.00056907686,0.00046605305,0.00027911007,0.0002614751,0.0004864944,0.00042604964,0.00053115946,0.000710122],"category_scores_gemma":[0.00071384944,0.00024215225,0.0005433847,0.00030682376,0.00028348117,0.00040740357,0.00033901373,0.00046591114,0.00011755108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052624382,0.000042578373,0.0012255225,0.00008747321,0.000048131486,0.00007089257,0.00003541707,0.93014115,0.0078107943,0.0030893884,0.00051537115,0.05688079],"study_design_scores_gemma":[0.000007804948,0.00006350496,0.0004090165,0.0000046387836,0.000008255665,0.000019204646,0.000010348863,0.996185,0.001684118,0.0007059135,0.0008979102,0.0000042151337],"about_ca_topic_score_codex":0.0017664133,"about_ca_topic_score_gemma":0.002595744,"teacher_disagreement_score":0.0017664133,"about_ca_system_score_codex":0.0002967833,"about_ca_system_score_gemma":0.0005542878,"threshold_uncertainty_score":0.0035122037},"labels":[],"label_agreement":null},{"id":"W2606049180","doi":"10.1007/978-3-319-57351-9_16","title":"A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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 Waterloo","funders":"","keywords":"Solver; Computer science; Constraint (computer-aided design); Benchmark (surveying); Mathematical optimization; Constraint satisfaction problem; Constraint satisfaction; Algorithm; Linear subspace; Constraint programming; Combinatorial optimization; Mathematics; Artificial intelligence","score_opus":0.027814252064999427,"score_gpt":0.29980466181435933,"score_spread":0.2719904097493599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606049180","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.013884893,0.004461787,0.9488355,0.0010510004,0.00038785333,0.0003433481,0.00029812963,0.0006343438,0.03010314],"genre_scores_gemma":[0.29707247,0.0028643738,0.6822975,0.0010693161,0.00081488886,0.00083548366,0.0007788154,0.00152743,0.012739691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98448783,0.006544769,0.0005043459,0.0013553252,0.0053987005,0.0017090595],"domain_scores_gemma":[0.94742167,0.04183995,0.0017375409,0.004069601,0.004070898,0.0008604023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015715735,0.0044529834,0.0027663629,0.0026645723,0.0018946897,0.006462424,0.006642145,0.003506981,0.016354129],"category_scores_gemma":[0.05341424,0.0018250967,0.0033579713,0.005420094,0.0033882519,0.007547159,0.0037947677,0.0072957743,0.0020348267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009541988,0.0003491694,0.00072453363,0.0005815726,0.00018964542,0.00012897553,0.00009707798,0.81667924,0.0022866456,0.085068844,0.010681533,0.082258634],"study_design_scores_gemma":[0.000021642329,0.00008678837,0.00013956724,0.00005268139,0.000033973105,0.0000707349,0.000022304175,0.9759789,0.0006152172,0.021925982,0.0010376204,0.000014592462],"about_ca_topic_score_codex":0.004179647,"about_ca_topic_score_gemma":0.004597441,"teacher_disagreement_score":0.016354129,"about_ca_system_score_codex":0.0054035983,"about_ca_system_score_gemma":0.0042848354,"threshold_uncertainty_score":0.08311373},"labels":[],"label_agreement":null},{"id":"W2610186569","doi":"10.1155/2017/2034907","title":"Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm","year":2017,"lang":"en","type":"article","venue":"Modelling and Simulation in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Thompson Rivers University; Simon Fraser University","funders":"","keywords":"Sorting; Multi-objective optimization; Mathematical optimization; Genetic algorithm; Pareto principle; Metaheuristic; Solution set; Computer science; Set (abstract data type); Algorithm; Mathematics","score_opus":0.03991106072584448,"score_gpt":0.28435167597690086,"score_spread":0.24444061525105637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610186569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05908781,0.00025997078,0.9298844,0.00015200608,0.000030370124,0.0000687866,0.00004719386,0.00018595938,0.010283452],"genre_scores_gemma":[0.86225766,0.0002702361,0.12748927,0.00008053151,0.000022925227,0.00032543504,0.00012989598,0.00003672995,0.009387357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998833,0.000033676435,0.0000050291637,0.000016902226,0.000044372082,0.000016779506],"domain_scores_gemma":[0.99987614,0.00005278401,0.000017695746,0.000007500528,0.000036323094,0.00000959863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039760143,0.0005315626,0.0006064464,0.0005354385,0.00044993777,0.00077755714,0.0006537087,0.00083970476,0.0016466242],"category_scores_gemma":[0.00037667665,0.0002873706,0.00078554684,0.00033651476,0.0003983416,0.00039121613,0.0006053746,0.00039529568,0.00019360818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750808,0.000017786593,0.00017714148,0.000021603517,0.000014666042,0.000025271433,0.000014676088,0.98871124,0.00150679,0.002071706,0.0001362402,0.0072853705],"study_design_scores_gemma":[0.0000042223414,0.000012347158,0.00004073007,0.0000019347774,0.0000023160362,0.000003943921,0.000002648053,0.9993531,0.00017453241,0.00024322484,0.00015943867,0.0000016694103],"about_ca_topic_score_codex":0.003953332,"about_ca_topic_score_gemma":0.002686811,"teacher_disagreement_score":0.003953332,"about_ca_system_score_codex":0.00048966316,"about_ca_system_score_gemma":0.00092793076,"threshold_uncertainty_score":0.007860661},"labels":[],"label_agreement":null},{"id":"W2615441104","doi":"","title":"Modeling an Augmented Lagrangian for Improved Blackbox Constrained Optimization","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Booth University College","funders":"","keywords":"Augmented Lagrangian method; Mathematical optimization; Computer science; Heuristics; Benchmark (surveying); Bottleneck; Context (archaeology); Lagrangian relaxation; Optimization problem; Sensitivity (control systems); Mathematics","score_opus":0.010613832243558068,"score_gpt":0.24324455807468034,"score_spread":0.23263072583112226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615441104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040386254,0.00009302343,0.99334705,0.00014487542,0.00002283739,0.00001918322,0.00002906248,0.00014194788,0.0021634263],"genre_scores_gemma":[0.458475,0.00036221006,0.53230274,0.00032811376,0.00008039615,0.00037438402,0.00022515502,0.00033813552,0.007513912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.0002796172,0.00002126032,0.000086222055,0.00013806329,0.000055598262],"domain_scores_gemma":[0.9984666,0.0009892627,0.00017450388,0.00013243359,0.00017269237,0.000064537315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019885085,0.0009377412,0.0012121924,0.00069767697,0.00038728223,0.0014371169,0.0011910269,0.0014862905,0.003986501],"category_scores_gemma":[0.004286799,0.0005801893,0.0009383198,0.00056268816,0.001305391,0.0016627025,0.0017477835,0.0015177,0.000661415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018879413,0.000018306897,0.00013555492,0.000039085564,0.000011413699,0.000027174689,0.000021883841,0.9626239,0.00054452074,0.029519496,0.00047987245,0.006559827],"study_design_scores_gemma":[0.0000023309208,0.0000062181657,0.000009696381,0.0000040135897,0.0000012845267,0.0000024533642,0.0000015356306,0.9947976,0.00009383086,0.0047972584,0.00028210247,0.0000016959004],"about_ca_topic_score_codex":0.001991954,"about_ca_topic_score_gemma":0.0021453623,"teacher_disagreement_score":0.003986501,"about_ca_system_score_codex":0.0008378161,"about_ca_system_score_gemma":0.0013888916,"threshold_uncertainty_score":0.013336182},"labels":[],"label_agreement":null},{"id":"W2615864160","doi":"10.1109/tmag.2017.2750901","title":"A Benchmark TEAM Problem for Multi-Objective Pareto Optimization of Electromagnetic Devices","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Benchmark (surveying); Computer science; Context (archaeology); Multi-objective optimization; Mathematical optimization; Pareto principle; Finite element method; Field (mathematics); Sensitivity (control systems); Mathematics; Machine learning; Electronic engineering; Physics; Engineering","score_opus":0.02289956013902422,"score_gpt":0.2879423914286392,"score_spread":0.265042831289615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615864160","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.014335333,0.00033974292,0.9711075,0.0002449477,0.000115826864,0.00009170947,0.00018979171,0.000102983584,0.013472259],"genre_scores_gemma":[0.4861683,0.00068556046,0.5029708,0.00018855413,0.00010915939,0.0007034994,0.00090189464,0.00024528994,0.008026963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.0007555052,0.000057738962,0.00013461466,0.00043993216,0.00012604195],"domain_scores_gemma":[0.99818784,0.001002309,0.0001384932,0.00017260366,0.00035305327,0.00014572173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039586,0.0012485737,0.0012396199,0.0012502713,0.0009153921,0.0018772001,0.0012365668,0.0016355935,0.003092769],"category_scores_gemma":[0.006437919,0.00029867858,0.0009883497,0.0010187081,0.0008684832,0.0011889198,0.0016089864,0.0013625323,0.0004994598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006187802,0.000057796962,0.00038545183,0.00010549019,0.000037874,0.000045869914,0.000027112954,0.9039162,0.0010234347,0.063644625,0.0024161332,0.028278118],"study_design_scores_gemma":[0.0000120914565,0.00007122026,0.0001410554,0.000025803718,0.000007350357,0.000028409871,0.00001958238,0.9716386,0.00090732647,0.024225174,0.0029131118,0.000010368058],"about_ca_topic_score_codex":0.001309867,"about_ca_topic_score_gemma":0.0010318658,"teacher_disagreement_score":0.003092769,"about_ca_system_score_codex":0.0012037875,"about_ca_system_score_gemma":0.0011464041,"threshold_uncertainty_score":0.016075075},"labels":[],"label_agreement":null},{"id":"W2618435777","doi":"10.5267/j.ijiec.2017.5.003","title":"An overview on robust design hybrid metamodeling: Advanced methodology in process optimization under uncertainty","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":57,"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":"Metamodeling; Robust optimization; Computer science; Context (archaeology); Probabilistic logic; Taguchi methods; Process (computing); Engineering optimization; Engineering design process; Mathematical optimization; Industrial engineering; Optimization problem; Management science; Engineering; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.24396224974893743,"score_gpt":0.40273723422049573,"score_spread":0.1587749844715583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618435777","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.00033728374,0.014033649,0.98225605,0.0002041181,0.00009264297,0.000026589958,0.000050308812,0.00014337552,0.002855913],"genre_scores_gemma":[0.08187701,0.103428796,0.80558157,0.0005966558,0.0010730898,0.00076654623,0.0005456066,0.00038654284,0.0057442905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840623,0.0006624494,0.0001541676,0.00024344253,0.00047784045,0.00005595703],"domain_scores_gemma":[0.9989869,0.00059867563,0.00010456219,0.000124951,0.00016119283,0.000023622211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025742315,0.0018913292,0.0019039841,0.0022429705,0.00029209405,0.0018076178,0.0017961116,0.0018964326,0.0031722635],"category_scores_gemma":[0.0021298777,0.00076298066,0.0029794727,0.0030410443,0.0009881124,0.0017621457,0.0014383525,0.0022822733,0.0014056835],"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.000046614186,0.000072909104,0.00049383345,0.0036852355,0.00026387876,0.0002042504,0.00016940446,0.43499374,0.007883647,0.30067265,0.004440402,0.24707344],"study_design_scores_gemma":[0.000024143832,0.00018063703,0.00052223064,0.0010677351,0.00014250603,0.00031752608,0.000058612048,0.62223697,0.0037785193,0.24011211,0.13145009,0.00010893209],"about_ca_topic_score_codex":0.0009924996,"about_ca_topic_score_gemma":0.0005712348,"teacher_disagreement_score":0.0031722635,"about_ca_system_score_codex":0.00075403403,"about_ca_system_score_gemma":0.0010784834,"threshold_uncertainty_score":0.013613999},"labels":[],"label_agreement":null},{"id":"W2618778734","doi":"10.1080/17445760.2017.1331439","title":"Cohort intelligence algorithm for discrete and mixed variable engineering problems","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Windsor","funders":"","keywords":"Metaheuristic; Continuous optimization; Penalty method; Mathematical optimization; Discrete optimization; Sampling (signal processing); Optimization problem; Reduction (mathematics); Algorithm; Computer science; Continuous variable; Integer programming; Nonlinear programming; Integer (computer science); Nonlinear system; Mathematics; Multi-swarm optimization","score_opus":0.017907375520779676,"score_gpt":0.2817691170762407,"score_spread":0.263861741555461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618778734","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.012779669,0.00023496388,0.9836897,0.00014874205,0.00005032231,0.00005820713,0.000026662181,0.00011878694,0.00289306],"genre_scores_gemma":[0.47958025,0.00051448686,0.5144185,0.0002654793,0.000104556646,0.00051658246,0.00029463362,0.00008009139,0.0042254357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00022683674,0.000029652498,0.00006923549,0.00017603584,0.00006042006],"domain_scores_gemma":[0.99875486,0.00075425016,0.00012690811,0.00006844762,0.00023202792,0.00006347671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001865886,0.00090688147,0.0009844524,0.0010706792,0.0005744923,0.0011236966,0.001537431,0.0011035112,0.0017922345],"category_scores_gemma":[0.003368999,0.00033014925,0.00081728265,0.0009896717,0.0006813422,0.0008702024,0.0012216961,0.0012614526,0.00035966703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007592478,0.00006257552,0.0010668349,0.00008063351,0.0000706917,0.00007306323,0.00005646503,0.9047473,0.0010130045,0.025093662,0.0014368932,0.06622303],"study_design_scores_gemma":[0.0000063024286,0.000024765604,0.00005787144,0.0000042131906,0.0000042352426,0.000010634258,0.000005286617,0.99693346,0.00015350844,0.0023693563,0.0004278827,0.0000024782105],"about_ca_topic_score_codex":0.003342656,"about_ca_topic_score_gemma":0.002454181,"teacher_disagreement_score":0.003342656,"about_ca_system_score_codex":0.00066142133,"about_ca_system_score_gemma":0.0012767555,"threshold_uncertainty_score":0.009867847},"labels":[],"label_agreement":null},{"id":"W2622665449","doi":"","title":"Problem formulations for simulation-based design optimization using statistical surrogates and direct search","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Surrogate model; Computer science; Simulation-based optimization; Metaheuristic; Derivative-free optimization; Optimization problem; Algorithm; Multi-swarm optimization; Mathematics","score_opus":0.025338713765910258,"score_gpt":0.2866958945960644,"score_spread":0.2613571808301542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622665449","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.00076231203,0.00009542091,0.9975272,0.00008851027,0.000013302224,0.000029656954,0.000023020992,0.00005593469,0.0014045066],"genre_scores_gemma":[0.12666196,0.00072670286,0.8669567,0.0001837757,0.00006962446,0.0011159881,0.00027245173,0.00025865936,0.003754178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987703,0.00068710744,0.0000660056,0.00008511235,0.0003588117,0.000032628497],"domain_scores_gemma":[0.9969572,0.002215887,0.00020671755,0.00017859672,0.00039159547,0.00005002751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033604666,0.0011202605,0.0011837217,0.0009960709,0.00043625184,0.0013711054,0.0012178278,0.001655181,0.0036197177],"category_scores_gemma":[0.006279917,0.0006682895,0.0013179849,0.0010241942,0.0011212726,0.0008265963,0.0013997803,0.0017780529,0.0008350346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010752957,0.000016877537,0.00013109457,0.00009125025,0.000016548429,0.000022665492,0.00002354632,0.9614292,0.00045758596,0.027401758,0.0004563496,0.009942438],"study_design_scores_gemma":[0.0000053096137,0.000009686042,0.00002198615,0.00001269691,0.0000030375238,0.000009817944,0.0000042715974,0.9910793,0.00019234678,0.007617006,0.0010417086,0.0000029041555],"about_ca_topic_score_codex":0.0017565624,"about_ca_topic_score_gemma":0.0016548542,"teacher_disagreement_score":0.0036197177,"about_ca_system_score_codex":0.00082817266,"about_ca_system_score_gemma":0.001713726,"threshold_uncertainty_score":0.017772079},"labels":[],"label_agreement":null},{"id":"W2625480000","doi":"10.1115/detc2002/dac-34091","title":"Adaptive Experimental Design Applied to Ergonomics Testing Procedure","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":39,"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":"Ryerson University; University of Michigan","keywords":"Computer science; Constraint (computer-aided design); Design of experiments; Sampling (signal processing); Selection (genetic algorithm); Artifact (error); Variety (cybernetics); Sample (material); Artificial intelligence; Machine learning; Mathematical optimization; Mathematics; Computer vision; Statistics","score_opus":0.06754711600764095,"score_gpt":0.2556310382059046,"score_spread":0.18808392219826364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625480000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006676414,0.00002403903,0.99077797,0.000026976022,0.000038497623,0.0012167237,0.000032638934,0.00025939732,0.00094736397],"genre_scores_gemma":[0.060842082,0.00004734892,0.93050504,0.000076370765,0.000022780005,0.0077334107,0.000051796713,0.00007309748,0.0006481074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98727244,0.008403659,0.0006942318,0.0013701319,0.002017968,0.00024152272],"domain_scores_gemma":[0.9820679,0.011462187,0.0013615123,0.0027770507,0.0021045445,0.00022667409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012362976,0.0010713894,0.000841387,0.0008734189,0.00053096254,0.0007195056,0.0014179351,0.0009569055,0.004883278],"category_scores_gemma":[0.026981479,0.0005847014,0.00077644206,0.0007669076,0.0015124392,0.0005844471,0.0013123682,0.0014819298,0.0006570723],"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.004773452,0.0012326607,0.0031603908,0.0013821756,0.00039439212,0.00025138876,0.0008091436,0.1714653,0.10421309,0.07990559,0.0020802428,0.63033223],"study_design_scores_gemma":[0.0018335001,0.012581721,0.008308676,0.00020571172,0.00036420897,0.00037357231,0.00011228299,0.73365164,0.120620295,0.07865833,0.04307826,0.00021174479],"about_ca_topic_score_codex":0.00033202957,"about_ca_topic_score_gemma":0.0004014711,"teacher_disagreement_score":0.012362976,"about_ca_system_score_codex":0.0005170183,"about_ca_system_score_gemma":0.0013077155,"threshold_uncertainty_score":0.06538242},"labels":[],"label_agreement":null},{"id":"W2626235566","doi":"10.1007/s00521-017-3049-x","title":"Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"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":"Sorting; Sine; Benchmark (surveying); Trigonometric functions; Algorithm; Multi-objective optimization; Mathematical optimization; Set (abstract data type); Mathematics; Pareto principle; Computer science; Discrete cosine transform; Artificial intelligence","score_opus":0.04358581292389558,"score_gpt":0.3086182583295261,"score_spread":0.26503244540563053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626235566","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.0039592497,0.00025514723,0.99388427,0.000048753183,0.00004375812,0.00003908595,0.000012917223,0.00011062873,0.0016461044],"genre_scores_gemma":[0.12247266,0.0003618402,0.87414587,0.00009202359,0.00006376823,0.0002631465,0.000110452645,0.00011880582,0.0023714453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994795,0.00017218573,0.00003513357,0.00006727487,0.00022202815,0.000024006382],"domain_scores_gemma":[0.99897987,0.00048455887,0.000115937386,0.000081105325,0.00029385064,0.000044519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001684201,0.0009945205,0.0012136301,0.0011637394,0.000512916,0.0006921455,0.001085175,0.0013180138,0.0025677264],"category_scores_gemma":[0.0029262004,0.00047020835,0.001024935,0.0013826755,0.0004877651,0.0007498826,0.0007963178,0.0011502556,0.00057131296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000726184,0.00009769469,0.0006219383,0.00023068265,0.00006640956,0.000035389796,0.000043917862,0.78775746,0.0039974554,0.017577188,0.0014407963,0.18805839],"study_design_scores_gemma":[0.000007852078,0.000033560027,0.00006729814,0.0000096929525,0.0000051383186,0.000012900755,0.000003366984,0.996543,0.0005679473,0.001877166,0.00086869294,0.0000034305117],"about_ca_topic_score_codex":0.001918034,"about_ca_topic_score_gemma":0.0024699455,"teacher_disagreement_score":0.0025677264,"about_ca_system_score_codex":0.0005103961,"about_ca_system_score_gemma":0.0014827464,"threshold_uncertainty_score":0.00890702},"labels":[],"label_agreement":null},{"id":"W2649938423","doi":"10.1016/j.jcde.2017.06.003","title":"∊-constraint heat transfer search (∊-HTS) algorithm for solving multi-objective engineering design problems","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Design and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Thompson Rivers University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Ministry of Economic Affairs","keywords":"Benchmark (surveying); Mathematical optimization; Multi-objective optimization; Reducer; Pareto principle; Engineering design process; Algorithm; Engineering optimization; Truss; Computer science; Optimization problem; Engineering; Mathematics; Structural engineering; Mechanical engineering","score_opus":0.03419872405366283,"score_gpt":0.26749690153505484,"score_spread":0.233298177481392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2649938423","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.009450511,0.000186168,0.98689216,0.00007364067,0.00002679453,0.000074566655,0.000026792794,0.00022454307,0.0030448232],"genre_scores_gemma":[0.27306753,0.00022604852,0.72119766,0.00012658087,0.00004073379,0.0006118608,0.00017515317,0.00012660574,0.0044278437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996191,0.000114521,0.000022102886,0.0000481619,0.00015797629,0.000038161015],"domain_scores_gemma":[0.9995546,0.00025329652,0.00003875835,0.000023144421,0.0001093547,0.00002084362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078753836,0.0008431455,0.0007363773,0.0008349733,0.0005658244,0.0005602105,0.0009738314,0.00089634344,0.0035489628],"category_scores_gemma":[0.0012253368,0.00040599678,0.00076144375,0.00078391406,0.000398587,0.00051051524,0.00068059,0.0008094493,0.0003960729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005261237,0.000044386015,0.0004035706,0.00009846472,0.00004454312,0.00004395802,0.00003740437,0.9083723,0.0024519383,0.0050208173,0.0012086111,0.08222137],"study_design_scores_gemma":[0.000010850307,0.0000186173,0.00005637836,0.0000048587813,0.0000038755356,0.000008852393,0.0000046087866,0.9980405,0.00051904615,0.0008084301,0.0005213609,0.0000025861013],"about_ca_topic_score_codex":0.005614355,"about_ca_topic_score_gemma":0.0049966886,"teacher_disagreement_score":0.005614355,"about_ca_system_score_codex":0.00061629515,"about_ca_system_score_gemma":0.0015103121,"threshold_uncertainty_score":0.011872411},"labels":[],"label_agreement":null},{"id":"W2667143831","doi":"10.1109/ccece.2017.7946703","title":"FIR filter design using Multiobjective Artificial Bee Colony algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Windsor","funders":"","keywords":"Pruning; Multi-objective optimization; Mathematical optimization; Finite impulse response; Stopband; Evolutionary algorithm; Computer science; Passband; Algorithm; Artificial bee colony algorithm; Mathematics; Engineering; Band-pass filter; Electronic engineering","score_opus":0.07647161330285383,"score_gpt":0.3284302122035312,"score_spread":0.25195859890067734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2667143831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117293745,0.00024155226,0.9849104,0.000054695793,0.000021502356,0.000030484101,0.000011641698,0.00017316005,0.0028271081],"genre_scores_gemma":[0.36328867,0.00051462895,0.630194,0.00013955937,0.000023767045,0.00024899052,0.000090608686,0.00006041587,0.005439275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998159,0.00003401974,0.000010589803,0.00003188175,0.00008880696,0.000018799836],"domain_scores_gemma":[0.999843,0.000055472337,0.000022720773,0.000011261498,0.00006018583,0.0000072255066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033514493,0.0005750835,0.00055008783,0.0003893631,0.00025386625,0.0005210214,0.0005925439,0.00082898117,0.0011806581],"category_scores_gemma":[0.0005574094,0.00029213916,0.00053828285,0.00036337177,0.00023148504,0.00036136707,0.00032839825,0.00036943553,0.00025918346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033719218,0.00003314103,0.00041774203,0.000101562924,0.000056936435,0.000083364626,0.00005687246,0.8748029,0.01922986,0.004499907,0.0007346867,0.09994946],"study_design_scores_gemma":[0.0000055689993,0.000023687722,0.000084230436,0.0000052441737,0.0000075138664,0.000018799623,0.0000048233974,0.9972887,0.0012720941,0.0005866146,0.0006992479,0.0000034443533],"about_ca_topic_score_codex":0.0016486134,"about_ca_topic_score_gemma":0.0018575673,"teacher_disagreement_score":0.0016486134,"about_ca_system_score_codex":0.00029456764,"about_ca_system_score_gemma":0.00044858706,"threshold_uncertainty_score":0.003949642},"labels":[],"label_agreement":null},{"id":"W2693076760","doi":"10.1016/j.ejor.2018.02.045","title":"Trade-off preservation in inverse multi-objective convex optimization","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Inverse; Linear programming; Computer science; Pareto principle; Mathematics; Optimization problem; Convex optimization; Regular polygon","score_opus":0.08503374081602867,"score_gpt":0.3640516131639794,"score_spread":0.2790178723479507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2693076760","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.015555867,0.00044392454,0.9792437,0.00025754326,0.000048941238,0.000032249984,0.00003782524,0.000108558415,0.0042714677],"genre_scores_gemma":[0.63066286,0.00081139174,0.35843724,0.00025121286,0.00013592973,0.00021864049,0.00018748162,0.0006333415,0.008661964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980788,0.0009951621,0.00008246349,0.00020462513,0.00051114196,0.00012774828],"domain_scores_gemma":[0.9944088,0.003999041,0.00031164466,0.0006368416,0.0004830172,0.00016063235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054460634,0.0015998344,0.0018637239,0.0009525011,0.00060389156,0.002528219,0.0020985613,0.001799711,0.0030749238],"category_scores_gemma":[0.018997505,0.0011508671,0.001250378,0.0012721822,0.0024795353,0.0038967694,0.0039004139,0.0031862704,0.00049265404],"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.00040663898,0.0001559225,0.00085128896,0.0005034263,0.00013130004,0.00019040001,0.00027080547,0.7777855,0.003394738,0.12603013,0.0019565693,0.08832326],"study_design_scores_gemma":[0.00001613597,0.00010784231,0.00013400282,0.000029207213,0.00001832039,0.0000692945,0.000023126897,0.95069385,0.0011315836,0.04707778,0.00068708113,0.0000116897345],"about_ca_topic_score_codex":0.0010905794,"about_ca_topic_score_gemma":0.000835485,"teacher_disagreement_score":0.0054460634,"about_ca_system_score_codex":0.00084404217,"about_ca_system_score_gemma":0.00088523584,"threshold_uncertainty_score":0.028801858},"labels":[],"label_agreement":null},{"id":"W2705978056","doi":"","title":"Simulation and optimization of Mixed Fluid Cascade process to produce Liquefied natural gas","year":2017,"lang":"en","type":"article","venue":"Nova Journal of Engineering and Applied Sciences","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Liquefied natural gas; Natural gas; Gas compressor; Liquefaction; Cascade; Volume (thermodynamics); Genetic algorithm; Work (physics); Process engineering; Interfacing; Process (computing); Engineering; Energy consumption; Environmental science; Computer science; Mechanical engineering; Mathematical optimization; Waste management; Mathematics; Thermodynamics; Physics","score_opus":0.022561665980629524,"score_gpt":0.29740248159344324,"score_spread":0.2748408156128137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2705978056","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.87575084,0.00071448844,0.0838807,0.00058897847,0.00013080117,0.00017168978,0.0007238654,0.00032748125,0.037711147],"genre_scores_gemma":[0.9799161,0.00023037833,0.014802788,0.000032199543,0.000007946274,0.00015764151,0.00022275498,0.000023067478,0.004607018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999021,0.000028042741,0.0000049669275,0.000014916344,0.000021277854,0.000028568658],"domain_scores_gemma":[0.9996716,0.00022204159,0.0000257175,0.000008415006,0.000056040233,0.000016205691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002880833,0.0005030291,0.0006227909,0.0003970454,0.0005107358,0.0006375582,0.00040067907,0.0009595818,0.0032453989],"category_scores_gemma":[0.00072894216,0.00023456394,0.00068779313,0.00041124824,0.00036779864,0.000276685,0.00034577004,0.0005221228,0.00014759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003425408,0.000023939945,0.00076594704,0.000037653837,0.0000069944285,0.000049801096,0.000016399057,0.9961157,0.00076578493,0.000624158,0.00012598133,0.0014333944],"study_design_scores_gemma":[0.0000075804082,0.000020717942,0.0002166668,0.0000034971263,0.0000031347709,0.0000033972267,0.000013397575,0.9990689,0.0003708795,0.0001216382,0.00016834085,0.0000018103722],"about_ca_topic_score_codex":0.020031484,"about_ca_topic_score_gemma":0.011155754,"teacher_disagreement_score":0.020031484,"about_ca_system_score_codex":0.0006577373,"about_ca_system_score_gemma":0.0011298846,"threshold_uncertainty_score":0.03982979},"labels":[],"label_agreement":null},{"id":"W2715235799","doi":"10.2139/ssrn.2986630","title":"Optimizing Objective Functions Determined from Random Forests","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Random forest; Environmental science; Computer science; Artificial intelligence","score_opus":0.010855445793266371,"score_gpt":0.2625532758994349,"score_spread":0.25169783010616853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2715235799","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.039496187,0.00087186287,0.954028,0.0001646398,0.0001386139,0.00012919916,0.0001545041,0.00079256063,0.0042242776],"genre_scores_gemma":[0.4491409,0.00039651655,0.5451893,0.00023398371,0.00011973209,0.00034223776,0.00070552225,0.0005557547,0.003316067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985719,0.00075352466,0.000058287063,0.00022590761,0.0002854098,0.0001048782],"domain_scores_gemma":[0.996723,0.0023922343,0.00018375946,0.0001911939,0.0004428335,0.00006694502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033417745,0.0013231264,0.0013546777,0.001297434,0.00048221316,0.0011652246,0.0013087242,0.001788467,0.002303606],"category_scores_gemma":[0.008503777,0.000673834,0.0012631189,0.001042449,0.00050551846,0.0011667351,0.0007369723,0.0014609514,0.00078736723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081896396,0.000067104076,0.00054935104,0.00010751946,0.00006666937,0.00004108262,0.00001529754,0.94055396,0.0010293395,0.0031078677,0.001388397,0.052991632],"study_design_scores_gemma":[0.0000065085746,0.000014652535,0.000097758915,0.000010471825,0.000010067467,0.000011421607,0.0000029150176,0.99726236,0.00043317996,0.0019624808,0.00018487801,0.0000032752553],"about_ca_topic_score_codex":0.0027092022,"about_ca_topic_score_gemma":0.0042785825,"teacher_disagreement_score":0.0033417745,"about_ca_system_score_codex":0.00083155197,"about_ca_system_score_gemma":0.0011735902,"threshold_uncertainty_score":0.017673254},"labels":[],"label_agreement":null},{"id":"W2728804035","doi":"10.1007/s00158-017-1726-0","title":"Compact implementation of non-hierarchical analytical target cascading for coordinating distributed multidisciplinary design optimization problems","year":2017,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University; Group for Research in Decision Analysis","funders":"McGill University","keywords":"Multidisciplinary design optimization; Multidisciplinary approach; Computer science; Engineering design process; Mathematical optimization; Distributed computing; Function (biology); Theoretical computer science; Engineering; Mathematics; Mechanical engineering","score_opus":0.02814911412164767,"score_gpt":0.3436362931700707,"score_spread":0.31548717904842305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728804035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016023174,0.00005081072,0.9743001,0.00007151294,0.000037042126,0.000027980897,0.000018234694,0.00066219544,0.008808861],"genre_scores_gemma":[0.7027453,0.00007407759,0.2908562,0.00007508329,0.000024126797,0.00013760774,0.000063745465,0.00014458405,0.005879358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997166,0.000064800646,0.000014269351,0.000037808266,0.00013203167,0.00003438541],"domain_scores_gemma":[0.9995148,0.00017092365,0.000048168447,0.0001132052,0.000113341746,0.000039598144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046476052,0.0006353166,0.00051625184,0.00032243712,0.00047851296,0.000849202,0.001410466,0.0006659285,0.006363326],"category_scores_gemma":[0.0013428311,0.00033137054,0.00037696332,0.0003661144,0.00038118742,0.000839144,0.0013027677,0.0007985073,0.00092749327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018419995,0.00014483757,0.0004356889,0.0001030546,0.00004560351,0.00013454075,0.00012653696,0.85667074,0.026258057,0.03544908,0.0020305887,0.07841708],"study_design_scores_gemma":[0.0000064559154,0.000019792684,0.000034393695,0.0000020641764,0.0000032690227,0.000010794275,0.0000073825054,0.9960484,0.0015938184,0.0017084571,0.0005628279,0.0000023825303],"about_ca_topic_score_codex":0.00160143,"about_ca_topic_score_gemma":0.0035182773,"teacher_disagreement_score":0.006363326,"about_ca_system_score_codex":0.00046563498,"about_ca_system_score_gemma":0.0006678037,"threshold_uncertainty_score":0.021287441},"labels":[],"label_agreement":null},{"id":"W2729858878","doi":"10.1109/cec.2017.7969592","title":"Fusion-based hybrid many-objective optimization algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; Benchmark (surveying); Algorithm; Optimization problem; Convergence (economics); Test functions for optimization; Curse of dimensionality; Mathematical optimization; Machine learning; Multi-swarm optimization; Mathematics","score_opus":0.012558301475420716,"score_gpt":0.26710910919382436,"score_spread":0.25455080771840366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729858878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010889917,0.0005396885,0.98442286,0.000116304596,0.000048749935,0.00005812643,0.0000327627,0.00050904707,0.0033825901],"genre_scores_gemma":[0.5571242,0.00047782293,0.43719724,0.00029016106,0.000070949805,0.0004807258,0.00028778278,0.0001426507,0.00392842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.00024106083,0.000053721502,0.00018190968,0.00035852112,0.00011204619],"domain_scores_gemma":[0.9993932,0.00027753055,0.000068095054,0.000043050964,0.00018813879,0.000029966726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018223319,0.0011922693,0.0017292432,0.0012551227,0.0006601325,0.0012020476,0.0020008837,0.0016521888,0.0022668843],"category_scores_gemma":[0.0017212877,0.00056224485,0.0013721642,0.0013322061,0.0007637769,0.0011280988,0.0018273453,0.0012386906,0.0005572219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066002984,0.00004298842,0.00040058364,0.000067537076,0.00007188366,0.000029633382,0.000049744183,0.93292606,0.0015795844,0.004105199,0.0006102276,0.060050588],"study_design_scores_gemma":[0.000010764149,0.000027054877,0.00006150117,0.000005440795,0.000008336282,0.000008456898,0.000004832982,0.9982798,0.00030038765,0.0009497463,0.00033962986,0.0000040328237],"about_ca_topic_score_codex":0.0047395597,"about_ca_topic_score_gemma":0.0030443277,"teacher_disagreement_score":0.0047395597,"about_ca_system_score_codex":0.0008241357,"about_ca_system_score_gemma":0.00138026,"threshold_uncertainty_score":0.009637535},"labels":[],"label_agreement":null},{"id":"W2732794531","doi":"10.1007/s00158-017-1730-4","title":"Multi-fidelity POD surrogate-assisted optimization: Concept and aero-design study","year":2017,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"Association Nationale de la Recherche et de la Technologie; Fédération Wallonie-Bruxelles","keywords":"Subspace topology; Surrogate model; Fidelity; Curse of dimensionality; Field (mathematics); Mathematical optimization; Computer science; Algorithm; Dimensionality reduction; Mathematics; Artificial intelligence","score_opus":0.03683139169342397,"score_gpt":0.3174067330130303,"score_spread":0.2805753413196063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732794531","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.056044277,0.00052460097,0.9228692,0.00028005897,0.000108072476,0.00010796895,0.00008825927,0.0001444196,0.019833153],"genre_scores_gemma":[0.8349474,0.00070866226,0.15784091,0.00007545868,0.000036827776,0.00010368921,0.000097303295,0.000075014104,0.006114769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996785,0.00011809954,0.000009392475,0.000023237397,0.0001519842,0.000018884106],"domain_scores_gemma":[0.99939287,0.00023550964,0.000065703985,0.00010813104,0.00015882762,0.000039060415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184722,0.00042038926,0.0005390777,0.00037650776,0.00027212946,0.0008271691,0.00042477323,0.0010045943,0.00147595],"category_scores_gemma":[0.001933775,0.00018637197,0.0004326618,0.00043840567,0.000564371,0.00070352474,0.00076680304,0.00076611864,0.00024199462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016932434,0.000305047,0.0013587616,0.00022397116,0.00002912521,0.00016793264,0.000075700096,0.8612999,0.018343732,0.072625965,0.0012178372,0.044182695],"study_design_scores_gemma":[0.0000045099264,0.000044168908,0.00015364138,0.000007798699,0.0000022563004,0.000044716373,0.000007736563,0.9956448,0.0016058335,0.0017646927,0.0007156346,0.0000042152674],"about_ca_topic_score_codex":0.0002828373,"about_ca_topic_score_gemma":0.0002449852,"teacher_disagreement_score":0.00147595,"about_ca_system_score_codex":0.00020056365,"about_ca_system_score_gemma":0.0003560912,"threshold_uncertainty_score":0.005386293},"labels":[],"label_agreement":null},{"id":"W2737342012","doi":"","title":"Numerical investigation of non-hierarchical coordination for distributed multidisciplinary design optimization with fixed computational budget","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Bombardier (Canada); McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; MATLAB; Computer science; Convergence (economics); Augmented Lagrangian method; Optimization problem; Consistency (knowledge bases); Mathematics; Algorithm","score_opus":0.01947192149283435,"score_gpt":0.2563932753391899,"score_spread":0.23692135384635551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737342012","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.4307697,0.0005827655,0.5293765,0.0008476103,0.00007940002,0.00027666352,0.00021496807,0.00037258025,0.037479788],"genre_scores_gemma":[0.93418807,0.00010534887,0.06373572,0.000047777623,0.000009254795,0.00017052745,0.000056155044,0.00003655215,0.0016506098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.0002384524,0.000018730852,0.00006200378,0.00012943888,0.00007841212],"domain_scores_gemma":[0.9974246,0.0017946373,0.00027262905,0.00016236461,0.00021102128,0.00013469257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872807,0.0006113452,0.00076208985,0.00058721437,0.00059244706,0.0009498517,0.00083701505,0.0012964866,0.002414091],"category_scores_gemma":[0.004809216,0.0002862929,0.00048136536,0.0005817525,0.0009964544,0.0006183069,0.0012504179,0.000879008,0.00018185713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029392748,0.000022670432,0.00041073526,0.000028556378,0.0000062628656,0.00003713385,0.000018938423,0.994695,0.00041568864,0.0025682757,0.00009208964,0.0016751653],"study_design_scores_gemma":[0.000010106303,0.000019713592,0.00008190717,0.0000034225932,0.0000022981776,0.000004360056,0.000014893333,0.9989864,0.00018726617,0.0005634648,0.00012455987,0.0000015879103],"about_ca_topic_score_codex":0.0076687876,"about_ca_topic_score_gemma":0.005870771,"teacher_disagreement_score":0.0076687876,"about_ca_system_score_codex":0.00092285516,"about_ca_system_score_gemma":0.0013223328,"threshold_uncertainty_score":0.015248299},"labels":[],"label_agreement":null},{"id":"W2737659035","doi":"10.1108/compel-02-2017-0110","title":"Analysis and design of electrical machines with material uncertainties in iron and permanent magnet","year":2017,"lang":"en","type":"article","venue":"COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Robustness (evolution); Magnet; Computer science; Mechanical engineering; Control engineering; Engineering","score_opus":0.01109181690410946,"score_gpt":0.2702947412406307,"score_spread":0.2592029243365212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737659035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027639838,0.0003636474,0.9699546,0.000107604224,0.00001739862,0.000035829053,0.000031142867,0.00009010292,0.0017598649],"genre_scores_gemma":[0.9196513,0.00042601075,0.07843175,0.000032315256,0.00001999581,0.00012537971,0.000062627856,0.00003498784,0.0012157358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.0001374947,0.000024005596,0.000082872444,0.0002037481,0.000035564255],"domain_scores_gemma":[0.9991346,0.00053169625,0.00017733582,0.000042406187,0.00009850251,0.000015512389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093381817,0.00056979654,0.0005951027,0.0004461014,0.00023329882,0.0007726512,0.0004811743,0.00077321916,0.0007639669],"category_scores_gemma":[0.0024251612,0.00046596356,0.00071980665,0.00030001794,0.00053843576,0.0004350413,0.0004855488,0.00053257006,0.000110328445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008440137,0.0000069433363,0.00013846709,0.000041770974,0.000012314291,0.000018470062,0.0000070640335,0.9907414,0.0014013966,0.001733081,0.0000419866,0.0058487607],"study_design_scores_gemma":[0.000001970406,0.000026150667,0.0001408633,0.000005052852,0.0000061831543,0.0000089934765,0.0000035106993,0.99752635,0.00071752496,0.0012787193,0.00028233134,0.0000023303166],"about_ca_topic_score_codex":0.0015679522,"about_ca_topic_score_gemma":0.0009174214,"teacher_disagreement_score":0.0015679522,"about_ca_system_score_codex":0.0004341886,"about_ca_system_score_gemma":0.00084161566,"threshold_uncertainty_score":0.004938543},"labels":[],"label_agreement":null},{"id":"W2742479298","doi":"10.1109/islped.2017.8009208","title":"A case for efficient accelerator design space exploration via Bayesian optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":78,"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":"Bayesian optimization; Computer science; Design space exploration; Artificial intelligence; Artificial neural network; Machine learning; Hardware acceleration; Bayesian probability; Space (punctuation); Bayesian network; Deep learning; Computer engineering; Embedded system; Field-programmable gate array","score_opus":0.05832393744523108,"score_gpt":0.30598532207861623,"score_spread":0.24766138463338516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742479298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010969769,0.00073734194,0.98002005,0.0012175638,0.00004646926,0.000030320853,0.00002614898,0.00023319316,0.0067191087],"genre_scores_gemma":[0.41374192,0.0007860223,0.57868767,0.0009314185,0.00008723142,0.00023229158,0.00008334643,0.00028660597,0.005163527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987764,0.0005384221,0.00003868964,0.0001507913,0.00039487222,0.00010091202],"domain_scores_gemma":[0.9978815,0.0014281617,0.00012444606,0.0003180237,0.00018647233,0.00006138734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027595377,0.00090316747,0.00092235237,0.00052026403,0.00051719457,0.0013126576,0.0010612564,0.0015603416,0.004278643],"category_scores_gemma":[0.008263176,0.0008344702,0.0007502288,0.0005711782,0.0014064146,0.0026601295,0.0013980629,0.0027053403,0.0008008376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013176288,0.00009915118,0.00075148785,0.00015736674,0.000080105245,0.000114831615,0.00009590726,0.7915977,0.004182917,0.12617652,0.0033157389,0.07329648],"study_design_scores_gemma":[0.000036381563,0.00006380975,0.0001326067,0.0000335825,0.000017646595,0.000049580904,0.0000182177,0.88685256,0.0013228575,0.106337324,0.0051217084,0.000013692395],"about_ca_topic_score_codex":0.00112526,"about_ca_topic_score_gemma":0.0022714508,"teacher_disagreement_score":0.004278643,"about_ca_system_score_codex":0.00077118515,"about_ca_system_score_gemma":0.0012383513,"threshold_uncertainty_score":0.014593959},"labels":[],"label_agreement":null},{"id":"W2745882967","doi":"10.1109/tmag.2017.2661987","title":"Surrogate-Based MOEA/D for Electric Motor Design With Scarce Function Evaluations","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"","keywords":"Surrogate model; Computer science; Decomposition; Multi-objective optimization; Mathematical optimization; Evolutionary algorithm; Function (biology); Electric motor; Artificial intelligence; Machine learning; Mathematics; Engineering","score_opus":0.037423525284519796,"score_gpt":0.29388138035126754,"score_spread":0.25645785506674773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745882967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040593334,0.00016805719,0.994443,0.000029548743,0.000017133365,0.000014916434,0.00000957072,0.00009656485,0.001161846],"genre_scores_gemma":[0.29765937,0.0004801641,0.6985565,0.000092548966,0.000030406401,0.000301519,0.00018084249,0.00013914767,0.0025594968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996321,0.00016748748,0.000014351459,0.000027767883,0.00013279241,0.00002555169],"domain_scores_gemma":[0.9996092,0.00022723163,0.00003323656,0.000031166066,0.00007840321,0.000020762938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556813,0.0009025911,0.00089922274,0.0005717008,0.00030072674,0.00045851737,0.0005493828,0.0007237128,0.0011195238],"category_scores_gemma":[0.0018186823,0.00043784938,0.0008460057,0.00051758194,0.0003547854,0.00039669315,0.00066198315,0.0010111011,0.0003957881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053894568,0.00003175525,0.00026737707,0.00008703681,0.000042189764,0.000028547702,0.000021874761,0.9431716,0.0044322996,0.0065924213,0.0004816433,0.044789266],"study_design_scores_gemma":[0.0000050240874,0.00002184459,0.00003640378,0.0000058684063,0.0000034492464,0.000009314937,0.0000019158897,0.99747187,0.00064013456,0.0011000248,0.00070214405,0.000002034718],"about_ca_topic_score_codex":0.00072486134,"about_ca_topic_score_gemma":0.0007089201,"teacher_disagreement_score":0.0011195238,"about_ca_system_score_codex":0.0003028059,"about_ca_system_score_gemma":0.00057220535,"threshold_uncertainty_score":0.0050542355},"labels":[],"label_agreement":null},{"id":"W2752453588","doi":"10.14738/tmlai.55.3580","title":"A Computational Algorithm for Simultaneously Creating Alternatives to Optimal Solutions","year":2017,"lang":"en","type":"article","venue":"Transactions on Machine Learning and Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Benchmark (surveying); Mathematical optimization; Firefly algorithm; Optimization problem; Algorithm; Mathematics","score_opus":0.04137580143151002,"score_gpt":0.3428928418152673,"score_spread":0.30151704038375726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752453588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021949632,0.00008705367,0.99461305,0.0001271405,0.00002552872,0.00011646948,0.000033611766,0.00026439643,0.0025378366],"genre_scores_gemma":[0.025248209,0.000075614094,0.97319317,0.0000674912,0.00001665947,0.00042588677,0.00007455846,0.000053539934,0.000844865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883693,0.00047538267,0.00006432587,0.00017066365,0.0003565265,0.00009623268],"domain_scores_gemma":[0.9976646,0.0018580842,0.00011086655,0.000104356586,0.00021149922,0.000050677827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003219378,0.0018958605,0.0013919836,0.0019324934,0.0011450775,0.0017039859,0.0023409296,0.0024328702,0.008176216],"category_scores_gemma":[0.006665338,0.00088577234,0.0015491513,0.0020328437,0.0014473302,0.0015845901,0.0024633596,0.0024836692,0.0012874968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117363,0.00012208466,0.00049429067,0.00026445225,0.0000757332,0.00008769769,0.00017109928,0.71043754,0.0016262082,0.09432852,0.0038481408,0.18842693],"study_design_scores_gemma":[0.0000519282,0.000045268138,0.000036900157,0.000024896399,0.000015531303,0.0000315001,0.000021206999,0.9733699,0.00051818544,0.023579903,0.002295787,0.000008936134],"about_ca_topic_score_codex":0.002942218,"about_ca_topic_score_gemma":0.0037061593,"teacher_disagreement_score":0.008176216,"about_ca_system_score_codex":0.0013266539,"about_ca_system_score_gemma":0.0025787547,"threshold_uncertainty_score":0.027352154},"labels":[],"label_agreement":null},{"id":"W2754588405","doi":"10.1609/aaai.v32i1.11532","title":"Warmstarting of Model-Based Algorithm Configuration","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Exploit; Computer science; Benchmark (surveying); Solver; Process (computing); Scratch; Algorithm; Programming language","score_opus":0.08355056564429254,"score_gpt":0.32335339257047163,"score_spread":0.2398028269261791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754588405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11498557,0.0011474704,0.86014676,0.0005700334,0.00039172627,0.00044419523,0.0002266314,0.012281315,0.009806306],"genre_scores_gemma":[0.62798345,0.00023253818,0.36498886,0.00056152843,0.0001278568,0.0008248232,0.0009870769,0.002071786,0.0022220437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604994,0.0017093562,0.00019373318,0.00089946727,0.0006390885,0.0005084562],"domain_scores_gemma":[0.98549426,0.0068586976,0.0007332005,0.0052037737,0.0011707057,0.0005393858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005314572,0.0024704717,0.0025414678,0.0017022939,0.0013115142,0.0023252587,0.0036461933,0.0023521024,0.0059332936],"category_scores_gemma":[0.026897497,0.0020345554,0.0017956652,0.001284573,0.0017011021,0.0038643766,0.004129383,0.0052662627,0.0025687865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007945629,0.00062219345,0.006284204,0.00028256743,0.00025834766,0.00021618468,0.0004269223,0.82353944,0.007304498,0.013679664,0.007678174,0.13891327],"study_design_scores_gemma":[0.00010640693,0.00016957708,0.00038536257,0.00004134074,0.00004622417,0.000057591078,0.000055350214,0.9841232,0.004331211,0.008793232,0.0018607994,0.000029789006],"about_ca_topic_score_codex":0.0020587475,"about_ca_topic_score_gemma":0.0036388899,"teacher_disagreement_score":0.0059332936,"about_ca_system_score_codex":0.0012778109,"about_ca_system_score_gemma":0.0023191175,"threshold_uncertainty_score":0.02810651},"labels":[],"label_agreement":null},{"id":"W2759142102","doi":"","title":"EM-driven multi-objective design of impedance transformers by pareto ranking bisection algorithm","year":2017,"lang":"en","type":"article","venue":"2017 International Applied Computational Electromagnetics Society Symposium (ACES)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Bisection; Transformer; Multi-objective optimization; Bisection method; Pareto principle; Mathematical optimization; Pareto optimal; Algorithm; Impedance matching; Mathematics; Electrical impedance; Ranking (information retrieval); Matching (statistics); Computer science; Engineering; Artificial intelligence; Statistics; Voltage","score_opus":0.013364426937418355,"score_gpt":0.26748255774098545,"score_spread":0.2541181308035671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759142102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063624377,0.00007212296,0.9912844,0.000038534126,0.000010013534,0.0000346023,0.000011909945,0.0000992249,0.0020868087],"genre_scores_gemma":[0.4250423,0.00023251804,0.5689785,0.00011373247,0.000022398775,0.00051155046,0.00012179752,0.00014940815,0.004827777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995919,0.00016833888,0.000014080318,0.000035732137,0.0001587593,0.00003130264],"domain_scores_gemma":[0.9995258,0.0002664197,0.000059425747,0.000027399983,0.00010188701,0.00001905446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771198,0.0011154987,0.0008340624,0.0008336675,0.00037568813,0.0009024501,0.0008868568,0.0009522344,0.0023559874],"category_scores_gemma":[0.0017276758,0.00049708557,0.00070668577,0.00071267824,0.00054620596,0.0007524943,0.0010366179,0.00079032,0.0004920402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003490818,0.00003252677,0.00012661784,0.000037388312,0.00001766171,0.000021223908,0.000026711072,0.9687836,0.001965666,0.0055616717,0.00030621374,0.023085903],"study_design_scores_gemma":[0.0000057791135,0.000022722414,0.000020647285,0.0000037278335,0.0000025995969,0.0000063865327,0.0000038064768,0.99790037,0.00041283193,0.0013235218,0.00029532227,0.0000022497206],"about_ca_topic_score_codex":0.0011104833,"about_ca_topic_score_gemma":0.0012460835,"teacher_disagreement_score":0.0023559874,"about_ca_system_score_codex":0.000606475,"about_ca_system_score_gemma":0.00078967144,"threshold_uncertainty_score":0.007881582},"labels":[],"label_agreement":null},{"id":"W2759726304","doi":"10.1007/s00158-017-1815-0","title":"Employing partial metamodels for optimization with scarce samples","year":2017,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Metamodeling; Mathematical optimization; Radial basis function; Computer science; Optimization problem; Engineering design process; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.031152022518268246,"score_gpt":0.3044022860194053,"score_spread":0.273250263501137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759726304","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.0041613956,0.00006812502,0.9950606,0.000060934228,0.000010908061,0.000016055541,0.00004840684,0.00010036876,0.00047322267],"genre_scores_gemma":[0.31201702,0.0003515232,0.68417114,0.00019037584,0.000054412565,0.00050313864,0.00054284255,0.0002675107,0.0019020163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983334,0.0010811262,0.000066214496,0.00015673635,0.00030169485,0.000060931627],"domain_scores_gemma":[0.99303037,0.0050255,0.0003840877,0.0010082657,0.00041025653,0.00014146793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045637493,0.0010160886,0.0016100378,0.0012957299,0.00047678853,0.0010887977,0.0016727662,0.001483892,0.002765796],"category_scores_gemma":[0.016018525,0.0011173179,0.0017697605,0.0012975693,0.001111376,0.0022880612,0.002180409,0.0014897643,0.00046482586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043333614,0.000037127964,0.00040081935,0.000080820384,0.000054373166,0.00003183304,0.00003133658,0.9379158,0.0010598073,0.041847154,0.00036706546,0.018130494],"study_design_scores_gemma":[0.0000031902248,0.000010703687,0.000024979769,0.000008099425,0.000005394135,0.0000047656677,0.0000033447684,0.9833829,0.00019419794,0.016071074,0.00028905954,0.0000023798325],"about_ca_topic_score_codex":0.001765067,"about_ca_topic_score_gemma":0.002799826,"teacher_disagreement_score":0.0045637493,"about_ca_system_score_codex":0.0007442417,"about_ca_system_score_gemma":0.0010383975,"threshold_uncertainty_score":0.024135709},"labels":[],"label_agreement":null},{"id":"W2761472785","doi":"10.1007/s10898-017-0574-1","title":"Order-based error for managing ensembles of surrogates in mesh adaptive direct search","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Benchmark (surveying); Surrogate model; Mathematical optimization; Global optimization; Computer science; Mathematics; Machine learning; Algorithm","score_opus":0.03303527240385088,"score_gpt":0.32753132144494923,"score_spread":0.29449604904109833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761472785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150006,0.00023482055,0.9827916,0.00012393059,0.00011588619,0.0000398974,0.00003497046,0.000120352,0.0015380036],"genre_scores_gemma":[0.51324445,0.00044553677,0.47983456,0.00018789174,0.00016475697,0.00032869368,0.00024123682,0.00038616025,0.005166762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890673,0.00040474624,0.00007858136,0.00009079981,0.0004443187,0.000074826065],"domain_scores_gemma":[0.9944291,0.003450783,0.00028628396,0.00068456307,0.00093801867,0.00021121197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764294,0.00082284457,0.0013108467,0.00090957753,0.0006843996,0.0013056644,0.0017705754,0.0020697962,0.0015317001],"category_scores_gemma":[0.014838876,0.00062586664,0.00075156416,0.0006386239,0.001070233,0.001883581,0.0026572784,0.0018657534,0.0003080184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007292684,0.000046855985,0.0004680398,0.000051954703,0.000025541498,0.000025284431,0.000046335896,0.957311,0.0012216986,0.020829681,0.0004963854,0.019404339],"study_design_scores_gemma":[0.0000021703702,0.000007810028,0.000020543019,0.0000028790266,0.0000018879715,0.0000027905442,0.0000019520678,0.9974269,0.00017621492,0.0022607627,0.00009396292,0.0000019530137],"about_ca_topic_score_codex":0.0037066436,"about_ca_topic_score_gemma":0.0042498847,"teacher_disagreement_score":0.003764294,"about_ca_system_score_codex":0.000923852,"about_ca_system_score_gemma":0.0012339818,"threshold_uncertainty_score":0.019907713},"labels":[],"label_agreement":null},{"id":"W2762742239","doi":"10.1007/s00158-017-1826-x","title":"Surrogate-based optimization with clustering-based space exploration for expensive multimodal problems","year":2017,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":33,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematical optimization; Kriging; Benchmark (surveying); Local optimum; Cluster analysis; Surrogate model; Computer science; Optimization problem; Global optimization; Local search (optimization); Algorithm; Mathematics; Machine learning","score_opus":0.0231776931946312,"score_gpt":0.28264271371293054,"score_spread":0.25946502051829934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762742239","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.005344062,0.00020031718,0.9922599,0.00011738948,0.00003744933,0.000029667888,0.000026732656,0.000115867704,0.0018686535],"genre_scores_gemma":[0.3214341,0.00033734945,0.67308754,0.00017301131,0.00008759045,0.00043214057,0.00025312047,0.00031062547,0.003884454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.0006380433,0.000043825836,0.00007633607,0.00030416777,0.00005861352],"domain_scores_gemma":[0.9974534,0.0016370786,0.00016534814,0.0002146865,0.00040756114,0.00012178842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029631967,0.0012901814,0.0017862304,0.0012386292,0.0006668104,0.0010871461,0.0015801468,0.0025891478,0.0028580816],"category_scores_gemma":[0.008651078,0.00094676524,0.0012936095,0.0015737675,0.0010873507,0.0014638075,0.0024357731,0.0019725047,0.0005223722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006154639,0.000042631003,0.00014119853,0.000058627134,0.000031411324,0.000029586912,0.000029642493,0.97224796,0.0008951331,0.011467351,0.00079107477,0.014203764],"study_design_scores_gemma":[0.000003143027,0.000008180476,0.000015629048,0.000003578222,0.0000015999212,0.000005311104,0.0000017437,0.9978358,0.00010303442,0.0018726027,0.0001473315,0.0000020528846],"about_ca_topic_score_codex":0.0017751718,"about_ca_topic_score_gemma":0.0019427107,"teacher_disagreement_score":0.0029631967,"about_ca_system_score_codex":0.00078199175,"about_ca_system_score_gemma":0.001144379,"threshold_uncertainty_score":0.015671074},"labels":[],"label_agreement":null},{"id":"W2765909831","doi":"10.1115/detc2017-67843","title":"A Reference Error Formulation for Multi-Fidelity Design Optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"","keywords":"Fidelity; Computer science; Constraint (computer-aided design); Mathematical optimization; Key (lock); Process (computing); High fidelity; Engineering design process; Optimization problem; Algorithm; Mathematics; Engineering","score_opus":0.1804359847249212,"score_gpt":0.3819200661392065,"score_spread":0.20148408141428528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765909831","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.00048317827,0.0000768617,0.99858046,0.000058764108,0.000013021513,0.000011859039,0.000009194436,0.000032159594,0.00073453813],"genre_scores_gemma":[0.2224325,0.0007052565,0.7699173,0.000220705,0.00013414692,0.00043025892,0.00015789768,0.00025855016,0.0057433983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979918,0.00079936045,0.00009078189,0.00021710424,0.00081103767,0.00008999831],"domain_scores_gemma":[0.9972796,0.0014172974,0.00026787672,0.00038684026,0.00056456955,0.00008390233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004719872,0.0013477402,0.001185819,0.0009407875,0.00042401085,0.0015126171,0.0023259448,0.0024716295,0.0035202322],"category_scores_gemma":[0.008953296,0.0005414493,0.0011530629,0.00078300736,0.0014884191,0.0021863698,0.0021625515,0.0022304486,0.0008501512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040748568,0.000035062898,0.00018656187,0.000153578,0.000025614916,0.000058999463,0.000068221554,0.8576787,0.0027082432,0.114072256,0.0008103554,0.024161628],"study_design_scores_gemma":[0.0000054105303,0.000049450147,0.000027933978,0.000020320174,0.000005197915,0.000018279306,0.0000056892427,0.98319936,0.00091605267,0.014305956,0.001438167,0.00000818484],"about_ca_topic_score_codex":0.0016246467,"about_ca_topic_score_gemma":0.0010211325,"teacher_disagreement_score":0.004719872,"about_ca_system_score_codex":0.0009921994,"about_ca_system_score_gemma":0.0011128904,"threshold_uncertainty_score":0.024961352},"labels":[],"label_agreement":null},{"id":"W2766299525","doi":"10.1115/detc2017-67601","title":"Dimension Reduction and Decomposition Using Causal Graph and Qualitative Analysis for Aircraft Concept Design Optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Dimensionality reduction; Curse of dimensionality; Multidisciplinary design optimization; Decomposition; Dimension (graph theory); Mathematical optimization; Computer science; Optimization problem; Graph; Decomposition method (queueing theory); Principal component analysis; Mathematics; Artificial intelligence; Theoretical computer science; Multidisciplinary approach","score_opus":0.055034606642099214,"score_gpt":0.3846011530735725,"score_spread":0.3295665464314733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766299525","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.0021074172,0.00010337494,0.9971307,0.00004445143,0.000009114637,0.000017861306,0.00001872213,0.00004981078,0.00051850145],"genre_scores_gemma":[0.23858687,0.00066416466,0.7589968,0.00008556552,0.00003625419,0.00035950984,0.00020939868,0.00008461552,0.0009768344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.0003186159,0.000032335676,0.000080370555,0.00022632738,0.000041230996],"domain_scores_gemma":[0.99865973,0.0009254889,0.00012579447,0.000091232214,0.00016385302,0.00003384928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013747149,0.0011104711,0.00077874504,0.0015505893,0.0004929312,0.0007201264,0.0005481711,0.0005486709,0.0018698386],"category_scores_gemma":[0.0027690385,0.00052931596,0.0013157724,0.0012296536,0.000880181,0.0010324523,0.0010572664,0.0011572614,0.00019239142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003658248,0.00004621452,0.0005811941,0.00022944743,0.000051751198,0.000055744822,0.00008113415,0.88140136,0.0034612236,0.053393364,0.00072021375,0.05994168],"study_design_scores_gemma":[0.000006516729,0.000017456463,0.000093581504,0.000011145254,0.00000977267,0.0000112430835,0.000012416579,0.97545207,0.00058220566,0.023109525,0.00068609655,0.000007871779],"about_ca_topic_score_codex":0.0029886016,"about_ca_topic_score_gemma":0.0023813262,"teacher_disagreement_score":0.0029886016,"about_ca_system_score_codex":0.00083931116,"about_ca_system_score_gemma":0.0014064267,"threshold_uncertainty_score":0.007270336},"labels":[],"label_agreement":null},{"id":"W2768981582","doi":"10.1007/s10288-017-0362-2","title":"The inventory replenishment planning and staggering problem: a bi-objective approach","year":2017,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Decision maker; Population; Pareto optimal; Order (exchange); Space (punctuation); Operations research; Mathematics; Economics","score_opus":0.02579070386469375,"score_gpt":0.287191586310707,"score_spread":0.2614008824460133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768981582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014886259,0.0020949203,0.97007316,0.00075775245,0.00019548117,0.00023804046,0.00052302744,0.00020346686,0.011027868],"genre_scores_gemma":[0.34905076,0.0034400413,0.62477624,0.00057241635,0.00040359684,0.00096249185,0.00090907817,0.00031281332,0.019572554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703765,0.0013251669,0.00014024536,0.0002969904,0.00093130406,0.00026860466],"domain_scores_gemma":[0.9981762,0.0010401169,0.00018851442,0.00009996755,0.0003228608,0.00017239354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047970675,0.0030650264,0.003552308,0.003933615,0.0008950317,0.004244426,0.0036699488,0.0039032935,0.0068627866],"category_scores_gemma":[0.0052796556,0.0017765446,0.0020773613,0.0051194117,0.000969939,0.0035257465,0.002719023,0.002861651,0.0008810591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007428718,0.00018654096,0.00037477954,0.00028712963,0.00018037784,0.00009729106,0.000028875982,0.95497507,0.0005770908,0.013847312,0.0013813843,0.027989853],"study_design_scores_gemma":[0.0000083667055,0.00003745077,0.00009813547,0.000018309247,0.000022727194,0.000017604136,0.0000098655655,0.9954743,0.00010933864,0.0036928211,0.00050300354,0.0000082111255],"about_ca_topic_score_codex":0.0064506354,"about_ca_topic_score_gemma":0.0058035636,"teacher_disagreement_score":0.0068627866,"about_ca_system_score_codex":0.0015468053,"about_ca_system_score_gemma":0.002613167,"threshold_uncertainty_score":0.025369644},"labels":[],"label_agreement":null},{"id":"W2771061817","doi":"10.1109/smc.2017.8122576","title":"Estimation distribution algorithms with differential mutation for multi-objective optimization problems","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"","keywords":"EDAS; Estimation of distribution algorithm; Mathematical optimization; Evolutionary algorithm; Benchmark (surveying); Differential evolution; Multi-objective optimization; Computer science; Evolutionary computation; Mutation; Selection (genetic algorithm); Convergence (economics); Population; Optimization problem; Algorithm; Premature convergence; Mathematics; Genetic algorithm; Machine learning","score_opus":0.027562202066772092,"score_gpt":0.29923728392282634,"score_spread":0.27167508185605427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771061817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053699557,0.00042532178,0.99277437,0.00006918932,0.000025650417,0.00003465669,0.000005520219,0.00011852028,0.0011766914],"genre_scores_gemma":[0.44066322,0.0011716177,0.5538151,0.00017764892,0.0000760727,0.00044532534,0.00008008975,0.00009368612,0.0034772533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991284,0.00035290432,0.00004412888,0.000082897335,0.00034330823,0.000048340396],"domain_scores_gemma":[0.9987036,0.00090780086,0.00011886381,0.000071241506,0.00016568064,0.000032830605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985491,0.0010944814,0.00088875927,0.0010806755,0.0004803155,0.0006678069,0.00114726,0.0009359559,0.0012334172],"category_scores_gemma":[0.0040417765,0.00035494828,0.00071680284,0.0011360776,0.0007867808,0.00096283667,0.0012270807,0.0012280354,0.0002755606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048042893,0.000071173636,0.0008264046,0.00012655082,0.00006658534,0.00008456618,0.00007809518,0.812817,0.003452311,0.026261324,0.0006249149,0.15554306],"study_design_scores_gemma":[0.000012672958,0.000028548795,0.00008694332,0.000006867954,0.0000073468377,0.00002498155,0.0000049514747,0.9938269,0.00077546295,0.0042669545,0.0009533451,0.0000049338546],"about_ca_topic_score_codex":0.0017866394,"about_ca_topic_score_gemma":0.0010859272,"teacher_disagreement_score":0.001985491,"about_ca_system_score_codex":0.00070694037,"about_ca_system_score_gemma":0.00083153177,"threshold_uncertainty_score":0.010500431},"labels":[],"label_agreement":null},{"id":"W2774188651","doi":"10.1088/1367-2630/aae72a","title":"Statistical physics of design","year":2018,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"Office of Naval Research","keywords":"Systems engineering; Component (thermodynamics); Range (aeronautics); Physics; Key (lock); Management science; Aerospace engineering; Computer science; Engineering","score_opus":0.03617238896819869,"score_gpt":0.30401104573436727,"score_spread":0.2678386567661686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774188651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01674188,0.006137021,0.8885007,0.006026674,0.0005224795,0.00012399901,0.0003778395,0.00028417268,0.08128527],"genre_scores_gemma":[0.7729681,0.0132357525,0.17898394,0.0031605603,0.0022508246,0.0012678378,0.00068773626,0.00050745124,0.026937738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978225,0.0007484389,0.00009444165,0.00040432697,0.0007320376,0.00019824394],"domain_scores_gemma":[0.99456465,0.003443212,0.00040215763,0.00088361726,0.0005442119,0.00016210422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943732,0.000971192,0.0012116716,0.0017927121,0.0013104909,0.003814253,0.0014276848,0.0021511926,0.0067032413],"category_scores_gemma":[0.008909035,0.0006531059,0.0011957142,0.0011231567,0.006368976,0.003768653,0.0021392799,0.003374248,0.0010364613],"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.0000039918386,0.000011366877,0.0002502915,0.00007261475,0.000023067907,0.000026983267,0.000052214178,0.02544226,0.00027766955,0.9674054,0.0013059771,0.005128097],"study_design_scores_gemma":[0.0000065276276,0.000014756154,0.00022789082,0.000025488956,0.0000056343947,0.000032336437,0.00002158762,0.055047713,0.00013167578,0.93591624,0.008559307,0.000010832279],"about_ca_topic_score_codex":0.0022987034,"about_ca_topic_score_gemma":0.0017273346,"teacher_disagreement_score":0.0067032413,"about_ca_system_score_codex":0.0027672958,"about_ca_system_score_gemma":0.0020202326,"threshold_uncertainty_score":0.022424519},"labels":[],"label_agreement":null},{"id":"W2786385181","doi":"10.1007/s00158-018-1906-6","title":"Ensemble of surrogate based global optimization methods using hierarchical design space reduction","year":2018,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":39,"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 Victoria","funders":"Northwestern Polytechnical University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Surrogate model; Mathematical optimization; Benchmark (surveying); Global optimization; Robustness (evolution); Computer science; Reduction (mathematics); Computation; Multi-objective optimization; Engineering design process; Optimization problem; Engineering optimization; Mathematics; Algorithm; Engineering","score_opus":0.03347490557827443,"score_gpt":0.3517479651707263,"score_spread":0.3182730595924519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786385181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009183058,0.0002107596,0.98830426,0.00003489012,0.000049124235,0.00003046164,0.000038009643,0.0002242324,0.0019251928],"genre_scores_gemma":[0.32806695,0.00038900157,0.66677773,0.00012234175,0.00008723024,0.00035846827,0.00056394923,0.00024137239,0.0033929436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988673,0.00044175872,0.00005618788,0.00011300494,0.00045409976,0.00006768741],"domain_scores_gemma":[0.9984983,0.00054888235,0.00009015089,0.00035542113,0.00043665728,0.00007069562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022904302,0.0011176617,0.0024394267,0.0010721812,0.00049666944,0.0009887697,0.0013026791,0.0013490013,0.0024927787],"category_scores_gemma":[0.0031706323,0.00071608805,0.0016389341,0.0012333132,0.0004929601,0.0012525873,0.001697817,0.00162494,0.0007836523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066338725,0.000083241044,0.00039479285,0.000072191666,0.00010953544,0.000022663664,0.000034595287,0.911011,0.0028314658,0.005315004,0.00091297604,0.07914628],"study_design_scores_gemma":[0.0000027148255,0.000027481043,0.00005572142,0.0000037443338,0.0000072228936,0.0000052489618,0.0000026307068,0.9983907,0.00031464608,0.00088220864,0.00030484158,0.000002970555],"about_ca_topic_score_codex":0.0009178262,"about_ca_topic_score_gemma":0.0017951612,"teacher_disagreement_score":0.0024927787,"about_ca_system_score_codex":0.00034097585,"about_ca_system_score_gemma":0.000897365,"threshold_uncertainty_score":0.012113094},"labels":[],"label_agreement":null},{"id":"W2788137402","doi":"10.1287/ijoc.2021.1066","title":"Network Models for Multiobjective Discrete Optimization","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Shortest path problem; Set (abstract data type); Path (computing); Network planning and design; Optimization problem; Identification (biology); Mathematics; Theoretical computer science","score_opus":0.029121039473464873,"score_gpt":0.2954834439798765,"score_spread":0.26636240450641163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788137402","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.0011466315,0.00023672417,0.994998,0.00019962082,0.00003387583,0.000024641877,0.00007053014,0.00007730229,0.0032127195],"genre_scores_gemma":[0.22436392,0.0020613272,0.75979465,0.00029047343,0.00016650304,0.00073360687,0.0005680093,0.00020813497,0.011813305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914277,0.00040804647,0.000035430396,0.00011730592,0.00023978678,0.000056711917],"domain_scores_gemma":[0.9990171,0.00062362145,0.00010542438,0.00010668906,0.00010188733,0.000045247034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011846292,0.0015031885,0.0008683409,0.0009520766,0.00052580936,0.0017682777,0.0017876559,0.0011553542,0.0054571964],"category_scores_gemma":[0.0027887684,0.0005488728,0.0014270187,0.0011922386,0.0010680112,0.002044342,0.0018744477,0.0031885263,0.0009061205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013151238,0.000022753227,0.00014812876,0.000073891424,0.000024514091,0.000032343236,0.000026812051,0.8493627,0.00045157853,0.13712077,0.0010484383,0.01167496],"study_design_scores_gemma":[0.000004631393,0.000008362635,0.00002431734,0.000012144886,0.000004437128,0.000012549336,0.0000074110594,0.9377868,0.00014248627,0.058905747,0.0030863727,0.0000047833796],"about_ca_topic_score_codex":0.0036647043,"about_ca_topic_score_gemma":0.0050843093,"teacher_disagreement_score":0.0054571964,"about_ca_system_score_codex":0.001961511,"about_ca_system_score_gemma":0.0013715161,"threshold_uncertainty_score":0.018256128},"labels":[],"label_agreement":null},{"id":"W2788310267","doi":"10.1093/biomet/asx022","title":"OUP accepted manuscript","year":2017,"lang":"en","type":"article","venue":"Biometrika","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics","score_opus":0.039372507185360214,"score_gpt":0.31131264218589033,"score_spread":0.2719401350005301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788310267","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.0038841534,0.005473179,0.008265015,0.008374934,0.022260169,0.0005116222,0.008373688,0.0026127505,0.94024456],"genre_scores_gemma":[0.0113685075,0.0024827998,0.0030442595,0.0016462347,0.0014287778,0.00016473378,0.0056479303,0.00094305456,0.9732736],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763703,0.00038975413,0.00014199036,0.00067292276,0.00081488484,0.0003433916],"domain_scores_gemma":[0.9966871,0.000390116,0.00015008489,0.0007342744,0.0013317915,0.00070666155],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020529728,0.0012531464,0.0014898919,0.0023893644,0.002308156,0.008013279,0.0024677657,0.0037202113,0.7464519],"category_scores_gemma":[0.0074407975,0.00065898284,0.0011876696,0.0020883686,0.001298583,0.0024482126,0.0049796253,0.0027850366,0.6574376],"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.00070948,0.00026921288,0.001463184,0.001109976,0.000084155065,0.0011143935,0.00031801144,0.0004893589,0.0056096045,0.028157486,0.62300634,0.33766878],"study_design_scores_gemma":[0.000031676034,0.00004888263,0.0004670093,0.00010881148,0.00000891943,0.00019191767,0.00007441417,0.00012919365,0.00095074065,0.0020455595,0.99593323,0.000009523341],"about_ca_topic_score_codex":0.0019503079,"about_ca_topic_score_gemma":0.0029402773,"teacher_disagreement_score":0.2535481,"about_ca_system_score_codex":0.0016118292,"about_ca_system_score_gemma":0.0029323979,"threshold_uncertainty_score":0.36165553},"labels":[],"label_agreement":null},{"id":"W2791987457","doi":"10.1016/j.applthermaleng.2018.03.037","title":"Sensitivity analysis of heat exchanger design to uncertainties of correlations","year":2018,"lang":"en","type":"article","venue":"Applied Thermal Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heat exchanger; Variance (accounting); Sensitivity (control systems); Variable (mathematics); Heat transfer coefficient; Mathematics; Heat transfer; Statistics; Thermodynamics; Engineering; Physics; Economics; Mathematical analysis","score_opus":0.014615545345146017,"score_gpt":0.23331913941720706,"score_spread":0.21870359407206102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791987457","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.4183081,0.00087333913,0.5725798,0.00052714115,0.00007223624,0.000106478634,0.00022966068,0.00022346877,0.0070796357],"genre_scores_gemma":[0.9933965,0.00009632369,0.0060060034,0.000020198686,0.000011903368,0.000025659321,0.00003652076,0.000019418998,0.00038731986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774504,0.0014227636,0.000052376075,0.00020631643,0.00040162247,0.000171891],"domain_scores_gemma":[0.979791,0.01867376,0.0005853662,0.0003780443,0.00045768608,0.00011406296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005554685,0.0009680483,0.0010011094,0.0011955405,0.0004143108,0.0011886859,0.0006634456,0.0012406063,0.001059153],"category_scores_gemma":[0.022532694,0.0008683048,0.0011210674,0.0009617273,0.0013158702,0.0013074335,0.0011500295,0.0010028052,0.00006839495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041633906,0.000009200281,0.00020948754,0.000015874966,0.000015394311,0.0000192679,0.0000065732265,0.99720484,0.00041433543,0.000975824,0.000032261258,0.0010552739],"study_design_scores_gemma":[0.000003260908,0.00001853073,0.00029575266,0.000002667513,0.000008423489,0.0000060381367,0.000004314953,0.9977976,0.00063819217,0.0011848703,0.00003502986,0.000005279747],"about_ca_topic_score_codex":0.0031673608,"about_ca_topic_score_gemma":0.0013679438,"teacher_disagreement_score":0.005554685,"about_ca_system_score_codex":0.0014069089,"about_ca_system_score_gemma":0.0008026356,"threshold_uncertainty_score":0.029376388},"labels":[],"label_agreement":null},{"id":"W2793283161","doi":"10.1016/j.asoc.2018.01.041","title":"SCGOSR: Surrogate-based constrained global optimization using space reduction","year":2018,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":75,"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 Natural Science Foundation of China","keywords":"Kriging; Mathematical optimization; Global optimization; Surrogate model; Computer science; Local optimum; Reduction (mathematics); Optimization problem; Local search (optimization); Constraint (computer-aided design); Constrained optimization; Penalty method; Algorithm; Mathematics; Machine learning","score_opus":0.016568139401737837,"score_gpt":0.2762662904990873,"score_spread":0.25969815109734945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793283161","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.002277547,0.00012980624,0.99393314,0.00007290823,0.000065851644,0.00003729627,0.000046624256,0.00062293303,0.002813954],"genre_scores_gemma":[0.13163996,0.00023852887,0.86085486,0.00024291144,0.00006324402,0.00035221755,0.00046404835,0.0009160823,0.005228194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00041532662,0.000027292479,0.000077961384,0.00041294543,0.000047957106],"domain_scores_gemma":[0.9992011,0.00036781147,0.000047349036,0.00015560533,0.00018633362,0.000041786698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015560344,0.0013535324,0.0018068873,0.0009921805,0.00048093955,0.0009682655,0.0014539224,0.0017544007,0.0047828425],"category_scores_gemma":[0.0031361086,0.00064582063,0.0012933619,0.001275568,0.0008794868,0.0010768987,0.0025339648,0.002187807,0.0015817808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014699844,0.00011930846,0.0002023549,0.00018951415,0.000100122794,0.0000837619,0.000057563662,0.86272913,0.005234403,0.027458947,0.0057634907,0.097914495],"study_design_scores_gemma":[0.000010649395,0.000023677874,0.000021487745,0.0000073403535,0.000003993741,0.000013123776,0.0000029848898,0.9944243,0.00055188045,0.0038360737,0.001100334,0.000004308945],"about_ca_topic_score_codex":0.0011802849,"about_ca_topic_score_gemma":0.001747128,"teacher_disagreement_score":0.0047828425,"about_ca_system_score_codex":0.00036857612,"about_ca_system_score_gemma":0.001030015,"threshold_uncertainty_score":0.01600027},"labels":[],"label_agreement":null},{"id":"W2793486732","doi":"10.5267/j.dsl.2017.11.001","title":"A many-objective Jaya algorithm for many-objective optimization problems","year":2018,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Sorting; Mathematical optimization; Traverse; Algorithm; Computer science; Selection (genetic algorithm); Multi-objective optimization; Measure (data warehouse); Tournament selection; Mathematics; Genetic algorithm; Data mining; Artificial intelligence","score_opus":0.01690443067706444,"score_gpt":0.2949201915517192,"score_spread":0.2780157608746548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793486732","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.0073767835,0.00043942532,0.98792434,0.00009240557,0.000060546055,0.00011552294,0.000036916557,0.0003270144,0.003626974],"genre_scores_gemma":[0.116231136,0.0004123389,0.8788846,0.00013013855,0.00004894785,0.0005685644,0.00018198702,0.00012669666,0.0034155603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.00019369242,0.00003325844,0.00007138013,0.00022070008,0.000036673046],"domain_scores_gemma":[0.99959785,0.000158233,0.00005046451,0.000044003715,0.0001218444,0.000027580398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073652,0.0009306574,0.00089231884,0.00092990225,0.00055796484,0.00087314006,0.0015351519,0.00096062187,0.0027338099],"category_scores_gemma":[0.0014848363,0.00036087172,0.0011602642,0.00095365074,0.00041671193,0.00070647796,0.0011659464,0.0012872986,0.0007227541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007236613,0.00012529385,0.0011595411,0.0002899812,0.00013831096,0.000102559745,0.00008353808,0.67866784,0.007235533,0.026065229,0.0025370242,0.28352278],"study_design_scores_gemma":[0.0000217215,0.00010289049,0.000249559,0.000023701557,0.000017367141,0.00008523668,0.000012892989,0.98807484,0.0015857997,0.0042187613,0.0055927634,0.000014503056],"about_ca_topic_score_codex":0.0012156472,"about_ca_topic_score_gemma":0.0017090077,"teacher_disagreement_score":0.0027338099,"about_ca_system_score_codex":0.00048788034,"about_ca_system_score_gemma":0.001284543,"threshold_uncertainty_score":0.009145439},"labels":[],"label_agreement":null},{"id":"W2793895061","doi":"10.1080/19475683.2018.1424736","title":"A comparison of three heuristic optimization algorithms for solving the multi-objective land allocation (MOLA) problem","year":2018,"lang":"en","type":"article","venue":"Annals of GIS","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Canada Foundation for Innovation","keywords":"Mathematical optimization; Simulated annealing; Particle swarm optimization; Computer science; Genetic algorithm; Optimization problem; Heuristic; Location-allocation; Penalty method; Algorithm; Mathematics","score_opus":0.10211118586663939,"score_gpt":0.3801868520672466,"score_spread":0.2780756662006072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793895061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09827343,0.0039631394,0.8799833,0.00043545978,0.00017960422,0.00023027664,0.00013943999,0.00083675917,0.015958602],"genre_scores_gemma":[0.43972617,0.0018018293,0.55584586,0.0001531108,0.00004190337,0.00032829057,0.0002614888,0.00014789708,0.0016935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.00036481148,0.000059525613,0.000086169806,0.00027351794,0.000084120395],"domain_scores_gemma":[0.99839133,0.0010602803,0.00012282061,0.00010376814,0.00026766353,0.000054119228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016917612,0.0012190052,0.0013125419,0.0015281329,0.00069648214,0.0012001084,0.0012430139,0.0017372543,0.00156372],"category_scores_gemma":[0.0037074923,0.00043613501,0.0012435041,0.0015881804,0.00043552945,0.0010570096,0.0006056755,0.0009151367,0.00026332267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023070442,0.00018807777,0.0016243691,0.00033123067,0.00016455876,0.00005926636,0.00008370044,0.81294566,0.0016854786,0.006871626,0.0010979732,0.17471735],"study_design_scores_gemma":[0.00004178676,0.00012870798,0.0005432275,0.000027510087,0.00004333718,0.000045722663,0.00004205943,0.9949314,0.0011361864,0.0015710812,0.0014753272,0.000013703658],"about_ca_topic_score_codex":0.004887045,"about_ca_topic_score_gemma":0.004553934,"teacher_disagreement_score":0.004887045,"about_ca_system_score_codex":0.00087721786,"about_ca_system_score_gemma":0.0015128987,"threshold_uncertainty_score":0.009717226},"labels":[],"label_agreement":null},{"id":"W2800275207","doi":"10.4018/978-1-5225-2255-3.ch189","title":"A Nature-Inspired Metaheuristic Approach for Generating Alternatives","year":2017,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Advanced Multi-Objective Optimization Algorithms","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; Firefly algorithm; Mathematical optimization; Metaheuristic; Artificial intelligence; Mathematics; Machine learning","score_opus":0.02727722670554076,"score_gpt":0.29583463326119436,"score_spread":0.2685574065556536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800275207","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.004317903,0.0006674035,0.9839192,0.00035561534,0.000055387318,0.00010486897,0.00005021065,0.0001093903,0.010419955],"genre_scores_gemma":[0.082471974,0.0007645367,0.9120116,0.00019283121,0.000039880462,0.000365937,0.000090577836,0.000059204736,0.004003506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933535,0.00032953426,0.000023609771,0.000072171184,0.00020794531,0.000031315412],"domain_scores_gemma":[0.9994955,0.00035090753,0.00004691161,0.000048162743,0.000041365965,0.000017121165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012772828,0.0010725545,0.00068542437,0.0014916934,0.00057411875,0.001460034,0.0018605243,0.0015737136,0.003200461],"category_scores_gemma":[0.0020109066,0.0005619245,0.0013067586,0.0020271568,0.0014444531,0.0011343943,0.0012139769,0.002225026,0.00049562525],"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.000041688178,0.00008868755,0.00029664426,0.00025573664,0.00011042819,0.000113695634,0.00016946415,0.6247035,0.0035004162,0.2576628,0.0030063132,0.11005056],"study_design_scores_gemma":[0.000025294958,0.00005171448,0.00007346612,0.00006910315,0.000022485552,0.00007974429,0.000028353817,0.9174033,0.0012011697,0.072337076,0.008693265,0.000015124345],"about_ca_topic_score_codex":0.0013031978,"about_ca_topic_score_gemma":0.002147879,"teacher_disagreement_score":0.003200461,"about_ca_system_score_codex":0.0013684547,"about_ca_system_score_gemma":0.0012158267,"threshold_uncertainty_score":0.010706663},"labels":[],"label_agreement":null},{"id":"W2800842922","doi":"10.1007/978-3-319-91641-5_25","title":"Robust Design with Surrogate-Assisted Evolutionary Algorithm: Does It Work?","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais","keywords":"Robustness (evolution); Computer science; Surrogate model; Evolutionary algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.028826136284710386,"score_gpt":0.24283001707534085,"score_spread":0.21400388079063046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800842922","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.0021381024,0.0018684037,0.989475,0.00062460057,0.00023104348,0.000014248647,0.000016106093,0.00023823646,0.00539421],"genre_scores_gemma":[0.18868051,0.004453441,0.7913908,0.0008824279,0.00043773465,0.00014614404,0.00018005345,0.00047021112,0.013358591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988726,0.00054247316,0.000054284963,0.00012632976,0.0003590617,0.00004529316],"domain_scores_gemma":[0.9986386,0.0006787341,0.000094713614,0.00023803598,0.00029771755,0.00005221282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025470948,0.00093947246,0.0022501638,0.00042300037,0.0002698373,0.0018105892,0.0014140307,0.0026334366,0.006291028],"category_scores_gemma":[0.007546166,0.0005886262,0.0011037393,0.0008256815,0.0008080459,0.0026103747,0.0011867778,0.0022955276,0.002552263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029166162,0.00015314292,0.0005822378,0.0006851284,0.00029740293,0.00012414528,0.000079351885,0.4776912,0.0051747416,0.09571301,0.00970048,0.40950754],"study_design_scores_gemma":[0.000029874944,0.00013659635,0.000099975965,0.000095280346,0.00003241936,0.0001168347,0.000015930053,0.9562811,0.00107427,0.03340222,0.008694964,0.000020567222],"about_ca_topic_score_codex":0.00031989912,"about_ca_topic_score_gemma":0.00029249754,"teacher_disagreement_score":0.006291028,"about_ca_system_score_codex":0.0002496035,"about_ca_system_score_gemma":0.00051028,"threshold_uncertainty_score":0.021045625},"labels":[],"label_agreement":null},{"id":"W2806266970","doi":"10.1115/1.4040485","title":"An Adaptive Aggregation-Based Approach for Expensively Constrained Black-Box Optimization Problems","year":2018,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"CMC Microsystems","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Adaptive sampling; Mathematics","score_opus":0.04697842901350394,"score_gpt":0.2853379376940037,"score_spread":0.23835950868049974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806266970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066442476,0.000053256063,0.99219996,0.000029202713,0.000009547494,0.000021152871,0.000009510109,0.00011395909,0.0009193187],"genre_scores_gemma":[0.43439636,0.00013797873,0.5627987,0.00011111873,0.000036704725,0.0002702059,0.00010539489,0.00012341116,0.0020200582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938464,0.00022571575,0.00003327403,0.00008137857,0.00023060813,0.000044297285],"domain_scores_gemma":[0.9991647,0.00045112474,0.000085392836,0.00009584216,0.00016951811,0.000033512402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012966847,0.00082740077,0.0008897823,0.0005386942,0.00038565343,0.00058677234,0.001012876,0.0006960247,0.0017385259],"category_scores_gemma":[0.001970437,0.000521348,0.00081281224,0.00051459053,0.0005325449,0.0006983435,0.0010805591,0.0010197826,0.00026823644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045711888,0.00003335638,0.0003519773,0.000052327832,0.00003640912,0.00004278521,0.000056237095,0.9456914,0.004936755,0.008066216,0.00038777923,0.040298935],"study_design_scores_gemma":[0.0000031170616,0.000013790566,0.000027060345,0.0000018225826,0.000002453503,0.000004264697,0.0000020291968,0.99848455,0.00040944765,0.00086146954,0.00018823665,0.0000016973955],"about_ca_topic_score_codex":0.0025684324,"about_ca_topic_score_gemma":0.0026035556,"teacher_disagreement_score":0.0025684324,"about_ca_system_score_codex":0.0003940396,"about_ca_system_score_gemma":0.0008683189,"threshold_uncertainty_score":0.006857574},"labels":[],"label_agreement":null},{"id":"W2807347316","doi":"10.1139/cjce-2017-0354","title":"Adaptive multi-objective traffic signal control using NLRMNSGA-II algorithm","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Sorting; Genetic algorithm; Algorithm; Computer science; Nonlinear system; Adaptive control; Mathematical optimization; Adaptive algorithm; SIGNAL (programming language); Control theory (sociology); Control (management); Mathematics; Artificial intelligence; Machine learning","score_opus":0.013822251970727287,"score_gpt":0.2219988137569557,"score_spread":0.20817656178622843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807347316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024337769,0.00023910575,0.9701862,0.00017125494,0.000056180696,0.00012395515,0.000040902,0.00039923028,0.004445371],"genre_scores_gemma":[0.7745504,0.00021769211,0.21849082,0.00026645654,0.000054514192,0.00084746396,0.00021062992,0.00009373774,0.0052684033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939024,0.00022183965,0.000026784537,0.0001245994,0.0001345097,0.000101933445],"domain_scores_gemma":[0.99935263,0.0003553683,0.000077900775,0.000024259958,0.0001553487,0.000034428045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012026614,0.0012641029,0.0013908175,0.0007476271,0.0005531576,0.0008643471,0.0016110889,0.0013953216,0.0023525928],"category_scores_gemma":[0.0019277398,0.0005659396,0.0008342683,0.00064520485,0.0006956901,0.00066302216,0.00091241463,0.0012945789,0.0003225841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017677667,0.000019305375,0.0001829574,0.000022482382,0.000018912539,0.000022059543,0.000019748471,0.990168,0.00028100502,0.0014196313,0.00026264935,0.00756564],"study_design_scores_gemma":[0.000011250751,0.000012167747,0.000037306203,0.0000023560713,0.0000033412164,0.0000028290413,0.0000028864408,0.9993376,0.00005796941,0.00041538753,0.00011455788,0.0000023140974],"about_ca_topic_score_codex":0.013803761,"about_ca_topic_score_gemma":0.009260866,"teacher_disagreement_score":0.013803761,"about_ca_system_score_codex":0.0009704359,"about_ca_system_score_gemma":0.0015770904,"threshold_uncertainty_score":0.027446806},"labels":[],"label_agreement":null},{"id":"W2808165282","doi":"10.1109/icdcs.2018.00031","title":"PEA: Parallel Evolutionary Algorithm by Separating Convergence and Diversity for Large-Scale Multi-Objective Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Alberta","funders":"","keywords":"Evolutionary algorithm; Computer science; Convergence (economics); Selection (genetic algorithm); Process (computing); Scale (ratio); Operator (biology); Evolutionary computation; Speedup; Mathematical optimization; Parallel algorithm; Algorithm; Machine learning; Mathematics; Parallel computing","score_opus":0.014315566916415367,"score_gpt":0.26900559377486916,"score_spread":0.25469002685845377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808165282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01539196,0.0003539435,0.98009896,0.00014157152,0.00005340813,0.00007299462,0.000026541913,0.0007064734,0.0031541602],"genre_scores_gemma":[0.4241644,0.00076368556,0.56968963,0.00019898535,0.00008852316,0.000492699,0.00021383587,0.00019253584,0.004195695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.000089410074,0.000020698286,0.00006695107,0.00013601863,0.000049308695],"domain_scores_gemma":[0.99961203,0.00017271415,0.000035510617,0.000060721293,0.00009377159,0.000025220043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000917622,0.0008944754,0.0009228926,0.0006884496,0.00058744807,0.00071012945,0.0013140424,0.0009351046,0.001833697],"category_scores_gemma":[0.0018540545,0.00033296342,0.0008370712,0.0010894814,0.0005350117,0.0012363136,0.0011687445,0.0010844361,0.0003288049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006705063,0.000078172656,0.0010861513,0.00009144026,0.00008454463,0.00011452182,0.00006484703,0.8566205,0.004602474,0.008908861,0.001685762,0.1265956],"study_design_scores_gemma":[0.0000263194,0.00003838181,0.00013395086,0.000004654555,0.000012495534,0.00003956217,0.000007676399,0.99481404,0.0007447277,0.0030209303,0.0011518393,0.0000054652332],"about_ca_topic_score_codex":0.0034637412,"about_ca_topic_score_gemma":0.0030925353,"teacher_disagreement_score":0.0034637412,"about_ca_system_score_codex":0.0004111383,"about_ca_system_score_gemma":0.0012790401,"threshold_uncertainty_score":0.0068871975},"labels":[],"label_agreement":null},{"id":"W2808305484","doi":"10.3233/jifs-169688","title":"A Kriging-based sequential optimization method with dual transformation for black-box models","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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 Ottawa","funders":"Natural Science Foundation of Heilongjiang Province","keywords":"Black box; Kriging; Transformation (genetics); Dual (grammatical number); Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Chemistry","score_opus":0.03366633057904297,"score_gpt":0.3109798941913449,"score_spread":0.27731356361230197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808305484","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.0018017653,0.00005653187,0.9970095,0.000027355205,0.000012013497,0.000019824673,0.000016793643,0.00017152024,0.00088468473],"genre_scores_gemma":[0.2527691,0.00041646595,0.7396941,0.000078715304,0.000034402838,0.0004625884,0.00024496176,0.000253485,0.006046169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00010576236,0.00001642443,0.00006980206,0.00014401703,0.000027926324],"domain_scores_gemma":[0.9997305,0.000112701106,0.000042446376,0.0000274945,0.00007060952,0.00001627107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626848,0.0010171919,0.0014924329,0.0005021069,0.00046796972,0.0008017313,0.001201017,0.0008646391,0.002807681],"category_scores_gemma":[0.00086837396,0.00071955594,0.0009309221,0.00073061825,0.0005830395,0.0008715048,0.0008085851,0.001318592,0.0008294916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344787,0.00002894984,0.00024897308,0.00010637003,0.00003190638,0.00003769906,0.000039723967,0.9483992,0.004159221,0.0070143733,0.0005357093,0.039363384],"study_design_scores_gemma":[0.000004074279,0.0000106214575,0.000020261965,0.000002091826,0.0000031611876,0.0000063512475,0.000001906132,0.99852055,0.00037090847,0.00054310827,0.0005133675,0.0000036344331],"about_ca_topic_score_codex":0.0062959073,"about_ca_topic_score_gemma":0.0062692007,"teacher_disagreement_score":0.0062959073,"about_ca_system_score_codex":0.0004919734,"about_ca_system_score_gemma":0.001915705,"threshold_uncertainty_score":0.012518525},"labels":[],"label_agreement":null},{"id":"W2808787830","doi":"10.1109/tcyb.2018.2842158","title":"Multidirectional Prediction Approach for Dynamic Multiobjective Optimization Problems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Multi-objective optimization; Particle swarm optimization; Mathematical optimization; Evolutionary algorithm; Population; Computer science; Set (abstract data type); Optimization problem; Pareto principle; Multi-swarm optimization; Mathematics","score_opus":0.015072468403118287,"score_gpt":0.25554914295242037,"score_spread":0.24047667454930208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808787830","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.011932587,0.00020967363,0.9855232,0.00013076133,0.000035065317,0.000038462167,0.000017798564,0.00015054684,0.0019618717],"genre_scores_gemma":[0.6794298,0.00044245267,0.31572336,0.00022713757,0.00007413684,0.00035330682,0.0001278168,0.00007902325,0.0035430174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.0001447702,0.00002631721,0.00007466693,0.00012015614,0.000039654326],"domain_scores_gemma":[0.9992194,0.0004553472,0.00008582059,0.00004996856,0.00015414345,0.000035356392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011890212,0.0010292816,0.0008553655,0.0005787845,0.00054638006,0.0007668966,0.0012484363,0.0009578701,0.0017429687],"category_scores_gemma":[0.002081853,0.00039457806,0.0006007153,0.00054293015,0.00044451217,0.00073990284,0.0008986536,0.0011766921,0.0002904138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014477841,0.000021490852,0.00041533666,0.000030703304,0.000017859478,0.000033515247,0.000034002966,0.97383595,0.00051398185,0.0028297931,0.0002966794,0.021956272],"study_design_scores_gemma":[0.0000013861539,0.000009044127,0.00003242136,0.0000022687818,0.000001923919,0.000004093337,0.0000033708106,0.99901044,0.00008465465,0.00070380606,0.00014513808,0.0000014091795],"about_ca_topic_score_codex":0.0050672484,"about_ca_topic_score_gemma":0.004248218,"teacher_disagreement_score":0.0050672484,"about_ca_system_score_codex":0.00047941535,"about_ca_system_score_gemma":0.0008213843,"threshold_uncertainty_score":0.01007551},"labels":[],"label_agreement":null},{"id":"W2809759906","doi":"10.1016/j.advengsoft.2018.06.001","title":"Multi-surrogate-based Differential Evolution with multi-start exploration (MDEME) for computationally expensive optimization","year":2018,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Kriging; Surrogate model; Mathematical optimization; Global optimization; Optimization problem; Computer science; Differential evolution; Meta-optimization; Radial basis function; Algorithm; Mathematics; Artificial intelligence; Artificial neural network; Machine learning","score_opus":0.01604897834074174,"score_gpt":0.2640538693778125,"score_spread":0.24800489103707077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809759906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009925312,0.0004654618,0.9839616,0.0001300867,0.000090723224,0.000047316862,0.000037571415,0.00025292506,0.0050890897],"genre_scores_gemma":[0.34441647,0.0003959942,0.6498605,0.00023170258,0.00005996617,0.00043243243,0.00019715757,0.00026185153,0.0041438555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00023177298,0.000022790531,0.000045736277,0.00018648399,0.000035970366],"domain_scores_gemma":[0.998801,0.0008236289,0.000072335475,0.000091876864,0.00015075876,0.000060378516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012331653,0.0007848458,0.0011000638,0.0008228524,0.00045526403,0.0006887367,0.0011330086,0.0016314128,0.002959743],"category_scores_gemma":[0.003639165,0.0005692339,0.00091366254,0.00082406186,0.0006205622,0.00078408595,0.0018709484,0.001841573,0.00048542643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007010004,0.0000636897,0.00025375592,0.00010496852,0.000036632213,0.000051684932,0.000052123996,0.9483624,0.0017274485,0.014498607,0.00082570675,0.03395293],"study_design_scores_gemma":[0.0000047877293,0.000016136306,0.00002133603,0.0000069984744,0.0000024545386,0.00000782417,0.0000020133068,0.99776745,0.00021705026,0.0015112862,0.00044037602,0.0000023750601],"about_ca_topic_score_codex":0.0013513204,"about_ca_topic_score_gemma":0.0015916547,"teacher_disagreement_score":0.002959743,"about_ca_system_score_codex":0.0005289186,"about_ca_system_score_gemma":0.00083485834,"threshold_uncertainty_score":0.009901285},"labels":[],"label_agreement":null},{"id":"W2810313902","doi":"10.2514/6.2018-2931","title":"A Relative Adequacy Framework for Multimodel Management in Multidisciplinary Design Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Multidisciplinary approach; Computer science; Multidisciplinary design optimization; Systems engineering; Engineering","score_opus":0.043438364299642346,"score_gpt":0.3353358526690527,"score_spread":0.2918974883694103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810313902","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.0015975283,0.000067875226,0.9976254,0.000059015583,0.0000065996087,0.000018643701,0.000013782131,0.000046136385,0.0005649369],"genre_scores_gemma":[0.29773363,0.00030854341,0.69933444,0.00014728747,0.00009506022,0.00039535778,0.00017314071,0.0002108084,0.001601678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561465,0.0025851466,0.00019470183,0.0003639886,0.0010815308,0.00016011948],"domain_scores_gemma":[0.99404836,0.0036666978,0.00048336596,0.000807984,0.00082431576,0.00016932469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008835041,0.0012955342,0.0014762761,0.0019616513,0.001041772,0.0016621912,0.0027516559,0.0012854212,0.0028283952],"category_scores_gemma":[0.014763322,0.0007349622,0.0017782791,0.0012922296,0.001987514,0.003471075,0.003634073,0.0026005644,0.0004291645],"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.000031685813,0.00004622242,0.00070415845,0.00015353863,0.000066426925,0.00007742467,0.00016614326,0.74031216,0.0012101085,0.2170878,0.0006969693,0.039447375],"study_design_scores_gemma":[0.000005174279,0.000024621531,0.00007016029,0.000020823949,0.000010742799,0.000014970732,0.000020675654,0.9391746,0.00042347796,0.058893953,0.0013315551,0.0000092437895],"about_ca_topic_score_codex":0.0035669126,"about_ca_topic_score_gemma":0.0032963085,"teacher_disagreement_score":0.008835041,"about_ca_system_score_codex":0.0012388044,"about_ca_system_score_gemma":0.0019658932,"threshold_uncertainty_score":0.046724737},"labels":[],"label_agreement":null},{"id":"W2832550360","doi":"10.1080/10095020.2018.1489576","title":"An improved knowledge-informed NSGA-II for multi-objective land allocation (MOLA)","year":2018,"lang":"en","type":"article","venue":"Geo-spatial Information Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Sorting; Multi-objective optimization; Computer science; Mathematical optimization; Context (archaeology); Pareto principle; Urban sprawl; Compromise; Grid; Operations research; Land use; Geography; Mathematics; Engineering; Algorithm; Civil engineering; Law","score_opus":0.024535211872120988,"score_gpt":0.33641209484612533,"score_spread":0.31187688297400434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2832550360","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.043634664,0.00021820914,0.94707274,0.00020991453,0.00005335281,0.00013413471,0.00015158848,0.00036929053,0.00815607],"genre_scores_gemma":[0.65949285,0.00025563262,0.33403155,0.00024838038,0.000032244232,0.00048500233,0.0004885881,0.000065074855,0.0049006166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995028,0.00016536331,0.00002523752,0.000077849945,0.00016914505,0.000059540216],"domain_scores_gemma":[0.99960536,0.00016607871,0.000046658242,0.00003979827,0.000118212476,0.000023837356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007499605,0.00085802574,0.00078802404,0.0006504122,0.00039096057,0.00075883203,0.0012976798,0.0010782912,0.001828795],"category_scores_gemma":[0.0016632194,0.00038633106,0.00079681916,0.0006232169,0.00046231574,0.0006881308,0.0007987406,0.00085464,0.0002855999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016433492,0.000018381588,0.00026005233,0.0000301608,0.000017905626,0.0000249874,0.000027301385,0.9789619,0.0008528731,0.002433584,0.0004115114,0.016944842],"study_design_scores_gemma":[0.000012162938,0.000023903778,0.00016536778,0.000008307022,0.00000890718,0.000012812243,0.000008668511,0.9971438,0.00047563642,0.0012828198,0.00085201644,0.0000056148656],"about_ca_topic_score_codex":0.009922585,"about_ca_topic_score_gemma":0.009152824,"teacher_disagreement_score":0.009922585,"about_ca_system_score_codex":0.0009321234,"about_ca_system_score_gemma":0.00214416,"threshold_uncertainty_score":0.019729674},"labels":[],"label_agreement":null},{"id":"W2860358344","doi":"10.1162/evco_a_00301","title":"Evolving Multimodal Robot Behavior via Many Stepping Stones with the Combinatorial Multiobjective Evolutionary Algorithm","year":2021,"lang":"en","type":"preprint","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"National Science Foundation","keywords":"Leverage (statistics); Artificial intelligence; Evolutionary robotics; Robotics; Computer science; Reinforcement learning; Evolutionary algorithm; Task (project management); Selection (genetic algorithm); Machine learning; Process (computing); Robot; Mathematical optimization; Mathematics","score_opus":0.010928380496214942,"score_gpt":0.2596300563978829,"score_spread":0.24870167590166795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2860358344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05799733,0.00025896236,0.9365528,0.0002254206,0.00003936907,0.00008805527,0.000023996574,0.00023692375,0.0045771454],"genre_scores_gemma":[0.555726,0.00022627851,0.44038975,0.00017964799,0.000025570445,0.0004831807,0.00007935884,0.00008747833,0.0028028165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965894,0.00016672908,0.000016023654,0.00004723968,0.00007820056,0.000032918782],"domain_scores_gemma":[0.9994325,0.00035467147,0.000054164146,0.00004892142,0.00006705265,0.000042635158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512302,0.0008981062,0.00086450647,0.0006807947,0.0003835109,0.0007243856,0.0010017338,0.0009491429,0.0014190787],"category_scores_gemma":[0.0021582688,0.00039905022,0.0008038312,0.00045974329,0.0008699122,0.00061897706,0.0009958873,0.00082750217,0.00018689301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147041,0.000021758713,0.00030102272,0.000020805479,0.000027252006,0.000037932998,0.000027061575,0.9798957,0.0010105174,0.0071926713,0.00017864574,0.011273518],"study_design_scores_gemma":[0.000006900445,0.0000143234665,0.000045559667,0.0000030368633,0.000003825736,0.0000067165465,0.000004463904,0.9971734,0.00013515963,0.0024104244,0.0001936632,0.000002583273],"about_ca_topic_score_codex":0.0021166408,"about_ca_topic_score_gemma":0.001859338,"teacher_disagreement_score":0.0021166408,"about_ca_system_score_codex":0.00062592956,"about_ca_system_score_gemma":0.0007911285,"threshold_uncertainty_score":0.005559504},"labels":[],"label_agreement":null},{"id":"W2888663540","doi":"10.1007/978-3-319-99253-2_2","title":"Design of a Surrogate Model Assisted (1 + 1)-ES","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":9,"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; Surrogate model; Context (archaeology); Adaptation (eye); Machine learning; Function (biology); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.03626305347064781,"score_gpt":0.27298382236821955,"score_spread":0.23672076889757174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888663540","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.009851324,0.00011722513,0.98064166,0.00011529507,0.000071451315,0.000062734005,0.000057876885,0.00035668872,0.008725738],"genre_scores_gemma":[0.5817172,0.00022735799,0.40303248,0.0002049674,0.00006628912,0.00040902902,0.00028473898,0.00014884843,0.013909105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994728,0.00016840812,0.000022135846,0.00010488116,0.00017351832,0.00005834566],"domain_scores_gemma":[0.9996269,0.00012586157,0.000042864693,0.000052446994,0.00011793396,0.00003391937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157413,0.0007495225,0.0010496541,0.0004189147,0.00036962223,0.001166858,0.001000128,0.0018561771,0.00597365],"category_scores_gemma":[0.001334455,0.0003648771,0.0007673461,0.00045183834,0.0004316523,0.00067945296,0.0013432468,0.00081518537,0.001567664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022566618,0.00011134165,0.00040352033,0.00018535674,0.000048028593,0.00016188841,0.000052093692,0.8645586,0.023850601,0.021693105,0.0022005246,0.08650927],"study_design_scores_gemma":[0.000010911553,0.00012213143,0.00006334753,0.000008884076,0.000007025162,0.000045576326,0.0000069208263,0.99400455,0.0021888628,0.0018838538,0.0016517552,0.0000061104156],"about_ca_topic_score_codex":0.000343336,"about_ca_topic_score_gemma":0.00032989786,"teacher_disagreement_score":0.00597365,"about_ca_system_score_codex":0.00030578126,"about_ca_system_score_gemma":0.000654458,"threshold_uncertainty_score":0.019983828},"labels":[],"label_agreement":null},{"id":"W2889272453","doi":"10.1039/c8sc02239a","title":"Chimera: enabling hierarchy based multi-objective optimization for self-driving laboratories","year":2018,"lang":"en","type":"article","venue":"Chemical Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Tata Sons; FAS Division of Science, Harvard University; Harvard University","keywords":"Chimera (genetics); Computer science; Interpretability; A priori and a posteriori; Multi-objective optimization; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.013391263366100775,"score_gpt":0.2846620514620578,"score_spread":0.27127078809595706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889272453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008386146,0.00013485207,0.9865182,0.000091874266,0.000035880927,0.00006394771,0.00008032314,0.0015631454,0.0031256543],"genre_scores_gemma":[0.20990717,0.00015267199,0.7866883,0.00013371951,0.000026119895,0.00043729186,0.00025752233,0.0005648576,0.0018323321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996123,0.00015126432,0.000014939164,0.000056199817,0.00012669622,0.000038710867],"domain_scores_gemma":[0.9991762,0.00045129107,0.000074564974,0.00010681611,0.000101038335,0.000090072994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013162612,0.0010853151,0.0008034797,0.00046446646,0.00054331427,0.00092249125,0.0015735308,0.0011734354,0.00448588],"category_scores_gemma":[0.0022937285,0.000516446,0.00090415124,0.00038281598,0.00071608945,0.0007506651,0.0020518533,0.0021204462,0.0009043632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006587995,0.00006959351,0.00033933815,0.00014771198,0.000056257963,0.0000551863,0.00006953672,0.9373204,0.0076436545,0.016896158,0.001643995,0.035692293],"study_design_scores_gemma":[0.000009720594,0.000022330825,0.000028991702,0.0000059235335,0.0000029402977,0.000006423897,0.000005592373,0.9949287,0.00084390305,0.0029143032,0.00122566,0.0000054529933],"about_ca_topic_score_codex":0.00382927,"about_ca_topic_score_gemma":0.004591801,"teacher_disagreement_score":0.00448588,"about_ca_system_score_codex":0.0009264762,"about_ca_system_score_gemma":0.0019836759,"threshold_uncertainty_score":0.015006721},"labels":[],"label_agreement":null},{"id":"W2894147786","doi":"10.1111/anzs.12247","title":"On the existence and constructions of orthogonal designs","year":2018,"lang":"en","type":"article","venue":"Australian & New Zealand Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal array; Latin hypercube sampling; Mathematics; Hypercube; Computer experiment; Class (philosophy); Orthogonal transformation; Compiler; Orthogonal basis; Empirical orthogonal functions; Algorithm; Combinatorics; Computer science; Statistics; Artificial intelligence; Programming language; Monte Carlo method","score_opus":0.04215345534616777,"score_gpt":0.2938439509565809,"score_spread":0.2516904956104131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894147786","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.012633237,0.00044055405,0.97994655,0.00022475219,0.00007353275,0.00017822874,0.00013298626,0.00014488789,0.006225352],"genre_scores_gemma":[0.17776735,0.0009036312,0.8143199,0.00041761715,0.00017584927,0.0024162831,0.00039753935,0.00026843135,0.003333396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95124465,0.037202884,0.0021344225,0.003329598,0.0049444744,0.0011439186],"domain_scores_gemma":[0.83536536,0.13054463,0.008796787,0.015489441,0.008582691,0.0012210706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.041817784,0.0012780111,0.0018466997,0.002706645,0.0013370686,0.0019706273,0.0014565117,0.0012160399,0.008102214],"category_scores_gemma":[0.12705404,0.0015187763,0.0022163033,0.0020003086,0.0050613233,0.0036025296,0.0044539217,0.0030071866,0.0014105311],"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.0005738866,0.00012552027,0.002018551,0.0005455062,0.00012643852,0.00008845952,0.00042744176,0.02858443,0.003631753,0.82803386,0.0018844116,0.13395977],"study_design_scores_gemma":[0.00027932262,0.0010832641,0.0016160952,0.0004424494,0.000101490084,0.0002756091,0.00020142256,0.095051244,0.006148686,0.8751798,0.019516522,0.000104111],"about_ca_topic_score_codex":0.00041476326,"about_ca_topic_score_gemma":0.0003278427,"teacher_disagreement_score":0.041817784,"about_ca_system_score_codex":0.0012901248,"about_ca_system_score_gemma":0.0025990496,"threshold_uncertainty_score":0.22115624},"labels":[],"label_agreement":null},{"id":"W2895404167","doi":"10.1007/978-981-13-1610-4_1","title":"Optimization of Constrained Engineering Design Problems Using Cohort Intelligence Method","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Advanced Multi-Objective Optimization Algorithms","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 Windsor","funders":"","keywords":"Simulated annealing; Particle swarm optimization; Swarm intelligence; Mathematical optimization; Computer science; Robustness (evolution); Evolutionary algorithm; Standard deviation; Engineering optimization; Optimization problem; Computational intelligence; Constraint (computer-aided design); Metaheuristic; Artificial intelligence; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.03241023265900115,"score_gpt":0.29385694691647796,"score_spread":0.2614467142574768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895404167","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.0018341375,0.00032999425,0.9934227,0.000068108035,0.000046700676,0.000028972427,0.000030475254,0.000049374554,0.0041896547],"genre_scores_gemma":[0.26919603,0.0017711751,0.7095307,0.00027276078,0.00027544473,0.00087301515,0.0004561937,0.00030557477,0.017319098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918705,0.00038108692,0.00003888009,0.00010345021,0.00023678002,0.000052773896],"domain_scores_gemma":[0.9982907,0.0012471505,0.00010335534,0.00010674129,0.00019683722,0.00005529797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021936158,0.0012876188,0.0019755512,0.0011103326,0.0005202963,0.0017181861,0.0014481209,0.0014037318,0.004481272],"category_scores_gemma":[0.00449636,0.0006405227,0.0017676306,0.0015446732,0.0009857073,0.0010210051,0.002186528,0.0019390003,0.0007925704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002434516,0.000044672295,0.00022966166,0.0001706865,0.00008117793,0.000045213405,0.00004205171,0.87367916,0.0007992713,0.075747535,0.0021113604,0.04702492],"study_design_scores_gemma":[0.000004084274,0.000015497952,0.000038767626,0.000011368979,0.00000638566,0.000007212394,0.000003935179,0.9835887,0.0001306121,0.015169105,0.0010200613,0.0000043460454],"about_ca_topic_score_codex":0.0022232663,"about_ca_topic_score_gemma":0.0017075002,"teacher_disagreement_score":0.004481272,"about_ca_system_score_codex":0.0008074521,"about_ca_system_score_gemma":0.0010958351,"threshold_uncertainty_score":0.014991403},"labels":[],"label_agreement":null},{"id":"W2898550336","doi":"10.1109/nemo.2018.8503121","title":"Multi-Objective Design of Compact Microwave Components with Data-Driven Surrogates and Pareto Front Decomposition","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"Narodowym Centrum Nauki","keywords":"Multi-objective optimization; Pareto principle; Kriging; Computer science; Mathematical optimization; Set (abstract data type); Volume (thermodynamics); Data set; Pareto analysis; Algorithm; Mathematics; Machine learning; Artificial intelligence","score_opus":0.0488784994277955,"score_gpt":0.30441028926718583,"score_spread":0.25553178983939034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898550336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013713491,0.00007312372,0.98442197,0.000047623096,0.000009572765,0.000028863693,0.000022555341,0.000079291145,0.0016035034],"genre_scores_gemma":[0.49563935,0.00022845711,0.5004353,0.00006249126,0.000015838314,0.00042007834,0.00016705961,0.00011338281,0.0029180916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.0001585342,0.0000147051105,0.00002936993,0.00014847472,0.0000302235],"domain_scores_gemma":[0.9994351,0.00032919558,0.000056223686,0.000060037193,0.00009669836,0.000022664424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013380228,0.0008297256,0.00078935357,0.0005531334,0.00024718855,0.0007708777,0.0006892456,0.0009295049,0.0011299971],"category_scores_gemma":[0.0018934555,0.00057269365,0.00088136934,0.0005295557,0.00061593455,0.00060306187,0.00092107424,0.0009188456,0.00024804744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010391699,0.000011197724,0.00006792505,0.000018137434,0.0000067663427,0.000009058194,0.000008830413,0.992916,0.0010205801,0.00206159,0.000046318917,0.0038233034],"study_design_scores_gemma":[0.0000026873906,0.000012433376,0.000019196072,0.0000026708956,0.000001209898,0.000002658641,0.0000022731458,0.9985008,0.00056736777,0.00072412763,0.0001628366,0.0000017298195],"about_ca_topic_score_codex":0.0009029571,"about_ca_topic_score_gemma":0.00086187123,"teacher_disagreement_score":0.0013380228,"about_ca_system_score_codex":0.0004926327,"about_ca_system_score_gemma":0.0007465008,"threshold_uncertainty_score":0.007076204},"labels":[],"label_agreement":null},{"id":"W2898957569","doi":"10.1115/detc2018-85379","title":"Advanced Primal-Dual Interior-Point Method for the Method of Moving Asymptotes","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; General Motors of Canada","keywords":"Asymptote; Topology optimization; Mathematical optimization; Dual (grammatical number); Point (geometry); Computer science; Interior point method; Topology (electrical circuits); Optimization problem; Convergence (economics); Mathematics; Finite element method; Engineering","score_opus":0.018881176060303997,"score_gpt":0.34420913700444733,"score_spread":0.32532796094414335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898957569","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.00052549667,0.00016269436,0.9975829,0.00003894077,0.000038870978,0.000015203916,0.0000089350915,0.000053100997,0.0015738673],"genre_scores_gemma":[0.07602024,0.0006813981,0.9181724,0.00011324945,0.00011100956,0.0003738619,0.00008678956,0.0002023628,0.0042385384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.0004127665,0.000034868735,0.00008807277,0.00028505333,0.00004682106],"domain_scores_gemma":[0.9992079,0.00041983929,0.00006225499,0.00005967771,0.0002008156,0.000049447717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019821557,0.001106965,0.0013548958,0.00085409044,0.00059936364,0.0010656158,0.0013959622,0.0012851824,0.0055176145],"category_scores_gemma":[0.0029679055,0.00042792017,0.001283025,0.0009848623,0.0010961242,0.0010347329,0.0014446554,0.0033042873,0.0017044126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083967716,0.00009413495,0.00040179933,0.00040978307,0.000072291565,0.00019541036,0.00015459191,0.5956601,0.008740076,0.27195448,0.004714881,0.117518365],"study_design_scores_gemma":[0.0000102381855,0.000022267637,0.000035779245,0.00002038117,0.0000071512986,0.000054769684,0.000007414788,0.97700787,0.00093042204,0.017541567,0.0043513803,0.0000107420165],"about_ca_topic_score_codex":0.001194845,"about_ca_topic_score_gemma":0.0010064058,"teacher_disagreement_score":0.0055176145,"about_ca_system_score_codex":0.0006219311,"about_ca_system_score_gemma":0.0013762396,"threshold_uncertainty_score":0.018458247},"labels":[],"label_agreement":null},{"id":"W2899199563","doi":"10.1155/2018/8465020","title":"CFD-Based Optimization of Fluid Flow Product Aided by Artificial Intelligence and Design Space Validation","year":2018,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Alberta","funders":"University of Alberta","keywords":"Solver; Computational fluid dynamics; Computer science; Metamodeling; MATLAB; Python (programming language); Engineering design process; Control engineering; Mathematical optimization; Engineering; Mechanical engineering; Mathematics; Aerospace engineering","score_opus":0.02729831506858458,"score_gpt":0.2484841063735433,"score_spread":0.22118579130495872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899199563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027897539,0.000117697884,0.9654799,0.00006607468,0.000029397937,0.000065958775,0.0000770573,0.0007553601,0.0055109654],"genre_scores_gemma":[0.57309234,0.00016599966,0.42240706,0.000049358237,0.000014698644,0.00037679862,0.00027811222,0.00025173073,0.003363934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966705,0.000108944994,0.000018585646,0.000037698817,0.00014003925,0.000027710283],"domain_scores_gemma":[0.99942696,0.00028468602,0.00005636157,0.00006885198,0.00014821281,0.000015010034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010486066,0.0006482343,0.00074678904,0.00062951434,0.00044135243,0.0007354852,0.00057353027,0.00074334966,0.0022397905],"category_scores_gemma":[0.0016321533,0.00036231466,0.00068455975,0.00045857226,0.0005218999,0.0004065264,0.000588302,0.00054864684,0.00039914594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029064537,0.00001936727,0.0003026954,0.0000506336,0.000009998875,0.000020833524,0.000020888114,0.97618574,0.0031377536,0.0028944102,0.00022574358,0.017102798],"study_design_scores_gemma":[0.0000028746058,0.000009248023,0.00006458097,0.0000031157012,0.0000016784418,0.000004208205,0.0000022270037,0.9979298,0.0011173837,0.00040505844,0.000457653,0.000002076546],"about_ca_topic_score_codex":0.0026152572,"about_ca_topic_score_gemma":0.0017774532,"teacher_disagreement_score":0.0026152572,"about_ca_system_score_codex":0.00061025866,"about_ca_system_score_gemma":0.0012366816,"threshold_uncertainty_score":0.0074928403},"labels":[],"label_agreement":null},{"id":"W2900393606","doi":"","title":"Locally weighted regression models for surrogate-assisted design optimization","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; Metric (unit); Surrogate model; Optimization problem; Smoothing; Computer science; Mathematics; Smoothness; Statistics; Engineering","score_opus":0.020558377825519426,"score_gpt":0.25144888877840144,"score_spread":0.23089051095288202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900393606","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.0020161187,0.00007219058,0.9970714,0.000048234528,0.000009652713,0.000014254619,0.000013287196,0.000096458614,0.00065831334],"genre_scores_gemma":[0.33129942,0.00060065876,0.65951574,0.00020256318,0.00007502898,0.0005372273,0.0002480945,0.00035687466,0.0071643493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986665,0.0007956286,0.00004429535,0.00012063782,0.00032169715,0.00005124521],"domain_scores_gemma":[0.99731356,0.0016991467,0.0002743576,0.00030401332,0.00034504986,0.00006388932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674729,0.0012894695,0.0012556626,0.00090567564,0.0003039878,0.0011033944,0.0013389501,0.0013997636,0.0026759238],"category_scores_gemma":[0.006874252,0.0005485344,0.0011644607,0.00095136283,0.00094526366,0.0011508524,0.001175495,0.0016494801,0.0009864231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018357112,0.000021964175,0.0002001501,0.000047403184,0.000021651758,0.000022889106,0.000022384716,0.9700233,0.0013249416,0.015779452,0.00032604643,0.012191433],"study_design_scores_gemma":[0.0000016643376,0.000012882677,0.000015690357,0.0000036817978,0.0000019173042,0.0000043857863,0.0000018809519,0.99608094,0.00029373792,0.0032162115,0.00036459274,0.0000024713706],"about_ca_topic_score_codex":0.0012225057,"about_ca_topic_score_gemma":0.0012635081,"teacher_disagreement_score":0.0026759238,"about_ca_system_score_codex":0.00063782645,"about_ca_system_score_gemma":0.00077975466,"threshold_uncertainty_score":0.0141454935},"labels":[],"label_agreement":null},{"id":"W2903221689","doi":"","title":"Review of measures of the quality of approximated Pareto fronts in multiobjective optimization","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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; HEC Montréal","funders":"","keywords":"Pareto principle; Multi-objective optimization; Mathematical optimization; Computer science; Quality (philosophy); Pareto analysis; Pareto optimal; Mathematics; Physics","score_opus":0.03290294344312134,"score_gpt":0.2891658533052156,"score_spread":0.25626290986209427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903221689","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.0018407386,0.8903812,0.10184158,0.00072900165,0.00061217666,0.000041836516,0.00020748544,0.00006726078,0.00427879],"genre_scores_gemma":[0.055128496,0.8434488,0.096296966,0.0005101575,0.001664045,0.00015738067,0.00067588274,0.000110908986,0.002007347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960748,0.0010842828,0.00055802806,0.00065419363,0.0015177956,0.00011093887],"domain_scores_gemma":[0.9853065,0.009362003,0.00076705264,0.00063088146,0.003802638,0.00013094957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054143853,0.0014028765,0.0024785826,0.0050919782,0.00043948545,0.0035066865,0.0025749234,0.0015822343,0.00224156],"category_scores_gemma":[0.02376942,0.0008192955,0.0011370357,0.009048715,0.0013536189,0.003461752,0.0010654969,0.0019384699,0.0010224344],"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.00011862152,0.000058652004,0.000747029,0.015587539,0.00031973078,0.0000744315,0.00010241634,0.024311464,0.0015258158,0.05461725,0.01070381,0.8918333],"study_design_scores_gemma":[0.00008206392,0.0007107771,0.0083258115,0.029239103,0.001169061,0.002138632,0.00060299266,0.13596912,0.008359686,0.16962552,0.6433481,0.00042924666],"about_ca_topic_score_codex":0.0020002078,"about_ca_topic_score_gemma":0.0018954572,"teacher_disagreement_score":0.0054143853,"about_ca_system_score_codex":0.0018936476,"about_ca_system_score_gemma":0.0016148085,"threshold_uncertainty_score":0.02863431},"labels":[],"label_agreement":null},{"id":"W2904647428","doi":"10.1016/j.apm.2018.12.011","title":"A time-space Kriging-based sequential metamodeling approach for multi-objective crashworthiness optimization","year":2018,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Beijing Science and Technology Planning Project; Beijing Institute of Technology Research Fund Program for Young Scholars; National Natural Science Foundation of China","keywords":"Crashworthiness; Metamodeling; Kriging; Crash; Domain (mathematical analysis); Mathematical optimization; Computer science; Optimization problem; Design of experiments; Engineering; Algorithm; Mathematics; Machine learning","score_opus":0.04877985823875721,"score_gpt":0.29175173540359756,"score_spread":0.24297187716484034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904647428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011717221,0.00007546608,0.9870467,0.000041891144,0.000016044365,0.000030029269,0.00006341241,0.0002875905,0.00072156626],"genre_scores_gemma":[0.5559874,0.00024680636,0.44063085,0.000058766207,0.000031315056,0.00028089233,0.00035062435,0.00017845324,0.002234901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976593,0.000069509995,0.000015853748,0.000048626,0.00007414954,0.000026007698],"domain_scores_gemma":[0.99955374,0.00020603431,0.00006252291,0.000043829474,0.00010955681,0.00002437073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056432636,0.0008906896,0.0013070618,0.00054519554,0.0004849281,0.0005124899,0.0011998849,0.0008668809,0.0018431742],"category_scores_gemma":[0.001302168,0.0007916707,0.0010384545,0.00083738874,0.00035346657,0.0007707837,0.00069054967,0.0010577595,0.00035942762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016497652,0.000020651942,0.00014778045,0.000026104457,0.00001868855,0.000012256764,0.000014169554,0.98607546,0.0013225665,0.00081712345,0.000092751296,0.011436007],"study_design_scores_gemma":[0.0000027328706,0.000011720255,0.000044595447,0.000001189931,0.0000038778926,0.0000023946434,0.000001885507,0.9992772,0.00018333564,0.0003548601,0.00011374279,0.000002551507],"about_ca_topic_score_codex":0.024303762,"about_ca_topic_score_gemma":0.027038867,"teacher_disagreement_score":0.024303762,"about_ca_system_score_codex":0.00056769815,"about_ca_system_score_gemma":0.0019329028,"threshold_uncertainty_score":0.048324585},"labels":[],"label_agreement":null},{"id":"W2905319669","doi":"10.1002/pamm.201800273","title":"Pareto Front Interpolation Based on Parametric Sensitivity Analysis in a Bi‐Objective Setting","year":2018,"lang":"en","type":"article","venue":"PAMM","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Berger (Canada)","funders":"","keywords":"Interpolation (computer graphics); Parametric statistics; Sensitivity (control systems); Multi-objective optimization; Mathematical optimization; Pareto principle; Mathematics; Front (military); Exploit; Pareto optimal; Polynomial; Applied mathematics; Algorithm; Computer science; Statistics; Engineering; Mathematical analysis; Artificial intelligence; Electronic engineering","score_opus":0.010444534878331047,"score_gpt":0.27203669594645496,"score_spread":0.26159216106812394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905319669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020606175,0.00007987005,0.977679,0.000036209978,0.000010651026,0.000039876893,0.000023579369,0.00010980321,0.0014148909],"genre_scores_gemma":[0.6212225,0.00016163547,0.3768654,0.000044443063,0.00001713083,0.00017865296,0.00010401156,0.00007984111,0.0013263719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847275,0.0006515486,0.00005318604,0.0001299466,0.00059096,0.00010152316],"domain_scores_gemma":[0.997241,0.001981628,0.0001527232,0.0002642779,0.00030879723,0.000051494284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041047954,0.0008305348,0.00096433493,0.0014836955,0.0003347662,0.0008551662,0.0009283804,0.0007564808,0.0014144502],"category_scores_gemma":[0.0069137313,0.00041145153,0.0010879469,0.0011718683,0.0008456051,0.00089054834,0.0013355414,0.0014475486,0.00023126708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083461404,0.0000337591,0.00026515633,0.000060001355,0.000028194925,0.000034258763,0.00004153688,0.96331847,0.004134903,0.009680464,0.00010453221,0.022215277],"study_design_scores_gemma":[0.000002792672,0.00001983517,0.000076734934,0.0000049493956,0.0000027264452,0.000006866203,0.0000025350764,0.9971161,0.00077264383,0.0018604876,0.00013010191,0.0000041912576],"about_ca_topic_score_codex":0.0021051543,"about_ca_topic_score_gemma":0.00092501246,"teacher_disagreement_score":0.0041047954,"about_ca_system_score_codex":0.0009404643,"about_ca_system_score_gemma":0.00069393375,"threshold_uncertainty_score":0.021708488},"labels":[],"label_agreement":null},{"id":"W2907009959","doi":"10.1002/mcda.1658","title":"Investigating trade‐offs between optimal mobile photo enforcement programme plans","year":2019,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Advanced Multi-Objective Optimization Algorithms","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 Alberta","funders":"","keywords":"Silhouette; Computer science; Medoid; Set (abstract data type); Partition (number theory); Cluster analysis; Metric (unit); Jaccard index; Multi-objective optimization; Data mining; Index (typography); Operations research; Mathematical optimization; Mathematics; Operations management; Artificial intelligence; Engineering; Machine learning","score_opus":0.03445674400745234,"score_gpt":0.3314569130756071,"score_spread":0.29700016906815474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907009959","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.8797916,0.00035062447,0.10626723,0.00033115764,0.000026225058,0.00040808108,0.00019947712,0.00016194486,0.012463665],"genre_scores_gemma":[0.96989036,0.000076697776,0.028717164,0.000026775833,0.0000037312138,0.0001676907,0.00008687525,0.000021081292,0.001009576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922025,0.00037483263,0.000035285782,0.00008282435,0.00012701302,0.00015988901],"domain_scores_gemma":[0.99559826,0.0035079746,0.00030239776,0.000100515164,0.00033392038,0.00015692275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034855732,0.0007336326,0.00068235985,0.0024086002,0.0004448417,0.0017041236,0.00061615446,0.0013147766,0.0032223235],"category_scores_gemma":[0.010504951,0.00060410105,0.000770127,0.00070511154,0.0005323835,0.0010636628,0.0007543995,0.00068253314,0.00017666022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019156148,0.00019698426,0.0022340408,0.00008556291,0.000043624812,0.00006179739,0.00006470218,0.9783977,0.0015022826,0.0025658244,0.00028022405,0.014375713],"study_design_scores_gemma":[0.000021440992,0.00026144023,0.0019815157,0.000025507377,0.000026646363,0.000011065954,0.00020619098,0.99458647,0.0010435971,0.0016028298,0.0002221404,0.000011077834],"about_ca_topic_score_codex":0.003919795,"about_ca_topic_score_gemma":0.0033286647,"teacher_disagreement_score":0.003919795,"about_ca_system_score_codex":0.0017539907,"about_ca_system_score_gemma":0.0011430825,"threshold_uncertainty_score":0.01843369},"labels":[],"label_agreement":null},{"id":"W2911999864","doi":"10.1007/978-3-030-12598-1_9","title":"GDE4: The Generalized Differential Evolution with Ordered Mutation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ontario Tech University","funders":"","keywords":"Differential (mechanical device); Mutation; Mathematics; Genetics; Biology; Physics; Thermodynamics; Gene","score_opus":0.00984153339223182,"score_gpt":0.23364580304659055,"score_spread":0.22380426965435873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911999864","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.013212625,0.0008431832,0.9678801,0.00020637609,0.00036269077,0.00010512912,0.0003391574,0.0014009217,0.015649926],"genre_scores_gemma":[0.20342417,0.0011325896,0.7603569,0.00029799534,0.000110113375,0.00039698603,0.00087041216,0.00061929564,0.032791495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997563,0.000055421577,0.0000107209635,0.000034109613,0.0001151518,0.000028334201],"domain_scores_gemma":[0.999858,0.00005817354,0.000010256104,0.000026466827,0.000035754943,0.000011309604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040808786,0.0006509158,0.00092531566,0.00049470295,0.00030525753,0.0006632076,0.0014567176,0.0008854007,0.005918757],"category_scores_gemma":[0.00091227464,0.00020911763,0.00085755583,0.000928495,0.00046777705,0.00049476593,0.0009098727,0.0010989131,0.0010580482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120665,0.00006824008,0.00043624258,0.00034235325,0.00010226693,0.00020492876,0.000103043276,0.50314546,0.011868013,0.104804136,0.011422411,0.3673908],"study_design_scores_gemma":[0.000061207866,0.00009656303,0.00016791416,0.000030409112,0.000029714207,0.00013780706,0.00001341258,0.9224301,0.0041329605,0.040685926,0.03219222,0.000021872762],"about_ca_topic_score_codex":0.0021592726,"about_ca_topic_score_gemma":0.0016959646,"teacher_disagreement_score":0.005918757,"about_ca_system_score_codex":0.0005243886,"about_ca_system_score_gemma":0.00080094865,"threshold_uncertainty_score":0.019800246},"labels":[],"label_agreement":null},{"id":"W2912321885","doi":"10.5555/3320516.3320763","title":"Green simulation optimization using likelihood ratio estimators","year":2018,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Estimator; Context (archaeology); Computer science; Mathematical optimization; Maximum likelihood; Computer simulation; Reuse; Mathematics; Statistics; Simulation; Engineering","score_opus":0.042296933293259745,"score_gpt":0.32587115029866803,"score_spread":0.2835742170054083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912321885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003113839,0.00011289032,0.9951988,0.00014917362,0.000014005822,0.000048368795,0.000021257656,0.00023661664,0.0011051374],"genre_scores_gemma":[0.35380185,0.00043765045,0.6410445,0.00039859285,0.000058147354,0.0007089316,0.00022450484,0.00051541254,0.0028104044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925141,0.005640058,0.00020259914,0.00043647876,0.0010041554,0.00020269577],"domain_scores_gemma":[0.9714257,0.023910968,0.00143598,0.0016975481,0.0012513289,0.00027838457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01359707,0.0015653037,0.0018442158,0.0022173126,0.00062993146,0.0021784015,0.0018862374,0.0017522399,0.003251071],"category_scores_gemma":[0.061023362,0.0010927244,0.0012376003,0.0015564197,0.0023456472,0.0030801392,0.0031983184,0.0025230509,0.0007385859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007830987,0.000040944447,0.0009081138,0.00007727946,0.000072729614,0.00004891122,0.00005348057,0.9090554,0.00060987705,0.0669582,0.00053958327,0.021557163],"study_design_scores_gemma":[0.000017104136,0.000024889338,0.00006367162,0.000019935373,0.0000070307115,0.000009581602,0.000005726753,0.96801054,0.00042957926,0.030883586,0.0005204203,0.000008027724],"about_ca_topic_score_codex":0.002859128,"about_ca_topic_score_gemma":0.0023191762,"teacher_disagreement_score":0.01359707,"about_ca_system_score_codex":0.001907406,"about_ca_system_score_gemma":0.002935933,"threshold_uncertainty_score":0.07190907},"labels":[],"label_agreement":null},{"id":"W2913101259","doi":"10.1109/ssci.2018.8628739","title":"Enhanced Correlation Matrix Based Visualization for Multi- and Many-objective optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Visualization; Computer science; Plot (graphics); Set (abstract data type); Benchmark (surveying); Mathematical optimization; Convergence (economics); Parallel coordinates; Data visualization; Optimization problem; Data mining; Focus (optics); Variable (mathematics); Mathematics; Algorithm; Statistics","score_opus":0.019082517776213424,"score_gpt":0.3249452592664193,"score_spread":0.30586274149020587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913101259","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.017110415,0.00048781562,0.9763509,0.00030015383,0.000052280924,0.000048669175,0.00019373417,0.0025269391,0.0029290703],"genre_scores_gemma":[0.37053487,0.0008860702,0.62515885,0.00012236231,0.000060758994,0.00020168826,0.00046283635,0.0005718854,0.0020005452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.0002787715,0.000030244073,0.00005241869,0.00019870832,0.00004453114],"domain_scores_gemma":[0.99854666,0.0007673752,0.00015688111,0.00014115631,0.0003240642,0.000063897955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468569,0.0011321995,0.0006272048,0.0016550779,0.00037757834,0.0015144596,0.0005949184,0.00071367563,0.005103548],"category_scores_gemma":[0.0033217664,0.00029284833,0.00060699775,0.0017414404,0.00033497563,0.0015094164,0.0012357961,0.001184342,0.00052213075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005736272,0.00018648716,0.0027288506,0.00087053026,0.00013953545,0.0006109072,0.0007303434,0.44116396,0.08760229,0.06278652,0.01764399,0.38496307],"study_design_scores_gemma":[0.00002979969,0.00006293643,0.0009232411,0.000036580765,0.000017187182,0.00015124382,0.000072637515,0.9656685,0.012950612,0.013483463,0.0065608136,0.000042979045],"about_ca_topic_score_codex":0.0015443227,"about_ca_topic_score_gemma":0.0014754632,"teacher_disagreement_score":0.005103548,"about_ca_system_score_codex":0.00048714894,"about_ca_system_score_gemma":0.0007491626,"threshold_uncertainty_score":0.017073095},"labels":[],"label_agreement":null},{"id":"W2914029036","doi":"10.1002/9781118014967.ch12","title":"Randomized Optimization","year":2011,"lang":"en","type":"other","venue":"Wiley series in probability and statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Stochastic optimization; Mathematical optimization; Randomness; Randomized algorithm; Stochastic approximation; Computer science; Monte Carlo method; Simulated annealing; Global optimization; Mathematics; Algorithm; Key (lock)","score_opus":0.015890567518318344,"score_gpt":0.2435982088983946,"score_spread":0.22770764138007624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914029036","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.0024126456,0.0063434606,0.89062,0.0023318024,0.0012618684,0.0001583019,0.00043717935,0.0005981982,0.095836535],"genre_scores_gemma":[0.26718283,0.020037789,0.5670135,0.003489719,0.0025583599,0.0013976011,0.0019689684,0.0011915094,0.1351597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681866,0.0012968662,0.00012474462,0.000536531,0.0009764477,0.00024666885],"domain_scores_gemma":[0.9968252,0.0019782502,0.0002046556,0.0004985718,0.00037989038,0.00011341144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563331,0.0014786004,0.0015786369,0.00085463905,0.00089525385,0.002671039,0.0015636948,0.0015352578,0.025722215],"category_scores_gemma":[0.010587533,0.0004831909,0.0012848153,0.0012111414,0.0018702993,0.0028763423,0.0023814193,0.002803976,0.0058792736],"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.00006599079,0.00006489983,0.0002518814,0.00025088456,0.00007001795,0.000057857906,0.000033198394,0.096925884,0.00048336928,0.8058204,0.02367777,0.07229784],"study_design_scores_gemma":[0.00006605873,0.000075333315,0.000211238,0.00016939185,0.0000406223,0.00010466298,0.000029846587,0.31038168,0.0006654545,0.6014109,0.08681003,0.00003473652],"about_ca_topic_score_codex":0.0016236587,"about_ca_topic_score_gemma":0.0020003172,"teacher_disagreement_score":0.025722215,"about_ca_system_score_codex":0.0015688043,"about_ca_system_score_gemma":0.0019900012,"threshold_uncertainty_score":0.08604938},"labels":[],"label_agreement":null},{"id":"W2914865307","doi":"10.1080/13669877.2019.1569093","title":"Reproducibility investigation of elicitation techniques in risk assessment for hydraulic turbines","year":2019,"lang":"en","type":"article","venue":"Journal of Risk Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure","funders":"Mitacs","keywords":"Expert elicitation; Metric (unit); Computer science; Variable (mathematics); Expert opinion; Risk analysis (engineering); Management science; Operations research; Engineering; Mathematics; Statistics; Operations management","score_opus":0.04726016173597463,"score_gpt":0.4065754968099397,"score_spread":0.35931533507396507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914865307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37082198,0.0020981452,0.6163624,0.000943359,0.00022275388,0.002179269,0.00031516736,0.00057604647,0.0064808885],"genre_scores_gemma":[0.7534096,0.00045321332,0.2436607,0.00019341399,0.000121119665,0.0013080537,0.0002707311,0.00011114767,0.0004719935],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.6409185,0.29091638,0.02471169,0.010883202,0.03089044,0.0016797675],"domain_scores_gemma":[0.14939363,0.7448225,0.030826122,0.042090554,0.032214794,0.000652447],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.21848191,0.0013558135,0.0014173446,0.0031818347,0.0015297455,0.0037842223,0.003118127,0.0025874537,0.0018257969],"category_scores_gemma":[0.55408186,0.00065680494,0.002454725,0.0030404977,0.0022325634,0.0035033654,0.0040332535,0.0018822305,0.0005331943],"study_design_candidate":"observational","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.0090874,0.0019165379,0.07503328,0.010660551,0.0029453002,0.0007416534,0.032690562,0.048808932,0.039830763,0.017509215,0.003006169,0.7577696],"study_design_scores_gemma":[0.0024414947,0.023038283,0.16818659,0.0064764568,0.0052973325,0.0041035805,0.025306871,0.45420793,0.19602852,0.08193199,0.03147522,0.0015057228],"about_ca_topic_score_codex":0.0008458884,"about_ca_topic_score_gemma":0.00067609217,"teacher_disagreement_score":0.7815181,"about_ca_system_score_codex":0.001914315,"about_ca_system_score_gemma":0.0021645485,"threshold_uncertainty_score":0.96375096},"labels":[],"label_agreement":null},{"id":"W2914898599","doi":"10.1007/978-3-030-12598-1_49","title":"IRA-EMO: Interactive Method Using Reservation and Aspiration Levels for Evolutionary Multiobjective Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Reservation; Computer science; Multi-objective optimization; Mathematical optimization; Pareto principle; Decision maker; Evolutionary algorithm; Interval (graph theory); Optimization problem; Multiobjective programming; Artificial intelligence; Operations research; Algorithm; Mathematics; Machine learning","score_opus":0.04482112435557944,"score_gpt":0.3283234854295944,"score_spread":0.28350236107401494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914898599","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.005223786,0.00017656761,0.9810689,0.00006165493,0.00011673078,0.000050786817,0.00005901946,0.0018157416,0.011426741],"genre_scores_gemma":[0.1750201,0.00019740236,0.80764234,0.0002403364,0.000080778394,0.00041579927,0.00023421216,0.0010168906,0.015152125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979573,0.000062342486,0.000009097317,0.000032136246,0.00007527071,0.000025378695],"domain_scores_gemma":[0.9997135,0.00016244414,0.00001672324,0.000027450278,0.000057709844,0.000022237204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515544,0.00085613027,0.000927826,0.00047055565,0.00047745366,0.0008470365,0.0018946716,0.0014486858,0.014930828],"category_scores_gemma":[0.0011269302,0.00048136446,0.0008416934,0.0004553515,0.00033005516,0.00068167766,0.0012985497,0.0012621852,0.0023371684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018436817,0.00019910879,0.00031416112,0.0002679534,0.00009340081,0.00018775779,0.00014789935,0.6800371,0.008440858,0.016892968,0.010600902,0.2826335],"study_design_scores_gemma":[0.00001644874,0.000023402506,0.000041330793,0.000011928701,0.0000076583,0.000021699585,0.000007520396,0.9948368,0.00073520286,0.0017522254,0.0025383495,0.0000075438707],"about_ca_topic_score_codex":0.002025609,"about_ca_topic_score_gemma":0.0028825102,"teacher_disagreement_score":0.014930828,"about_ca_system_score_codex":0.00034254382,"about_ca_system_score_gemma":0.0005148987,"threshold_uncertainty_score":0.049948573},"labels":[],"label_agreement":null},{"id":"W2914910073","doi":"10.1007/s10479-018-3122-6","title":"Improving the computational efficiency of stochastic programs using automated algorithm configuration: an application to decentralized energy systems","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"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; University of British Columbia Hospital","funders":"Compute Canada","keywords":"Theory of computation; Computer science; Mathematical optimization; Computational complexity theory; Energy (signal processing); Integer (computer science); Scale (ratio); Stack (abstract data type); Photovoltaic system; Algorithm; Mathematics","score_opus":0.08685261222821998,"score_gpt":0.41343236826343277,"score_spread":0.3265797560352128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914910073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17034435,0.00019297839,0.8216363,0.000490623,0.00007639241,0.00011157288,0.000074507865,0.0014986127,0.0055745197],"genre_scores_gemma":[0.805054,0.00007304864,0.1935587,0.000054641765,0.000035947385,0.00014243794,0.00006096322,0.00014180376,0.00087839464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814785,0.0011102868,0.000063560095,0.00018486983,0.00035418468,0.00013926323],"domain_scores_gemma":[0.9856996,0.011499107,0.0005952078,0.0010904025,0.0009332005,0.00018255172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029945967,0.00091385713,0.0013473912,0.0007206533,0.0009183117,0.0013061134,0.0013430646,0.0012002233,0.002535678],"category_scores_gemma":[0.016303977,0.0005281684,0.00051695673,0.0011568707,0.00096653786,0.0015578037,0.0012342299,0.0016414985,0.00026709394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012810652,0.00013833663,0.00043450855,0.00002706642,0.000015488855,0.00003230806,0.000032743967,0.9585628,0.0006202437,0.00631466,0.0004933963,0.03320044],"study_design_scores_gemma":[0.000018608525,0.000018151302,0.000041154188,0.0000014094725,0.0000024428634,0.0000036795036,0.00000363674,0.9977679,0.00023359238,0.0018456337,0.000061395695,0.0000023405619],"about_ca_topic_score_codex":0.0069676777,"about_ca_topic_score_gemma":0.0069042663,"teacher_disagreement_score":0.0069676777,"about_ca_system_score_codex":0.0011468536,"about_ca_system_score_gemma":0.0023843844,"threshold_uncertainty_score":0.015837133},"labels":[],"label_agreement":null},{"id":"W2917647106","doi":"10.1002/qre.1040","title":"Discussion (3): Jones–Johnson Paper","year":2009,"lang":"en","type":"article","venue":"Quality and Reliability Engineering International","topic":"Advanced Multi-Objective Optimization Algorithms","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","score_opus":0.011034141712087997,"score_gpt":0.28277432417025505,"score_spread":0.27174018245816706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917647106","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.0017099886,0.0072250795,0.0016785994,0.76689976,0.10659414,0.00010633607,0.00061948167,0.00014906458,0.1150176],"genre_scores_gemma":[0.036189727,0.0037368545,0.0010793484,0.7231599,0.054819353,0.00020825423,0.00041584385,0.00026666696,0.18012403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99324846,0.0014842714,0.00044312747,0.0019163968,0.0018863997,0.0010213562],"domain_scores_gemma":[0.98449564,0.0052342038,0.0008277126,0.0018052922,0.005660806,0.0019762542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007921343,0.0006336618,0.00079100335,0.0012338778,0.0038466947,0.0061682346,0.002375104,0.014526545,0.10178692],"category_scores_gemma":[0.029855285,0.000404857,0.0011831281,0.0011159754,0.0022797459,0.005193242,0.0030160446,0.008241397,0.049602132],"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.00005873113,0.000028815566,0.00037169308,0.00006606909,0.000016564503,0.00013303512,0.00014377174,0.000024039298,0.00008712201,0.026255058,0.95882046,0.013994574],"study_design_scores_gemma":[0.000017047907,0.000010323643,0.0005185916,0.00013166927,0.000012431759,0.00017785093,0.00018430573,0.000075623924,0.00024474383,0.00892687,0.9896868,0.000013737391],"about_ca_topic_score_codex":0.0050133183,"about_ca_topic_score_gemma":0.004036496,"teacher_disagreement_score":0.10178692,"about_ca_system_score_codex":0.004887488,"about_ca_system_score_gemma":0.0045101633,"threshold_uncertainty_score":0.34051114},"labels":[],"label_agreement":null},{"id":"W2922377918","doi":"10.1007/s12293-019-00282-5","title":"Project portfolio selection and scheduling under a fuzzy environment","year":2019,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Project portfolio management; Mathematical optimization; Portfolio; Flexibility (engineering); Pareto principle; Fuzzy logic; Scheduling (production processes); Evolutionary algorithm; Operations research; Project management; Machine learning; Artificial intelligence; Mathematics; Engineering; Systems engineering","score_opus":0.012046640714551271,"score_gpt":0.25060554894108106,"score_spread":0.23855890822652978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922377918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1738828,0.0005449796,0.8185519,0.0004514221,0.00008333012,0.00008619532,0.00012886668,0.00008965442,0.0061808424],"genre_scores_gemma":[0.9155318,0.00028856064,0.08056126,0.000040585266,0.000055464327,0.00008189228,0.00005265685,0.00002179981,0.0033660138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991379,0.00035629343,0.00004046486,0.00012610725,0.00021205915,0.00012723639],"domain_scores_gemma":[0.99858034,0.0008779631,0.0001873858,0.000053984917,0.00017491347,0.00012552935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022728972,0.0005726625,0.0013201771,0.0012801924,0.0007406606,0.0017470814,0.0010274408,0.001224481,0.001467734],"category_scores_gemma":[0.003996342,0.0005478249,0.00066620467,0.0017657006,0.0006984913,0.0014432872,0.00072694913,0.0006942506,0.00013158923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000870513,0.000031899835,0.0004714124,0.000035990946,0.00004724401,0.00007122953,0.000022609504,0.975042,0.00094155874,0.010282924,0.00029110175,0.012674875],"study_design_scores_gemma":[0.0000075981825,0.00002293842,0.0001500814,0.000003140989,0.000007349901,0.000014249623,0.000009099352,0.99471927,0.00021651227,0.004733527,0.00011178841,0.0000044591734],"about_ca_topic_score_codex":0.0047059082,"about_ca_topic_score_gemma":0.0033573904,"teacher_disagreement_score":0.0047059082,"about_ca_system_score_codex":0.0015670693,"about_ca_system_score_gemma":0.0012448202,"threshold_uncertainty_score":0.012020409},"labels":[],"label_agreement":null},{"id":"W2925680367","doi":"10.48550/arxiv.1904.03615","title":"Topology of Pareto sets of strongly convex problems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"Precursory Research for Embryonic Science and Technology; Japan Society for the Promotion of Science","keywords":"Simplex; Mathematics; Pareto principle; Regular polygon; Mathematical optimization; Dimension (graph theory); Topology (electrical circuits); Multi-objective optimization; Convex analysis; Combinatorics; Convex optimization; Geometry","score_opus":0.057694667986832454,"score_gpt":0.20861682393397038,"score_spread":0.15092215594713793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925680367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12400026,0.0006713694,0.8456152,0.001232503,0.00006477931,0.000121304365,0.0002795528,0.000109062414,0.027905937],"genre_scores_gemma":[0.8046614,0.001266251,0.1803466,0.00036981,0.00017499986,0.0005596477,0.0007878881,0.00020979505,0.011623707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552816,0.001955268,0.00021910339,0.00045211302,0.0014891188,0.00035624445],"domain_scores_gemma":[0.9907774,0.005532901,0.000844741,0.0005394983,0.0013799754,0.0009254548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055048997,0.001243725,0.0012411713,0.003432382,0.002216644,0.00641231,0.0016092905,0.001736068,0.004600543],"category_scores_gemma":[0.015282124,0.0009084581,0.0016364456,0.0014854005,0.0052589313,0.004477646,0.00681652,0.003449679,0.00062722573],"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.000043831045,0.000038050395,0.0005759422,0.000080779326,0.000036313897,0.00011459353,0.00030903984,0.052549075,0.0011591123,0.93546206,0.00072122214,0.008909986],"study_design_scores_gemma":[0.00001840522,0.00005091722,0.00031564292,0.000046848792,0.000009766413,0.00008118147,0.00021083035,0.18673201,0.0007673982,0.80894613,0.0028001107,0.000020763724],"about_ca_topic_score_codex":0.00086077926,"about_ca_topic_score_gemma":0.0006308324,"teacher_disagreement_score":0.00641231,"about_ca_system_score_codex":0.0021255517,"about_ca_system_score_gemma":0.0011226353,"threshold_uncertainty_score":0.029113054},"labels":[],"label_agreement":null},{"id":"W2928561833","doi":"10.1162/978-0-262-31709-2-ch139","title":"A hybrid genetic/immune strategy to tackle the multiobjective quadratic assignment problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 à Chicoutimi","funders":"","keywords":"Knapsack problem; Mathematical optimization; Benchmark (surveying); Multi-objective optimization; Quadratic assignment problem; Genetic algorithm; Computer science; Optimization problem; Quadratic equation; Mathematics","score_opus":0.00949706403982447,"score_gpt":0.23855539712973522,"score_spread":0.22905833308991075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928561833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037649866,0.0004238516,0.95458037,0.00017823158,0.00008714151,0.00006483253,0.000017462207,0.00021730775,0.0067809727],"genre_scores_gemma":[0.5062479,0.00032473356,0.48666084,0.00033492272,0.000073930554,0.00019487675,0.00007014425,0.000047422247,0.006045273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980706,0.00004914906,0.0000063261905,0.000023709343,0.00009101947,0.00002271259],"domain_scores_gemma":[0.99988663,0.00004597484,0.000017833598,0.000008307373,0.000028463895,0.000012719963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003692797,0.0005239402,0.00042797238,0.00050456816,0.0002752975,0.00043754937,0.00078858447,0.0008649308,0.0011968052],"category_scores_gemma":[0.00043783622,0.00014075835,0.00037083268,0.00041296717,0.0003479666,0.00040782438,0.00054111576,0.0004901397,0.0002220987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007202961,0.00020591347,0.0009523631,0.00013307534,0.00011854661,0.00027905748,0.00011007416,0.7493568,0.027355915,0.02585567,0.0026175291,0.192943],"study_design_scores_gemma":[0.000021898897,0.000121067664,0.00015374472,0.0000073572314,0.000014672866,0.000101980506,0.000011838697,0.99221826,0.002013958,0.0028644146,0.002462938,0.000007747026],"about_ca_topic_score_codex":0.0007086931,"about_ca_topic_score_gemma":0.001078152,"teacher_disagreement_score":0.0011968052,"about_ca_system_score_codex":0.00024217232,"about_ca_system_score_gemma":0.00037014182,"threshold_uncertainty_score":0.0040037036},"labels":[],"label_agreement":null},{"id":"W2932891632","doi":"","title":"Optimizing DICOM data management with NSGA-G","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"DICOM; Computer science; Database; Operating system","score_opus":0.020721088838804413,"score_gpt":0.2473986961190756,"score_spread":0.2266776072802712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932891632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13361347,0.0003548937,0.8445914,0.00096946326,0.00033467988,0.0004212693,0.0009969105,0.0035830962,0.015134934],"genre_scores_gemma":[0.5362417,0.00011918844,0.454454,0.00034744397,0.000053979322,0.00041653155,0.0013764366,0.00044871797,0.0065420093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995296,0.00016008774,0.000025150066,0.00008281318,0.00011848499,0.000083905135],"domain_scores_gemma":[0.99853766,0.00067338964,0.00008643468,0.00020525914,0.00041018586,0.00008712913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013848533,0.0008111541,0.0008234003,0.00081816665,0.0007984754,0.0012365633,0.001274262,0.0012508675,0.008562908],"category_scores_gemma":[0.004593942,0.0004025518,0.0006831527,0.0009805915,0.0005800867,0.0010351104,0.0009813653,0.0011554252,0.0009270895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121252415,0.00005480447,0.0005045352,0.00003905997,0.000018078303,0.000042795116,0.000036995876,0.9414322,0.0007679634,0.0019552808,0.0033224195,0.051704697],"study_design_scores_gemma":[0.000016924945,0.000023734892,0.00012318815,0.0000048834568,0.0000046707673,0.000006928478,0.000021331367,0.9967571,0.0006216491,0.0015337996,0.0008825725,0.0000033344706],"about_ca_topic_score_codex":0.01384861,"about_ca_topic_score_gemma":0.013424302,"teacher_disagreement_score":0.01384861,"about_ca_system_score_codex":0.0012953139,"about_ca_system_score_gemma":0.002095109,"threshold_uncertainty_score":0.028645754},"labels":[],"label_agreement":null},{"id":"W2942517280","doi":"10.1109/access.2019.2914697","title":"Multi-Objective Optimization of Manufacturing Process in Carbon Fiber Industry Using Artificial Intelligence Techniques","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"Deakin University","keywords":"Computer science; TOPSIS; Energy consumption; Ideal solution; Multi-objective optimization; Profitability index; Mathematical optimization; Process (computing); Efficient energy use; Process engineering; Industrial engineering; Engineering; Mathematics; Operations research; Machine learning","score_opus":0.04490728971614212,"score_gpt":0.34563329134259546,"score_spread":0.30072600162645335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942517280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12330035,0.0013401146,0.86794025,0.00022229925,0.000045553614,0.00014023394,0.000063618776,0.00014384798,0.0068037324],"genre_scores_gemma":[0.8741053,0.0006393226,0.12261909,0.000052373456,0.000015680751,0.00028931274,0.000081952865,0.00002439011,0.002172578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958485,0.0001665521,0.000021249409,0.0000567802,0.00012428482,0.000046275698],"domain_scores_gemma":[0.9996375,0.00024024436,0.00005225977,0.000010965176,0.000048483944,0.00001050676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011026784,0.0009406386,0.00075628184,0.00070736656,0.00038742367,0.0008891124,0.0005141348,0.0009508414,0.0007337721],"category_scores_gemma":[0.0008970701,0.00039744528,0.0008721635,0.00071963866,0.00039887265,0.00042858397,0.0005073156,0.00060985546,0.00008374491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013746674,0.000022041431,0.00022358245,0.000045566227,0.000020208134,0.000025308802,0.000010975304,0.99219525,0.0007505648,0.00067660405,0.00005424144,0.0059619797],"study_design_scores_gemma":[0.0000029762255,0.00002988993,0.00010557197,0.000004043137,0.0000047784174,0.0000041992366,0.0000051035427,0.99901617,0.0003349699,0.00036716432,0.00012300629,0.0000022076106],"about_ca_topic_score_codex":0.00516356,"about_ca_topic_score_gemma":0.003949942,"teacher_disagreement_score":0.00516356,"about_ca_system_score_codex":0.00084670284,"about_ca_system_score_gemma":0.0008964173,"threshold_uncertainty_score":0.010267019},"labels":[],"label_agreement":null},{"id":"W2943729245","doi":"10.1007/978-3-319-31204-0_1","title":"Enhanced Multiobjective Population-Based Incremental Learning with Applications in Risk Treaty Optimization","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Dalhousie University","funders":"","keywords":"Speedup; Computer science; Pareto principle; Context (archaeology); Population; Mathematical optimization; Multi-objective optimization; Dual (grammatical number); Parallel computing; Machine learning; Mathematics","score_opus":0.0071618120789763325,"score_gpt":0.2418116852113466,"score_spread":0.23464987313237026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943729245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012976516,0.000666927,0.9812655,0.00013810175,0.00012547224,0.00005166025,0.000036321606,0.0002625451,0.0044769533],"genre_scores_gemma":[0.43216425,0.00064441684,0.5594847,0.00025134502,0.00017356283,0.00034758012,0.00018377855,0.0001580425,0.0065924153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.000120974284,0.00001892136,0.000052939493,0.000104049825,0.00002800909],"domain_scores_gemma":[0.99854624,0.00091147114,0.00007114541,0.000082890125,0.00034666777,0.00004163766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278832,0.0007742727,0.0012700653,0.0006879928,0.0003319403,0.00093983056,0.0019268556,0.0014384984,0.003770286],"category_scores_gemma":[0.0040937173,0.00043040668,0.00074113783,0.00084047683,0.0004380015,0.0011128018,0.001454497,0.0016111134,0.0004940531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043874017,0.0001163772,0.00042662528,0.0001117153,0.00005338772,0.000064332824,0.000054929358,0.85217404,0.0013365108,0.009638771,0.0022156904,0.13376372],"study_design_scores_gemma":[0.0000024900255,0.000013667793,0.000035931218,0.000003853807,0.0000045259308,0.0000072360185,0.0000018311388,0.99828845,0.00013691714,0.0012787184,0.00022432437,0.000001984767],"about_ca_topic_score_codex":0.001903531,"about_ca_topic_score_gemma":0.0019255255,"teacher_disagreement_score":0.003770286,"about_ca_system_score_codex":0.00044055106,"about_ca_system_score_gemma":0.0005387058,"threshold_uncertainty_score":0.012612879},"labels":[],"label_agreement":null},{"id":"W2944554922","doi":"10.1007/s10898-019-00782-1","title":"Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Ministerio de Economía y Competitividad; Concordia University","keywords":"Selection (genetic algorithm); Preference; Mathematics; Portfolio; Mathematical optimization; Multi-objective optimization; Portfolio optimization; Econometrics; Machine learning; Computer science; Statistics; Business; Finance","score_opus":0.04571095833041305,"score_gpt":0.28495084844442164,"score_spread":0.2392398901140086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944554922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021805704,0.00036734363,0.96848094,0.00070370204,0.00007084462,0.000056360648,0.000073147654,0.000047420883,0.008394494],"genre_scores_gemma":[0.8032152,0.0009058024,0.1794051,0.00041918224,0.00016789138,0.0003070868,0.00014411274,0.00006172681,0.015373883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854845,0.0008243674,0.000055538476,0.00014390248,0.00031851075,0.000109126864],"domain_scores_gemma":[0.9977685,0.0013960949,0.00024786431,0.0001390983,0.00030193708,0.00014656695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036458846,0.0009889393,0.0015766188,0.0011274371,0.0006190921,0.002123051,0.0029861333,0.002504248,0.0038953403],"category_scores_gemma":[0.0090574,0.00072277134,0.0011569875,0.0016000826,0.0013577039,0.0028298197,0.0016766238,0.0020818957,0.00039997572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000443025,0.00006745539,0.00051844167,0.00006520348,0.00006784792,0.000103155035,0.00006132828,0.8644364,0.00041866794,0.12082503,0.00079505227,0.012597142],"study_design_scores_gemma":[0.000007876891,0.000013875596,0.00005028474,0.000006120843,0.000007407555,0.000013163562,0.0000033518475,0.98696715,0.000029864465,0.012704551,0.00019163112,0.0000046832574],"about_ca_topic_score_codex":0.0027090658,"about_ca_topic_score_gemma":0.0027261958,"teacher_disagreement_score":0.0038953403,"about_ca_system_score_codex":0.0012441434,"about_ca_system_score_gemma":0.001043721,"threshold_uncertainty_score":0.019281507},"labels":[],"label_agreement":null},{"id":"W2949103490","doi":"10.48550/arxiv.1003.0804","title":"Branch and Bound Algorithms for Maximizing Expected Improvement Functions","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Algorithm; Function (biology); Set (abstract data type); Mathematical optimization; Source code; Process (computing); Genetic algorithm; Code (set theory); Gaussian process; Gaussian; Computer experiment; Simulation; Mathematics; Machine learning","score_opus":0.059012045044887294,"score_gpt":0.21414433072215253,"score_spread":0.15513228567726522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949103490","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.0027237264,0.0008821722,0.9923441,0.00029525955,0.0000402319,0.00010338828,0.000053636162,0.0004020672,0.0031554403],"genre_scores_gemma":[0.09598929,0.0012954528,0.8957297,0.00038888984,0.0001350051,0.0012430253,0.0003854423,0.000575834,0.0042573027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969777,0.0014835426,0.0001680803,0.00038429137,0.00070555584,0.00028084766],"domain_scores_gemma":[0.98487365,0.013078967,0.00044905877,0.0004209637,0.0009639153,0.00021341849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072380006,0.003558846,0.003235202,0.0030675628,0.0011821064,0.002629815,0.00280177,0.0031242468,0.010192189],"category_scores_gemma":[0.023023756,0.00135495,0.0012451315,0.0032767898,0.002057399,0.002618874,0.002377488,0.004171942,0.002765687],"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.00018019081,0.00017254226,0.00071664527,0.00030487456,0.000104618855,0.00007108862,0.00014257732,0.8001626,0.0007280176,0.06367094,0.005621603,0.12812422],"study_design_scores_gemma":[0.00005098691,0.000047145426,0.00008918994,0.000050551305,0.000023885099,0.000020994667,0.000019633166,0.9506834,0.00043608525,0.046869002,0.0016967774,0.000012346497],"about_ca_topic_score_codex":0.003946329,"about_ca_topic_score_gemma":0.0040454064,"teacher_disagreement_score":0.010192189,"about_ca_system_score_codex":0.0026164826,"about_ca_system_score_gemma":0.0034001619,"threshold_uncertainty_score":0.03827864},"labels":[],"label_agreement":null},{"id":"W2949920955","doi":"10.48550/arxiv.1403.4890","title":"Modeling an Augmented Lagrangian for Blackbox Constrained Optimization","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Augmented Lagrangian method; Computer science; Mathematical optimization; Heuristics; Bottleneck; Benchmark (surveying); Context (archaeology); Lagrangian relaxation; Sensitivity (control systems); Optimization problem; Simple (philosophy); Algorithm; Mathematics","score_opus":0.061969418260469145,"score_gpt":0.21566876393236215,"score_spread":0.153699345671893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949920955","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.0028606523,0.0001122558,0.9940764,0.00020221254,0.000024774783,0.000018702805,0.000043321,0.00011594075,0.0025457027],"genre_scores_gemma":[0.42191115,0.0005719314,0.5657413,0.00041635052,0.00011859003,0.00047757186,0.00028703568,0.00039264865,0.010083422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.00028731776,0.000021187512,0.00009907652,0.0001345621,0.000051053506],"domain_scores_gemma":[0.99833065,0.0011183416,0.00018928442,0.00013391179,0.0001520157,0.0000759153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168826,0.0010051157,0.001109614,0.0007084257,0.00043936414,0.0016503242,0.0011891316,0.0018159576,0.00480072],"category_scores_gemma":[0.004431558,0.00061021245,0.0009873512,0.0005897206,0.0016366295,0.0019039387,0.0019790838,0.0017876915,0.00076380855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017085436,0.000018461767,0.00017323182,0.000054393855,0.000013302611,0.000038288454,0.000026353644,0.92120135,0.00054964196,0.07044859,0.0008018081,0.0066574365],"study_design_scores_gemma":[0.000003073715,0.000005926323,0.000015262449,0.0000066412317,0.0000017814016,0.0000045827232,0.0000027769283,0.98254323,0.00011563989,0.016722444,0.0005759914,0.0000026788337],"about_ca_topic_score_codex":0.0019047074,"about_ca_topic_score_gemma":0.0021494923,"teacher_disagreement_score":0.00480072,"about_ca_system_score_codex":0.00091504777,"about_ca_system_score_gemma":0.0014276033,"threshold_uncertainty_score":0.016059995},"labels":[],"label_agreement":null},{"id":"W2952346195","doi":"10.1007/s42114-019-00107-6","title":"A multi-objective Gaussian process approach for optimization and prediction of carbonization process in carbon fiber production under uncertainty","year":2019,"lang":"en","type":"article","venue":"Advanced Composites and Hybrid Materials","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Carbonization; Polyacrylonitrile; Process engineering; Fiber; Process (computing); Energy consumption; Materials science; Computer science; Ultimate tensile strength; Mechanical engineering; Composite material; Polymer; Engineering","score_opus":0.009018392970465708,"score_gpt":0.2472421186603419,"score_spread":0.2382237256898762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952346195","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.021698011,0.00031775163,0.97649866,0.00021163835,0.00004416392,0.00003848227,0.000048740414,0.00013856571,0.0010038432],"genre_scores_gemma":[0.85623896,0.00056182465,0.1389669,0.0001523271,0.00010482915,0.0003497446,0.00018864877,0.00011584325,0.003320877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00025229563,0.000034906876,0.00011642985,0.00016708484,0.0000676332],"domain_scores_gemma":[0.99744296,0.0018825597,0.00016942399,0.000050853716,0.00038384993,0.00007035597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028349753,0.0012635305,0.00187269,0.00085036876,0.0008109226,0.0013156096,0.0013654823,0.002706197,0.0010551799],"category_scores_gemma":[0.0043898225,0.0011540189,0.0015463872,0.0009788129,0.0014710664,0.0012669831,0.0014847557,0.0019914326,0.00018998116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011888444,0.000012040217,0.0000821299,0.000013888292,0.000012259671,0.000011342312,0.000008965322,0.9962754,0.00014965823,0.0012575772,0.000054620643,0.002110188],"study_design_scores_gemma":[0.00000101759,0.0000027307617,0.000011490458,4.934066e-7,0.0000010174434,4.651395e-7,5.143884e-7,0.9997315,0.00003007457,0.00020682007,0.00001284499,0.0000010095652],"about_ca_topic_score_codex":0.023252722,"about_ca_topic_score_gemma":0.011691186,"teacher_disagreement_score":0.023252722,"about_ca_system_score_codex":0.0014335247,"about_ca_system_score_gemma":0.0025012244,"threshold_uncertainty_score":0.046234787},"labels":[],"label_agreement":null},{"id":"W2953667433","doi":"10.1115/1.4044109","title":"A Relative Adequacy Framework for Multi-Model Management in Design Optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Mathematical optimization; Fidelity; Computer science; Airfoil; Transonic; Engineering design process; Key (lock); Process (computing); Constraint (computer-aided design); Optimization problem; Mathematics; Engineering; Aerodynamics; Aerospace engineering","score_opus":0.07694864023157873,"score_gpt":0.3331516760135233,"score_spread":0.2562030357819446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953667433","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.0042168526,0.00006186513,0.9949545,0.000082432714,0.0000062640756,0.00002894974,0.00000831564,0.000045705412,0.0005951414],"genre_scores_gemma":[0.59147286,0.00014115086,0.40678903,0.00009404036,0.000046583464,0.00036601254,0.00007023685,0.00012827404,0.0008917474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917101,0.0053428146,0.00029510807,0.00049642584,0.0019080312,0.00024752718],"domain_scores_gemma":[0.98536205,0.010003562,0.0013108935,0.0013695856,0.0016477315,0.00030607215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014781969,0.0011838733,0.0013784197,0.0017352023,0.0008036937,0.002056058,0.0026706147,0.0015563057,0.0018150209],"category_scores_gemma":[0.03277361,0.00076071953,0.0012528038,0.0008003139,0.0032149923,0.0030992061,0.0040538856,0.002265488,0.00024873402],"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.0000676223,0.000056239118,0.00055111846,0.00010074424,0.000039081915,0.000067202425,0.00014223023,0.8254886,0.001638101,0.15466644,0.0002549893,0.016927581],"study_design_scores_gemma":[0.0000052751907,0.00003695467,0.000043512235,0.000011790713,0.000005507871,0.000008517409,0.000009945275,0.9800269,0.00046356558,0.019105418,0.00027701707,0.0000055808055],"about_ca_topic_score_codex":0.0022986827,"about_ca_topic_score_gemma":0.0011912277,"teacher_disagreement_score":0.014781969,"about_ca_system_score_codex":0.0014749735,"about_ca_system_score_gemma":0.0015610141,"threshold_uncertainty_score":0.078175426},"labels":[],"label_agreement":null},{"id":"W2953979082","doi":"10.1145/3321707.3321728","title":"A surrogate model assisted (1+1)-ES with increased exploitation of the model","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":10,"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":"Surrogate model; Context (archaeology); Computer science; Gaussian process; Mathematical optimization; Black box; Process (computing); Function (biology); Gaussian; Mathematics; Artificial intelligence; Physics","score_opus":0.017569413325023982,"score_gpt":0.22306256983906494,"score_spread":0.20549315651404096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953979082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05612877,0.00013608171,0.9378906,0.0002443193,0.000035066496,0.00003900495,0.000034414003,0.00022328182,0.0052684946],"genre_scores_gemma":[0.71223265,0.00010310331,0.28338084,0.00016566647,0.000021449274,0.00008574024,0.00008691688,0.00007046507,0.0038531248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.00026427073,0.000022001368,0.00006087741,0.00016183768,0.000042569456],"domain_scores_gemma":[0.99846137,0.0009952622,0.00011950277,0.00020771689,0.00016419696,0.000051872743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015884746,0.0006161427,0.000756559,0.00033320824,0.00021851837,0.0007812964,0.0009319236,0.0015710038,0.0019206611],"category_scores_gemma":[0.004041942,0.0002629105,0.00065534306,0.00046851742,0.00062062044,0.0010462228,0.0012463958,0.0010040154,0.00034443146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059232505,0.000048787773,0.00041800557,0.00004507203,0.000022504475,0.000072682415,0.00003736998,0.9570458,0.0053574895,0.016430857,0.00030755234,0.020154528],"study_design_scores_gemma":[0.0000059044028,0.00003638574,0.0000551222,0.00000311247,0.0000029747046,0.000020081412,0.0000022682193,0.996949,0.00080898654,0.0018988238,0.00021347511,0.0000038505673],"about_ca_topic_score_codex":0.0007602677,"about_ca_topic_score_gemma":0.0010041054,"teacher_disagreement_score":0.0019206611,"about_ca_system_score_codex":0.0003691099,"about_ca_system_score_gemma":0.00064063503,"threshold_uncertainty_score":0.008400798},"labels":[],"label_agreement":null},{"id":"W2954664346","doi":"10.22158/asir.v3n3p92","title":"A Stochastic Simulation-Optimization Method for Generating Waste Management Alternatives Using Population-Based Algorithms","year":2019,"lang":"en","type":"article","venue":"Applied Science and Innovative Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematical optimization; Computer science; Process (computing); Population; Stochastic optimization; Stochastic simulation; Stochastic process; Algorithm; Mathematics","score_opus":0.06961703694971053,"score_gpt":0.4230346416882911,"score_spread":0.3534176047385805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954664346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031333738,0.00005562259,0.9947284,0.000062034196,0.000015324407,0.000052048475,0.000014468206,0.00007701742,0.001861644],"genre_scores_gemma":[0.1831387,0.00016770556,0.8135019,0.00007976112,0.000028983735,0.0007727054,0.00008067608,0.00006399733,0.002165515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.0004840968,0.000025897049,0.000059301095,0.00018803087,0.00003507592],"domain_scores_gemma":[0.99864453,0.001051873,0.00007402365,0.000052552135,0.00013578453,0.00004122379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016731961,0.0007586039,0.0008411795,0.0008205637,0.0006472872,0.0006454425,0.001064348,0.00097625365,0.002755069],"category_scores_gemma":[0.0031960844,0.0005126421,0.0008771682,0.0009254047,0.00089477934,0.00059498503,0.0010505925,0.0011559702,0.0003113686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013124155,0.000017739614,0.00012599351,0.000019259714,0.000018741663,0.00002417272,0.00002001414,0.97387654,0.0004751224,0.0141538335,0.00019026158,0.011065119],"study_design_scores_gemma":[0.000010739102,0.000011486992,0.000019756511,0.000004749283,0.0000040071886,0.000009103631,0.0000029364983,0.99582124,0.00014764558,0.0034567215,0.00050812593,0.000003545821],"about_ca_topic_score_codex":0.0039053482,"about_ca_topic_score_gemma":0.004543227,"teacher_disagreement_score":0.0039053482,"about_ca_system_score_codex":0.0007421135,"about_ca_system_score_gemma":0.0015659692,"threshold_uncertainty_score":0.009216666},"labels":[],"label_agreement":null},{"id":"W2954785872","doi":"10.1016/j.asoc.2019.105588","title":"A Two-Engine interaction driven many-objective evolutionary algorithm with feasibility-aware adaptation","year":2019,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"National Key Research and Development Program of China; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; McGill University","keywords":"Computer science; Benchmark (surveying); Adaptation (eye); Evolutionary algorithm; Multi-objective optimization; Selection (genetic algorithm); Mathematical optimization; Population; Space (punctuation); Pareto principle; Artificial intelligence; Machine learning; Mathematics","score_opus":0.01164351555665493,"score_gpt":0.25376320152564247,"score_spread":0.24211968596898753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954785872","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.019309621,0.00016685082,0.9719598,0.00015413028,0.000107269654,0.000100383295,0.000028408102,0.0003923712,0.0077812215],"genre_scores_gemma":[0.4639448,0.00014156831,0.5277767,0.00021495757,0.000057242094,0.00046573704,0.00012054825,0.0001531723,0.007125202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971074,0.00007491872,0.000014400823,0.000046716636,0.000115641655,0.000037559428],"domain_scores_gemma":[0.9996674,0.0001462929,0.0000174407,0.00004575317,0.00008916146,0.00003404753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007121595,0.0007838756,0.0012242724,0.0005388265,0.000549248,0.0009828822,0.0023597663,0.0018524553,0.003769677],"category_scores_gemma":[0.0014477031,0.00054608955,0.00078451383,0.0006639216,0.00050260755,0.0006864327,0.0018581367,0.0011686906,0.0007095372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081474354,0.00012876438,0.00046972436,0.00006160414,0.00007685156,0.00012998734,0.000053901607,0.9125105,0.0039114403,0.009382364,0.0011607155,0.072032616],"study_design_scores_gemma":[0.000011962499,0.000016139575,0.000039663704,0.000002038651,0.0000060116067,0.000011636535,0.0000028813956,0.9989532,0.00017743319,0.00056282204,0.00021281,0.0000034165216],"about_ca_topic_score_codex":0.0022960585,"about_ca_topic_score_gemma":0.0029818933,"teacher_disagreement_score":0.003769677,"about_ca_system_score_codex":0.00035604465,"about_ca_system_score_gemma":0.0008473914,"threshold_uncertainty_score":0.012610793},"labels":[],"label_agreement":null},{"id":"W2963265176","doi":"10.5555/3157096.3157258","title":"Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangian","year":2016,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":10,"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; Advanced Scientific Computing Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Augmented Lagrangian method; Lagrangian; Variable (mathematics); Computer science; Bayesian probability; Mathematical optimization; Bayesian optimization; Lagrangian relaxation; Mathematics; Applied mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.0062627147488541444,"score_gpt":0.2231939715461903,"score_spread":0.21693125679733616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963265176","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.006471265,0.00017960717,0.98732495,0.00024045695,0.000026048077,0.000026807968,0.00007143857,0.00016862493,0.0054907957],"genre_scores_gemma":[0.21321768,0.00034525222,0.77648324,0.00021945211,0.00007585878,0.00020486265,0.00026999568,0.00031733062,0.008866317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00054953125,0.00003174753,0.00009845348,0.00022736927,0.0000755255],"domain_scores_gemma":[0.9983247,0.0010905358,0.0001719507,0.00013715617,0.00019603554,0.00007958866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002439226,0.0012681639,0.0010415005,0.00080048625,0.0004974607,0.0018668638,0.00083308306,0.0013874328,0.0050230105],"category_scores_gemma":[0.0049525965,0.0006884053,0.00076904445,0.0010698416,0.0012697321,0.0019392569,0.0020934916,0.0018196062,0.0009541947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005971129,0.000041586758,0.00037377648,0.00008196392,0.0000339196,0.00009961647,0.000041191295,0.85241365,0.001456889,0.11616645,0.0025976575,0.026633644],"study_design_scores_gemma":[0.000009311189,0.000009502236,0.000032985667,0.000008782209,0.0000029989412,0.0000097291895,0.000003628034,0.98322004,0.00021813373,0.015559565,0.0009214737,0.0000038903604],"about_ca_topic_score_codex":0.003697505,"about_ca_topic_score_gemma":0.0050818184,"teacher_disagreement_score":0.0050230105,"about_ca_system_score_codex":0.0010001828,"about_ca_system_score_gemma":0.0016166075,"threshold_uncertainty_score":0.016803622},"labels":[],"label_agreement":null},{"id":"W2964033023","doi":"10.1115/1.4044321","title":"Multi-Fidelity Modeling and Adaptive Co-Kriging-Based Optimization for All-Electric Geostationary Orbit Satellite Systems","year":2019,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Aeronautical Science Foundation of China; International Cooperation and Exchange Programme; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Kriging; Multidisciplinary design optimization; Geostationary orbit; Computer science; Metamodeling; Satellite; Optimization problem; Mathematical optimization; Aerospace engineering; Engineering; Algorithm; Mathematics; Multidisciplinary approach; Machine learning","score_opus":0.049927553643281254,"score_gpt":0.2998007894296624,"score_spread":0.24987323578638113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964033023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060702235,0.00028853677,0.9353449,0.00020366466,0.000024712133,0.000036026104,0.000073639596,0.00017955611,0.00314676],"genre_scores_gemma":[0.93548614,0.000163058,0.06281457,0.00004496184,0.000013409849,0.000087768705,0.000092321534,0.000040053128,0.0012576658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.000114098155,0.000013803845,0.000051604202,0.00009868367,0.000037587455],"domain_scores_gemma":[0.999561,0.00021986783,0.000077881064,0.000033257566,0.000081573366,0.0000262753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584727,0.0006335806,0.0007520725,0.00044628707,0.00039644045,0.0007106849,0.000712109,0.00086261064,0.0009536716],"category_scores_gemma":[0.0012345868,0.00051991973,0.000762562,0.00050716015,0.0005023846,0.00054358545,0.0007159905,0.00093018357,0.00011008159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049891014,0.000004575284,0.00019371735,0.000007198488,0.000004655368,0.000008052267,0.00000485689,0.9975132,0.0002294421,0.0005191034,0.000037081314,0.0014731942],"study_design_scores_gemma":[7.684207e-7,0.0000021037156,0.000032043146,7.341236e-7,7.9796575e-7,6.6691933e-7,0.0000012343705,0.99973077,0.000047667352,0.0001393987,0.00004306411,6.835232e-7],"about_ca_topic_score_codex":0.025282154,"about_ca_topic_score_gemma":0.013792399,"teacher_disagreement_score":0.025282154,"about_ca_system_score_codex":0.000868652,"about_ca_system_score_gemma":0.0012278956,"threshold_uncertainty_score":0.05026996},"labels":[],"label_agreement":null},{"id":"W2964235255","doi":"10.48550/arxiv.1706.06926","title":"Trade-off preservation in inverse multi-objective convex optimization","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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; University of New Brunswick","funders":"","keywords":"Mathematical optimization; Inverse; Linear programming; Mathematics; Computer science; Convex optimization; Pareto principle; Measure (data warehouse); Regular polygon","score_opus":0.07990169809114857,"score_gpt":0.229607976579074,"score_spread":0.14970627848792545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964235255","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.0046237772,0.000083229774,0.99414283,0.00011023146,0.000008602705,0.000014774694,0.000008790928,0.000036153553,0.00097164745],"genre_scores_gemma":[0.4910805,0.00034293,0.5043758,0.00021268796,0.000070751616,0.00024702982,0.000102942104,0.0001971102,0.0033702387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759644,0.0012213017,0.00010911883,0.00030218542,0.00065338006,0.00011750902],"domain_scores_gemma":[0.9942477,0.003989113,0.00054759235,0.0006881656,0.00040205783,0.00012541907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005373455,0.0014005944,0.0015672,0.0010865704,0.0005760204,0.0019382224,0.002158839,0.0016949318,0.0018636255],"category_scores_gemma":[0.01348075,0.00092087843,0.0019535786,0.0012038408,0.0027251213,0.0034703296,0.0032013662,0.0035247614,0.00032627958],"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.00003748871,0.00005718385,0.00042122707,0.00009459365,0.000043796572,0.00006199735,0.000104567116,0.89918756,0.0013265918,0.07712375,0.00034951937,0.021191737],"study_design_scores_gemma":[0.0000037334994,0.00003447212,0.00003968875,0.000008102534,0.0000048235192,0.0000177723,0.000007329787,0.97268766,0.00043896472,0.0264868,0.00026527877,0.0000053993967],"about_ca_topic_score_codex":0.0014537369,"about_ca_topic_score_gemma":0.0011912148,"teacher_disagreement_score":0.005373455,"about_ca_system_score_codex":0.0013644379,"about_ca_system_score_gemma":0.0011578938,"threshold_uncertainty_score":0.028417826},"labels":[],"label_agreement":null},{"id":"W2964281761","doi":"10.1016/j.artint.2013.10.003","title":"Algorithm runtime prediction: Methods &amp; evaluation","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"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; Parameterized complexity; Generalization; Range (aeronautics); Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Mathematics","score_opus":0.08348968459179722,"score_gpt":0.38890349694185905,"score_spread":0.3054138123500618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964281761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30780235,0.011347366,0.5584912,0.0017492905,0.0021978277,0.001096779,0.0070340005,0.07712616,0.033154994],"genre_scores_gemma":[0.5379767,0.0017179243,0.4327078,0.00036350734,0.00029956902,0.000734752,0.008569272,0.004345642,0.013284807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383295,0.002112641,0.00038796794,0.0011005463,0.0021531873,0.00041267616],"domain_scores_gemma":[0.9765577,0.012685441,0.0008447762,0.0043394524,0.004965544,0.0006070877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006103894,0.00209822,0.0015209602,0.0021458368,0.00086309784,0.002154565,0.0029772029,0.0020714803,0.011727213],"category_scores_gemma":[0.028743058,0.00050292624,0.00084005244,0.0023240391,0.00073658465,0.0028009778,0.0014844821,0.0016514238,0.0047236634],"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.0046013477,0.0018861161,0.006201893,0.0009984288,0.00034964972,0.000078855366,0.00012555133,0.18513761,0.0043034707,0.0025612556,0.044973426,0.7487825],"study_design_scores_gemma":[0.00047805381,0.0005830204,0.0024590825,0.00008956645,0.00015321923,0.00009467196,0.00007411572,0.97198445,0.01586198,0.001851549,0.0063242647,0.000045944253],"about_ca_topic_score_codex":0.009824339,"about_ca_topic_score_gemma":0.009861648,"teacher_disagreement_score":0.011727213,"about_ca_system_score_codex":0.0015334855,"about_ca_system_score_gemma":0.0026883767,"threshold_uncertainty_score":0.03923142},"labels":[],"label_agreement":null},{"id":"W2966894080","doi":"10.1109/cec.2019.8790351","title":"CGDE3: An Efficient Center-based Algorithm for Solving Large-scale Multi-objective Optimization Problems","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ontario Tech University","funders":"","keywords":"Differential evolution; Mathematical optimization; Initialization; Computer science; Population; Evolutionary algorithm; Optimization problem; Algorithm; Meta-optimization; Sampling (signal processing); Continuous optimization; Population-based incremental learning; Evolutionary computation; Multi-objective optimization; Mathematics; Multi-swarm optimization; Genetic algorithm","score_opus":0.01355382209919603,"score_gpt":0.26493944183685386,"score_spread":0.25138561973765783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966894080","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.010106508,0.0004329996,0.9859097,0.0001343111,0.00006754771,0.00009317949,0.000069653965,0.0008328809,0.0023531702],"genre_scores_gemma":[0.20796253,0.00038141324,0.78692126,0.00023022034,0.000041527863,0.0005312277,0.0003939819,0.00025046105,0.0032873955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.00008520223,0.000021551621,0.00005616795,0.00014757385,0.000039840135],"domain_scores_gemma":[0.9995907,0.00019290023,0.000039157407,0.000031928514,0.0001167195,0.000028469314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082713406,0.0012037181,0.0012727845,0.00079453393,0.00065126264,0.0006358617,0.001416402,0.0013582458,0.00240335],"category_scores_gemma":[0.0016167121,0.00041568652,0.0010476301,0.00092366803,0.0005009942,0.00066636375,0.0010618946,0.0013654149,0.0004999838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009181449,0.0000827456,0.0008158719,0.00013144394,0.000105170606,0.00011038889,0.00007226505,0.85749644,0.0041263974,0.006314739,0.004005157,0.1266476],"study_design_scores_gemma":[0.00003140607,0.000024190605,0.00008456131,0.0000061632145,0.0000073715637,0.000024888473,0.000006793685,0.9960007,0.0008760639,0.0013436277,0.0015877051,0.000006448051],"about_ca_topic_score_codex":0.007572782,"about_ca_topic_score_gemma":0.008623665,"teacher_disagreement_score":0.007572782,"about_ca_system_score_codex":0.00060978485,"about_ca_system_score_gemma":0.0015081003,"threshold_uncertainty_score":0.015057385},"labels":[],"label_agreement":null},{"id":"W2967473668","doi":"10.22725/icasp13.093","title":"Bayesian optimization in effective dimensions via kernel-based sensitivity indices","year":2019,"lang":"en","type":"article","venue":"Seoul National University Open Repository (Seoul National University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Safran Electronics (Canada)","funders":"","keywords":"Mathematical optimization; Mathematics; Bayesian optimization; Reproducing kernel Hilbert space; Feature selection; Dimension (graph theory); Optimization problem; Sensitivity (control systems); Computer science; Machine learning; Hilbert space","score_opus":0.0065704039077710856,"score_gpt":0.22049316798354882,"score_spread":0.21392276407577773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967473668","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.009047235,0.00013420903,0.9893946,0.000104464205,0.000009112829,0.00003142099,0.00001875106,0.00011590746,0.0011441996],"genre_scores_gemma":[0.5402174,0.00050310016,0.45550123,0.00018880735,0.000063438376,0.00042205225,0.00015339129,0.00028044326,0.002670046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978023,0.0012477816,0.000086487074,0.00021191589,0.00054013357,0.00011141653],"domain_scores_gemma":[0.9934196,0.0050394195,0.0004414208,0.00034723547,0.00060877594,0.0001435671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005600073,0.001277994,0.0014395973,0.0018289326,0.0005361811,0.0019853946,0.0010502227,0.001245972,0.0017615034],"category_scores_gemma":[0.015202921,0.00084048643,0.0011438946,0.00097011,0.0018148973,0.0025466187,0.0032378878,0.0017642387,0.00033609476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006086041,0.0000610622,0.0006923756,0.000096243784,0.00008658592,0.00003468982,0.00008313762,0.89742035,0.0022653958,0.05971008,0.00062319834,0.038866118],"study_design_scores_gemma":[0.0000039551837,0.000014221718,0.00010929235,0.000008953467,0.000006252632,0.0000071784193,0.0000045738298,0.9848567,0.00043793904,0.014358688,0.00018309763,0.000008958412],"about_ca_topic_score_codex":0.0016347738,"about_ca_topic_score_gemma":0.00148559,"teacher_disagreement_score":0.005600073,"about_ca_system_score_codex":0.0012362135,"about_ca_system_score_gemma":0.0015408003,"threshold_uncertainty_score":0.029616416},"labels":[],"label_agreement":null},{"id":"W2967673584","doi":"10.48550/arxiv.1908.05357","title":"Sequential Computer Experimental Design for Estimating an Extreme Probability or Quantile","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"","keywords":"Quantile; Computer science; Monte Carlo method; Code (set theory); Computer experiment; Source code; Probability distribution; Quality (philosophy); Algorithm; Statistics; Mathematics; Set (abstract data type); Simulation","score_opus":0.24125816844910142,"score_gpt":0.2674207027034251,"score_spread":0.02616253425432369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967673584","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.0150256995,0.00005725695,0.9832355,0.000081828664,0.00003292477,0.00063946756,0.00006364077,0.0002573649,0.0006063854],"genre_scores_gemma":[0.24250326,0.00010657763,0.75026375,0.00014827606,0.00003733556,0.0060736164,0.00018466564,0.00009435872,0.0005881301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98388636,0.012199414,0.00045263424,0.0016541206,0.001505768,0.00030181516],"domain_scores_gemma":[0.9363834,0.048600093,0.0046479255,0.006852928,0.0030188493,0.0004967607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028022582,0.0014762973,0.0013331167,0.0010464321,0.00056166045,0.0011745191,0.0016324859,0.0014543933,0.004050006],"category_scores_gemma":[0.0708641,0.0008626752,0.0009336802,0.0010194771,0.0026123098,0.0015407342,0.0015292707,0.002525857,0.00047266245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032749302,0.0009921149,0.00841895,0.0011811873,0.00060922175,0.00011117599,0.00030485383,0.6320317,0.020956375,0.20014744,0.001564596,0.13040747],"study_design_scores_gemma":[0.00053066335,0.0028453302,0.0021403467,0.0000831306,0.000110190245,0.00004319889,0.000040818406,0.89042175,0.013532768,0.08767095,0.0025267364,0.000054092827],"about_ca_topic_score_codex":0.0007181061,"about_ca_topic_score_gemma":0.00066529197,"teacher_disagreement_score":0.028022582,"about_ca_system_score_codex":0.0012063668,"about_ca_system_score_gemma":0.0023265525,"threshold_uncertainty_score":0.14819938},"labels":[],"label_agreement":null},{"id":"W2972091841","doi":"10.1115/detc2018-85325","title":"Knowledge Assisted Optimization for Large-Scale Problems: A Review and Proposition","year":2018,"lang":"en","type":"review","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Knowledge engineering; Engineering optimization; Scale (ratio); Domain knowledge; Knowledge-based systems; Optimization problem; Industrial engineering; Management science; Data science; Artificial intelligence; Engineering","score_opus":0.04661742812093883,"score_gpt":0.35356159847491947,"score_spread":0.30694417035398064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972091841","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.0004113979,0.9830735,0.009831797,0.00090217596,0.00024641547,0.000022523885,0.00004188442,0.000030537656,0.005439834],"genre_scores_gemma":[0.0042990386,0.9872197,0.0066584405,0.00028613885,0.00031174746,0.00003522773,0.000069576585,0.000011620575,0.0011085664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941623,0.00011287603,0.00006976264,0.00012144515,0.00024643625,0.000033233977],"domain_scores_gemma":[0.9978277,0.0015871088,0.00012609344,0.000079335696,0.0003338963,0.00004580812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013486865,0.0010993242,0.0013308421,0.0028715052,0.00046251563,0.0018339683,0.0014338715,0.0018110349,0.00453515],"category_scores_gemma":[0.0030103463,0.0005568614,0.0009770697,0.0046786857,0.00092929107,0.0029799955,0.0010446183,0.0016078271,0.0019323004],"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.000034243072,0.00010826404,0.0002954,0.022113524,0.00015330441,0.00015871512,0.00015961006,0.0052669966,0.00084785925,0.051998764,0.015514292,0.903349],"study_design_scores_gemma":[0.000016647533,0.00012857735,0.0007693118,0.008555816,0.00025608196,0.00084808306,0.00018513072,0.004917976,0.00142362,0.044117544,0.93869823,0.00008309649],"about_ca_topic_score_codex":0.0015943865,"about_ca_topic_score_gemma":0.0016538446,"teacher_disagreement_score":0.00453515,"about_ca_system_score_codex":0.00076702994,"about_ca_system_score_gemma":0.0020393566,"threshold_uncertainty_score":0.015171528},"labels":[],"label_agreement":null},{"id":"W2973734321","doi":"10.1109/jsyst.2019.2939250","title":"Information-Based Hierarchical Planning for a Mobile Sensing Network in Environmental Mapping","year":2019,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Planner; Adaptive sampling; Motion planning; Distributed computing; Field (mathematics); Gaussian; Sampling (signal processing); Greedy algorithm; Mobile robot; Data mining; Real-time computing; Artificial intelligence; Algorithm; Computer vision; Mathematics","score_opus":0.010763115072522571,"score_gpt":0.2409295779204711,"score_spread":0.23016646284794853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973734321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015496704,0.00019162345,0.9831081,0.00014586344,0.000013143253,0.000044970227,0.000056398418,0.00013951969,0.00080362766],"genre_scores_gemma":[0.77514124,0.00027155844,0.22245644,0.00007890662,0.000026689931,0.00020096925,0.00017497166,0.000053584827,0.0015956404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00020125353,0.000020431688,0.00015289913,0.00010431917,0.000074716976],"domain_scores_gemma":[0.99881905,0.0007939426,0.00013328047,0.0000733536,0.00009717411,0.000083183804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011894222,0.0008770248,0.00096061185,0.0006465748,0.00072416913,0.00071492954,0.0014954766,0.00093936594,0.0013271935],"category_scores_gemma":[0.0029323325,0.000619781,0.0006095509,0.00082971575,0.0012201471,0.0015447108,0.0013458778,0.0009611913,0.0001600912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028567514,0.000013931899,0.00026543764,0.000028995311,0.000008744081,0.00003613749,0.000050409828,0.98416543,0.0005255478,0.0058384812,0.0002452646,0.008793031],"study_design_scores_gemma":[0.000003898351,0.000013890625,0.00004531001,0.0000019771112,0.0000023728999,0.0000066284865,0.000011253724,0.99686474,0.0001345325,0.0027621356,0.00015037412,0.0000028780407],"about_ca_topic_score_codex":0.013376145,"about_ca_topic_score_gemma":0.014413394,"teacher_disagreement_score":0.013376145,"about_ca_system_score_codex":0.0015516122,"about_ca_system_score_gemma":0.00199922,"threshold_uncertainty_score":0.026596606},"labels":[],"label_agreement":null},{"id":"W2983933840","doi":"10.1108/ec-04-2019-0146","title":"A sequential sampling method for adaptive metamodeling using data with highly nonlinear relation between input and output parameters","year":2019,"lang":"en","type":"article","venue":"Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Metamodeling; Latin hypercube sampling; Kriging; Adaptive sampling; Sampling (signal processing); Nonlinear system; Relation (database); Input/output; Computer science; Mathematical optimization; Algorithm; Mathematics; Data mining; Monte Carlo method; Machine learning; Statistics","score_opus":0.08569164701266536,"score_gpt":0.3310697766606284,"score_spread":0.24537812964796307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983933840","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.0050875074,0.000034423156,0.9944376,0.000017528571,0.000007772192,0.000033722696,0.00002203208,0.00009805711,0.0002613196],"genre_scores_gemma":[0.25578183,0.0001602347,0.7421593,0.000052172716,0.00002742945,0.00043211743,0.00026991902,0.00008512483,0.0010318792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989575,0.00048037464,0.00006322085,0.00016241793,0.00029807037,0.000038360307],"domain_scores_gemma":[0.9982784,0.0009838165,0.00015005236,0.00018307118,0.00036277698,0.000041930853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021728552,0.000709309,0.00070461846,0.0008287636,0.0004886954,0.00045916848,0.00090056506,0.0005060958,0.0018113004],"category_scores_gemma":[0.0043627424,0.00036673603,0.00084512105,0.0007657777,0.00047548793,0.00083016406,0.0007652649,0.00075362175,0.0002736708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021347331,0.00013964438,0.004818203,0.0002729389,0.000120258206,0.00011880424,0.00025687768,0.763353,0.015181482,0.016297944,0.0009476146,0.19827977],"study_design_scores_gemma":[0.000013566742,0.00007408225,0.00033774512,0.000010839688,0.000010782497,0.000030945994,0.000017564525,0.99295205,0.0025313473,0.0029773249,0.0010332083,0.000010556655],"about_ca_topic_score_codex":0.003910616,"about_ca_topic_score_gemma":0.0041461727,"teacher_disagreement_score":0.003910616,"about_ca_system_score_codex":0.00045631203,"about_ca_system_score_gemma":0.0009798066,"threshold_uncertainty_score":0.011491299},"labels":[],"label_agreement":null},{"id":"W2988052337","doi":"10.1007/s40313-019-00526-2","title":"Applying Social Choice Theory to Solve Engineering Multi-objective Optimization Problems","year":2019,"lang":"en","type":"article","venue":"Journal of Control Automation and Electrical Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Waterloo","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Heuristics; Mathematical optimization; Computer science; Heuristic; Social choice theory; Domain (mathematical analysis); Voting; Optimization problem; Mathematics; Mathematical economics","score_opus":0.007045113322051408,"score_gpt":0.23227425077612227,"score_spread":0.22522913745407086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988052337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017914753,0.0003860027,0.97520036,0.0006423551,0.00011429386,0.00015265284,0.000039076196,0.000032916312,0.005517648],"genre_scores_gemma":[0.62312925,0.00088250695,0.3680797,0.00030199284,0.00023919214,0.00090484874,0.00011830045,0.00008411847,0.00626015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520564,0.00363476,0.00012117697,0.00021209921,0.00059123687,0.00023514417],"domain_scores_gemma":[0.98288625,0.015682392,0.0004400711,0.00024120255,0.00053876743,0.00021133597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007713828,0.0013751751,0.0021685823,0.0020343561,0.0009621814,0.0022793273,0.0017184329,0.0023336578,0.0042517195],"category_scores_gemma":[0.015991766,0.00085734087,0.002331239,0.0017968025,0.0021664093,0.0021229016,0.0026541941,0.0024300676,0.00021244005],"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.000035874193,0.00015518499,0.0008142049,0.00012392383,0.00017781461,0.000074885415,0.00007355252,0.8687509,0.00018123076,0.114291385,0.0005876417,0.014733429],"study_design_scores_gemma":[0.000018370778,0.000033118245,0.00009849383,0.000013765129,0.000012433884,0.0000062857125,0.000025395642,0.93626547,0.000047906706,0.06309713,0.00037477622,0.0000068750164],"about_ca_topic_score_codex":0.0049618776,"about_ca_topic_score_gemma":0.004427382,"teacher_disagreement_score":0.007713828,"about_ca_system_score_codex":0.0019487316,"about_ca_system_score_gemma":0.0026354,"threshold_uncertainty_score":0.040795088},"labels":[],"label_agreement":null},{"id":"W2993305012","doi":"10.1016/j.finel.2020.103400","title":"Multi-fidelity bayesian optimization using model-order reduction for viscoplastic structures","year":2020,"lang":"en","type":"article","venue":"Finite Elements in Analysis and Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Safran Electronics (Canada)","funders":"","keywords":"Viscoplasticity; Reduction (mathematics); Fidelity; Model order reduction; Computer science; Mathematical optimization; Bayesian optimization; Computation; High fidelity; Finite element method; Decomposition; Bayesian probability; Algorithm; Mathematics; Artificial intelligence; Engineering; Constitutive equation; Structural engineering","score_opus":0.05786467632426533,"score_gpt":0.3163782550403253,"score_spread":0.25851357871605996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993305012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003613421,0.0001326261,0.9950589,0.00011964527,0.000015641837,0.000016967755,0.00003356512,0.0001072346,0.0009020088],"genre_scores_gemma":[0.38091686,0.00053644396,0.6107252,0.00023804135,0.00008237319,0.00033276033,0.00037711702,0.00048279492,0.0063083284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.0002455716,0.000023804965,0.00007318864,0.00024352768,0.000042891454],"domain_scores_gemma":[0.9976407,0.0017222976,0.00018282482,0.00013540545,0.00024936243,0.00006945683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018512813,0.0009425828,0.0017757702,0.0008970333,0.0005709343,0.0011744776,0.0014216189,0.0020675608,0.002446243],"category_scores_gemma":[0.0066384394,0.0017096766,0.0011959273,0.00071018597,0.0011401545,0.0015391939,0.0018756925,0.0025613508,0.0005052208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022907865,0.000022866176,0.00009992013,0.000038952247,0.000019148052,0.0000148825975,0.000024610841,0.97857714,0.00059951027,0.010674794,0.00030838882,0.00959677],"study_design_scores_gemma":[0.0000020137963,0.0000028747875,0.000014736432,0.0000030388023,0.0000019066786,0.0000026789833,0.0000013025118,0.9974353,0.000109563734,0.002306207,0.00011815196,0.000002334831],"about_ca_topic_score_codex":0.007434063,"about_ca_topic_score_gemma":0.009238641,"teacher_disagreement_score":0.007434063,"about_ca_system_score_codex":0.0012559055,"about_ca_system_score_gemma":0.0018856585,"threshold_uncertainty_score":0.014781594},"labels":[],"label_agreement":null},{"id":"W2996735224","doi":"10.3390/agriculture10010003","title":"Time–Cost–Quality Trade-Off in a Broiler Production Project Using Meta-Heuristic Algorithms: A Case Study","year":2019,"lang":"en","type":"article","venue":"Agriculture","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Dalhousie University","funders":"","keywords":"Particle swarm optimization; Algorithm; Production (economics); Quality (philosophy); Fuzzy logic; Mathematical optimization; Process (computing); Meta heuristic; Interval (graph theory); Computer science; Heuristic; Function (biology); Mathematics; Operations research; Economics; Artificial intelligence","score_opus":0.054499627479857544,"score_gpt":0.33105631575690614,"score_spread":0.2765566882770486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996735224","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.93836033,0.0013898312,0.05032662,0.0005092217,0.000040063624,0.0003402077,0.00021877783,0.00015035937,0.00866471],"genre_scores_gemma":[0.9672537,0.0004573618,0.030057978,0.0000322493,0.00000930569,0.0001391934,0.000119052864,0.00001886631,0.0019123915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992269,0.00037711646,0.000036761812,0.00007723524,0.00012642545,0.00015550847],"domain_scores_gemma":[0.998099,0.0013394586,0.0001417923,0.00006161465,0.0002082972,0.0001496974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023728963,0.0013974819,0.0011581762,0.0018528133,0.0012487515,0.0019002408,0.0012925017,0.0033226206,0.0016556721],"category_scores_gemma":[0.0024758077,0.00071179174,0.0016404534,0.0016036448,0.00063849246,0.0009252702,0.000744435,0.0009891725,0.0001287369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016750273,0.00033787344,0.002315377,0.00014014199,0.00007430501,0.000904435,0.000054610875,0.98424083,0.0007724085,0.001093731,0.00025803648,0.009640712],"study_design_scores_gemma":[0.000061167535,0.00029076534,0.0013760406,0.000023496948,0.0000534899,0.000107429085,0.00016130353,0.9958715,0.0010693838,0.00057483895,0.00039077268,0.000019815003],"about_ca_topic_score_codex":0.018178115,"about_ca_topic_score_gemma":0.017923128,"teacher_disagreement_score":0.018178115,"about_ca_system_score_codex":0.0023301134,"about_ca_system_score_gemma":0.0016740463,"threshold_uncertainty_score":0.036144614},"labels":[],"label_agreement":null},{"id":"W3001500280","doi":"10.2514/1.a34616","title":"Optimization of a Supersonic Rocket-Based Combined Cycle Inlet Using Differential Evolution","year":2020,"lang":"en","type":"article","venue":"Journal of Spacecraft and Rockets","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mach number; Supersonic speed; Rocket (weapon); Aerospace engineering; Differential evolution; Mechanics; Inlet; Control theory (sociology); Physics; Mathematics; Engineering; Mathematical optimization; Computer science; Mechanical engineering","score_opus":0.015361678713844902,"score_gpt":0.2392464868236812,"score_spread":0.2238848081098363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001500280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28642064,0.00028243908,0.69838357,0.000095994954,0.00004994845,0.00016562176,0.00009482311,0.00054285035,0.01396409],"genre_scores_gemma":[0.8485648,0.00012143887,0.14463075,0.0000352318,0.000007751897,0.0002024772,0.0001445606,0.00005193537,0.0062409313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998499,0.000023949342,0.0000060689454,0.000031005464,0.000058284073,0.00003073567],"domain_scores_gemma":[0.999808,0.000076076816,0.00003211544,0.000014507431,0.000048770537,0.000020570233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993492,0.0005067586,0.0006952732,0.0005175156,0.00039657688,0.0007201147,0.00073958526,0.00089318305,0.0021052393],"category_scores_gemma":[0.0005901626,0.00029718198,0.0004995141,0.0003462452,0.00031315483,0.00033638178,0.00055346004,0.00044498485,0.0003042853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010239103,0.00007019617,0.0014472785,0.0000739519,0.000024248622,0.00010569619,0.000049086957,0.9517763,0.013033379,0.002110782,0.00029449648,0.030912183],"study_design_scores_gemma":[0.000013969173,0.00012827096,0.0003870303,0.0000058355763,0.000009933913,0.000019827348,0.000011704206,0.99502856,0.003382435,0.00023463463,0.0007712653,0.0000064594865],"about_ca_topic_score_codex":0.0023430164,"about_ca_topic_score_gemma":0.0027429173,"teacher_disagreement_score":0.0023430164,"about_ca_system_score_codex":0.0005334622,"about_ca_system_score_gemma":0.0007486006,"threshold_uncertainty_score":0.007042706},"labels":[],"label_agreement":null},{"id":"W3003586727","doi":"10.1016/j.asoc.2020.106143","title":"Adaptive repair method for constraint handling in multi-objective genetic algorithm based on relationship between constraints and variables","year":2020,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","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; Institute for Computing, Information and Cognitive Systems","keywords":"Mathematical optimization; Constraint (computer-aided design); Feasible region; Computer science; Evolutionary algorithm; Genetic algorithm; Metric (unit); Multi-objective optimization; Convergence (economics); Variable (mathematics); Optimization problem; Algorithm; Mathematics; Engineering","score_opus":0.05105968804820702,"score_gpt":0.3041225723608524,"score_spread":0.25306288431264534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003586727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007109024,0.0001306026,0.99140394,0.000056334622,0.000041788106,0.000035458615,0.000012284216,0.0001992018,0.0010113398],"genre_scores_gemma":[0.37788588,0.00025178533,0.61705667,0.00014926071,0.00006606919,0.00030134773,0.00011753174,0.00014707266,0.0040243645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.00015693494,0.000032475262,0.00011082802,0.00017983468,0.000036865647],"domain_scores_gemma":[0.99926764,0.0003492371,0.000075189426,0.00005572916,0.00022980619,0.00002242851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009816211,0.00063145556,0.0009040771,0.0007894521,0.0005428963,0.00064464455,0.001876732,0.0011649177,0.003163381],"category_scores_gemma":[0.0023064339,0.00039409837,0.0006348808,0.00082431565,0.00051292777,0.001059684,0.0007641966,0.001072172,0.000330148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014698358,0.000116025476,0.0008208093,0.00020470525,0.00008982836,0.00016254201,0.0002370353,0.769696,0.0116113145,0.016077187,0.0016705517,0.19916703],"study_design_scores_gemma":[0.000011553342,0.000030073334,0.00009578692,0.000007569565,0.000013914796,0.000026461026,0.000008929502,0.9973954,0.0008868035,0.001085365,0.00043180748,0.0000063828384],"about_ca_topic_score_codex":0.005416982,"about_ca_topic_score_gemma":0.0042080944,"teacher_disagreement_score":0.005416982,"about_ca_system_score_codex":0.000456464,"about_ca_system_score_gemma":0.0009285879,"threshold_uncertainty_score":0.010770917},"labels":[],"label_agreement":null},{"id":"W3003818284","doi":"","title":"Review of the quality of approximated Pareto fronts in multiobjective optimization, Journées de l'optimisation","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Multi-objective optimization; Pareto principle; Quality (philosophy); Computer science; Mathematical optimization; Pareto optimal; Mathematics; Physics","score_opus":0.022106832088032848,"score_gpt":0.28486614804166255,"score_spread":0.2627593159536297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003818284","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.0017621197,0.9357308,0.05556354,0.0011539737,0.00094024756,0.00001980223,0.00011434455,0.000056735884,0.0046583028],"genre_scores_gemma":[0.042374697,0.8897863,0.06217345,0.0005385946,0.0016209218,0.00006287993,0.00042252184,0.00012164742,0.0028989916],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979335,0.0005705978,0.00026703023,0.00027550038,0.0008857838,0.000067530884],"domain_scores_gemma":[0.99256927,0.004606533,0.00033165276,0.0003420042,0.0020646087,0.00008591411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045409244,0.0010203506,0.002031041,0.0032122112,0.00045686561,0.0034497858,0.0018530294,0.0014547214,0.0036642153],"category_scores_gemma":[0.015122019,0.00061905436,0.001000462,0.0055972217,0.0011100527,0.0031408106,0.0010528067,0.0017513036,0.0011254642],"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.00014331189,0.000047202808,0.00042216497,0.0143179605,0.00021081422,0.00008320305,0.00010819029,0.027161276,0.0018666306,0.046646766,0.014400451,0.8945919],"study_design_scores_gemma":[0.00006761804,0.0004656981,0.0043948153,0.017660309,0.000524251,0.001511545,0.00045245353,0.08211828,0.0072430344,0.094179444,0.79116195,0.00022056188],"about_ca_topic_score_codex":0.0019082241,"about_ca_topic_score_gemma":0.0019519988,"teacher_disagreement_score":0.0045409244,"about_ca_system_score_codex":0.0014198256,"about_ca_system_score_gemma":0.0014093991,"threshold_uncertainty_score":0.02401495},"labels":[],"label_agreement":null},{"id":"W3011340068","doi":"10.1115/1.4046650","title":"Sequential Radial Basis Function-Based Optimization Method Using Virtual Sample Generation","year":2020,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Beijing Institute of Technology; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Radial basis function; Computer science; Metamodeling; Mathematical optimization; Kriging; Robustness (evolution); Optimization problem; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.10168092833975943,"score_gpt":0.3123270109360753,"score_spread":0.21064608259631584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011340068","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.008542469,0.00011879456,0.9900163,0.000049890208,0.000023739729,0.000028846605,0.000016246622,0.00033083095,0.00087284046],"genre_scores_gemma":[0.52245975,0.00014466174,0.47480148,0.00012562545,0.0000323656,0.00025001194,0.00015206885,0.00013779399,0.001896242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.00015895219,0.000018442986,0.00006406014,0.00017109151,0.00002869609],"domain_scores_gemma":[0.9994542,0.00025213306,0.000053352574,0.00005921699,0.00015811465,0.00002293436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078820094,0.00075009454,0.0010160267,0.0005052458,0.00025529982,0.0004775224,0.00087468186,0.0006929355,0.0017746236],"category_scores_gemma":[0.001339278,0.0004015034,0.0006373853,0.0004345091,0.00039073348,0.00060796115,0.0005531658,0.000675839,0.00037307382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012510327,0.000059743707,0.00047707508,0.00010983939,0.00003955433,0.000043406646,0.00003527603,0.8981425,0.008346846,0.004238379,0.001016537,0.08736567],"study_design_scores_gemma":[0.0000060974417,0.000015800184,0.00002705926,0.0000016965088,0.000001836646,0.0000046275986,0.0000011956561,0.9989569,0.0004796037,0.00028064137,0.00022258691,0.0000020021675],"about_ca_topic_score_codex":0.002832853,"about_ca_topic_score_gemma":0.0021858518,"teacher_disagreement_score":0.002832853,"about_ca_system_score_codex":0.00039115758,"about_ca_system_score_gemma":0.00077803514,"threshold_uncertainty_score":0.005936682},"labels":[],"label_agreement":null},{"id":"W3011495853","doi":"10.1080/03155986.2020.1730677","title":"Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":15,"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":"Categorical variable; Mathematical optimization; Maximization; Computer science; Kernel (algebra); Benchmark (surveying); Gaussian; Gaussian process; Optimization problem; Kriging; Continuous optimization; Mathematics; Algorithm; Artificial intelligence; Machine learning; Multi-swarm optimization","score_opus":0.04782811463025451,"score_gpt":0.32053925902598396,"score_spread":0.27271114439572947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011495853","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.014121021,0.0001500774,0.98409015,0.00015678094,0.000014077729,0.000023066379,0.00004378908,0.000146461,0.0012545574],"genre_scores_gemma":[0.63327706,0.00020631686,0.36198077,0.00016849548,0.000035295845,0.0003858622,0.00024376938,0.0002471175,0.0034552724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919206,0.0004956631,0.000025688205,0.00009727782,0.0001197258,0.00006956006],"domain_scores_gemma":[0.99765897,0.001807302,0.00014568133,0.00012715836,0.00017699253,0.00008390128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029244926,0.0011143629,0.0012571447,0.00067238195,0.00031356263,0.0011727398,0.000986136,0.0013890609,0.0019023119],"category_scores_gemma":[0.0056216894,0.0004840216,0.001160277,0.00062073104,0.0010244284,0.0008585905,0.0016735053,0.0012492047,0.00029480306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044314034,0.000021903066,0.0003018825,0.000039406124,0.000020818372,0.000024983308,0.000018891044,0.9806563,0.00045043806,0.012061023,0.00025501937,0.0061048917],"study_design_scores_gemma":[0.0000036448898,0.0000135748905,0.000033781598,0.0000032634903,0.0000024147514,0.0000030272752,0.0000030706458,0.99682367,0.00011136246,0.0028955734,0.00010448474,0.0000020353607],"about_ca_topic_score_codex":0.002278992,"about_ca_topic_score_gemma":0.0019290202,"teacher_disagreement_score":0.0029244926,"about_ca_system_score_codex":0.0007642166,"about_ca_system_score_gemma":0.0012323845,"threshold_uncertainty_score":0.015466332},"labels":[],"label_agreement":null},{"id":"W3015993571","doi":"10.1007/s10898-022-01127-1","title":"Numerical certification of Pareto optimality for biobjective nonlinear problems","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Set (abstract data type); Pareto principle; Mathematical optimization; Class (philosophy); Mathematics; Polygon (computer graphics); Regular polygon; Computer science; Algorithm","score_opus":0.019277783038109963,"score_gpt":0.2869851079830246,"score_spread":0.26770732494491467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015993571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12468751,0.00046832947,0.8377427,0.0007012158,0.00022267694,0.00015547639,0.00010487253,0.00042279795,0.03549441],"genre_scores_gemma":[0.81328076,0.00017745631,0.18391462,0.00009179748,0.000022376631,0.00009215501,0.00015053716,0.00014494147,0.0021253198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982645,0.0007992656,0.000084865285,0.00010275313,0.0006200909,0.00012854152],"domain_scores_gemma":[0.9866976,0.009145872,0.00057515857,0.00096663024,0.00233052,0.00028418633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005763527,0.0007521614,0.0007885435,0.0016235961,0.0011491074,0.0020469187,0.0011132705,0.0018068184,0.0045391642],"category_scores_gemma":[0.033176046,0.00043389283,0.00065720157,0.0006883545,0.0023444647,0.0012697193,0.0022359309,0.0017093241,0.000403227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002722958,0.000126835,0.0018395687,0.0001873919,0.000035845125,0.00012902037,0.00011708963,0.8627089,0.004379261,0.0866729,0.0015195524,0.042011272],"study_design_scores_gemma":[0.000016130542,0.000032417403,0.00022475756,0.000029943361,0.0000037233694,0.000029409353,0.00002469111,0.98422396,0.0016120224,0.013325491,0.00046999758,0.000007473294],"about_ca_topic_score_codex":0.0025483367,"about_ca_topic_score_gemma":0.0022486055,"teacher_disagreement_score":0.005763527,"about_ca_system_score_codex":0.0009740244,"about_ca_system_score_gemma":0.0018572005,"threshold_uncertainty_score":0.030480802},"labels":[],"label_agreement":null},{"id":"W3021188214","doi":"10.46254/j.ieom.20190201","title":"Comparison Study of Discrete Optimization Problem Using Meta-Heuristic Approaches: A Case Study","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering and Operations Management","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure","funders":"","keywords":"Mathematical optimization; Ant colony optimization algorithms; Metaheuristic; Simulated annealing; Computer science; Particle swarm optimization; Genetic algorithm; Meta-optimization; Algorithm; Tabu search; Heuristics; Mathematics","score_opus":0.10075415801037864,"score_gpt":0.32113747098084416,"score_spread":0.22038331297046554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021188214","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.7617142,0.0034976166,0.21190324,0.0007378285,0.00018399225,0.00048157675,0.00043605905,0.00032582923,0.020719638],"genre_scores_gemma":[0.91847974,0.0005888966,0.0793977,0.000048493202,0.000018915904,0.00018823775,0.00011469612,0.000028179991,0.0011351312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989182,0.0006263484,0.000055714558,0.00008542813,0.0002022158,0.00011212707],"domain_scores_gemma":[0.9956856,0.0034622513,0.00020039185,0.00019283521,0.0003596265,0.00009936876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463409,0.0010143564,0.0011194017,0.0015493318,0.0005473752,0.0015384554,0.0010405217,0.0016016923,0.0018761685],"category_scores_gemma":[0.0042353906,0.0003648006,0.0010433756,0.0012340941,0.0004670515,0.0006698543,0.00053191563,0.00085014274,0.00015505553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018815459,0.00023967218,0.00096634694,0.00028253888,0.00010020671,0.00010827141,0.000040608087,0.975002,0.000815652,0.0026500742,0.00033381174,0.019272722],"study_design_scores_gemma":[0.00003910892,0.0003043171,0.00047882582,0.000026222679,0.000038208353,0.000040270792,0.00009269311,0.9962329,0.0012904922,0.0008387529,0.0006086902,0.000009472991],"about_ca_topic_score_codex":0.003775885,"about_ca_topic_score_gemma":0.0029871103,"teacher_disagreement_score":0.003775885,"about_ca_system_score_codex":0.0011116941,"about_ca_system_score_gemma":0.00093029795,"threshold_uncertainty_score":0.013027966},"labels":[],"label_agreement":null},{"id":"W3021190556","doi":"10.1007/s00158-020-02572-w","title":"Multi-model management for time-dependent multidisciplinary design optimization problems","year":2020,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Multidisciplinary design optimization; Multidisciplinary approach; Computer science; Context (archaeology); Mathematical optimization; Engineering design process; Process (computing); Convergence (economics); Industrial engineering; Mathematics; Engineering; Mechanical engineering","score_opus":0.030645738484828777,"score_gpt":0.2753018813591183,"score_spread":0.24465614287428955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021190556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008819445,0.000233452,0.98733646,0.00021671005,0.000051942894,0.000057656096,0.000054409997,0.00015816969,0.0030718644],"genre_scores_gemma":[0.64887893,0.00062298245,0.34048986,0.00027649492,0.00012249219,0.000713505,0.00035693677,0.00031166594,0.008227138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991386,0.0003731861,0.0000406687,0.000108028704,0.00026675977,0.0000726924],"domain_scores_gemma":[0.99863064,0.00068554236,0.00019876736,0.00015412153,0.00023984702,0.00009099704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019141784,0.0012309655,0.0016289488,0.0010243,0.0009882216,0.0019213348,0.0020725608,0.0021359771,0.0036922111],"category_scores_gemma":[0.0039136913,0.0008255037,0.0017805955,0.0009009083,0.0007551879,0.001870295,0.0026716043,0.0018959164,0.0005007245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136731505,0.000028523476,0.00011044976,0.000027390268,0.000022218874,0.000021208394,0.0000157047,0.9873762,0.00048509496,0.004081294,0.00023649489,0.0075816843],"study_design_scores_gemma":[0.0000019186584,0.000007884825,0.00001923766,0.0000025874226,0.0000037395546,0.0000033846916,0.000003985571,0.9976386,0.00010544882,0.001995982,0.00021543955,0.0000017764704],"about_ca_topic_score_codex":0.004321833,"about_ca_topic_score_gemma":0.0047113495,"teacher_disagreement_score":0.004321833,"about_ca_system_score_codex":0.00104183,"about_ca_system_score_gemma":0.0013960939,"threshold_uncertainty_score":0.012351692},"labels":[],"label_agreement":null},{"id":"W3023765545","doi":"10.3390/econometrics4010012","title":"Evolutionary Sequential Monte Carlo Samplers for Change-Point Models","year":2016,"lang":"en","type":"article","venue":"Econometrics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Markov chain Monte Carlo; Particle filter; Monte Carlo method; Computer science; Algorithm; Marginal likelihood; Mathematical optimization; Inference; Heuristic; Mathematics; Bayesian probability; Artificial intelligence; Statistics; Kalman filter","score_opus":0.12649954573386915,"score_gpt":0.2851502513235134,"score_spread":0.15865070558964425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023765545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028024116,0.00015743899,0.99580896,0.00007377356,0.000024931403,0.000041740062,0.000032178395,0.00011695454,0.000941584],"genre_scores_gemma":[0.21289337,0.00063637487,0.77897644,0.00020085188,0.00012874516,0.0006794452,0.0004892554,0.0002851954,0.0057102954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843234,0.0008821996,0.00006014363,0.00022725087,0.000312857,0.00008515498],"domain_scores_gemma":[0.9908937,0.007343061,0.00041908683,0.00050060137,0.0006545532,0.00018896796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048389924,0.0009529614,0.0013570653,0.0014484326,0.0007341264,0.0012821277,0.0020128712,0.0015957322,0.0077650943],"category_scores_gemma":[0.021527598,0.00079525466,0.0012102321,0.0013245291,0.0015220497,0.0015305715,0.0017059977,0.0022547375,0.0010637328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085542546,0.000052259697,0.0014976482,0.00011290248,0.00009039972,0.00009737027,0.00010636473,0.7287289,0.00049726677,0.22546087,0.0013110307,0.041959547],"study_design_scores_gemma":[0.000014772143,0.000010192735,0.00008234763,0.000012508903,0.000007783452,0.00001545007,0.000005390756,0.95186466,0.00012693516,0.046858132,0.0009960652,0.0000057866037],"about_ca_topic_score_codex":0.0044906903,"about_ca_topic_score_gemma":0.005906313,"teacher_disagreement_score":0.0077650943,"about_ca_system_score_codex":0.0012469995,"about_ca_system_score_gemma":0.0014484429,"threshold_uncertainty_score":0.025976777},"labels":[],"label_agreement":null},{"id":"W3024820404","doi":"","title":"Optimal Scale Response Format: A Generalizability Theory Perspective","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Generalizability theory; Perspective (graphical); Scale (ratio); Computer science; Data science; Mathematics; Artificial intelligence; Statistics; Geography; Cartography","score_opus":0.008989443071572683,"score_gpt":0.2704387601367444,"score_spread":0.2614493170651717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024820404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024599588,0.00025299177,0.92688197,0.0042032166,0.00035732856,0.00079003104,0.0004038724,0.0007579768,0.04175312],"genre_scores_gemma":[0.740108,0.00041452158,0.2425571,0.0019616592,0.0008554989,0.0027090746,0.0005577655,0.00042950918,0.010406944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98006105,0.01300154,0.0008547203,0.0024809008,0.0029687246,0.00063305674],"domain_scores_gemma":[0.8685659,0.09127919,0.004207025,0.023239685,0.0117784375,0.00092982256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02997881,0.0012436446,0.0017715826,0.0019955179,0.0013813733,0.004957409,0.0034796621,0.0028443376,0.029069282],"category_scores_gemma":[0.19463114,0.000824164,0.0016458835,0.0021741188,0.0040410645,0.010219785,0.0037274112,0.0038881847,0.0028076917],"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.00077801745,0.00034223025,0.002606851,0.00031381726,0.00014940284,0.00009883169,0.0009292195,0.016552437,0.002209102,0.8425322,0.006653318,0.1268346],"study_design_scores_gemma":[0.00015233384,0.00028861823,0.0010694015,0.00007049224,0.0000663119,0.00009135947,0.00039518948,0.057838365,0.0015246144,0.93555814,0.0029068072,0.000038298786],"about_ca_topic_score_codex":0.0007791823,"about_ca_topic_score_gemma":0.00042996666,"teacher_disagreement_score":0.02997881,"about_ca_system_score_codex":0.0012919774,"about_ca_system_score_gemma":0.001630722,"threshold_uncertainty_score":0.15854502},"labels":[],"label_agreement":null},{"id":"W3028365645","doi":"10.1016/j.swevo.2020.100713","title":"Surrogate-assisted grey wolf optimization for high-dimensional, computationally expensive black-box problems","year":2020,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Surrogate model; Robustness (evolution); Global optimization; Computation; Optimization problem; Local search (optimization); Mathematical optimization; Artificial intelligence; Radial basis function; Algorithm; Data mining; Machine learning; Mathematics; Artificial neural network","score_opus":0.023331193630724365,"score_gpt":0.251606041909398,"score_spread":0.22827484827867364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028365645","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.015359717,0.0004197533,0.9792063,0.0002326738,0.00006109463,0.00003192756,0.00003368115,0.0001595054,0.0044952207],"genre_scores_gemma":[0.62697214,0.0006035681,0.3641323,0.00020696006,0.00007231691,0.0002860443,0.00019235634,0.00021369083,0.0073205866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937576,0.00033286668,0.000020763475,0.000040420495,0.00018137888,0.000048922793],"domain_scores_gemma":[0.9985013,0.0010841523,0.00009079655,0.00008491562,0.00017196225,0.000066879606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002177823,0.00062642276,0.0016925709,0.0005195975,0.00041605384,0.0010859024,0.0009508899,0.0019028164,0.002729967],"category_scores_gemma":[0.0043971995,0.000548479,0.0006363164,0.0008050063,0.0009793269,0.00094719435,0.0012828992,0.0014597026,0.00041977936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054510227,0.000027945798,0.00013477496,0.0000676976,0.000021296997,0.000046538706,0.000021918788,0.9776405,0.0009078897,0.009472525,0.00057829387,0.011026159],"study_design_scores_gemma":[0.00000392,0.00000849278,0.000017752982,0.000003707504,0.000001449667,0.0000047244785,0.0000015745551,0.9977549,0.00013178578,0.0019053235,0.00016516814,0.0000012669498],"about_ca_topic_score_codex":0.0013093532,"about_ca_topic_score_gemma":0.0011058842,"teacher_disagreement_score":0.002729967,"about_ca_system_score_codex":0.0005006488,"about_ca_system_score_gemma":0.0009957146,"threshold_uncertainty_score":0.011517525},"labels":[],"label_agreement":null},{"id":"W3028421519","doi":"10.1080/03155986.2019.1607810","title":"An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Advanced Scientific Computing Research","keywords":"Fidelity; Computer science; Surrogate model; Black box; High fidelity; Computation; Sampling (signal processing); Mathematical optimization; Algorithm; Function (biology); Optimization problem; Machine learning; Artificial intelligence; Mathematics; Engineering","score_opus":0.04286155012797854,"score_gpt":0.3590349756424031,"score_spread":0.31617342551442457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028421519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091275363,0.00004763919,0.9979517,0.00008396352,0.000014383052,0.00003421196,0.000011527629,0.00008934155,0.00085445767],"genre_scores_gemma":[0.07012672,0.00015853925,0.9267812,0.00014581424,0.000047075766,0.00056961813,0.00009277219,0.00017258002,0.001905588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988349,0.0004780504,0.000051365907,0.00014868066,0.00038792603,0.00009909001],"domain_scores_gemma":[0.997157,0.0019464988,0.00020404831,0.00024069105,0.00033662064,0.000115048635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034396008,0.0015372693,0.0014959581,0.0009306343,0.00078034523,0.0014252531,0.0023947456,0.0024554795,0.0048015746],"category_scores_gemma":[0.008749618,0.0008578614,0.0011164369,0.0008414324,0.0019726972,0.0015846806,0.0031085636,0.0033816483,0.0009617667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030179353,0.000037728078,0.00015873952,0.00007164039,0.000021138601,0.00003696259,0.00003833939,0.9225922,0.00078284135,0.059165593,0.00070669985,0.016357906],"study_design_scores_gemma":[0.0000111174795,0.000013147904,0.0000149958005,0.000009411422,0.000002178702,0.000007949563,0.000002959857,0.98677504,0.00017937912,0.012358754,0.0006215489,0.0000034708246],"about_ca_topic_score_codex":0.0027423801,"about_ca_topic_score_gemma":0.0025033,"teacher_disagreement_score":0.0048015746,"about_ca_system_score_codex":0.0012695718,"about_ca_system_score_gemma":0.002490438,"threshold_uncertainty_score":0.018190563},"labels":[],"label_agreement":null},{"id":"W3029701887","doi":"10.1145/3387168.3387205","title":"Solving Dynamic Multi-Objective Optimization Problems Using Cultural Algorithm based on Decomposition","year":2019,"lang":"en","type":"article","venue":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Mathematical optimization; Decomposition; Multi-objective optimization; Optimization problem; Computer science; Population; Algorithm; Local optimum; Mathematics; Chemistry","score_opus":0.017576925004042804,"score_gpt":0.3094245261946589,"score_spread":0.2918476011906161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029701887","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.029366072,0.0003812647,0.9658858,0.00016683931,0.0000529705,0.00008299064,0.00003362338,0.00016472864,0.003865706],"genre_scores_gemma":[0.4478387,0.00046291604,0.5488373,0.00019860247,0.00004873965,0.0004679468,0.00020409227,0.00007708714,0.0018646198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.00029910472,0.000041612187,0.000097231576,0.00014967714,0.00007709607],"domain_scores_gemma":[0.99893194,0.0006528387,0.00009896543,0.000068289824,0.00017385579,0.000074150674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001539594,0.0014224937,0.001372929,0.00093309913,0.0006622561,0.0012726827,0.0010286949,0.0012722083,0.0012562338],"category_scores_gemma":[0.0029379898,0.0004600105,0.0013046633,0.0008373058,0.0008356296,0.0009224464,0.0016154866,0.0015609011,0.00021525868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027010019,0.00004147704,0.0006180388,0.00004883644,0.000058291083,0.000040705963,0.000051507184,0.9612539,0.0012201907,0.0057292352,0.00044718757,0.030463649],"study_design_scores_gemma":[0.000010672023,0.000032101354,0.000063306914,0.000007189197,0.0000071790637,0.000012644212,0.0000134150705,0.9972037,0.00025972523,0.0020448822,0.0003410668,0.0000041221724],"about_ca_topic_score_codex":0.0054029888,"about_ca_topic_score_gemma":0.003744549,"teacher_disagreement_score":0.0054029888,"about_ca_system_score_codex":0.0007607732,"about_ca_system_score_gemma":0.0017425624,"threshold_uncertainty_score":0.010743082},"labels":[],"label_agreement":null},{"id":"W3030155800","doi":"10.1016/j.asoc.2020.106429","title":"Kriging-assisted Discrete Global Optimization (KDGO) for black-box problems with costly objective and constraints","year":2020,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for Central Universities of the Central South University; Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Kriging; Mathematical optimization; Computer science; Robustness (evolution); Black box; Underwater glider; Benchmark (surveying); Sampling (signal processing); Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.014565376420465117,"score_gpt":0.2493201298439894,"score_spread":0.23475475342352428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030155800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010050516,0.00019025592,0.98778254,0.000094051735,0.000026696118,0.00002862022,0.00005023877,0.00047081604,0.0013062193],"genre_scores_gemma":[0.38657984,0.00027929735,0.60949993,0.00014786494,0.000030200408,0.00019036328,0.00022424031,0.00026695893,0.00278137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948394,0.00022670686,0.0000171916,0.00006889394,0.00015297416,0.00005023022],"domain_scores_gemma":[0.99856085,0.0009866735,0.00010705394,0.00013651127,0.0001603006,0.00004867004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010909006,0.0009275312,0.0015404358,0.00057198806,0.00046979912,0.00071503106,0.0011598543,0.0014384032,0.0020365675],"category_scores_gemma":[0.0030313088,0.00071684696,0.0007124833,0.0008012952,0.0008795447,0.00096902275,0.0014404496,0.0018137643,0.00048149613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003275,0.00003670831,0.0002203917,0.00010205967,0.000029265355,0.000020395548,0.000032258646,0.9676483,0.0016751158,0.0032349806,0.00044653096,0.026483987],"study_design_scores_gemma":[0.0000066518933,0.000011418669,0.00003816793,0.0000037814084,0.0000025295822,0.0000037862944,0.0000032598243,0.9982664,0.00034598316,0.0011197508,0.00019543835,0.000002850543],"about_ca_topic_score_codex":0.0077598463,"about_ca_topic_score_gemma":0.012117892,"teacher_disagreement_score":0.0077598463,"about_ca_system_score_codex":0.00052990235,"about_ca_system_score_gemma":0.0014751821,"threshold_uncertainty_score":0.015429318},"labels":[],"label_agreement":null},{"id":"W3034398297","doi":"10.2514/6.2020-3152","title":"An efficient application of Bayesian optimization to an industrial MDO framework for aircraft design.","year":2020,"lang":"en","type":"article","venue":"AIAA AVIATION 2020 FORUM","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Bombardier (Canada)","funders":"","keywords":"Bayesian optimization; Solver; Set (abstract data type); Bayesian probability; Aviation; Global optimization","score_opus":0.0265716939448896,"score_gpt":0.29424118991350096,"score_spread":0.26766949596861134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034398297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026141014,0.00018475858,0.9934098,0.00013569911,0.00002421322,0.000055003467,0.00007066129,0.00019311486,0.0033126478],"genre_scores_gemma":[0.19280188,0.00035675993,0.80222327,0.0001859438,0.000049123544,0.00054108165,0.00037311003,0.00028090566,0.0031880087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947447,0.00025638493,0.000018213239,0.000038958093,0.00017466735,0.000037292455],"domain_scores_gemma":[0.9990972,0.00058255,0.00006479881,0.00005403383,0.00015472708,0.000046750076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016640082,0.0008883088,0.0009099373,0.0006799265,0.0004073257,0.00076268194,0.0010739957,0.0011770187,0.0038068697],"category_scores_gemma":[0.0042129443,0.000667805,0.00080148,0.0006107361,0.000581116,0.00069505227,0.0014947897,0.0014674761,0.0007224634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002451995,0.000025709189,0.0001952571,0.000057173773,0.000025128586,0.000023589197,0.000023492797,0.9611466,0.0005093812,0.01649794,0.0009864033,0.02048492],"study_design_scores_gemma":[0.000005637489,0.000007745524,0.00003213169,0.000006609265,0.0000029667274,0.0000044982853,0.000003019839,0.995865,0.00008456495,0.003333605,0.0006520181,0.000002159946],"about_ca_topic_score_codex":0.008315826,"about_ca_topic_score_gemma":0.010996683,"teacher_disagreement_score":0.008315826,"about_ca_system_score_codex":0.0006296359,"about_ca_system_score_gemma":0.0017269555,"threshold_uncertainty_score":0.016534865},"labels":[],"label_agreement":null},{"id":"W3045592461","doi":"10.2514/6.2019-3667","title":"Mode Pursuing Sampling Method Using Coordinate Perturbation for High-dimensional Expensive Black-box Optimization","year":2019,"lang":"en","type":"article","venue":"AIAA Aviation 2019 Forum","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Perturbation (astronomy); Mode (computer interface); Black box; Physics; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Quantum mechanics","score_opus":0.017598279990905234,"score_gpt":0.31173241179551214,"score_spread":0.2941341318046069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045592461","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.011621904,0.00011401148,0.98528624,0.00008156834,0.000054366705,0.000037683938,0.00002226465,0.00016651514,0.0026153324],"genre_scores_gemma":[0.38257176,0.00022092064,0.611207,0.00019766291,0.00007651133,0.00035766044,0.00014359097,0.00019032367,0.0050345627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999691,0.00014296015,0.0000082093275,0.000029431329,0.000100879486,0.000027636339],"domain_scores_gemma":[0.9992052,0.00052099134,0.00003641543,0.00006565958,0.00012574189,0.000045918452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213867,0.00054697227,0.00094928994,0.0004091,0.00044788865,0.0005034467,0.0011525012,0.00082447426,0.0041678986],"category_scores_gemma":[0.0025671937,0.00032373914,0.0004747633,0.00045446018,0.0006920594,0.00068807247,0.0012429429,0.0011612324,0.00048103285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040178228,0.00018721729,0.0010273999,0.00016395311,0.00007806901,0.00014130339,0.00009897784,0.84912854,0.007848251,0.04919981,0.0031023338,0.088622324],"study_design_scores_gemma":[0.000006717477,0.000011697168,0.000025656642,0.0000018545064,0.0000017937144,0.0000042329443,0.0000016818713,0.9985165,0.00025324925,0.0010206929,0.00015415727,0.0000016869795],"about_ca_topic_score_codex":0.0026170749,"about_ca_topic_score_gemma":0.0028274443,"teacher_disagreement_score":0.0041678986,"about_ca_system_score_codex":0.0004025921,"about_ca_system_score_gemma":0.000882783,"threshold_uncertainty_score":0.013942957},"labels":[],"label_agreement":null},{"id":"W3045595564","doi":"10.1002/cjs.11559","title":"A sequential split‐and‐conquer approach for the analysis of big dependent data in computer experiments","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Divide and conquer algorithms; Computer science; Inference; Frequentist inference; Gaussian process; Data mining; Computation; Algorithm; Uncertainty quantification; Machine learning; Gaussian; Artificial intelligence; Bayesian probability; Bayesian inference","score_opus":0.09078864965144023,"score_gpt":0.29937832121815794,"score_spread":0.2085896715667177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045595564","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.0029875073,0.00013440046,0.9963147,0.00012579831,0.000008797892,0.000041612137,0.00002279046,0.00017748035,0.00018701237],"genre_scores_gemma":[0.20398599,0.00027204878,0.793786,0.00019827044,0.0001418462,0.00045129604,0.0002228105,0.00014606069,0.0007956658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686927,0.0013254292,0.00015678376,0.00053433154,0.00093023083,0.00018397775],"domain_scores_gemma":[0.9814393,0.014277166,0.0011208103,0.0010471649,0.0017769643,0.00033863797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008031261,0.0015118172,0.0020284797,0.0026059328,0.00089246884,0.0014251759,0.00272445,0.0015898492,0.0024098149],"category_scores_gemma":[0.02096065,0.0009200059,0.0012349027,0.0020705222,0.0020215684,0.0026672285,0.0025570893,0.0025796082,0.00034484023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030961202,0.0002552166,0.0030241234,0.0002498086,0.00019665941,0.00023060199,0.00018267047,0.7851558,0.0029015127,0.058592547,0.0018340545,0.14706741],"study_design_scores_gemma":[0.000011392414,0.000017537464,0.00008835332,0.0000033463018,0.0000056392937,0.000009493551,0.0000072056364,0.98867947,0.0002940626,0.010692068,0.00018781348,0.0000036441072],"about_ca_topic_score_codex":0.004015462,"about_ca_topic_score_gemma":0.0039639324,"teacher_disagreement_score":0.008031261,"about_ca_system_score_codex":0.001174965,"about_ca_system_score_gemma":0.0024163094,"threshold_uncertainty_score":0.042473912},"labels":[],"label_agreement":null},{"id":"W3045671334","doi":"10.1007/s00158-020-02591-7","title":"A relative adequacy framework for multimodel management in multidisciplinary design optimization","year":2020,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Multidisciplinary approach; Multidisciplinary design optimization; Engineering design process; Computer science; Management science; Systems engineering; Engineering; Risk analysis (engineering); Mechanical engineering; Business","score_opus":0.03661798131880695,"score_gpt":0.305770368941454,"score_spread":0.26915238762264704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045671334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002736037,0.00011419924,0.9952082,0.0001562931,0.000014190066,0.000030285972,0.00003301064,0.00007564734,0.0016321067],"genre_scores_gemma":[0.43000475,0.00033530488,0.5662846,0.00024627993,0.00017929262,0.00042011976,0.00027268202,0.00021749886,0.0020394602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884277,0.0075327633,0.0005050231,0.0008479189,0.0023966415,0.00028993294],"domain_scores_gemma":[0.97814894,0.014819517,0.0012074494,0.0025172115,0.002971042,0.00033587794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018798735,0.0011601427,0.0018484199,0.003667777,0.0016222734,0.002704225,0.0033877266,0.0015774342,0.0042873938],"category_scores_gemma":[0.04746762,0.0008385366,0.00191143,0.0023002296,0.002572173,0.005535708,0.004810839,0.0024434659,0.0004960924],"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.000061919156,0.00006915385,0.0010787204,0.00019013348,0.00010750464,0.00008550239,0.00024301493,0.3675593,0.0008372821,0.57931286,0.0014656242,0.04898901],"study_design_scores_gemma":[0.00001021329,0.000044070464,0.00022952513,0.000049751085,0.000028640656,0.000029699884,0.000050103434,0.75273377,0.0004964206,0.24440691,0.001905119,0.000015846994],"about_ca_topic_score_codex":0.0035048954,"about_ca_topic_score_gemma":0.0033900735,"teacher_disagreement_score":0.018798735,"about_ca_system_score_codex":0.0017700023,"about_ca_system_score_gemma":0.0023187646,"threshold_uncertainty_score":0.0994184},"labels":[],"label_agreement":null},{"id":"W3045713108","doi":"10.1115/1.4047909","title":"Mode-Pursuing Sampling Method Using Discriminative Coordinate Perturbation for High-Dimensional Expensive Black-Box Optimization","year":2020,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Beijing Institute of Technology; National Natural Science Foundation of China","keywords":"Mathematical optimization; Computer science; Perturbation (astronomy); Robustness (evolution); Discriminative model; Optimization problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.10074389442939438,"score_gpt":0.3532763690213026,"score_spread":0.2525324745919082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045713108","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.010826483,0.00012794386,0.98730564,0.00005203717,0.000021089758,0.000029708728,0.000014475411,0.00019243151,0.0014301366],"genre_scores_gemma":[0.47130975,0.00021955017,0.525216,0.00015874082,0.000047158686,0.0002792123,0.00012723025,0.0001740148,0.0024684079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996075,0.00013553712,0.00001534565,0.000061013696,0.00014885612,0.000031820684],"domain_scores_gemma":[0.99946755,0.00029469503,0.000041073483,0.000064717206,0.00009916081,0.000032775908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082566065,0.0007476791,0.00087234343,0.00048532445,0.00036249295,0.0004766701,0.00097069476,0.0006739891,0.0021930032],"category_scores_gemma":[0.0016541493,0.00036458366,0.0005470943,0.0004430932,0.00055114744,0.0006644176,0.0010106262,0.0008408401,0.00038587555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015348576,0.00008969811,0.0010838687,0.00015516693,0.00005633677,0.00012111677,0.00007683804,0.86294514,0.015185507,0.019164987,0.0017259393,0.099241965],"study_design_scores_gemma":[0.0000073798024,0.000020048275,0.000041980755,0.000002398571,0.0000028837967,0.000010879392,0.0000030590777,0.9978035,0.0007269551,0.001007005,0.000371224,0.0000027355682],"about_ca_topic_score_codex":0.0017111404,"about_ca_topic_score_gemma":0.0016884675,"teacher_disagreement_score":0.0021930032,"about_ca_system_score_codex":0.00035276517,"about_ca_system_score_gemma":0.00080284674,"threshold_uncertainty_score":0.0073363185},"labels":[],"label_agreement":null},{"id":"W3047794975","doi":"10.4018/978-1-7998-3970-5.ch014","title":"Extreme Value Metaheuristics and Coupled Mapped Lattice Approaches for Gas Turbine-Absorption Chiller Optimization","year":2020,"lang":"en","type":"book-chapter","venue":"Advances in computer and electrical engineering book series","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Alberta Energy","funders":"","keywords":"Metaheuristic; Differential evolution; Mathematical optimization; Computer science; Extreme value theory; Stochastic optimization; Turbine; Chiller; Simulated annealing; Genetic algorithm; Engineering; Mathematics; Mechanical engineering; Physics","score_opus":0.01883506152196596,"score_gpt":0.21273728773455414,"score_spread":0.19390222621258818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047794975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005290261,0.011841156,0.946432,0.0004439491,0.00028186257,0.00004030783,0.000068687856,0.00024981736,0.035351988],"genre_scores_gemma":[0.19694561,0.022788877,0.7165661,0.0004911827,0.0002958985,0.0003139089,0.00035638994,0.0002613743,0.061980594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981457,0.000056449982,0.0000066490707,0.000018092276,0.00009296774,0.000011270052],"domain_scores_gemma":[0.9998665,0.00008363538,0.000010329545,0.000009273087,0.000022671546,0.0000075507087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032930367,0.00076174346,0.00049476145,0.0004729164,0.0002155563,0.00095864566,0.0006900152,0.00070798065,0.003836638],"category_scores_gemma":[0.000653113,0.0002945418,0.00057548896,0.001395477,0.00047512297,0.0007046245,0.00065517944,0.0015382012,0.0011216743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032531418,0.00006474151,0.00016451388,0.00033353432,0.00007070413,0.00009491551,0.00006347991,0.6593217,0.003532694,0.14951828,0.0077392543,0.17906371],"study_design_scores_gemma":[0.0000118710595,0.00006474722,0.00016237664,0.00007337465,0.000014643753,0.00011258512,0.000034252076,0.8739939,0.001447662,0.090207405,0.03386087,0.00001637761],"about_ca_topic_score_codex":0.00073042576,"about_ca_topic_score_gemma":0.0012499611,"teacher_disagreement_score":0.003836638,"about_ca_system_score_codex":0.00043178708,"about_ca_system_score_gemma":0.00048262975,"threshold_uncertainty_score":0.012834787},"labels":[],"label_agreement":null},{"id":"W3082029294","doi":"10.1016/j.ejor.2020.08.048","title":"Inferring linear feasible regions using inverse optimization","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Feasible region; Set (abstract data type); Constraint (computer-aided design); Constrained optimization; Optimization problem; Function (biology); Algorithm; Mathematics","score_opus":0.23612361330620157,"score_gpt":0.39858356278024537,"score_spread":0.1624599494740438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082029294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075210393,0.00013093889,0.99029326,0.000103874496,0.000014530089,0.00003638758,0.00009626346,0.00034290538,0.001460846],"genre_scores_gemma":[0.3106529,0.00029936052,0.6850252,0.00012848129,0.000052299074,0.00024019733,0.0006069753,0.00031254246,0.0026820162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879503,0.00043981356,0.00006672395,0.00028678554,0.00031593168,0.000095730524],"domain_scores_gemma":[0.9926561,0.006216813,0.00031244048,0.00032493597,0.0004028829,0.000086799744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019320438,0.0017800801,0.002004757,0.002238429,0.0006763564,0.0028859577,0.001669502,0.002331138,0.0053430963],"category_scores_gemma":[0.013618857,0.0022173948,0.002391318,0.0015014175,0.0016183078,0.0033608547,0.002516057,0.0029964736,0.0012426428],"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.00015247992,0.00010964737,0.0006494667,0.00023010674,0.00007672322,0.00018722576,0.000097593285,0.9198608,0.0026983516,0.013309941,0.0012505958,0.06137714],"study_design_scores_gemma":[0.00001351754,0.00002326944,0.00008358656,0.000016990176,0.00001257516,0.000025342997,0.000017824275,0.98461074,0.00091171777,0.013788661,0.00048599328,0.0000098248365],"about_ca_topic_score_codex":0.005533509,"about_ca_topic_score_gemma":0.0047800085,"teacher_disagreement_score":0.005533509,"about_ca_system_score_codex":0.0007395237,"about_ca_system_score_gemma":0.0018349951,"threshold_uncertainty_score":0.01787448},"labels":[],"label_agreement":null},{"id":"W3082083549","doi":"10.1007/978-3-030-58112-1_13","title":"Simple Surrogate Model Assisted Optimization with Covariance Matrix Adaptation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Dalhousie University","funders":"","keywords":"Computer science; Simple (philosophy); CMA-ES; Adaptation (eye); Covariance matrix; Algorithm; Mathematical optimization; Matrix (chemical analysis); Covariance; Artificial intelligence; Covariance function; Mathematics; Statistics","score_opus":0.023973858364599566,"score_gpt":0.2611975937309552,"score_spread":0.23722373536635563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082083549","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.0020703834,0.00013566768,0.9911747,0.000053831078,0.00011070645,0.000017410035,0.00005378438,0.00052901095,0.005854509],"genre_scores_gemma":[0.19356796,0.00032218272,0.7799497,0.00022260414,0.00012819815,0.00019595648,0.0005027163,0.00065843965,0.0244522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.000106868414,0.000012672574,0.000045227207,0.00016414463,0.000020994728],"domain_scores_gemma":[0.99967754,0.00010189306,0.00001796327,0.000115405244,0.000070020054,0.000017143353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043345,0.00090142916,0.0012184103,0.00029584285,0.00029467803,0.0008811106,0.0010983057,0.0016853783,0.0068988707],"category_scores_gemma":[0.0012142649,0.0005350306,0.0009608214,0.0007437181,0.00036857786,0.0010404509,0.0012497951,0.0015708475,0.0030384664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016043043,0.00012668093,0.00019195185,0.00020264917,0.00009973176,0.00012581117,0.00003359208,0.77912456,0.020262098,0.03871757,0.007959971,0.15299502],"study_design_scores_gemma":[0.0000067468955,0.000022327236,0.00004192462,0.000005193592,0.000004910685,0.000033578675,0.00000195355,0.9907885,0.001466883,0.0051085823,0.0025119642,0.00000740317],"about_ca_topic_score_codex":0.00053774053,"about_ca_topic_score_gemma":0.0010035866,"teacher_disagreement_score":0.0068988707,"about_ca_system_score_codex":0.00021030496,"about_ca_system_score_gemma":0.0004352329,"threshold_uncertainty_score":0.023079038},"labels":[],"label_agreement":null},{"id":"W3092716745","doi":"10.1016/j.envsoft.2020.104902","title":"Cluster-based multi-objective optimization for identifying diverse design options: Application to water resources problems","year":2020,"lang":"en","type":"article","venue":"Environmental Modelling & Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":9,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Computer science; Flexibility (engineering); Multi-objective optimization; Benchmark (surveying); Data mining; Mathematical optimization; Cluster (spacecraft); Set (abstract data type); Pareto principle; Process (computing); Machine learning; Mathematics; Statistics; Geography","score_opus":0.050291367491627874,"score_gpt":0.2579614541183884,"score_spread":0.2076700866267605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092716745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055274956,0.00045565318,0.9378926,0.00018352013,0.00006817088,0.00024580435,0.00021211678,0.00080905796,0.004858076],"genre_scores_gemma":[0.5448318,0.0002800615,0.4506749,0.00008477397,0.00003882283,0.00062701135,0.00038185104,0.00033796395,0.0027427634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993056,0.0003143664,0.000025101543,0.000088237524,0.00020891568,0.000057649726],"domain_scores_gemma":[0.99742776,0.001813637,0.000104874394,0.00010939815,0.0004518113,0.00009250897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239246,0.0016964653,0.0022337895,0.0020407438,0.0016051083,0.0011235671,0.0019230923,0.0016911903,0.0038195492],"category_scores_gemma":[0.0044820374,0.00094851514,0.0015519653,0.0028830448,0.00080104975,0.0009675947,0.0014423851,0.0015580738,0.00037027485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049201662,0.000040806186,0.00018701196,0.000036002883,0.00003268866,0.000012256844,0.000015880818,0.9873805,0.00023601601,0.0012436149,0.00032254023,0.010443456],"study_design_scores_gemma":[0.0000062338986,0.000008254794,0.000041888856,0.0000016291124,0.0000035023938,0.000001887838,0.0000037733096,0.9991043,0.00009665003,0.00065358466,0.000075247866,0.0000029846944],"about_ca_topic_score_codex":0.02409468,"about_ca_topic_score_gemma":0.020196978,"teacher_disagreement_score":0.02409468,"about_ca_system_score_codex":0.0016174103,"about_ca_system_score_gemma":0.0022694718,"threshold_uncertainty_score":0.047908843},"labels":[],"label_agreement":null},{"id":"W3094400170","doi":"10.1002/cjce.23899","title":"Multiobjective optimization of area‐to‐point heat conduction structure using binary quantum‐behaved <scp>PSO</scp> and Tchebycheff decomposition method","year":2020,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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 Natural Science Foundation of China","keywords":"Mathematical optimization; Particle swarm optimization; Multi-objective optimization; Quantum; Binary number; Pareto principle; Mathematics; Computer science; Physics","score_opus":0.01783087719387239,"score_gpt":0.2564719722182549,"score_spread":0.23864109502438252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094400170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06346957,0.00019139663,0.9292963,0.0001629515,0.00004437326,0.00008163787,0.000046274366,0.000086875225,0.006620588],"genre_scores_gemma":[0.7854513,0.00015817658,0.21039428,0.000079034115,0.000017288528,0.00025862246,0.000088381414,0.00004343373,0.0035094966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995993,0.00016160004,0.000013392036,0.00004224592,0.00013285987,0.000050669103],"domain_scores_gemma":[0.9995277,0.00026363114,0.000040559793,0.000020372234,0.0001158936,0.000031924188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885197,0.00058631226,0.0008587316,0.0005815759,0.00035895847,0.0009259693,0.0006711646,0.000873413,0.0015065725],"category_scores_gemma":[0.0012029908,0.00041004817,0.00059448986,0.0005252693,0.00056054536,0.00048214832,0.0005341705,0.0005082052,0.0001437178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016608636,0.000026265914,0.00012450812,0.000029631257,0.000014475717,0.000012327009,0.000010133077,0.99000704,0.0015134305,0.0029938659,0.00018132539,0.005070406],"study_design_scores_gemma":[0.0000033247115,0.0000063416664,0.000032368866,0.0000010713989,9.884074e-7,0.0000010925794,0.0000014645489,0.99955624,0.000120377714,0.00024098964,0.00003487228,8.6903987e-7],"about_ca_topic_score_codex":0.006386039,"about_ca_topic_score_gemma":0.0036019392,"teacher_disagreement_score":0.006386039,"about_ca_system_score_codex":0.0008084845,"about_ca_system_score_gemma":0.0012124095,"threshold_uncertainty_score":0.012697756},"labels":[],"label_agreement":null},{"id":"W3096998548","doi":"10.2514/1.j059826","title":"Evaluating the Risk of Local Optima in Aerodynamic Shape Optimization","year":2020,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":16,"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":"Bombardier Transportation; Government of Ontario","keywords":"Local optimum; Aerodynamics; Shape optimization; Set (abstract data type); Optimal design; Mathematical optimization; Geometric design; Computer science; Optimization problem; Mathematics; Engineering; Finite element method; Geometry; Structural engineering; Aerospace engineering; Machine learning","score_opus":0.03472903478689438,"score_gpt":0.3188054304586147,"score_spread":0.2840763956717203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096998548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39522782,0.0011659266,0.59897864,0.00027422086,0.000041584073,0.0001892474,0.00007506213,0.0005143272,0.0035331072],"genre_scores_gemma":[0.8953733,0.00021112556,0.10304262,0.00006162889,0.000012106538,0.0001554259,0.000081820785,0.00012879424,0.00093332276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997874,0.0012759563,0.000077121185,0.00013565415,0.000522677,0.000114609924],"domain_scores_gemma":[0.9757834,0.020612376,0.0013683246,0.0008105223,0.0011393911,0.0002859711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071548983,0.0008954706,0.0010473346,0.001085724,0.00067939016,0.00089887757,0.00056396343,0.0013451793,0.000992337],"category_scores_gemma":[0.024220116,0.000550513,0.00082787126,0.00053603516,0.0011074641,0.00092404743,0.0015122261,0.001213503,0.00017983791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022377541,0.00004783156,0.0025284237,0.000057469402,0.000055700562,0.000077971585,0.000066254455,0.98145974,0.001644839,0.0014151272,0.00017068168,0.012252243],"study_design_scores_gemma":[0.000013566561,0.00023469873,0.00096384535,0.00001808722,0.0000152185385,0.000036497837,0.000030325484,0.99531174,0.0017197441,0.0014878021,0.00015323373,0.000015251216],"about_ca_topic_score_codex":0.0024400847,"about_ca_topic_score_gemma":0.0030648676,"teacher_disagreement_score":0.0071548983,"about_ca_system_score_codex":0.0009162068,"about_ca_system_score_gemma":0.0008974924,"threshold_uncertainty_score":0.037839174},"labels":[],"label_agreement":null},{"id":"W3098133464","doi":"","title":"Efficient Emulators of Computer Experiments Using Compactly Supported Correlation Functions, With An Application to Cosmology","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Correlation; Computer science; Correlation function (quantum field theory); Gaussian; Gaussian process; Function (biology); Computer experiment; Product (mathematics); Algorithm; Dimension (graph theory); Simulation; Mathematics; Physics","score_opus":0.03160110112162959,"score_gpt":0.2862074674335189,"score_spread":0.25460636631188927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098133464","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.063434,0.00016892307,0.93177414,0.00026832108,0.000024221597,0.00009560396,0.00017089212,0.0024224187,0.0016414485],"genre_scores_gemma":[0.6636063,0.00019504377,0.33344218,0.0001254238,0.000030060946,0.00043039382,0.00048048142,0.0005497584,0.0011403181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901545,0.00054491067,0.00005260119,0.00009822315,0.000231071,0.00005771896],"domain_scores_gemma":[0.98848754,0.007825701,0.0010010458,0.0018544985,0.00065541815,0.00017579878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030550328,0.000889626,0.00079264597,0.00078734814,0.00047894262,0.0009565254,0.0019123218,0.00096687314,0.0020275754],"category_scores_gemma":[0.02006035,0.00073284196,0.00060506334,0.0008924548,0.0010259305,0.0021910092,0.00093568437,0.0017629141,0.00052749476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046065325,0.00002602398,0.0010244102,0.000026073141,0.000021417665,0.00002485398,0.00003272201,0.97643334,0.0007904396,0.010217929,0.00042513557,0.0109315915],"study_design_scores_gemma":[0.000006218178,0.000007742936,0.00007192772,0.000003088622,0.0000016023987,0.0000069664534,0.0000028345437,0.99630725,0.00054284296,0.0028936814,0.00015301167,0.000002866376],"about_ca_topic_score_codex":0.0034162533,"about_ca_topic_score_gemma":0.0032273112,"teacher_disagreement_score":0.0034162533,"about_ca_system_score_codex":0.0011355262,"about_ca_system_score_gemma":0.001468442,"threshold_uncertainty_score":0.016156793},"labels":[],"label_agreement":null},{"id":"W3099057434","doi":"10.6084/m9.figshare.6287681.v2","title":"Local Gaussian Process Model for Large-Scale Dynamic Computer Experiments","year":2019,"lang":"en","type":"article","venue":"Figshare","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer experiment; Computer science; Gaussian process; Singular value decomposition; Set (abstract data type); Algorithm; Process (computing); Gaussian; Euclidean distance; Simulation; Artificial intelligence","score_opus":0.020481621745374476,"score_gpt":0.3017479135736517,"score_spread":0.2812662918282772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099057434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004740328,0.00004048827,0.9941549,0.000078016616,0.000008400945,0.000039916213,0.00004167228,0.0002442801,0.0006519854],"genre_scores_gemma":[0.60352427,0.00022982224,0.3888805,0.00023982562,0.00003800499,0.0011133257,0.0003806,0.00023287343,0.005360823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991233,0.00039138296,0.00002865901,0.00016108512,0.00023723367,0.00005828239],"domain_scores_gemma":[0.99784946,0.0013537987,0.00020837503,0.0002666703,0.00024915382,0.00007245847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026231944,0.0007443463,0.0008475011,0.00059237925,0.0003490284,0.00067462114,0.0023787166,0.0014412585,0.0037684236],"category_scores_gemma":[0.0066298298,0.0003836541,0.00069871,0.000680353,0.0010597713,0.0012995945,0.0012325406,0.00177685,0.0010706323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051028735,0.000042344916,0.0004098873,0.000043362994,0.000012932735,0.000043268352,0.00002713007,0.9560175,0.0018039574,0.030039089,0.0006486679,0.01086084],"study_design_scores_gemma":[0.0000033324286,0.000011493081,0.000042931493,0.00000162466,0.0000014131534,0.000004841992,0.0000019258607,0.9950016,0.00031187834,0.004415949,0.00020073644,0.0000023080067],"about_ca_topic_score_codex":0.0019878338,"about_ca_topic_score_gemma":0.0021401073,"teacher_disagreement_score":0.0037684236,"about_ca_system_score_codex":0.0009414523,"about_ca_system_score_gemma":0.0009758473,"threshold_uncertainty_score":0.013872981},"labels":[],"label_agreement":null},{"id":"W3100953776","doi":"10.1115/detc2001/dac-21141","title":"Improvement on the Adaptive Response Surface Method for High-Dimensional Computation-Intensive Design Problems","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"","keywords":"Latin hypercube sampling; Computation; Computer science; Hypercube; Central composite design; Speedup; Set (abstract data type); Mathematical optimization; Response surface methodology; Parallel computing; Algorithm; Mathematics; Statistics","score_opus":0.048656188231832084,"score_gpt":0.3065736388663195,"score_spread":0.2579174506344874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100953776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049366257,0.00007459323,0.99401,0.00002870523,0.000009638303,0.000028166267,0.0000037740642,0.00015282053,0.00075566856],"genre_scores_gemma":[0.19112295,0.00019879758,0.8065133,0.000080105994,0.000032320284,0.00032387872,0.000038786482,0.00011318495,0.001576637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793315,0.0011852984,0.000063469815,0.00012421301,0.0006427511,0.000051078183],"domain_scores_gemma":[0.99764913,0.0015546452,0.0001355955,0.00016342719,0.00046013945,0.00003712261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003574437,0.0008243678,0.000952399,0.00072030514,0.00025368744,0.00044310925,0.0008647812,0.0008453988,0.002579066],"category_scores_gemma":[0.004417703,0.00036202118,0.00091452606,0.00046333726,0.00069301866,0.000524949,0.0007325571,0.0010510134,0.0006352717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011460356,0.0000901471,0.00039682997,0.00020201188,0.00005020074,0.000052089865,0.00008052309,0.85861945,0.014050113,0.007849202,0.00044906518,0.11804584],"study_design_scores_gemma":[0.000010727184,0.00007699465,0.000053576416,0.000004485637,0.0000044502162,0.00000934567,0.000003873028,0.9971674,0.0010762886,0.0008694868,0.0007192114,0.000004247179],"about_ca_topic_score_codex":0.0010664526,"about_ca_topic_score_gemma":0.00093479955,"teacher_disagreement_score":0.003574437,"about_ca_system_score_codex":0.0002927601,"about_ca_system_score_gemma":0.0006976946,"threshold_uncertainty_score":0.018903613},"labels":[],"label_agreement":null},{"id":"W3101200922","doi":"10.5267/j.ijiec.2020.10.001","title":"A chaotic-based improved many-objective Jaya algorithm for many-objective optimization problems","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","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":"","keywords":"Benchmark (surveying); Algorithm; Sorting; Mathematical optimization; Convergence (economics); Chaotic; Computer science; Local optimum; Tournament selection; Premature convergence; Evolutionary algorithm; Selection (genetic algorithm); Mathematics; Artificial intelligence; Particle swarm optimization","score_opus":0.02531355818343585,"score_gpt":0.2650028868976819,"score_spread":0.23968932871424609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101200922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02399807,0.00076367497,0.96778023,0.0001560559,0.00008851288,0.00011838337,0.000049484643,0.0003605615,0.0066849175],"genre_scores_gemma":[0.43096858,0.0007784257,0.55811226,0.00019624725,0.00008264796,0.000686731,0.00027237347,0.00014219242,0.008760464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00010052686,0.000021616454,0.000050781982,0.00014484745,0.000028252789],"domain_scores_gemma":[0.9996947,0.0001183135,0.00004062433,0.000024296423,0.000100865225,0.000021231728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006174474,0.0007542159,0.00084975525,0.0006853803,0.00051293045,0.0006767765,0.0012199235,0.0007390347,0.002455392],"category_scores_gemma":[0.0011251845,0.00031746973,0.0009630293,0.00063753355,0.00041291324,0.00060846144,0.0009551243,0.00093571923,0.0004778074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007977665,0.00008400186,0.0015325644,0.00021714537,0.00013710397,0.00013158316,0.00013275463,0.7915924,0.007881498,0.015167809,0.0019352341,0.1811081],"study_design_scores_gemma":[0.000026067366,0.00008282683,0.00032863408,0.000015961277,0.000018115825,0.00007692997,0.000013414044,0.99256,0.0011151256,0.0023682897,0.0033801016,0.000014422274],"about_ca_topic_score_codex":0.0021158764,"about_ca_topic_score_gemma":0.0022808807,"teacher_disagreement_score":0.002455392,"about_ca_system_score_codex":0.0004789869,"about_ca_system_score_gemma":0.0012026947,"threshold_uncertainty_score":0.0082140565},"labels":[],"label_agreement":null},{"id":"W3103210112","doi":"","title":"Improving NSGA-II with an Adaptive Mutation Operator","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Waterloo","funders":"","keywords":"Operator (biology); Adaptive mutation; Mutation; Evolutionary algorithm; Mathematical optimization; Computer science; Multi-objective optimization; Evolutionary computation; Process (computing); Pareto principle; Mathematics; Genetic algorithm; Biology","score_opus":0.015759731976079192,"score_gpt":0.2606782161603119,"score_spread":0.2449184841842327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103210112","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.081326224,0.0004230456,0.909712,0.00027000127,0.00018520761,0.00020929468,0.000054558168,0.0007552994,0.0070644207],"genre_scores_gemma":[0.5126981,0.0004241356,0.4803595,0.00027617853,0.000064817716,0.00032473146,0.00017423661,0.00017144949,0.0055067926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992724,0.00023350213,0.000043223718,0.00008107864,0.00031118494,0.00005868606],"domain_scores_gemma":[0.9992951,0.00027194756,0.00008332224,0.000096219184,0.00021754476,0.00003595949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041192,0.0010816818,0.0006357351,0.00073920126,0.000366139,0.00059564033,0.0009547417,0.0008160166,0.001200037],"category_scores_gemma":[0.0032302008,0.00024826726,0.0006391354,0.0006014423,0.00045497902,0.0005407927,0.0008850916,0.00092157855,0.00033537555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009213193,0.00014450925,0.0014846895,0.00008539374,0.000087809174,0.00018448428,0.00012845859,0.8517928,0.0133339325,0.008991517,0.0015644879,0.122109845],"study_design_scores_gemma":[0.000033190514,0.00006897229,0.0004244162,0.000010702463,0.000025594281,0.00005484861,0.000013443049,0.9921417,0.0026702085,0.0018614607,0.002684013,0.000011435504],"about_ca_topic_score_codex":0.0049433797,"about_ca_topic_score_gemma":0.0040424736,"teacher_disagreement_score":0.0049433797,"about_ca_system_score_codex":0.00053596543,"about_ca_system_score_gemma":0.0009903753,"threshold_uncertainty_score":0.009829223},"labels":[],"label_agreement":null},{"id":"W3107847621","doi":"10.1007/s43069-021-00075-y","title":"Combining Cross Entropy and MADS methods for inequality constrained global optimization","year":2020,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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; HEC Montréal","funders":"","keywords":"Inequality; Mathematics; Computer science; Econometrics; Mathematical optimization; Economics; Mathematical analysis","score_opus":0.027354151793291905,"score_gpt":0.3428868302780182,"score_spread":0.31553267848472627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107847621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030859201,0.00031791598,0.9950427,0.000060523445,0.00003697685,0.000017097476,0.000012406477,0.00014108929,0.0012853147],"genre_scores_gemma":[0.31050947,0.0005922686,0.6838469,0.0002587904,0.00024707403,0.00023844058,0.000205242,0.00036668841,0.003735114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868983,0.0005627793,0.0000660169,0.00012526254,0.0005034542,0.000052562442],"domain_scores_gemma":[0.997985,0.0013076107,0.00011747209,0.0001734748,0.0003563255,0.00006012236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026154635,0.0011562967,0.0011536496,0.0019862764,0.00032522893,0.0009318756,0.0011256578,0.0008784022,0.001796823],"category_scores_gemma":[0.0049418835,0.0005047707,0.0009252046,0.0011632934,0.00083941873,0.0011686962,0.0022144301,0.0012640951,0.00043564884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113730195,0.00007340859,0.0010523797,0.00020454559,0.00019225727,0.000089624256,0.000067296096,0.7665473,0.005216944,0.040250678,0.0012031146,0.18498868],"study_design_scores_gemma":[0.0000049312375,0.000022901142,0.00010132181,0.0000068796458,0.0000063012503,0.00001327558,0.000002271392,0.9946078,0.00065080146,0.003941029,0.0006365164,0.000005906502],"about_ca_topic_score_codex":0.0014878864,"about_ca_topic_score_gemma":0.0015044507,"teacher_disagreement_score":0.0026154635,"about_ca_system_score_codex":0.0004946671,"about_ca_system_score_gemma":0.0005527433,"threshold_uncertainty_score":0.013832092},"labels":[],"label_agreement":null},{"id":"W3111000592","doi":"10.1007/978-3-030-58930-1_12","title":"Hybridization of the Differential Evolution Algorithm for Continuous Multi-objective Optimization","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Mathematical optimization; Differential evolution; Metaheuristic; Computer science; Convergence (economics); Algorithm; Evolutionary algorithm; Multi-objective optimization; Meta-optimization; Mathematics","score_opus":0.054487132783635574,"score_gpt":0.32386920424057025,"score_spread":0.26938207145693466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111000592","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.008942549,0.0009934776,0.9675184,0.00018470595,0.00030096958,0.00004864787,0.00002819134,0.0003384705,0.021644566],"genre_scores_gemma":[0.21535,0.0010099382,0.76197624,0.0002645864,0.00015923925,0.00023081728,0.00012603974,0.00022909993,0.020654015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953115,0.00014539788,0.000020721993,0.00006061652,0.00021253891,0.000029551375],"domain_scores_gemma":[0.9994904,0.00028907863,0.000018421477,0.000060679868,0.00011432478,0.000027026399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008907944,0.00061488204,0.00097626203,0.00068501726,0.00030288764,0.001024118,0.0012694485,0.0012694581,0.00611986],"category_scores_gemma":[0.0019975454,0.00034350378,0.0007723137,0.0012198995,0.0004967883,0.0010103533,0.001213618,0.0014519673,0.0012695913],"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.00012107601,0.00020985058,0.0005271082,0.00031352983,0.0001460522,0.00015042824,0.00016753003,0.4295804,0.014264156,0.09842187,0.004555309,0.45154268],"study_design_scores_gemma":[0.000014429007,0.0000702927,0.00014680243,0.000019837275,0.000013951051,0.00006684643,0.000011927096,0.97819877,0.0016071382,0.0113968225,0.008442674,0.000010568302],"about_ca_topic_score_codex":0.0009038071,"about_ca_topic_score_gemma":0.0009143074,"teacher_disagreement_score":0.00611986,"about_ca_system_score_codex":0.0004948062,"about_ca_system_score_gemma":0.00042929832,"threshold_uncertainty_score":0.020472944},"labels":[],"label_agreement":null},{"id":"W3111176240","doi":"10.1109/smc42975.2020.9283294","title":"Age-Layered Strategies for Many-Objective Optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematical optimization; Sorting; Multi-objective optimization; Pareto principle; Reduction (mathematics); Ranking (information retrieval); Inefficiency; Computer science; Evolutionary algorithm; Optimization problem; Convergence (economics); Mathematics; Artificial intelligence; Algorithm; Economics","score_opus":0.03053826607247536,"score_gpt":0.2782520772688626,"score_spread":0.24771381119638722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111176240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008482792,0.0005163615,0.9866171,0.0001253719,0.00003539023,0.000082226696,0.000024091727,0.00015244311,0.0039641922],"genre_scores_gemma":[0.26402617,0.00090776104,0.72931796,0.00024994588,0.000053449756,0.0005665769,0.000120296245,0.00013009606,0.0046277163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890995,0.00048432816,0.00005947574,0.0000728516,0.00041366677,0.000059773243],"domain_scores_gemma":[0.9990526,0.00046329905,0.000108088236,0.00010969158,0.00020694807,0.000059289916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018696783,0.0013702648,0.00076703576,0.000983032,0.00042184547,0.0011189017,0.0012675341,0.0009337941,0.0023648152],"category_scores_gemma":[0.003131826,0.00036681554,0.0010734265,0.00074116286,0.000674,0.0013432046,0.0015814721,0.001327502,0.0005475983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031710497,0.00007569569,0.0006349038,0.00015484315,0.00011387871,0.00006700359,0.00009163643,0.8426461,0.0032464906,0.065013126,0.0010498732,0.08687469],"study_design_scores_gemma":[0.000013492891,0.00008905759,0.00010661746,0.000025067606,0.000016616495,0.00003075659,0.000018668607,0.9749522,0.0012211978,0.02059682,0.0029160634,0.000013365666],"about_ca_topic_score_codex":0.0019651083,"about_ca_topic_score_gemma":0.0022234588,"teacher_disagreement_score":0.0023648152,"about_ca_system_score_codex":0.00095968647,"about_ca_system_score_gemma":0.0010190804,"threshold_uncertainty_score":0.009887934},"labels":[],"label_agreement":null},{"id":"W3120457970","doi":"10.1109/ssci47803.2020.9308352","title":"Deterministic Numeric Simulation and Surrogate Models with White and Black Machine Learning Methods: A Case Study on Inverse Mappings","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Research Council Canada","funders":"","keywords":"Black box; Computer science; Surrogate model; Inverse problem; Emulation; Artificial intelligence; Machine learning; Range (aeronautics); Partial differential equation; Mathematical optimization; Algorithm; Mathematics","score_opus":0.06153928276110581,"score_gpt":0.33126714973596255,"score_spread":0.26972786697485673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120457970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14386289,0.0011423298,0.8295167,0.001070802,0.00010926357,0.000114948605,0.00012007948,0.00038425214,0.023678785],"genre_scores_gemma":[0.8532746,0.0006235605,0.13994281,0.000079429774,0.00003805598,0.00014025517,0.00008374172,0.00009789531,0.00571971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921787,0.0004492487,0.00002693598,0.00006454806,0.00019751124,0.000043957294],"domain_scores_gemma":[0.9977202,0.0017940054,0.00009009395,0.00019956654,0.00014457456,0.000051574676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019090262,0.00050536793,0.0008224859,0.00048709207,0.00066308846,0.001366887,0.0005682885,0.0016025176,0.0016084525],"category_scores_gemma":[0.0038873486,0.0003550891,0.0007798475,0.0007176652,0.0014283035,0.0010941353,0.00090306165,0.0011754278,0.00024056555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004171484,0.000043842785,0.0004458095,0.00004808282,0.000009871003,0.00015294086,0.00010707023,0.9564209,0.0008488012,0.03131067,0.00030193158,0.010268303],"study_design_scores_gemma":[0.0000059549916,0.00002639425,0.00009847702,0.000009885768,0.0000025560757,0.00003633209,0.000019194189,0.9904102,0.00094339665,0.007019102,0.0014228268,0.0000057229504],"about_ca_topic_score_codex":0.0018687235,"about_ca_topic_score_gemma":0.0013492659,"teacher_disagreement_score":0.0019090262,"about_ca_system_score_codex":0.0007110684,"about_ca_system_score_gemma":0.00070000626,"threshold_uncertainty_score":0.010096073},"labels":[],"label_agreement":null},{"id":"W3122249354","doi":"","title":"Evolutionary Sequential Monte Carlo Samplers for Change-point Models","year":2015,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Markov chain Monte Carlo; Particle filter; Monte Carlo method; Computer science; Algorithm; Marginal likelihood; Mathematical optimization; Inference; Hybrid Monte Carlo; Heuristic; Bayesian probability; Mathematics; Artificial intelligence; Statistics; Kalman filter","score_opus":0.13317681680389143,"score_gpt":0.3639498034040559,"score_spread":0.2307729866001645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122249354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030347446,0.00017492594,0.9953768,0.00009164899,0.000030590814,0.000045432538,0.000041987627,0.00013151107,0.0010723051],"genre_scores_gemma":[0.22963396,0.00070988113,0.760781,0.00025455,0.00015910732,0.0007349629,0.00061751995,0.0003403969,0.0067686997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830127,0.00092661765,0.00006483579,0.00026897792,0.0003447415,0.00009343506],"domain_scores_gemma":[0.98943615,0.008501709,0.0004829381,0.00062408927,0.00073881535,0.0002162999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049997717,0.0010164562,0.0014612366,0.0015186497,0.00075837766,0.0014661603,0.0021792452,0.0017328911,0.008593899],"category_scores_gemma":[0.024169365,0.0008558309,0.0013360489,0.0013728832,0.001678355,0.0017383759,0.0017991671,0.0025727516,0.0011563705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009467961,0.000056908,0.0016552426,0.0001223719,0.00009971429,0.00010961253,0.000115041,0.68822396,0.00053340115,0.26824602,0.0015727743,0.03917017],"study_design_scores_gemma":[0.000016971908,0.000010833747,0.000091409966,0.000015187237,0.000008943473,0.00001811918,0.000006040801,0.93715245,0.0001409409,0.061397176,0.0011350714,0.00000683182],"about_ca_topic_score_codex":0.004530694,"about_ca_topic_score_gemma":0.0059757824,"teacher_disagreement_score":0.008593899,"about_ca_system_score_codex":0.0013330404,"about_ca_system_score_gemma":0.0014447634,"threshold_uncertainty_score":0.028749406},"labels":[],"label_agreement":null},{"id":"W3133833020","doi":"10.1007/s11004-021-09927-z","title":"Correction to: Uncertainty Assessment over any Volume without Simulation: Revisiting Multi-Gaussian Kriging","year":2021,"lang":"en","type":"article","venue":"Mathematical Geosciences","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"","keywords":"Kriging; Geostatistics; Hydrogeology; Uncertainty quantification; Gaussian; Variogram; Statistics; Econometrics; Gaussian process; Environmental science; Volume (thermodynamics); Mathematics; Geology; Statistical physics; Soil science; Computer science; Geotechnical engineering; Physics; Spatial variability; Thermodynamics","score_opus":0.024428264746360666,"score_gpt":0.3459286096820115,"score_spread":0.32150034493565083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133833020","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.0038974741,0.0017921261,0.098772064,0.0318324,0.8302811,0.00018960061,0.0077681444,0.017953705,0.0075133815],"genre_scores_gemma":[0.28451058,0.0063204677,0.3243679,0.031345353,0.07225946,0.0007134929,0.018916499,0.036714356,0.22485189],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994799,0.0006931879,0.00072280556,0.00088943867,0.0025427737,0.00035270714],"domain_scores_gemma":[0.960079,0.00789414,0.001810162,0.0059745237,0.022960888,0.0012812421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037560686,0.0024731937,0.002897044,0.0035134442,0.0026191243,0.004815446,0.0048501715,0.0065146275,0.12696894],"category_scores_gemma":[0.074531265,0.0018367104,0.0017504343,0.005407364,0.0017062211,0.0037015018,0.0043829274,0.00715931,0.04511708],"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.00018386227,0.00004200896,0.00044026083,0.0005090431,0.00007921412,0.0002947203,0.00010684929,0.0052239234,0.0014396847,0.004685455,0.94834936,0.038645618],"study_design_scores_gemma":[0.00028259854,0.00008369713,0.004320312,0.000514674,0.00016203185,0.0010497597,0.00042041217,0.09171022,0.011161076,0.029404258,0.860471,0.0004200126],"about_ca_topic_score_codex":0.015675997,"about_ca_topic_score_gemma":0.024084158,"teacher_disagreement_score":0.12696894,"about_ca_system_score_codex":0.002990259,"about_ca_system_score_gemma":0.0060400483,"threshold_uncertainty_score":0.42475343},"labels":[],"label_agreement":null},{"id":"W3139526846","doi":"10.1080/00949655.2021.1900182","title":"Approximately optimal subset selection for statistical design and modelling","year":2021,"lang":"en","type":"article","venue":"Journal of Statistical Computation and Simulation","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Mathematics; Mathematical optimization; Selection (genetic algorithm); Cross-entropy method; Entropy (arrow of time); Optimization problem; Set (abstract data type); Optimal design; Principle of maximum entropy; Algorithm; Applied mathematics; Statistics; Computer science; Artificial intelligence; Quadratic assignment problem","score_opus":0.04670705401099513,"score_gpt":0.32965979382469884,"score_spread":0.2829527398137037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139526846","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.0015590361,0.000116200135,0.9978884,0.00008525888,0.000010195994,0.000045598896,0.000021897418,0.000050786064,0.00022267648],"genre_scores_gemma":[0.18031801,0.0007403679,0.8152733,0.00022298266,0.00014142545,0.00133382,0.00036773426,0.00014973446,0.0014525951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9878405,0.009867636,0.00026673186,0.0008134401,0.000979221,0.00023258623],"domain_scores_gemma":[0.9633958,0.032134887,0.0013208927,0.0016639198,0.0011822432,0.0003022987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014843931,0.0023051635,0.0029091532,0.0017100564,0.0006533478,0.0016526608,0.0017902964,0.0018740597,0.0026128402],"category_scores_gemma":[0.042206116,0.00127686,0.0016276125,0.0019262221,0.0029187805,0.0020206633,0.0023140723,0.0022323413,0.00064647954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013095372,0.000059672617,0.0007219469,0.00017764159,0.0001766201,0.00009790915,0.0000965014,0.84299374,0.0010975752,0.12267953,0.0010065784,0.030761335],"study_design_scores_gemma":[0.000033515378,0.00006032751,0.00008516488,0.00001678396,0.000013601297,0.000019321886,0.000008601168,0.92488927,0.00043498675,0.07368854,0.00074009964,0.000009691418],"about_ca_topic_score_codex":0.0015470594,"about_ca_topic_score_gemma":0.0012390333,"teacher_disagreement_score":0.014843931,"about_ca_system_score_codex":0.0018119316,"about_ca_system_score_gemma":0.0026902938,"threshold_uncertainty_score":0.07850313},"labels":[],"label_agreement":null},{"id":"W3141233211","doi":"10.1007/s10589-021-00272-9","title":"DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"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":"Mathematical optimization; Multi-objective optimization; Iterated local search; Extension (predicate logic); Context (archaeology); Set (abstract data type); Pareto principle; Mathematics; Computer science; Optimization problem; Metaheuristic","score_opus":0.018983299392605023,"score_gpt":0.29188553682389085,"score_spread":0.27290223743128583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141233211","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.0049384944,0.00024921523,0.9867401,0.00012682383,0.0001226978,0.000068524976,0.00013282595,0.002597384,0.0050238855],"genre_scores_gemma":[0.11768229,0.00014299755,0.8746829,0.00030880078,0.000052946143,0.0004766194,0.0003063876,0.0009322131,0.005414862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994956,0.00018467828,0.000017528035,0.0000640241,0.0001856263,0.000052523486],"domain_scores_gemma":[0.99907494,0.0005519617,0.00005149598,0.000117626405,0.00014322322,0.000060772418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010519966,0.0012101273,0.0015571639,0.0010197297,0.0006723057,0.0010582916,0.0020400642,0.002120629,0.012176845],"category_scores_gemma":[0.0033116387,0.0006900596,0.0009196229,0.0009798463,0.0006140507,0.0009130752,0.0023074434,0.0020977876,0.0021866008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002821243,0.00018621082,0.00045593927,0.00030139682,0.00015211238,0.00008506681,0.00009064284,0.74843323,0.005149997,0.022269867,0.011325085,0.2112683],"study_design_scores_gemma":[0.000024608356,0.00001733418,0.000028198741,0.000010612738,0.0000045201496,0.000009092692,0.000004732353,0.9947699,0.0006858486,0.0029837913,0.0014577396,0.0000036630008],"about_ca_topic_score_codex":0.0023174733,"about_ca_topic_score_gemma":0.004123377,"teacher_disagreement_score":0.012176845,"about_ca_system_score_codex":0.0006717562,"about_ca_system_score_gemma":0.0011703288,"threshold_uncertainty_score":0.040735602},"labels":[],"label_agreement":null},{"id":"W3142815160","doi":"10.1115/1.4050749","title":"Multi-Objective Optimization for High-Dimensional Expensively Constrained Black-Box Problems","year":2021,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Decomposition; Multi-objective optimization; Cluster analysis; Metamodeling; Mathematics; Artificial intelligence; Machine learning","score_opus":0.0373627401359308,"score_gpt":0.2772010246687062,"score_spread":0.23983828453277542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142815160","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.035307452,0.0002962655,0.96194714,0.00012496406,0.00003140262,0.000055458495,0.00003935665,0.0001684919,0.0020295163],"genre_scores_gemma":[0.59992486,0.00022153008,0.39686015,0.0001530926,0.000031822106,0.0003476888,0.00013796658,0.00014048339,0.0021823933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.0004298091,0.00003693915,0.000096494376,0.00016168106,0.000055557575],"domain_scores_gemma":[0.99785393,0.0015946395,0.00017335842,0.00009964292,0.0002163575,0.00006206838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025180362,0.0012346379,0.0013312439,0.0007773878,0.00045145646,0.0008448103,0.00096517045,0.0013379023,0.0018330922],"category_scores_gemma":[0.00319435,0.00073062035,0.0009595242,0.0005293664,0.0008408694,0.0006844811,0.0010309573,0.0011806301,0.00023651795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013301435,0.000017064955,0.00014977835,0.00003193372,0.000022017282,0.000019555702,0.000009085239,0.9940446,0.00059595733,0.0012388958,0.00009489219,0.0037629378],"study_design_scores_gemma":[0.0000034373147,0.000008754334,0.000027788547,0.000002687707,0.0000019005043,0.0000021448343,0.0000022317452,0.99925464,0.00016886485,0.0004467926,0.000079659236,0.000001111476],"about_ca_topic_score_codex":0.0037145796,"about_ca_topic_score_gemma":0.0030729834,"teacher_disagreement_score":0.0037145796,"about_ca_system_score_codex":0.0006159416,"about_ca_system_score_gemma":0.0008649864,"threshold_uncertainty_score":0.01331687},"labels":[],"label_agreement":null},{"id":"W3151456762","doi":"10.4018/978-1-5225-2498-4.ch013","title":"Design and Analysis of Computer Experiments","year":2017,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"","keywords":"Computer science; Computer experiment; Process (computing); Emphasis (telecommunications); Engineering design process; Design of experiments; Computer Applications; Management science; Systems engineering; Industrial engineering; Simulation; Engineering; Mathematics; Programming language; Mechanical engineering","score_opus":0.03888834029460076,"score_gpt":0.31795843060800055,"score_spread":0.2790700903133998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151456762","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.008809746,0.0027406928,0.91904783,0.0006398056,0.0011886001,0.027229508,0.005385572,0.0040816166,0.030876603],"genre_scores_gemma":[0.055948887,0.0035136733,0.80254483,0.0014644027,0.00041374916,0.11549435,0.0045768367,0.0013593083,0.014684016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895475,0.0045162425,0.00078296097,0.0015522852,0.003216115,0.00038485412],"domain_scores_gemma":[0.979478,0.010501126,0.0013425477,0.0027426379,0.005487196,0.00044851482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013478289,0.0017945179,0.0017047176,0.001590848,0.0006090617,0.0032822187,0.0023221571,0.0013883502,0.03440016],"category_scores_gemma":[0.041637916,0.0007878014,0.0007725128,0.001352711,0.001340637,0.0015178531,0.0015873435,0.002137188,0.009993906],"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.004145372,0.0008875559,0.0029292763,0.010084332,0.00049445545,0.0002855514,0.0007654898,0.049987786,0.038994934,0.13814293,0.068803445,0.6844789],"study_design_scores_gemma":[0.002366272,0.0051252516,0.0043110773,0.0021146957,0.0004918041,0.00029786333,0.0004404589,0.09757819,0.07197109,0.11591371,0.6991024,0.00028721843],"about_ca_topic_score_codex":0.0003954504,"about_ca_topic_score_gemma":0.00045111688,"teacher_disagreement_score":0.03440016,"about_ca_system_score_codex":0.0012402749,"about_ca_system_score_gemma":0.0037496646,"threshold_uncertainty_score":0.11508},"labels":[],"label_agreement":null},{"id":"W3153988432","doi":"","title":"Inverse Bayesian Optimization: Learning Human Search Strategies in a Sequential Optimization Task.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Bayesian optimization; Hyperparameter optimization; Probabilistic logic; Computer science; Bayesian probability; Task (project management); Function (biology); Machine learning; Optimization problem; Range (aeronautics); Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.05935918226286159,"score_gpt":0.23310943778464457,"score_spread":0.17375025552178297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153988432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0196967,0.00021896945,0.9774801,0.0002611951,0.000012267894,0.00006391936,0.000034116216,0.00019225238,0.0020405175],"genre_scores_gemma":[0.43238398,0.00041946225,0.5630088,0.00022429724,0.00003803111,0.00052439055,0.00018156767,0.00013656168,0.0030829099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.0009537501,0.000052660762,0.0002567319,0.0002057898,0.000068371504],"domain_scores_gemma":[0.9933314,0.0054310258,0.0005305732,0.00031616143,0.00024212936,0.00014863138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042989245,0.0011650671,0.0011121396,0.0007689862,0.0004591748,0.0012037078,0.0012984347,0.0016680531,0.00229962],"category_scores_gemma":[0.020507827,0.0008898612,0.0007046769,0.000725724,0.0015653059,0.0019626168,0.0017101584,0.0017283751,0.00048731448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023091573,0.00019329331,0.003879561,0.00021820462,0.00015722743,0.00009560448,0.0004516969,0.8003054,0.002829433,0.053883053,0.0018580888,0.13589755],"study_design_scores_gemma":[0.000016955975,0.000049167633,0.00038164918,0.000018448241,0.000008789651,0.000027655316,0.00001955856,0.96893454,0.00036812568,0.029537082,0.000626665,0.000011405447],"about_ca_topic_score_codex":0.0042956294,"about_ca_topic_score_gemma":0.0052170316,"teacher_disagreement_score":0.0042989245,"about_ca_system_score_codex":0.00086934754,"about_ca_system_score_gemma":0.0017239897,"threshold_uncertainty_score":0.022735178},"labels":[],"label_agreement":null},{"id":"W3160538881","doi":"10.1016/j.compchemeng.2021.107371","title":"An adaptive sampling surrogate model building framework for the optimization of reaction systems","year":2021,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Adaptive sampling; Computer science; Sampling (signal processing); Convergence (economics); Mathematical optimization; Engineering optimization; Surrogate model; Scale (ratio); Optimization problem; Linear programming; Algorithm; Machine learning; Mathematics; Monte Carlo method","score_opus":0.026938695011727475,"score_gpt":0.2758539798247078,"score_spread":0.2489152848129803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160538881","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.0030591753,0.00011480176,0.99501437,0.00006361741,0.000024530415,0.000025545598,0.000034708595,0.00016235145,0.0015009036],"genre_scores_gemma":[0.39327484,0.000464904,0.6005068,0.0001799263,0.00011149612,0.0005647159,0.00042717397,0.0003335679,0.0041365926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992009,0.00042251303,0.000028444918,0.000046457353,0.00025530576,0.000046400895],"domain_scores_gemma":[0.99884737,0.0006614067,0.00008345425,0.00010139895,0.00024827695,0.000058101825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023921076,0.00086651463,0.0015030175,0.000678797,0.00048751917,0.00088611007,0.0018028574,0.0014108185,0.002199708],"category_scores_gemma":[0.004068097,0.00060700503,0.0010633123,0.0008166264,0.0006919252,0.00080422463,0.001407335,0.0017252482,0.00052712485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027381158,0.00002790438,0.00010323287,0.000033484266,0.00001957403,0.000016282784,0.000012250727,0.97641766,0.0005269756,0.012322691,0.00028110459,0.010211545],"study_design_scores_gemma":[0.0000021720602,0.0000051035317,0.0000066721104,0.0000015071372,0.000001074229,0.000001271082,5.902203e-7,0.9986312,0.000054271844,0.0011727097,0.00012256434,8.4311495e-7],"about_ca_topic_score_codex":0.003550054,"about_ca_topic_score_gemma":0.0036795523,"teacher_disagreement_score":0.003550054,"about_ca_system_score_codex":0.0005620983,"about_ca_system_score_gemma":0.001373189,"threshold_uncertainty_score":0.012650847},"labels":[],"label_agreement":null},{"id":"W3162664130","doi":"10.1007/s10898-021-01019-w","title":"Integrating $$\\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems","year":2021,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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 Guelph","funders":"National Research Foundation Singapore","keywords":"Mathematical optimization; Surrogate model; Optimization problem; Mathematics; Function (biology); Multi-objective optimization; Evolutionary algorithm; Computer science","score_opus":0.011906402326560034,"score_gpt":0.2696545108687438,"score_spread":0.2577481085421838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162664130","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.0032388978,0.00032709006,0.99256563,0.00014562966,0.000083407846,0.000034190478,0.000023661696,0.00011496514,0.0034664858],"genre_scores_gemma":[0.20589824,0.0007662238,0.78529525,0.00042111718,0.00016193315,0.00031529256,0.00018821478,0.00044275718,0.006510965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819773,0.000868539,0.00007313263,0.00007507706,0.0006596088,0.00012587858],"domain_scores_gemma":[0.9976769,0.0013253548,0.00012846035,0.00013245334,0.00064133527,0.000095600284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047787814,0.0016927128,0.0019159521,0.0011385509,0.00059517956,0.0014167589,0.0015304885,0.002022625,0.0026862181],"category_scores_gemma":[0.00787696,0.0006078725,0.0010064427,0.00125291,0.00082138786,0.0014523413,0.0020243542,0.002079374,0.00081856945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011408235,0.00017555607,0.0003854453,0.00023391083,0.00007285272,0.00008227285,0.00006225317,0.8652583,0.0030821469,0.042130627,0.003158911,0.085243605],"study_design_scores_gemma":[0.0000032640232,0.000012289476,0.000021310387,0.000008964118,0.000002937513,0.000008534798,0.000003319727,0.9967526,0.00021549614,0.0025458196,0.0004219654,0.000003490596],"about_ca_topic_score_codex":0.004402969,"about_ca_topic_score_gemma":0.006894906,"teacher_disagreement_score":0.0047787814,"about_ca_system_score_codex":0.00067484204,"about_ca_system_score_gemma":0.0017662866,"threshold_uncertainty_score":0.025272965},"labels":[],"label_agreement":null},{"id":"W3163384192","doi":"10.18280/isi.260205","title":"Evolutionary Algorithms for Real Time Engineering Problems: A Comprehensive Review","year":2021,"lang":"en","type":"review","venue":"Ingénierie des systèmes d information","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Metaheuristic; Engineering optimization; Mathematical optimization; Computer science; Optimization problem; Variety (cybernetics); Process (computing); Evolutionary algorithm; Continuous optimization; Scheme (mathematics); Test functions for optimization; Multi-swarm optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.03430728709100111,"score_gpt":0.29568628473752917,"score_spread":0.26137899764652806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163384192","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.0003726159,0.97771525,0.015872274,0.0004704423,0.00033152348,0.00002066242,0.00003057808,0.000057979763,0.005128739],"genre_scores_gemma":[0.0041988688,0.97791845,0.014983432,0.0002061822,0.00048249998,0.000035869536,0.000096492535,0.00002812239,0.0020500198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958473,0.00008139021,0.000049136164,0.00007372948,0.00018519883,0.000025929314],"domain_scores_gemma":[0.9991279,0.00057294866,0.000051014293,0.000039276318,0.00018594775,0.000022921824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008183464,0.0013363855,0.0013391727,0.002108053,0.00035837753,0.0014595288,0.0013425242,0.0014022553,0.00429889],"category_scores_gemma":[0.0016687106,0.0005407682,0.00079679297,0.0044477903,0.00064504,0.0022762248,0.00085705996,0.0017851372,0.0028519442],"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.000025106856,0.00009278377,0.00021620245,0.0068564205,0.00008298275,0.00008944398,0.00007461282,0.0068143844,0.0007784431,0.019205678,0.01600643,0.94975764],"study_design_scores_gemma":[0.000018607465,0.00012792645,0.0006371554,0.0041969125,0.00012660683,0.0007586548,0.00009429127,0.007981573,0.000907978,0.023168473,0.9619256,0.00005624013],"about_ca_topic_score_codex":0.0010281922,"about_ca_topic_score_gemma":0.0010592116,"teacher_disagreement_score":0.00429889,"about_ca_system_score_codex":0.00048326756,"about_ca_system_score_gemma":0.0010218191,"threshold_uncertainty_score":0.01438123},"labels":[],"label_agreement":null},{"id":"W3180164923","doi":"10.1007/s10589-022-00381-z","title":"Quantifying uncertainty with ensembles of surrogates for blackbox optimization","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"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":"Institut de Valorisation des Données","keywords":"Mathematical optimization; Computer science; Stochastic optimization; Context (archaeology); Optimization problem; Metaheuristic; Mathematics","score_opus":0.022842800052946446,"score_gpt":0.28093445588126226,"score_spread":0.25809165582831584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180164923","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.014821826,0.0002492374,0.9832169,0.00011069087,0.000049777882,0.000017212082,0.000039659375,0.00010585379,0.0013888929],"genre_scores_gemma":[0.7911334,0.0004812648,0.20607749,0.00013673624,0.00011589745,0.00013686919,0.00025295702,0.00021313044,0.0014522914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970644,0.001633692,0.00011095234,0.00026575447,0.0007756577,0.00014958973],"domain_scores_gemma":[0.9914562,0.005769517,0.00060791237,0.0011076484,0.0007976171,0.00026103307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061406638,0.0013392187,0.0020376309,0.001075384,0.0006398,0.0022274177,0.0011476321,0.0020501602,0.0012121669],"category_scores_gemma":[0.019961052,0.0008680848,0.0011379513,0.00090637314,0.0016280705,0.002846467,0.0029869345,0.0022074918,0.00023045353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000486117,0.000018332717,0.00029438,0.000035253666,0.000051405772,0.000017765527,0.000022290915,0.96932113,0.00071808463,0.021565786,0.00024882366,0.007658072],"study_design_scores_gemma":[0.0000015248772,0.000009578758,0.000042124073,0.0000068119607,0.0000036634747,0.0000052947935,0.0000026098362,0.9865567,0.00024522707,0.013003771,0.00011947107,0.0000032558398],"about_ca_topic_score_codex":0.0006912769,"about_ca_topic_score_gemma":0.0006107186,"teacher_disagreement_score":0.0061406638,"about_ca_system_score_codex":0.0007574406,"about_ca_system_score_gemma":0.00080408395,"threshold_uncertainty_score":0.032475352},"labels":[],"label_agreement":null},{"id":"W3185522196","doi":"10.1017/9781108571401.027","title":"Optimal Design for Least Squares Estimators","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Estimator; Computer science; Content (measure theory); Least-squares function approximation; Statistics; Mathematics","score_opus":0.03620858582150023,"score_gpt":0.2258413488710233,"score_spread":0.1896327630495231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185522196","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.00027219453,0.0032629191,0.99011993,0.00020751257,0.00019470851,0.000021764901,0.000083940264,0.00024190512,0.0055951825],"genre_scores_gemma":[0.056885835,0.016881363,0.87221193,0.000850897,0.0010886039,0.0007161257,0.00114493,0.0007720845,0.049448237],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984875,0.0007457652,0.00006175507,0.00020720829,0.00044046083,0.000057383593],"domain_scores_gemma":[0.99884486,0.00078076206,0.000054714637,0.00012828784,0.00017164566,0.000019538671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016869707,0.0012299323,0.0012818682,0.00065423816,0.00027258828,0.0013784459,0.0012115891,0.0016248224,0.021489209],"category_scores_gemma":[0.0057651917,0.00068237155,0.00073816965,0.0013131622,0.0010015568,0.0011890556,0.0012166701,0.0022456911,0.010023743],"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.000109888606,0.00006194282,0.00033749716,0.0013789003,0.00016946091,0.00010158771,0.000089566754,0.1317065,0.004648209,0.280774,0.069659,0.5109633],"study_design_scores_gemma":[0.00005620973,0.00010860821,0.00055488234,0.00029111697,0.00006514165,0.0002063055,0.00003953736,0.5448794,0.0036427868,0.32220757,0.12789693,0.000051537925],"about_ca_topic_score_codex":0.0012245085,"about_ca_topic_score_gemma":0.0013450141,"teacher_disagreement_score":0.021489209,"about_ca_system_score_codex":0.0007387696,"about_ca_system_score_gemma":0.00084454217,"threshold_uncertainty_score":0.071888566},"labels":[],"label_agreement":null},{"id":"W3193433638","doi":"10.1007/978-3-030-64018-7_4","title":"Heuristics and Metaheuristics for Fixed-Charge Network Design","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Metaheuristic; Heuristics; Fixed charge; Computer science; Mathematical optimization; Heuristic; Constructive; Field (mathematics); Population; Mathematics; Sociology","score_opus":0.04156584865863594,"score_gpt":0.2514892381633121,"score_spread":0.20992338950467615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193433638","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.0033960966,0.012504561,0.9177813,0.00051785295,0.00063010736,0.00009338812,0.00012424804,0.00042246524,0.064529985],"genre_scores_gemma":[0.15085778,0.017729633,0.74503666,0.00046103337,0.00063660054,0.00038220352,0.00029471415,0.00039504265,0.08420632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976593,0.00008472021,0.000006781654,0.00003059413,0.00008665257,0.000025277457],"domain_scores_gemma":[0.9997396,0.00016592101,0.000017868511,0.000029781066,0.000035768444,0.000011083274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392293,0.0014072143,0.0007814904,0.0007306478,0.00043707312,0.0014483146,0.0018677987,0.0014745024,0.010157972],"category_scores_gemma":[0.0013400026,0.00068400346,0.00066700677,0.0019821564,0.00066073553,0.0012381762,0.00059675693,0.0017115779,0.0016950245],"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.00003451577,0.000047581507,0.000058761816,0.00021357808,0.00003905946,0.000041835603,0.000025565982,0.74466896,0.0010791371,0.09146944,0.016556397,0.14576513],"study_design_scores_gemma":[0.000021652604,0.000042744094,0.00009245456,0.000082317565,0.000019425603,0.00006478314,0.000030208808,0.85508466,0.000889221,0.107563995,0.036093056,0.000015537948],"about_ca_topic_score_codex":0.0037403621,"about_ca_topic_score_gemma":0.0061810864,"teacher_disagreement_score":0.010157972,"about_ca_system_score_codex":0.0013447604,"about_ca_system_score_gemma":0.0008963937,"threshold_uncertainty_score":0.0339818},"labels":[],"label_agreement":null},{"id":"W3197491224","doi":"10.1109/tnnls.2021.3105937","title":"Multi-Objective Neural Evolutionary Algorithm for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Knapsack problem; Artificial neural network; Evolutionary algorithm; Combinatorial optimization; Travelling salesman problem; Scalability; Mathematical optimization; Artificial intelligence; Heuristics; Optimization problem; Inference; Algorithm; Mathematics","score_opus":0.014620265587794617,"score_gpt":0.24346156437418906,"score_spread":0.22884129878639445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197491224","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.010265536,0.0003873467,0.98548687,0.00017539387,0.000042436215,0.000053601547,0.000026542992,0.00023928184,0.003323069],"genre_scores_gemma":[0.30271888,0.00046532077,0.6907821,0.0002982925,0.000057113975,0.0005003908,0.0001931065,0.00014422776,0.0048405714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996069,0.00015121159,0.000019923842,0.00006286645,0.00011187092,0.000047257316],"domain_scores_gemma":[0.99926955,0.00048629282,0.000054194785,0.00004524509,0.000106097716,0.000038591894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012113808,0.0012016789,0.0011250537,0.0007642166,0.00042021475,0.00076219655,0.0012412948,0.0012304679,0.0022641262],"category_scores_gemma":[0.0027307072,0.00047268454,0.00072867755,0.0007530923,0.0006082475,0.00074165215,0.001085602,0.0016198317,0.00035891176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021757647,0.000042621712,0.00035222087,0.000045059205,0.000037135065,0.000038471448,0.000027175955,0.95114845,0.0005283575,0.009895736,0.0007278821,0.037135094],"study_design_scores_gemma":[0.0000061011415,0.000008739648,0.000021104908,0.0000031524573,0.0000024886604,0.0000052493506,0.0000023513808,0.9973882,0.00008705099,0.0021709641,0.00030326692,0.0000014213224],"about_ca_topic_score_codex":0.0033860288,"about_ca_topic_score_gemma":0.003760612,"teacher_disagreement_score":0.0033860288,"about_ca_system_score_codex":0.0008706453,"about_ca_system_score_gemma":0.0010868713,"threshold_uncertainty_score":0.0075742006},"labels":[],"label_agreement":null},{"id":"W3197550566","doi":"10.1007/978-3-030-63591-6_25","title":"Using Shooting Approaches to Generate Initial Guesses for ODE Parameter Estimation","year":2021,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Ode; Parameterized complexity; Ordinary differential equation; Set (abstract data type); Shooting method; Computer science; Mathematical optimization; Estimation; Estimation theory; Mathematics; Differential (mechanical device); Applied mathematics; Algorithm; Differential equation; Engineering; Boundary value problem; Mathematical analysis","score_opus":0.2098970060607345,"score_gpt":0.3354747858039829,"score_spread":0.12557777974324838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197550566","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.002175706,0.000031456162,0.9957301,0.000020793037,0.000020300658,0.00002939282,0.000032153574,0.0005013773,0.0014586905],"genre_scores_gemma":[0.06266224,0.00009227167,0.9330952,0.000047483893,0.000013252136,0.00014880176,0.00020253562,0.00063309894,0.0031050148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967825,0.000100069,0.000022140859,0.000053037646,0.00012279843,0.000023738457],"domain_scores_gemma":[0.9970975,0.0019960783,0.00014343119,0.0002888123,0.00037895184,0.000095254174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935713,0.0013113886,0.00090869836,0.0010461325,0.0007808082,0.0012897932,0.0012623774,0.0018814801,0.009270938],"category_scores_gemma":[0.0073763756,0.0012181764,0.000819695,0.0008261604,0.0009832499,0.0014413298,0.0020268615,0.0027445296,0.0024977885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015913208,0.000106877706,0.00063698925,0.00025338092,0.00007183234,0.00018497302,0.0003673303,0.7904997,0.013804088,0.035839103,0.0039296406,0.15414697],"study_design_scores_gemma":[0.000011261988,0.000014933875,0.000038558243,0.00001644151,0.0000050898993,0.000020597978,0.000015941207,0.9890323,0.0026498092,0.00679689,0.0013881426,0.00001010729],"about_ca_topic_score_codex":0.00358091,"about_ca_topic_score_gemma":0.005716996,"teacher_disagreement_score":0.009270938,"about_ca_system_score_codex":0.0006930263,"about_ca_system_score_gemma":0.0008324434,"threshold_uncertainty_score":0.031014383},"labels":[],"label_agreement":null},{"id":"W3197777288","doi":"10.1287/opre.2022.0382","title":"Inverse Optimization: Theory and Applications","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":69,"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; University of Toronto","funders":"","keywords":"Inverse; Mathematical optimization; Computer science; Optimization problem; Inverse problem; Range (aeronautics); Mathematics; Engineering","score_opus":0.05634145700229787,"score_gpt":0.3915288568863341,"score_spread":0.33518739988403623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197777288","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006334383,0.8876783,0.086739145,0.0033233531,0.0011866711,0.00003331391,0.00011406343,0.00009104481,0.020200666],"genre_scores_gemma":[0.018485513,0.9397588,0.032015134,0.0012955151,0.0029608137,0.00007038815,0.00018019178,0.00007074604,0.005163007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870074,0.00037711958,0.00012487257,0.0001961657,0.000533346,0.00006766794],"domain_scores_gemma":[0.9984926,0.0009461117,0.00009820901,0.000079650046,0.00033936035,0.000044049604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933112,0.001419176,0.0019151671,0.0027415976,0.00065925234,0.0028346516,0.0013971493,0.0025245936,0.007613298],"category_scores_gemma":[0.0031563954,0.00083107944,0.0013984498,0.0046040835,0.0021598542,0.0028390505,0.0015894853,0.0028963513,0.0029193328],"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.00004867603,0.00010489825,0.0007118623,0.00859701,0.00015996431,0.0002164612,0.00016203214,0.0369969,0.00150225,0.28475302,0.063311085,0.60343575],"study_design_scores_gemma":[0.000016899705,0.00009130729,0.0011037298,0.003178989,0.000076631426,0.0010426476,0.00014739319,0.024399411,0.0008238913,0.2725263,0.69649,0.000102853664],"about_ca_topic_score_codex":0.0027586347,"about_ca_topic_score_gemma":0.001910297,"teacher_disagreement_score":0.007613298,"about_ca_system_score_codex":0.0015346257,"about_ca_system_score_gemma":0.0019198158,"threshold_uncertainty_score":0.025469005},"labels":[],"label_agreement":null},{"id":"W3201643026","doi":"10.1016/j.jobe.2021.103272","title":"A hierarchical decomposition approach for multi-level building design optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Building Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"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":"Mathematical optimization; Decomposition; Optimization problem; Dimension (graph theory); Computer science; Set (abstract data type); Decomposition method (queueing theory); Mathematics","score_opus":0.05117331093593996,"score_gpt":0.30887728798071107,"score_spread":0.2577039770447711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201643026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013213339,0.000093210794,0.9971681,0.000025304345,0.0000148352665,0.0000144864125,0.000021577098,0.00008559623,0.0012554654],"genre_scores_gemma":[0.10978837,0.00036116983,0.88675696,0.00008461444,0.000039449387,0.00019086424,0.00017079388,0.00017089261,0.002436876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995677,0.0001422806,0.000023311193,0.00004517015,0.00017631378,0.000045097197],"domain_scores_gemma":[0.9995592,0.00019494025,0.00003227987,0.00005314301,0.00013176701,0.000028600454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078689173,0.00089246506,0.0010770402,0.00086062914,0.00051227695,0.00084060413,0.0011942538,0.0009350333,0.004177292],"category_scores_gemma":[0.0014022266,0.00074973825,0.0014457578,0.0010737875,0.0004223752,0.000840434,0.0013573342,0.0014630007,0.0008919015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002225519,0.00004685525,0.00015724424,0.00009654067,0.000042066513,0.000035883597,0.000038114562,0.9254358,0.0038566987,0.015397121,0.0011183156,0.053753085],"study_design_scores_gemma":[0.0000027543842,0.000009062355,0.00002966706,0.0000051833435,0.000005347417,0.000005106805,0.000003904751,0.99650526,0.00020646844,0.0026992853,0.0005254118,0.0000025637107],"about_ca_topic_score_codex":0.004685804,"about_ca_topic_score_gemma":0.006389862,"teacher_disagreement_score":0.004685804,"about_ca_system_score_codex":0.0005137461,"about_ca_system_score_gemma":0.0010107862,"threshold_uncertainty_score":0.013974488},"labels":[],"label_agreement":null},{"id":"W3202513398","doi":"10.3390/a14100286","title":"Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure","funders":"","keywords":"Ant colony optimization algorithms; Mathematical optimization; Computer science; Domain (mathematical analysis); Heuristic; Optimization problem; Combinatorial optimization; Metaheuristic; Engineering design process; Discrete optimization; Set (abstract data type); Continuous optimization; Sequence (biology); Truss; Algorithm; Mathematics; Engineering; Multi-swarm optimization","score_opus":0.015335681380706772,"score_gpt":0.27116537417371767,"score_spread":0.2558296927930109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202513398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013953475,0.00086966786,0.97527766,0.00029504352,0.000088846275,0.00010320817,0.00009098218,0.00027438626,0.009046694],"genre_scores_gemma":[0.39334226,0.0011589587,0.59938323,0.00027048038,0.00012190319,0.00048179197,0.00030474315,0.00013217432,0.0048044627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00032810698,0.00002710282,0.00007008917,0.0002680609,0.000057608595],"domain_scores_gemma":[0.9991467,0.00045476752,0.000069677204,0.00006514939,0.00022232537,0.00004126718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010802854,0.0009426115,0.00089152256,0.00085397606,0.00036747532,0.001023448,0.0013426265,0.00086398766,0.0023511269],"category_scores_gemma":[0.0018090724,0.00031702485,0.00069809036,0.0011481822,0.00060901814,0.0007479488,0.00091140025,0.001221766,0.0004925118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002723309,0.00003306991,0.00029793676,0.00007682615,0.0000378239,0.000054090408,0.000025479105,0.94771165,0.0009674469,0.01694348,0.0011729541,0.032651946],"study_design_scores_gemma":[0.000004125125,0.000014454233,0.0000407727,0.0000041556827,0.0000033478582,0.000011254585,0.000004524816,0.9960163,0.0001515472,0.003071422,0.00067548285,0.0000024899439],"about_ca_topic_score_codex":0.005323747,"about_ca_topic_score_gemma":0.0047604768,"teacher_disagreement_score":0.005323747,"about_ca_system_score_codex":0.00073300995,"about_ca_system_score_gemma":0.0013625226,"threshold_uncertainty_score":0.010585487},"labels":[],"label_agreement":null},{"id":"W3203480234","doi":"10.1155/2021/8548639","title":"Social Network Search for Solving Engineering Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Computational Intelligence and Neuroscience","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Popularity; Benchmark (surveying); Metaheuristic; Conversation; Field (mathematics); Imitation; Social network (sociolinguistics); Optimization algorithm; Optimization problem; Mathematical optimization; Artificial intelligence; Machine learning; Social media; Algorithm; Mathematics; World Wide Web","score_opus":0.05464896600811137,"score_gpt":0.3121515330919351,"score_spread":0.25750256708382374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203480234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008137825,0.0010105097,0.9853007,0.00032871647,0.000091091344,0.00008826114,0.000051781157,0.00010500018,0.0048860624],"genre_scores_gemma":[0.39066774,0.0013878219,0.60123825,0.00034642065,0.00020179347,0.0011175565,0.0003156963,0.00014000299,0.004584805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992874,0.00039696225,0.000032380718,0.000099618526,0.00014380859,0.00003988948],"domain_scores_gemma":[0.9986552,0.001039392,0.00009687053,0.00004382667,0.00013382803,0.000030892043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018357281,0.0017083253,0.0012650393,0.0014276012,0.0006594021,0.00088079675,0.0009595261,0.0016880505,0.002447848],"category_scores_gemma":[0.0038543125,0.0005745452,0.0010120586,0.0014640166,0.0009017487,0.0010017338,0.0010691539,0.0012382199,0.00034749633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002271157,0.000030044359,0.00031271848,0.00010643618,0.000055529723,0.000027184964,0.000019555608,0.97045094,0.00025391896,0.012211183,0.00058562966,0.015924083],"study_design_scores_gemma":[0.000006917113,0.000011480527,0.0000304091,0.000007697854,0.000004540851,0.000004616649,0.000005594415,0.99502915,0.000066924935,0.0044406084,0.00038964796,0.000002495148],"about_ca_topic_score_codex":0.0049868366,"about_ca_topic_score_gemma":0.004209481,"teacher_disagreement_score":0.0049868366,"about_ca_system_score_codex":0.0010845523,"about_ca_system_score_gemma":0.0012247593,"threshold_uncertainty_score":0.00991559},"labels":[],"label_agreement":null},{"id":"W3204790331","doi":"10.1109/access.2021.3117560","title":"Efficient Design Space Exploration of OpenCL Kernels for FPGA Targets Using Black Box Optimization","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Scalability; Design space exploration; Bayesian optimization; Black box; Heuristic; Surrogate model; Field-programmable gate array; Mathematical optimization; Machine learning; Artificial intelligence; Embedded system","score_opus":0.1050094427677004,"score_gpt":0.3550077767830489,"score_spread":0.2499983340153485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204790331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14678557,0.00056471635,0.84225726,0.00027348532,0.00003289502,0.00007501377,0.00008576184,0.001402282,0.008522946],"genre_scores_gemma":[0.7889578,0.0001445797,0.20809719,0.00009379214,0.000009173682,0.00012254274,0.00013300747,0.00020755442,0.0022344165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999762,0.000081667466,0.000006947277,0.00002310749,0.0000838301,0.000042563483],"domain_scores_gemma":[0.9993523,0.00042024106,0.000061389765,0.000040958996,0.00009372988,0.000031401414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054182386,0.00071619445,0.00062038895,0.0007104371,0.00030763602,0.0007151162,0.00058463763,0.0005691859,0.0026232894],"category_scores_gemma":[0.0014829929,0.00041484035,0.0005142522,0.00037585222,0.0004030047,0.00060765014,0.0005526419,0.0005719665,0.00035383136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060280345,0.00003286691,0.00053740735,0.00005430933,0.000016207872,0.000041096842,0.000028921282,0.9665358,0.0030030198,0.0022238654,0.0004963222,0.026969898],"study_design_scores_gemma":[0.0000052842274,0.000015789441,0.000047292382,0.0000026265136,0.0000019776548,0.000004926005,0.000006533949,0.99837863,0.00049589295,0.0008492094,0.00019028192,0.0000014851257],"about_ca_topic_score_codex":0.0024072086,"about_ca_topic_score_gemma":0.0038872617,"teacher_disagreement_score":0.0026232894,"about_ca_system_score_codex":0.0006557807,"about_ca_system_score_gemma":0.0011646848,"threshold_uncertainty_score":0.008775771},"labels":[],"label_agreement":null},{"id":"W3215534145","doi":"10.2514/1.j060718","title":"Surrogate-Assisted Differential Evolution Using Knowledge-Transfer-Based Sampling for Expensive Optimization Problems","year":2021,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Differential evolution; Mathematical optimization; Kriging; Computer science; Optimization problem; Surrogate model; Evolutionary algorithm; Mathematics; Machine learning","score_opus":0.06345597297973568,"score_gpt":0.31948138552715544,"score_spread":0.25602541254741973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215534145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011487201,0.00014726314,0.9865514,0.000067556495,0.000023869805,0.00003608914,0.000016793127,0.0001532463,0.0015165425],"genre_scores_gemma":[0.6006678,0.00031399538,0.3957197,0.00018000526,0.000055524124,0.00037893225,0.00023304079,0.00011261843,0.002338332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948883,0.00016449907,0.000028675835,0.00006788622,0.00020601583,0.00004398725],"domain_scores_gemma":[0.99892586,0.00063479925,0.000080484846,0.00010099068,0.00020405269,0.000053773772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012620547,0.00084646285,0.0012924173,0.00058942306,0.00043360586,0.0007801798,0.0012941653,0.0009838777,0.0015964874],"category_scores_gemma":[0.0031353917,0.000421363,0.0008220033,0.0006222427,0.0006621308,0.0009185016,0.0013149055,0.0011284412,0.00030143198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053132797,0.000053844487,0.00067973795,0.00008627767,0.000035604375,0.0000723728,0.000048596357,0.9450184,0.002585201,0.0078116464,0.00047194283,0.043083247],"study_design_scores_gemma":[0.0000032471012,0.000010974152,0.000026987622,0.0000017737026,0.0000018699084,0.0000062175977,0.0000018785415,0.99884665,0.00026686094,0.0006856236,0.00014612569,0.0000018400194],"about_ca_topic_score_codex":0.0026545941,"about_ca_topic_score_gemma":0.0020839928,"teacher_disagreement_score":0.0026545941,"about_ca_system_score_codex":0.00053137366,"about_ca_system_score_gemma":0.001067443,"threshold_uncertainty_score":0.0066744685},"labels":[],"label_agreement":null},{"id":"W337827445","doi":"10.4018/978-1-60566-798-0.ch009","title":"Statistical Analysis of Computational Intelligence Algorithms on a Multi-Objective Filter Design Problem","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Simulated annealing; Mathematical optimization; Sorting; Finite impulse response; Algorithm; Multi-objective optimization; Particle swarm optimization; Optimization problem; Genetic algorithm; Weighting; Mathematics","score_opus":0.034234867627347516,"score_gpt":0.29741750593233646,"score_spread":0.26318263830498895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W337827445","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.0042265905,0.0009255015,0.9909966,0.0002429293,0.000036721212,0.00003217337,0.000026396709,0.000081892875,0.0034312604],"genre_scores_gemma":[0.24802685,0.004777341,0.73875374,0.00045801516,0.00040811565,0.0009446442,0.00033309477,0.0002704757,0.0060277004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648905,0.0018717062,0.0001538076,0.00038908626,0.000986018,0.00011044652],"domain_scores_gemma":[0.98101693,0.016670717,0.00053622545,0.00052328274,0.0011564753,0.00009644269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005641558,0.0014131651,0.0012474867,0.0014737099,0.00043183874,0.0020996272,0.00089872425,0.001103231,0.0026125791],"category_scores_gemma":[0.017167695,0.0005041881,0.0009860111,0.0017845961,0.0015789346,0.0019482204,0.0011623506,0.0018609955,0.0005486871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042970936,0.00005864928,0.0009751668,0.00034468912,0.00012463602,0.00006717443,0.000100190264,0.7366196,0.001176573,0.13996771,0.0018663988,0.11865621],"study_design_scores_gemma":[0.000006573357,0.000059857357,0.0004221254,0.000047306738,0.00001645928,0.000031031057,0.000019523413,0.93364054,0.0006514843,0.06263712,0.0024570283,0.0000108885115],"about_ca_topic_score_codex":0.00093921204,"about_ca_topic_score_gemma":0.0007127513,"teacher_disagreement_score":0.005641558,"about_ca_system_score_codex":0.0011567071,"about_ca_system_score_gemma":0.0013022344,"threshold_uncertainty_score":0.02983582},"labels":[],"label_agreement":null},{"id":"W35595736","doi":"10.1007/978-3-642-37140-0_16","title":"Knowledge Transfer Strategies for Vector Evaluated Particle Swarm Optimization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Brock University","funders":"","keywords":"Particle swarm optimization; Crossover; Computer science; Multi-swarm optimization; Inefficiency; Swarm behaviour; Mathematical optimization; Set (abstract data type); Algorithm; Artificial intelligence; Mathematics","score_opus":0.030469963994475928,"score_gpt":0.29060637780074855,"score_spread":0.2601364138062726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35595736","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.005267414,0.000646512,0.98444116,0.00013898833,0.00011155816,0.000055041735,0.000019725656,0.00011664689,0.009203084],"genre_scores_gemma":[0.6565151,0.0012021746,0.3160106,0.0003225322,0.0002658148,0.0006257688,0.0001753972,0.00021335509,0.024669245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996119,0.00013633785,0.000024646793,0.000038523765,0.00015300325,0.00003563151],"domain_scores_gemma":[0.9992843,0.0004356206,0.000047574053,0.00004584901,0.0001604937,0.000026289932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012307134,0.001113968,0.0011383351,0.00066519115,0.00048281084,0.0012848091,0.0017559312,0.0017016424,0.0049272026],"category_scores_gemma":[0.0034804924,0.00044091066,0.00061985845,0.00083540304,0.00084592984,0.0014316556,0.0019005518,0.0013193155,0.0008528929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008344055,0.00009024682,0.00011252969,0.0001686729,0.000058123427,0.00006691637,0.0000816554,0.80712414,0.00165539,0.054169994,0.0029128655,0.13347612],"study_design_scores_gemma":[0.000006602713,0.000024075396,0.00002476753,0.000007936202,0.0000042662814,0.0000068942104,0.0000056886925,0.9917857,0.00018231779,0.0075350464,0.0004132414,0.000003402862],"about_ca_topic_score_codex":0.0028755711,"about_ca_topic_score_gemma":0.0019051544,"teacher_disagreement_score":0.0049272026,"about_ca_system_score_codex":0.000795805,"about_ca_system_score_gemma":0.0006447407,"threshold_uncertainty_score":0.016483068},"labels":[],"label_agreement":null},{"id":"W4200560384","doi":"10.1007/s00158-021-03134-4","title":"Surrogate-based optimization based on the probability of feasibility","year":2021,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Mathematical optimization; Computer science; Aerodynamics; Constraint (computer-aided design); Engineering design process; Surrogate model; Convergence (economics); Inviscid flow; Airfoil; Nonlinear programming; Uncertainty quantification; Optimization problem; Mathematics; Nonlinear system; Machine learning; Engineering","score_opus":0.024377238002608607,"score_gpt":0.27205613855367605,"score_spread":0.24767890055106745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200560384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028845144,0.00018209372,0.9943461,0.00013567087,0.000054934888,0.000016646181,0.000022895683,0.000036063993,0.0023211357],"genre_scores_gemma":[0.55146253,0.0011745641,0.4402616,0.00020827442,0.00027211398,0.00038116443,0.0003006196,0.00022041504,0.0057186834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976671,0.0014272912,0.000070649025,0.00013483109,0.00062624144,0.000073950636],"domain_scores_gemma":[0.991915,0.006365593,0.00044132528,0.00030489845,0.0007792919,0.00019400977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004841496,0.0010496986,0.0018259004,0.0015702597,0.0005535352,0.0020181274,0.0012779412,0.001812683,0.0035037333],"category_scores_gemma":[0.018946242,0.0008691794,0.001130522,0.0016631688,0.0018114961,0.002930922,0.0020133234,0.0022114252,0.0004870087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062040766,0.000024038785,0.0002026957,0.00007183736,0.000032612283,0.00002891984,0.000020169673,0.8819858,0.00055406545,0.10543221,0.00072069303,0.010865009],"study_design_scores_gemma":[0.0000038026667,0.000010288254,0.000029515262,0.000007880594,0.0000029080222,0.0000085697775,0.000001581304,0.98575914,0.000104279665,0.013808147,0.00026028117,0.0000036232223],"about_ca_topic_score_codex":0.0006406305,"about_ca_topic_score_gemma":0.00047140665,"teacher_disagreement_score":0.004841496,"about_ca_system_score_codex":0.00083325576,"about_ca_system_score_gemma":0.001002319,"threshold_uncertainty_score":0.025604546},"labels":[],"label_agreement":null},{"id":"W4205737100","doi":"10.1109/smc52423.2021.9659146","title":"Reference Point-Based Particle Sub-Swarm Optimization","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Particle swarm optimization; Multi-swarm optimization; Mathematical optimization; Equidistant; Maxima and minima; Position (finance); Multi-objective optimization; Metaheuristic; Computation; Computer science; Swarm behaviour; Pareto principle; Point (geometry); Optimization problem; Algorithm; Mathematics","score_opus":0.04976894851196202,"score_gpt":0.2923497905512877,"score_spread":0.24258084203932567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205737100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034267323,0.00030025776,0.99269146,0.00005060297,0.000053869255,0.000038879985,0.000018512083,0.00020736516,0.0032123686],"genre_scores_gemma":[0.34089288,0.0010717601,0.645807,0.00015603544,0.000104425686,0.00046539708,0.00036768345,0.00020954676,0.010925178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993723,0.00016536775,0.000025945072,0.00009261775,0.0003060383,0.00003770312],"domain_scores_gemma":[0.9995895,0.00013907788,0.00004827037,0.000047307625,0.00015292352,0.000023025816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009580202,0.00089185854,0.0012315102,0.00083550735,0.00047640913,0.001043058,0.0015018085,0.0009330853,0.0026220034],"category_scores_gemma":[0.0014742336,0.0003680942,0.0007169454,0.0009873012,0.000525776,0.00090410037,0.0008803168,0.00082330965,0.00096383976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082891194,0.000055634486,0.0005018776,0.00014803244,0.00007214209,0.00007078709,0.00007541976,0.8190206,0.004088666,0.022315353,0.0026571222,0.15091151],"study_design_scores_gemma":[0.000008753493,0.00003673242,0.000077856545,0.0000060977895,0.00000700979,0.00001588985,0.0000053108215,0.9949008,0.000662494,0.0017619872,0.002511665,0.000005411727],"about_ca_topic_score_codex":0.002872562,"about_ca_topic_score_gemma":0.0020403313,"teacher_disagreement_score":0.002872562,"about_ca_system_score_codex":0.0005746826,"about_ca_system_score_gemma":0.00089562545,"threshold_uncertainty_score":0.008771479},"labels":[],"label_agreement":null},{"id":"W4206267728","doi":"10.1287/opre.2021.2157","title":"Robust Learning of Consumer Preferences","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Consumer choice; Focus (optics); Mathematical optimization; Sequence (biology); Asymptotically optimal algorithm; Artificial intelligence; Machine learning; Operations research; Marketing; Algorithm; Mathematics; Business","score_opus":0.14610335025292934,"score_gpt":0.389352057866647,"score_spread":0.24324870761371767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206267728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028709836,0.00030741855,0.96788377,0.00034914791,0.000028987672,0.00006506844,0.0001345109,0.00023307903,0.002288229],"genre_scores_gemma":[0.8280324,0.00042834628,0.16704482,0.0003124049,0.00008396677,0.00024872104,0.0005869528,0.00007256496,0.0031899035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973705,0.0011971543,0.00010006591,0.00067193026,0.00045212047,0.00020810467],"domain_scores_gemma":[0.98830265,0.00892207,0.000838941,0.00094025064,0.00080898404,0.00018701746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045280405,0.0011040322,0.0016962668,0.0008468686,0.00036757294,0.0014106225,0.0020769532,0.0015227123,0.0024981224],"category_scores_gemma":[0.02380436,0.0007411477,0.0011116877,0.0011281917,0.0013031381,0.0023556275,0.0016292554,0.0026640592,0.00054802746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027940117,0.00011723733,0.0019308772,0.000104269166,0.00014058099,0.00006710688,0.00009419574,0.8765654,0.0010706212,0.024597226,0.0019046783,0.093128465],"study_design_scores_gemma":[0.000016773487,0.000030283518,0.00023854953,0.0000059861404,0.000007322925,0.000011861775,0.0000084594285,0.98304445,0.00034714595,0.016053153,0.00022721349,0.000008785447],"about_ca_topic_score_codex":0.0041808262,"about_ca_topic_score_gemma":0.0025959935,"teacher_disagreement_score":0.0045280405,"about_ca_system_score_codex":0.0016127464,"about_ca_system_score_gemma":0.0010528859,"threshold_uncertainty_score":0.023946881},"labels":[],"label_agreement":null},{"id":"W4206881206","doi":"","title":"APM-MOEA : An asynchronous parallel model for multi-objective evolutionary algorithms","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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 à Chicoutimi","funders":"","keywords":"Computer science; Asynchronous communication; Evolutionary algorithm; Evolutionary computation; Parallel computing; Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03019648609902191,"score_gpt":0.2798584387207837,"score_spread":0.24966195262176177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206881206","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.0049248994,0.00015200733,0.9902124,0.00013440581,0.000086253676,0.00005324039,0.000094712064,0.00076896016,0.003573101],"genre_scores_gemma":[0.25450677,0.00053014845,0.73050934,0.0001922841,0.00016636708,0.00065997103,0.00034929038,0.00048156257,0.012604361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.00016682445,0.000019653678,0.00007240068,0.00012869501,0.00003577107],"domain_scores_gemma":[0.9994615,0.00024634541,0.000041006933,0.00009635614,0.00011656126,0.000038355287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224251,0.0007376282,0.0007644373,0.00039247706,0.00049221446,0.0010366318,0.0019195535,0.0009227312,0.0056107757],"category_scores_gemma":[0.0023427936,0.00040669323,0.00076907384,0.00084531144,0.00042905242,0.0010792372,0.0011065413,0.0016147885,0.001201964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013731366,0.00007928581,0.0003228412,0.00013511122,0.000050766437,0.0000581655,0.000035112138,0.89097214,0.0023233662,0.033704713,0.0033036072,0.0688775],"study_design_scores_gemma":[0.000019927296,0.000020818721,0.00003993436,0.000004280225,0.000007749546,0.000012952775,0.0000029082316,0.9876087,0.0005253399,0.009639286,0.0021150666,0.0000030699243],"about_ca_topic_score_codex":0.0022928317,"about_ca_topic_score_gemma":0.003331306,"teacher_disagreement_score":0.0056107757,"about_ca_system_score_codex":0.0004725129,"about_ca_system_score_gemma":0.0010742489,"threshold_uncertainty_score":0.01876986},"labels":[],"label_agreement":null},{"id":"W4207001343","doi":"10.1111/itor.13116","title":"Inverse attribute‐based optimization with an application in assortment optimization","year":2022,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Regret; Set (abstract data type); Mathematical optimization; Perspective (graphical); Inverse; Range (aeronautics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.05580652844780478,"score_gpt":0.3745006731160889,"score_spread":0.31869414466828416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207001343","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.012866458,0.0005268078,0.98213506,0.00047151308,0.00005664798,0.000035571586,0.000042396958,0.00010253477,0.003763079],"genre_scores_gemma":[0.6855186,0.00091486785,0.3065389,0.0003570043,0.00019078188,0.00019858034,0.00016735846,0.00015560535,0.0059581404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967759,0.0019500825,0.0000996367,0.00031735492,0.00069716724,0.00015975439],"domain_scores_gemma":[0.9917979,0.0062748953,0.00049238215,0.000482654,0.0006918329,0.00026024497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005225846,0.0015605586,0.002273547,0.0014519597,0.00049641833,0.0017383016,0.0016516548,0.0015621464,0.0027681198],"category_scores_gemma":[0.01402152,0.00060055236,0.0016301303,0.0020205777,0.002481606,0.0019035937,0.0025933946,0.003423044,0.0003351603],"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.000042091666,0.00007071098,0.0005357784,0.000064912674,0.000052895368,0.000046831377,0.00004803252,0.9207179,0.0002184396,0.06430626,0.00051055785,0.0133855725],"study_design_scores_gemma":[0.0000042225206,0.00001731874,0.000043165972,0.000007711008,0.000004427899,0.0000059542713,0.0000046607024,0.9744512,0.0000842661,0.025122963,0.00024901424,0.0000051023358],"about_ca_topic_score_codex":0.0049693678,"about_ca_topic_score_gemma":0.0018284571,"teacher_disagreement_score":0.005225846,"about_ca_system_score_codex":0.001580459,"about_ca_system_score_gemma":0.0014837804,"threshold_uncertainty_score":0.027637303},"labels":[],"label_agreement":null},{"id":"W4211059871","doi":"10.1115/1.4044525","title":"Knowledge-Assisted Optimization for Large-Scale Design Problems: A Review and Proposition","year":2019,"lang":"en","type":"review","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Design knowledge; Scale (ratio); Industrial engineering; Engineering optimization; Management science; Optimization problem; Engineering","score_opus":0.10066591990374062,"score_gpt":0.3572525854471908,"score_spread":0.25658666554345017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211059871","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.0002703116,0.9911697,0.004603811,0.000522723,0.00017549432,0.000016094307,0.000024507115,0.000019629806,0.0031977575],"genre_scores_gemma":[0.003445216,0.9928092,0.0026633255,0.00019371542,0.00019513423,0.00002251468,0.000040038198,0.0000061217443,0.00062483456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999418,0.0001268482,0.00006862004,0.00010942927,0.0002454661,0.000031636202],"domain_scores_gemma":[0.9976548,0.0016905135,0.00014243365,0.0000710594,0.00039310657,0.000048116974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013902321,0.0009208206,0.0013244723,0.0032003848,0.00035647157,0.0016408687,0.0012926174,0.0015601603,0.00386434],"category_scores_gemma":[0.0026998548,0.0005221417,0.0008697026,0.003993911,0.00081980706,0.0020590355,0.0008737435,0.0012658167,0.0015898607],"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.00003622519,0.00010217974,0.00024254258,0.02929854,0.00019824918,0.00013192547,0.00011493386,0.004334827,0.00072505476,0.034639094,0.013721232,0.91645515],"study_design_scores_gemma":[0.000019810595,0.0001418215,0.000994446,0.013601392,0.00032149008,0.00082648755,0.00014732777,0.004079873,0.0013409345,0.027301716,0.9511454,0.000079452664],"about_ca_topic_score_codex":0.0014888884,"about_ca_topic_score_gemma":0.0014705453,"teacher_disagreement_score":0.00386434,"about_ca_system_score_codex":0.0007295141,"about_ca_system_score_gemma":0.0016383202,"threshold_uncertainty_score":0.012927532},"labels":[],"label_agreement":null},{"id":"W4211161595","doi":"10.1007/978-3-540-74757-4_6","title":"Heuristic Methods","year":2015,"lang":"en","type":"book-chapter","venue":"Advances in geographic information science","topic":"Advanced Multi-Objective Optimization Algorithms","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; Western University","funders":"","keywords":"Heuristics; Simulated annealing; Tabu search; Computer science; Metaheuristic; Heuristic; Genetic algorithm; Greedy algorithm; Hyper-heuristic; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Algorithm","score_opus":0.020359182496856195,"score_gpt":0.3419816649500707,"score_spread":0.3216224824532145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211161595","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.0023186982,0.003945539,0.8075483,0.00071124034,0.0012390425,0.00024506816,0.00047678273,0.0012753899,0.18223992],"genre_scores_gemma":[0.10687543,0.005920053,0.62603414,0.0010621077,0.0009018097,0.00092108006,0.0016377051,0.0012277912,0.2554199],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905044,0.00023121333,0.000043786604,0.00018214916,0.00040474194,0.00008769493],"domain_scores_gemma":[0.99925166,0.0003298346,0.000046231253,0.0001916532,0.00014919619,0.00003151865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084413594,0.001533249,0.0013381426,0.0017590892,0.0009136982,0.0025324805,0.0023153906,0.0018649145,0.05313393],"category_scores_gemma":[0.0033955132,0.00067826477,0.0012292016,0.0017728785,0.00092979945,0.0015752345,0.0016730919,0.0017134227,0.014228177],"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.00007568854,0.0001494299,0.0002499074,0.0005411412,0.00008764548,0.00010464111,0.00010350194,0.16347149,0.0014338876,0.27813265,0.059473004,0.49617702],"study_design_scores_gemma":[0.0000796,0.00008679853,0.00021996173,0.00030976624,0.000063587526,0.00023554514,0.00010753244,0.48967388,0.002694867,0.26179618,0.24468693,0.000045341614],"about_ca_topic_score_codex":0.0017712902,"about_ca_topic_score_gemma":0.002085211,"teacher_disagreement_score":0.05313393,"about_ca_system_score_codex":0.0009576935,"about_ca_system_score_gemma":0.0013937751,"threshold_uncertainty_score":0.1777507},"labels":[],"label_agreement":null},{"id":"W4221008044","doi":"10.21203/rs.3.rs-1503527/v1","title":"Quantum Multi-guide Particle Swarm Optimisation for Dynamic Multi-objective Optimisation Problems","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Particle swarm optimization; Benchmark (surveying); Mathematical optimization; Computer science; Crossover; Swarm behaviour; Set (abstract data type); Pareto optimal; Pareto principle; Multi-swarm optimization; Multi-objective optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.09261859524340452,"score_gpt":0.4164968811561475,"score_spread":0.32387828591274304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221008044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027531445,0.0007091057,0.96583945,0.00020966942,0.00008753468,0.00007983253,0.000043242813,0.00024292801,0.0052568293],"genre_scores_gemma":[0.59411407,0.00058648625,0.40173915,0.0001726605,0.00005459013,0.00025385257,0.00017268155,0.000099665536,0.0028068519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995141,0.00020702668,0.000025164214,0.000058755028,0.00016562102,0.00002936019],"domain_scores_gemma":[0.9990472,0.0005817953,0.00007691773,0.000087148816,0.00017614604,0.00003075165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013672163,0.0005725084,0.000787371,0.0006440375,0.00047134145,0.00087100704,0.0007378535,0.0008444432,0.0016054576],"category_scores_gemma":[0.002378943,0.00033316,0.00059337355,0.000827019,0.0006926513,0.0006297502,0.0007901332,0.00094479905,0.00023333689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024000075,0.000027264205,0.0003682153,0.00007430669,0.00003486513,0.000028700177,0.00003110316,0.96204793,0.00135406,0.007178176,0.00050740415,0.028324028],"study_design_scores_gemma":[0.000007057614,0.000016135868,0.0001010795,0.000004877276,0.0000039416555,0.000006588352,0.0000042318616,0.9970318,0.00028296048,0.0018159131,0.00072270003,0.000002560165],"about_ca_topic_score_codex":0.003090726,"about_ca_topic_score_gemma":0.0025248386,"teacher_disagreement_score":0.003090726,"about_ca_system_score_codex":0.0006537894,"about_ca_system_score_gemma":0.0008261006,"threshold_uncertainty_score":0.00723058},"labels":[],"label_agreement":null},{"id":"W4221068686","doi":"10.3390/a15040102","title":"Dynamic Line Scan Thermography Parameter Design via Gaussian Process Emulation","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization Algorithms","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é Laval","funders":"Vlaamse regering; Universiteit Antwerpen; Fonds Wetenschappelijk Onderzoek","keywords":"Emulation; Computer science; Gaussian process; Surrogate model; Process (computing); Set (abstract data type); Thermography; Gaussian; Machine learning; Artificial intelligence; Simulation","score_opus":0.016238384567365757,"score_gpt":0.27751105129380016,"score_spread":0.2612726667264344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221068686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042202617,0.00005376163,0.99447757,0.00007543222,0.000007465768,0.000027134813,0.000016148388,0.00021903984,0.0009032942],"genre_scores_gemma":[0.42727217,0.00022966726,0.5689378,0.0001493261,0.000018140241,0.00032468681,0.0001352024,0.0002483229,0.0026847494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00018386188,0.000020074738,0.00009886373,0.00019857756,0.000042685595],"domain_scores_gemma":[0.99902046,0.0005248008,0.00013473578,0.000116722586,0.00016585797,0.0000374354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015377158,0.00069937384,0.00061653124,0.00053747353,0.00029017302,0.0010210775,0.0009672605,0.0011229496,0.0024532017],"category_scores_gemma":[0.0035344586,0.0004438334,0.0006444071,0.0005054467,0.0008802216,0.000977681,0.0011527039,0.0011537523,0.00062295387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004617594,0.000035550212,0.00039739546,0.000060750695,0.000015722113,0.00003987264,0.00005422549,0.9587307,0.0051478096,0.009543987,0.00044666842,0.02548113],"study_design_scores_gemma":[0.000005223094,0.000019824582,0.000044720226,0.0000049586224,0.0000026372898,0.000012274114,0.000005935589,0.9947891,0.0018949395,0.0025419511,0.0006732273,0.0000051153825],"about_ca_topic_score_codex":0.0012689354,"about_ca_topic_score_gemma":0.0013565884,"teacher_disagreement_score":0.0024532017,"about_ca_system_score_codex":0.00071865856,"about_ca_system_score_gemma":0.00094312395,"threshold_uncertainty_score":0.008206785},"labels":[],"label_agreement":null},{"id":"W4221140136","doi":"10.48550/arxiv.2203.06336","title":"A New and Flexible Design Construction for Orthogonal Arrays for Modern Applications","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"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 Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Orthogonal array; Latin hypercube sampling; Computer science; Orthogonal basis; Orthogonal coordinates; Algorithm; Orthogonal transformation; Computer experiment; Hypercube; Theoretical computer science; Computer engineering; Engineering drawing; Computational science; Mathematics; Parallel computing; Engineering; Geometry; Simulation; Monte Carlo method; Taguchi methods","score_opus":0.09067192044786006,"score_gpt":0.22477074464857785,"score_spread":0.13409882420071778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140136","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.00090716715,0.000048621056,0.99827814,0.000027538914,0.000021233534,0.000025581041,0.000026419133,0.000102600796,0.00056275824],"genre_scores_gemma":[0.04012603,0.00019494022,0.9576513,0.00011832396,0.00006787902,0.0005050988,0.00014507797,0.00014294292,0.0010482757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953768,0.0024209623,0.00021897462,0.00074323104,0.0010489263,0.00019106556],"domain_scores_gemma":[0.99589133,0.0019109324,0.0004463651,0.00076750736,0.0008570377,0.00012682538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030887595,0.0012094681,0.0009370204,0.0009665696,0.00063206645,0.0010503628,0.0011437082,0.0008331946,0.004327206],"category_scores_gemma":[0.009923396,0.00065518386,0.001283366,0.0015604738,0.0011678565,0.0013501085,0.0018703805,0.0022371153,0.0015552894],"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.00031671612,0.00019684715,0.0017968002,0.00054090447,0.00015702077,0.00016724755,0.0003789233,0.1986536,0.053002857,0.2544861,0.0061628358,0.48414013],"study_design_scores_gemma":[0.00012686808,0.0010981795,0.001189292,0.00013196458,0.00009596764,0.000396314,0.000111187124,0.7539646,0.02904477,0.16085024,0.0528538,0.00013678754],"about_ca_topic_score_codex":0.00047015055,"about_ca_topic_score_gemma":0.0005265561,"teacher_disagreement_score":0.004327206,"about_ca_system_score_codex":0.00048500326,"about_ca_system_score_gemma":0.0010483159,"threshold_uncertainty_score":0.01633513},"labels":[],"label_agreement":null},{"id":"W4225124397","doi":"10.1016/j.dche.2022.100030","title":"Data-Driven Natural Gas Compressor Models for Gas Transport Network Optimization","year":2022,"lang":"en","type":"article","venue":"Digital Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gas compressor; Dimensionless quantity; Natural gas; Artificial neural network; Minification; Computer science; Surrogate model; Mathematical optimization; Compressor station; Engineering; Mathematics; Artificial intelligence; Mechanical engineering; Thermodynamics; Physics","score_opus":0.017787535980550107,"score_gpt":0.22579464947729005,"score_spread":0.20800711349673995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225124397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05120295,0.0008101919,0.9350736,0.00081262976,0.00012134829,0.00007695284,0.0006827993,0.0003701452,0.010849431],"genre_scores_gemma":[0.9154566,0.00079894264,0.07033073,0.00021458774,0.00005911307,0.00038733653,0.0011687289,0.00011798921,0.011465944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984384,0.00005723436,0.0000076238493,0.000033695662,0.000041674517,0.00001583226],"domain_scores_gemma":[0.9995915,0.00023670809,0.000049639806,0.000019626645,0.0000824091,0.0000199658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056928844,0.0009609295,0.00062511314,0.00029743311,0.00025706575,0.00062879483,0.0010739783,0.0011253228,0.0027233337],"category_scores_gemma":[0.0015661042,0.00038647198,0.0005495287,0.0005085185,0.0005787384,0.0010374562,0.00066360534,0.0017205391,0.00027819828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054711827,0.0000042785723,0.00006682653,0.000008856087,0.0000025700695,0.000006274381,0.0000034497432,0.9968984,0.0000989695,0.0017651352,0.0001282057,0.001011533],"study_design_scores_gemma":[6.7777097e-7,0.0000015093498,0.000010653203,8.3394286e-7,3.781404e-7,6.557189e-7,7.2984886e-7,0.99930024,0.000025921736,0.0005774375,0.000080402904,5.674076e-7],"about_ca_topic_score_codex":0.011638872,"about_ca_topic_score_gemma":0.010532529,"teacher_disagreement_score":0.011638872,"about_ca_system_score_codex":0.0011494741,"about_ca_system_score_gemma":0.00095021474,"threshold_uncertainty_score":0.023142278},"labels":[],"label_agreement":null},{"id":"W4226385637","doi":"10.1080/03155986.2022.2040274","title":"Approximating the Pareto frontier for a challenging real-world bi-objective covering problem","year":2022,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Pareto principle; Mathematical optimization; Subgradient method; Heuristic; Computer science; Set (abstract data type); Constraint (computer-aided design); Frontier; Set cover problem; Decision maker; Pareto optimal; Multi-objective optimization; Efficient frontier; Operations research; Mathematics; Economics; Geography","score_opus":0.04901622433517749,"score_gpt":0.3374266635117765,"score_spread":0.28841043917659903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226385637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056921996,0.0008885453,0.9348781,0.00035031667,0.00003468426,0.000059803664,0.00014727935,0.00009063109,0.0066285725],"genre_scores_gemma":[0.65820974,0.0012530133,0.33514163,0.00018533292,0.000053290678,0.0003046501,0.000467515,0.00012537524,0.0042594937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940145,0.00029561762,0.000018214236,0.00006855748,0.00010631898,0.000109878485],"domain_scores_gemma":[0.9977016,0.0018542437,0.00014062024,0.00006512873,0.00016229975,0.000076079035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017959859,0.0014005842,0.0011952781,0.0011104192,0.00051170884,0.001477162,0.00078752596,0.0015943476,0.002662358],"category_scores_gemma":[0.004965514,0.00048392772,0.0009669551,0.0010951984,0.0008517688,0.0010659716,0.0010340125,0.001095369,0.00032883216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024229937,0.000021600183,0.00019716534,0.000063007974,0.00001672085,0.00007230999,0.000029197494,0.9862402,0.00042498537,0.0069028465,0.00042780704,0.005579911],"study_design_scores_gemma":[0.000004784893,0.000020886882,0.00009382418,0.000014459382,0.0000042543356,0.000025243406,0.00002032803,0.99408096,0.00018385235,0.0052153636,0.00033164985,0.0000043443847],"about_ca_topic_score_codex":0.00349064,"about_ca_topic_score_gemma":0.0017267977,"teacher_disagreement_score":0.00349064,"about_ca_system_score_codex":0.0012157278,"about_ca_system_score_gemma":0.0008440692,"threshold_uncertainty_score":0.009498239},"labels":[],"label_agreement":null},{"id":"W4229988500","doi":"10.23952/jano.1.2019.3.08","title":"Representation of the Pareto front for heterogeneous multi-objective optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Deutsche Forschungsgemeinschaft","keywords":"Representation (politics); Multi-objective optimization; Front (military); Pareto principle; Computer science; Mathematical optimization; Mathematical economics; Mathematics; Engineering; Political science; Mechanical engineering","score_opus":0.01168561794993419,"score_gpt":0.25649472857169725,"score_spread":0.24480911062176305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229988500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055534225,0.00029472564,0.99066025,0.0000641395,0.000019118002,0.000039608512,0.000038285394,0.00007014529,0.0032603717],"genre_scores_gemma":[0.5055585,0.0011206783,0.48697865,0.00011870493,0.000068382935,0.00045872646,0.00038267658,0.00014692251,0.0051666982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922335,0.0003195508,0.000035101464,0.0000633954,0.00027902995,0.00007957117],"domain_scores_gemma":[0.99923825,0.00039756874,0.000077463985,0.00009003736,0.00015408461,0.000042600135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020538657,0.001327705,0.0008780512,0.0016571885,0.0004503023,0.0016258685,0.0010993017,0.001186497,0.0038146842],"category_scores_gemma":[0.0030860428,0.00031258215,0.0012323027,0.0014272076,0.00067045336,0.0012748908,0.0012774883,0.0013486069,0.00071758416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049393253,0.000048853948,0.00021059155,0.000118593045,0.000026385358,0.00009876885,0.000063625506,0.89253896,0.0021957208,0.071738325,0.0010761705,0.031834494],"study_design_scores_gemma":[0.0000045171646,0.000020674017,0.000050000002,0.000012487954,0.0000047456506,0.00002161993,0.00000997125,0.9868688,0.00033262663,0.012015523,0.00065442687,0.000004622461],"about_ca_topic_score_codex":0.0017918965,"about_ca_topic_score_gemma":0.0010083498,"teacher_disagreement_score":0.0038146842,"about_ca_system_score_codex":0.001035074,"about_ca_system_score_gemma":0.0007712194,"threshold_uncertainty_score":0.012761414},"labels":[],"label_agreement":null},{"id":"W4235948861","doi":"10.32920/14640045.v1","title":"Wireless Sensor Network Optimization: Multi-Objective Paradigm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Optimization problem; Computer science; Software deployment; Key distribution in wireless sensor networks; Wireless network; Wireless; Multi-objective optimization; Mathematical optimization; Distributed computing; Network planning and design; Computer network; Telecommunications; Mathematics; Machine learning; Algorithm","score_opus":0.022769217665029595,"score_gpt":0.2732898342041067,"score_spread":0.2505206165390771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235948861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014901395,0.005633852,0.98330474,0.0012435345,0.00017295362,0.0000690982,0.00011588435,0.00006213826,0.007907648],"genre_scores_gemma":[0.2567802,0.031681415,0.6933026,0.0012357313,0.0014090481,0.0010722498,0.0003934591,0.0002443578,0.013880962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979804,0.0010864763,0.00008791586,0.00021289289,0.0005550712,0.00007724446],"domain_scores_gemma":[0.9987733,0.0008299999,0.0001373727,0.000060443494,0.00016181891,0.000037092203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025848756,0.0017140019,0.0014072546,0.00085935,0.00035912552,0.0020859374,0.0016287349,0.0018739295,0.0027748672],"category_scores_gemma":[0.0032684263,0.0005185024,0.0011013534,0.0023286063,0.0010852722,0.0023893996,0.0012327565,0.0026403163,0.0006160206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044399418,0.000066641944,0.00034370337,0.0012372088,0.00018352219,0.00017527466,0.00009821934,0.6453145,0.0015187048,0.2740934,0.0062635643,0.070660874],"study_design_scores_gemma":[0.000019105806,0.00007168453,0.00022485117,0.00017733635,0.000041667765,0.00011879872,0.000045150373,0.79704475,0.00075642613,0.18401547,0.017461356,0.000023462697],"about_ca_topic_score_codex":0.00090014254,"about_ca_topic_score_gemma":0.00092781935,"teacher_disagreement_score":0.0027748672,"about_ca_system_score_codex":0.0010773567,"about_ca_system_score_gemma":0.00098148,"threshold_uncertainty_score":0.013670266},"labels":[],"label_agreement":null},{"id":"W4242376211","doi":"10.13052/remn.17.103-126","title":"A comparative evaluation of genetic and gradient-based algorithms applied to aerodynamic optimization","year":2008,"lang":"en","type":"article","venue":"European Journal of Computational Mechanics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Mathematical optimization; Aerodynamics; Context (archaeology); Computation; Genetic algorithm; Algorithm; Gradient method; Multi-objective optimization; Meta-optimization; Pareto principle; Mathematics; Optimization problem; Computer science; Engineering","score_opus":0.038000327363495415,"score_gpt":0.2784580856916667,"score_spread":0.2404577583281713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242376211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41644147,0.008016067,0.5421316,0.001068868,0.0005424592,0.00040057444,0.0001231394,0.002646811,0.028629001],"genre_scores_gemma":[0.7243775,0.0022426164,0.26999775,0.0002011037,0.00008009521,0.00020250148,0.00017118685,0.00032441932,0.002402845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972541,0.0011773518,0.00010708364,0.00014832648,0.0011817698,0.00013134684],"domain_scores_gemma":[0.99442166,0.003946097,0.00018473277,0.00025124563,0.0010889566,0.000107353735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035222566,0.0011123386,0.0011594224,0.0018568486,0.00053490646,0.0013147941,0.0011862371,0.0020482303,0.000977207],"category_scores_gemma":[0.0118150525,0.00027454915,0.00049654185,0.0023699214,0.0009821057,0.0009603176,0.00067867804,0.00084200624,0.00030097138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006901907,0.00026409025,0.002479225,0.0003390766,0.0002007837,0.00013487104,0.00011795093,0.7821111,0.0034592294,0.008129178,0.0010580886,0.20101626],"study_design_scores_gemma":[0.0000927717,0.0004664574,0.0012574764,0.000042636886,0.0000519514,0.00009435234,0.000048180576,0.99012053,0.0038469546,0.002146885,0.0018114991,0.000020376265],"about_ca_topic_score_codex":0.005235448,"about_ca_topic_score_gemma":0.004069065,"teacher_disagreement_score":0.005235448,"about_ca_system_score_codex":0.0010276497,"about_ca_system_score_gemma":0.0009925001,"threshold_uncertainty_score":0.018627703},"labels":[],"label_agreement":null},{"id":"W4246419159","doi":"10.1002/0470011815.b2a15114","title":"<scp>P</scp> areto Distribution","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Biostatistics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Pareto principle; Generalization; Pareto distribution; Mathematics; Gamma distribution; Exponential function; Exponential distribution; Lomax distribution; Distribution (mathematics); Combinatorics; Multivariate statistics; Exponential family; Statistical physics; Applied mathematics; Statistics; Mathematical analysis; Physics","score_opus":0.006047229451271756,"score_gpt":0.24177336418019332,"score_spread":0.23572613472892157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246419159","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.0052056536,0.003472545,0.36068195,0.021235034,0.010784233,0.0005267767,0.012336715,0.0059158453,0.5798412],"genre_scores_gemma":[0.24164636,0.009538369,0.09188539,0.0074292794,0.01001042,0.0018072269,0.018205972,0.0062844907,0.6131925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972263,0.0004956768,0.00014766099,0.0005270393,0.0013556255,0.00024777994],"domain_scores_gemma":[0.99160564,0.0020446668,0.0005281126,0.0019392653,0.0035018506,0.00038041134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025437411,0.00150919,0.0017955543,0.0025921552,0.0018104729,0.006759947,0.0023862068,0.002943658,0.2987808],"category_scores_gemma":[0.01823979,0.0006266336,0.0012366045,0.0056363097,0.002836078,0.0029381448,0.0019919844,0.0032868832,0.15121311],"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.00015341485,0.000058811118,0.0007202268,0.00032019787,0.000035697598,0.00078125956,0.00011520744,0.0030538917,0.0011680016,0.4164232,0.45897305,0.11819703],"study_design_scores_gemma":[0.000056874305,0.000043368447,0.0013969071,0.00033916323,0.000024207358,0.002041604,0.00008512737,0.02078257,0.0026094653,0.29434243,0.67819655,0.00008170101],"about_ca_topic_score_codex":0.004059002,"about_ca_topic_score_gemma":0.003394642,"teacher_disagreement_score":0.2987808,"about_ca_system_score_codex":0.0034219609,"about_ca_system_score_gemma":0.0020756244,"threshold_uncertainty_score":0.9995214},"labels":[],"label_agreement":null},{"id":"W4246965515","doi":"10.1115/detc2015-47525","title":"Optimization on Metamodeling-Supported Iterative Decomposition","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"U.S. Department of Energy","keywords":"Metamodeling; Mathematical optimization; Benchmark (surveying); Optimization problem; Computer science; Decomposition; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.0359323896910449,"score_gpt":0.3161928727902139,"score_spread":0.280260483099169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246965515","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.0071354946,0.000048851878,0.99160504,0.000030860658,0.000007826116,0.000024023697,0.000015777408,0.00010257391,0.0010296],"genre_scores_gemma":[0.29799056,0.00017164658,0.6991977,0.00008546851,0.000017883936,0.00037536246,0.00017592247,0.00014538867,0.0018400087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952066,0.00022029973,0.00001932849,0.000075065516,0.00012395145,0.000040818213],"domain_scores_gemma":[0.9993443,0.00038732297,0.0000560049,0.00006811263,0.00012233014,0.00002195276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598962,0.0011033413,0.0010145565,0.0006413238,0.00032487724,0.00061064353,0.00088287005,0.0009304216,0.0014740989],"category_scores_gemma":[0.0022118452,0.00047837524,0.0009847779,0.00059492484,0.00068040163,0.00077671476,0.0010077496,0.000957944,0.00031445234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026727095,0.000028622786,0.00028708205,0.00005783589,0.000022756072,0.000032294512,0.000036206275,0.9631318,0.004043395,0.008684627,0.00029560016,0.023353154],"study_design_scores_gemma":[0.0000025289364,0.000010208472,0.00002790736,0.0000024840845,0.0000018031434,0.0000043121263,0.0000025316076,0.9980287,0.00040701602,0.0013445524,0.00016601359,0.000001961311],"about_ca_topic_score_codex":0.0020702316,"about_ca_topic_score_gemma":0.001432214,"teacher_disagreement_score":0.0020702316,"about_ca_system_score_codex":0.00053429545,"about_ca_system_score_gemma":0.0009508785,"threshold_uncertainty_score":0.0071918964},"labels":[],"label_agreement":null},{"id":"W4248692800","doi":"10.22215/etd/2019-13663","title":"The Evaluation of Multi-Objective Evolutionary Algorithms for a Maritime Domain Awareness Problem","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fishing; Enforcement; Set (abstract data type); Domain (mathematical analysis); Evolutionary algorithm; Business; Computer science; Fishery; Political science; Artificial intelligence; Mathematics; Biology; Law","score_opus":0.03557473894808107,"score_gpt":0.34251585006560636,"score_spread":0.3069411111175253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248692800","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.5196364,0.0061751194,0.4374601,0.0031750253,0.0008032554,0.0007718064,0.00057187286,0.00083575543,0.0305707],"genre_scores_gemma":[0.7695924,0.00088298623,0.22412288,0.0004498787,0.00011580127,0.00044336947,0.0005283321,0.00010803753,0.003756285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882203,0.00066967524,0.00007209504,0.00015714392,0.00015109991,0.00012794828],"domain_scores_gemma":[0.99054027,0.008089851,0.0002558697,0.00020436963,0.00065706985,0.00025251496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040474064,0.0018230625,0.0015502505,0.0013361196,0.00071883696,0.0014175322,0.0017285799,0.0035162002,0.0028824578],"category_scores_gemma":[0.011532791,0.0005247026,0.0010925,0.0009863197,0.0007308902,0.001322683,0.0012999957,0.0017246954,0.00027301692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121064906,0.00021719007,0.0006816068,0.00012702167,0.00005730822,0.00003482502,0.00002649272,0.97260416,0.00023283123,0.001388306,0.00064016896,0.023869017],"study_design_scores_gemma":[0.00002475508,0.00008123182,0.000115866555,0.000011481459,0.000011044551,0.0000066373204,0.000016749487,0.99901235,0.00008543895,0.00047658547,0.00015537473,0.0000024497201],"about_ca_topic_score_codex":0.008048664,"about_ca_topic_score_gemma":0.00572328,"teacher_disagreement_score":0.008048664,"about_ca_system_score_codex":0.0011380614,"about_ca_system_score_gemma":0.0017815493,"threshold_uncertainty_score":0.021404982},"labels":[],"label_agreement":null},{"id":"W4248816089","doi":"10.22215/etd/2018-13493","title":"High Fidelity and Efficient Computations of Dynamic Loads for Multidisciplinary Design Optimization of Flexible Transport Aircraft","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; York University","funders":"","keywords":"Metamodeling; Kriging; Airframe; Multidisciplinary design optimization; Reduction (mathematics); Computer science; Mathematical optimization; Modal; Process (computing); High fidelity; Set (abstract data type); Surrogate model; Computation; Engineering; Algorithm; Aerospace engineering; Multidisciplinary approach; Mathematics","score_opus":0.01508972893667291,"score_gpt":0.29727930398372315,"score_spread":0.2821895750470502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248816089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07307717,0.00043083553,0.900455,0.00056530867,0.00015514073,0.000097436874,0.0004160646,0.0007408695,0.02406212],"genre_scores_gemma":[0.72602636,0.00033254188,0.26479167,0.00013901595,0.00013819666,0.00028211132,0.00069229066,0.0006587664,0.0069390745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999741,0.00006252395,0.000010394047,0.000024647674,0.00012594329,0.0000354695],"domain_scores_gemma":[0.9993637,0.00034215522,0.00004556869,0.000091416325,0.00011294816,0.000044109187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052334653,0.0008040024,0.000633117,0.00040389178,0.00047769537,0.00090516487,0.0008934584,0.0011396728,0.00457218],"category_scores_gemma":[0.0032688782,0.00048032127,0.0004752421,0.00038804894,0.00057546207,0.00090481614,0.0013154235,0.0016575088,0.0010057401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049440532,0.000046335495,0.00041083284,0.000075084165,0.000017077493,0.0000404927,0.00005551893,0.9687515,0.002650344,0.0079034725,0.0012402252,0.018759647],"study_design_scores_gemma":[0.0000071183263,0.00000997708,0.00009080558,0.000006224318,0.000001513147,0.0000065645545,0.000011198785,0.9963471,0.00063413585,0.0021134345,0.0007695557,0.0000023306782],"about_ca_topic_score_codex":0.004125071,"about_ca_topic_score_gemma":0.0046090493,"teacher_disagreement_score":0.00457218,"about_ca_system_score_codex":0.00052649085,"about_ca_system_score_gemma":0.0010197511,"threshold_uncertainty_score":0.015295446},"labels":[],"label_agreement":null},{"id":"W4249469179","doi":"10.23952/jnva.5.2021.6.02","title":"An iteratively regularized stochastic gradient method for estimating a random parameter in a stochastic PDE. A variational inequality approach","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Multi-Objective Optimization Algorithms","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 Nacional de Educación a Distancia; Ministerio de Ciencia e Innovación; Agencia Estatal de Investigación; National Science Foundation","keywords":"Mathematics; Applied mathematics; Variational inequality; Mathematical optimization; Inequality; Mathematical analysis","score_opus":0.026457147458199107,"score_gpt":0.33167249065134585,"score_spread":0.30521534319314675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249469179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012391405,0.00013209289,0.998002,0.00009773388,0.000021249636,0.000026158023,0.000016112539,0.00002777725,0.00043776105],"genre_scores_gemma":[0.14420229,0.0006718058,0.84919244,0.00020101693,0.000116117975,0.0004495606,0.00015839013,0.00012649043,0.0048819478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931324,0.00031809724,0.000032086875,0.000102584236,0.00019757227,0.0000365117],"domain_scores_gemma":[0.9993243,0.00038069425,0.00007357214,0.000050207687,0.00012509446,0.000046042856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021057012,0.0010292816,0.0011255421,0.0007228433,0.00030865308,0.00080168847,0.0013524262,0.0014793877,0.0018652333],"category_scores_gemma":[0.0033983206,0.0007114805,0.0011618941,0.0005191373,0.0013764107,0.0014484236,0.0018962809,0.0019809788,0.00040572076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000579431,0.00005357343,0.00035474484,0.00023391459,0.00011170135,0.00014297357,0.00009081567,0.79460156,0.012118392,0.15210381,0.0011580787,0.038972456],"study_design_scores_gemma":[0.0000051861157,0.000019911227,0.000030573712,0.000007235079,0.0000049907976,0.00001716465,0.0000025577508,0.99063766,0.0005482851,0.008043191,0.00067572645,0.000007409056],"about_ca_topic_score_codex":0.0026963546,"about_ca_topic_score_gemma":0.0022442504,"teacher_disagreement_score":0.0026963546,"about_ca_system_score_codex":0.00083622616,"about_ca_system_score_gemma":0.0016597923,"threshold_uncertainty_score":0.011136115},"labels":[],"label_agreement":null},{"id":"W4249796148","doi":"10.1115/detc2004-57194","title":"An Efficient Pareto Set Identification Approach for Multi-Objective Optimization on Black-Box Functions","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"","keywords":"Mathematical optimization; Pareto principle; Computer science; Robustness (evolution); Black box; Multi-objective optimization; Set (abstract data type); Computation; Identification (biology); Convergence (economics); Algorithm; Mathematics; Artificial intelligence","score_opus":0.033186627233410836,"score_gpt":0.3035175838474078,"score_spread":0.270330956613997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249796148","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.0008593391,0.000030151285,0.9981171,0.000012991673,0.0000055630735,0.000019770585,0.0000041860335,0.00004686474,0.0009041018],"genre_scores_gemma":[0.100839056,0.00022543865,0.8950329,0.000076577664,0.00002518969,0.00042043478,0.000056510413,0.000094311596,0.0032295797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991898,0.00028472053,0.000024425926,0.0000668154,0.0003869962,0.00004730508],"domain_scores_gemma":[0.9992761,0.00041574522,0.000044865723,0.000078428675,0.00015931252,0.00002556284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020699096,0.0011340977,0.001113829,0.001358112,0.00073567976,0.00072117953,0.0010925158,0.0010246031,0.0029717193],"category_scores_gemma":[0.0022198332,0.0005584086,0.0012139665,0.0008561062,0.0010077932,0.0010964245,0.0016537327,0.0015299954,0.0007659635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037051002,0.000064775246,0.00017921386,0.00011341121,0.000036456204,0.000059119546,0.000071958595,0.7957212,0.0061816582,0.08203621,0.0009288112,0.11457017],"study_design_scores_gemma":[0.0000057620455,0.000027259686,0.000033542234,0.000011337169,0.0000042480215,0.000016749324,0.000005222003,0.9829379,0.0013224544,0.014265222,0.0013633913,0.000006998016],"about_ca_topic_score_codex":0.0009139925,"about_ca_topic_score_gemma":0.0011227236,"teacher_disagreement_score":0.0029717193,"about_ca_system_score_codex":0.00064693997,"about_ca_system_score_gemma":0.0012965928,"threshold_uncertainty_score":0.01094681},"labels":[],"label_agreement":null},{"id":"W4251911158","doi":"10.32920/14640045","title":"Wireless Sensor Network Optimization: Multi-Objective Paradigm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Optimization problem; Computer science; Software deployment; Key distribution in wireless sensor networks; Wireless network; Wireless; Distributed computing; Mathematical optimization; Computer network; Telecommunications; Mathematics","score_opus":0.022769217665029595,"score_gpt":0.2732898342041067,"score_spread":0.2505206165390771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251911158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014901395,0.005633852,0.98330474,0.0012435345,0.00017295362,0.0000690982,0.00011588435,0.00006213826,0.007907648],"genre_scores_gemma":[0.2567802,0.031681415,0.6933026,0.0012357313,0.0014090481,0.0010722498,0.0003934591,0.0002443578,0.013880962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979804,0.0010864763,0.00008791586,0.00021289289,0.0005550712,0.00007724446],"domain_scores_gemma":[0.9987733,0.0008299999,0.0001373727,0.000060443494,0.00016181891,0.000037092203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025848756,0.0017140019,0.0014072546,0.00085935,0.00035912552,0.0020859374,0.0016287349,0.0018739295,0.0027748672],"category_scores_gemma":[0.0032684263,0.0005185024,0.0011013534,0.0023286063,0.0010852722,0.0023893996,0.0012327565,0.0026403163,0.0006160206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044399418,0.000066641944,0.00034370337,0.0012372088,0.00018352219,0.00017527466,0.00009821934,0.6453145,0.0015187048,0.2740934,0.0062635643,0.070660874],"study_design_scores_gemma":[0.000019105806,0.00007168453,0.00022485117,0.00017733635,0.000041667765,0.00011879872,0.000045150373,0.79704475,0.00075642613,0.18401547,0.017461356,0.000023462697],"about_ca_topic_score_codex":0.00090014254,"about_ca_topic_score_gemma":0.00092781935,"teacher_disagreement_score":0.0027748672,"about_ca_system_score_codex":0.0010773567,"about_ca_system_score_gemma":0.00098148,"threshold_uncertainty_score":0.013670266},"labels":[],"label_agreement":null},{"id":"W4252074383","doi":"10.1109/ccece.2018.8447703","title":"IIR Filter Design Using Multiobjective Teaching-Learning-Based Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Passband; Stopband; Infinite impulse response; Chebyshev filter; Minimax; Finite impulse response; Computer science; Minification; Low-pass filter; 2D Filters; High-pass filter; Filter (signal processing); Digital filter; Filter design; Control theory (sociology); Mathematical optimization; Algorithm; Mathematics; Band-pass filter; Artificial intelligence; Electronic engineering; Engineering; Computer vision","score_opus":0.03145083055524149,"score_gpt":0.2945292099536109,"score_spread":0.2630783793983694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252074383","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.0059705605,0.00007896465,0.99242437,0.00002832263,0.000007755672,0.000023237184,0.0000054289544,0.0000863889,0.0013749489],"genre_scores_gemma":[0.33823854,0.00027380505,0.6568271,0.000101948215,0.00003596891,0.0002426012,0.000060726637,0.0000880309,0.0041312627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997383,0.000069509464,0.000013336159,0.000051403247,0.00010632509,0.000021127056],"domain_scores_gemma":[0.99958223,0.00023252152,0.000061246625,0.000026527263,0.00008350148,0.000013970623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066501903,0.0007939583,0.0006827468,0.00041778924,0.00025793115,0.00048667038,0.00065401907,0.0008495439,0.0016114279],"category_scores_gemma":[0.0012521364,0.0002684524,0.0005033742,0.00035870055,0.00045663572,0.0005329509,0.00051406305,0.0005605889,0.00039097306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044789045,0.000056687815,0.00022386944,0.00011444038,0.000031570453,0.000027642087,0.000039767725,0.90687937,0.009727627,0.0043292562,0.00030070788,0.07822415],"study_design_scores_gemma":[0.000005935857,0.000046824152,0.000044214543,0.000003848292,0.0000046549467,0.000011229366,0.000003452315,0.99744475,0.0015114691,0.00052736443,0.00039349357,0.0000027628346],"about_ca_topic_score_codex":0.0011020977,"about_ca_topic_score_gemma":0.0014466812,"teacher_disagreement_score":0.0016114279,"about_ca_system_score_codex":0.00052894204,"about_ca_system_score_gemma":0.0005836758,"threshold_uncertainty_score":0.005390823},"labels":[],"label_agreement":null},{"id":"W4255052596","doi":"10.22215/etd/2011-09468","title":"Improved placement of local solver launch points for large-scale global optimization","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Solver; Scale (ratio); Computer science; Aerospace engineering; Geography; Engineering; Cartography; Programming language","score_opus":0.0107878867576591,"score_gpt":0.2734182411692607,"score_spread":0.2626303544116016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255052596","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.024895322,0.00021902347,0.9619675,0.00014495727,0.00013141865,0.000120307515,0.00007496568,0.0029067232,0.009539644],"genre_scores_gemma":[0.3586238,0.00018204242,0.6281615,0.000089712965,0.00007040711,0.00031255247,0.00025978452,0.0008332527,0.011467019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995987,0.00011246829,0.000017379198,0.000054542976,0.00015415755,0.00006270092],"domain_scores_gemma":[0.9991684,0.0002532392,0.00007947578,0.00019626335,0.00022664285,0.00007603561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790629,0.001129564,0.0008546127,0.0008772651,0.00073021173,0.00096828624,0.0015351622,0.0010294993,0.011841113],"category_scores_gemma":[0.002755529,0.0005044088,0.00049281726,0.0006595348,0.000586196,0.0008775297,0.0019589076,0.0013087454,0.0039664577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031172257,0.00019400034,0.00067236024,0.00016589744,0.00004131341,0.00017795616,0.00014920812,0.7929072,0.016536579,0.012430045,0.008535523,0.16787817],"study_design_scores_gemma":[0.000058048212,0.00015583221,0.00015844479,0.0000147845385,0.000010399255,0.00002453651,0.000032788234,0.9887066,0.0048700585,0.002975063,0.0029810797,0.000012369353],"about_ca_topic_score_codex":0.0020488787,"about_ca_topic_score_gemma":0.0053955954,"teacher_disagreement_score":0.011841113,"about_ca_system_score_codex":0.00073349074,"about_ca_system_score_gemma":0.0012654383,"threshold_uncertainty_score":0.039612472},"labels":[],"label_agreement":null},{"id":"W425598545","doi":"","title":"Optimal Advertising Campaign Generation For Multiple Brands Using Multi-Objective Genetic Algorithm","year":2005,"lang":"en","type":"article","venue":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"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":"Greedy algorithm; Genetic algorithm; Mathematical optimization; Heuristic; Computer science; Variety (cybernetics); Pareto optimal; Set (abstract data type); Encoding (memory); Key (lock); Optimization problem; Pareto principle; Algorithm; Multi-objective optimization; Greedy randomized adaptive search procedure; Mathematics; Artificial intelligence","score_opus":0.05859566639916588,"score_gpt":0.28887644868629303,"score_spread":0.23028078228712714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W425598545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060417276,0.00024340578,0.93432146,0.00018383487,0.00004161653,0.000099146026,0.000053462783,0.0003075764,0.004332225],"genre_scores_gemma":[0.41129854,0.00023223941,0.58392817,0.00012700984,0.00003214443,0.00036591172,0.00021805018,0.0000983477,0.0036996254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.00010718006,0.000013040278,0.000071961884,0.000086534965,0.000053695385],"domain_scores_gemma":[0.9995103,0.0003196054,0.000057230707,0.000024588086,0.000064964595,0.000023343491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081866543,0.00084591703,0.0009516566,0.00094328664,0.00039979958,0.000777206,0.0011332219,0.0011051691,0.0015219824],"category_scores_gemma":[0.0015701028,0.00044031383,0.0009036225,0.00087896315,0.00052361,0.00061216706,0.0005767329,0.00073104305,0.0001812554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018610532,0.000027987877,0.00029240822,0.00001885332,0.000021256468,0.000027202454,0.00002406756,0.9721844,0.0010192592,0.0025456995,0.00028454486,0.02353564],"study_design_scores_gemma":[0.00001058115,0.0000162299,0.00006725906,0.000002839839,0.000007057289,0.000006957191,0.000005640815,0.99839693,0.00032827328,0.0008822752,0.00027282792,0.0000030731496],"about_ca_topic_score_codex":0.0066410345,"about_ca_topic_score_gemma":0.005211326,"teacher_disagreement_score":0.0066410345,"about_ca_system_score_codex":0.0011023638,"about_ca_system_score_gemma":0.0012591261,"threshold_uncertainty_score":0.013204753},"labels":[],"label_agreement":null},{"id":"W4280531198","doi":"10.1007/s40747-022-00759-w","title":"Machine learning-based framework to cover optimal Pareto-front in many-objective optimization","year":2022,"lang":"en","type":"article","venue":"Complex & Intelligent Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ontario Tech University","funders":"","keywords":"Multi-objective optimization; Mathematical optimization; Heuristic; Computer science; Latin hypercube sampling; Optimization problem; Pareto principle; Population; Set (abstract data type); Set cover problem; Machine learning; Artificial intelligence; Mathematics; Monte Carlo method","score_opus":0.027320001216155188,"score_gpt":0.2797006613151728,"score_spread":0.2523806600990176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280531198","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.014110787,0.00026986995,0.98296815,0.00012299352,0.000022753247,0.00005212673,0.000018149833,0.00021205921,0.002223149],"genre_scores_gemma":[0.57286656,0.00028705754,0.42409137,0.00020693832,0.000066275,0.0003948937,0.00014187237,0.00012817296,0.0018168662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990429,0.00042716507,0.000039658837,0.00009386946,0.00032177576,0.00007451948],"domain_scores_gemma":[0.99835914,0.0009962266,0.00015044882,0.00015250532,0.00029282126,0.00004887788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024103539,0.00090878445,0.0012603403,0.0011684591,0.00041399375,0.00076294,0.0015801002,0.001230761,0.0018959524],"category_scores_gemma":[0.0042025573,0.00043311037,0.0009373802,0.000799173,0.0009300923,0.0011093541,0.0012158336,0.0013391427,0.00030479106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010141548,0.000023971355,0.0001794787,0.000032421645,0.000009189269,0.000018329256,0.000013198028,0.97727764,0.00058394653,0.0058104675,0.00019559654,0.01584568],"study_design_scores_gemma":[0.0000016830828,0.000010831431,0.000019381063,0.0000030727942,0.0000010078903,0.000004141752,0.0000016516266,0.99849856,0.00014376128,0.0011986226,0.00011607387,0.0000011632565],"about_ca_topic_score_codex":0.0019427533,"about_ca_topic_score_gemma":0.0012172497,"teacher_disagreement_score":0.0024103539,"about_ca_system_score_codex":0.00094206963,"about_ca_system_score_gemma":0.0009479939,"threshold_uncertainty_score":0.012747288},"labels":[],"label_agreement":null},{"id":"W4280532181","doi":"10.18280/isi.270205","title":"An Intelligent Multi-Objective Evolutionary Model for Establishing Security in Cyber-Physical Systems","year":2022,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Evolutionary algorithm; Computer science; Scheduling (production processes); Process (computing); Element (criminal law); MATLAB; Mathematical optimization; Optimization problem; Distributed computing; Artificial intelligence; Mathematics; Algorithm","score_opus":0.020095358873116365,"score_gpt":0.27182224639085156,"score_spread":0.2517268875177352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280532181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015388592,0.00050069165,0.9704456,0.0002977665,0.00005600012,0.000065319284,0.00007724237,0.00009041242,0.01307845],"genre_scores_gemma":[0.7458661,0.001211417,0.23321562,0.00020878448,0.000064360116,0.0007015766,0.00023786158,0.00008122973,0.018412959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.00009708927,0.000008574698,0.000033547298,0.00006171476,0.000031699154],"domain_scores_gemma":[0.99975604,0.00013279101,0.00003135397,0.000012726503,0.000049487728,0.00001758998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006427517,0.00080095325,0.0007313364,0.0006814484,0.0005296791,0.0011728096,0.0011253008,0.0014738651,0.0032078596],"category_scores_gemma":[0.0011073712,0.00036523942,0.0010619856,0.0007269636,0.00062098255,0.0007195683,0.000868779,0.0011017958,0.00029573092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056337117,0.0000073144097,0.00009885892,0.000018326835,0.000010833383,0.000028038838,0.000011423688,0.9899518,0.00021830141,0.0066463095,0.00012851036,0.0028745865],"study_design_scores_gemma":[0.0000029599714,0.000012210121,0.000045235673,0.000004998461,0.0000043478813,0.000007774626,0.000004523453,0.99759537,0.000057796264,0.0018703475,0.00039238296,0.0000021429094],"about_ca_topic_score_codex":0.0045907446,"about_ca_topic_score_gemma":0.0038660201,"teacher_disagreement_score":0.0045907446,"about_ca_system_score_codex":0.0006791652,"about_ca_system_score_gemma":0.0010603742,"threshold_uncertainty_score":0.010731339},"labels":[],"label_agreement":null},{"id":"W4281289910","doi":"10.1115/1.4054631","title":"Reinforcement Learning-Based Sequential Batch-Sampling for Bayesian Optimal Experimental Design","year":2022,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Reinforcement learning; Computer science; Leverage (statistics); Bayesian optimization; Artificial intelligence; Bayesian probability; Time budget; Machine learning; Suite","score_opus":0.06422167137727451,"score_gpt":0.3170696949748516,"score_spread":0.2528480235975771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281289910","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.010922845,0.000401793,0.9862466,0.00027644378,0.000061798644,0.00048581362,0.00008286363,0.00056120905,0.0009607342],"genre_scores_gemma":[0.5781218,0.00032404443,0.41570693,0.00051873276,0.00011434001,0.0022892398,0.0003758544,0.00016365896,0.002385439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933717,0.004215673,0.00028175776,0.00106274,0.00068949774,0.0003785291],"domain_scores_gemma":[0.9458892,0.046500526,0.0027239262,0.0015559703,0.0020999108,0.0012304494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01671981,0.0021519074,0.004051757,0.0013964856,0.000610204,0.0013513705,0.003573941,0.0023642867,0.005124689],"category_scores_gemma":[0.03870101,0.0019071735,0.0013939203,0.000952695,0.0030121643,0.0016427195,0.0023789532,0.0036041664,0.0005811889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006055057,0.00019561005,0.0010794266,0.00030865776,0.00012551894,0.000088748246,0.00009247387,0.9304358,0.0008380503,0.026687074,0.00072078186,0.038822364],"study_design_scores_gemma":[0.000086079184,0.000069767644,0.00008599,0.000015901864,0.000013675632,0.0000065997788,0.0000038072099,0.9881197,0.00028042615,0.01110551,0.00020436078,0.000008148729],"about_ca_topic_score_codex":0.0065721585,"about_ca_topic_score_gemma":0.0064294613,"teacher_disagreement_score":0.01671981,"about_ca_system_score_codex":0.003147774,"about_ca_system_score_gemma":0.00472891,"threshold_uncertainty_score":0.08842385},"labels":[],"label_agreement":null},{"id":"W4283272765","doi":"10.2514/6.2022-4037","title":"A mixed-categorical data-driven approach for prediction and optimization of hybrid discontinuous composites performance","year":2022,"lang":"en","type":"article","venue":"AIAA AVIATION 2022 Forum","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Categorical variable; Surrogate model; Interpolation (computer graphics); Solver; Computer science; Bayesian optimization; Mathematical optimization; Process (computing); Optimization problem; Algorithm; Machine learning; Artificial intelligence; Mathematics","score_opus":0.020506587431729967,"score_gpt":0.2370151774739157,"score_spread":0.21650859004218573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283272765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031276323,0.00016978115,0.96546614,0.00021401033,0.000035147463,0.000047160556,0.0003016893,0.00052969885,0.001960072],"genre_scores_gemma":[0.7077034,0.00015443338,0.28733334,0.00014492116,0.00004300214,0.0003711824,0.00088058383,0.00015393697,0.0032151416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.00014289559,0.000014307975,0.00006030573,0.00008900073,0.00003277784],"domain_scores_gemma":[0.9987404,0.00082371983,0.00011855471,0.00006639239,0.00019486676,0.000056043486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013091562,0.00081453816,0.00068262,0.00080931076,0.00028889964,0.00096917886,0.0010892578,0.0016069462,0.0035083715],"category_scores_gemma":[0.002874278,0.0005603926,0.0008646811,0.00055464404,0.00042195024,0.0005196745,0.0007699009,0.0012970361,0.0005982424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039794086,0.000052555104,0.00088426407,0.00004484131,0.000019019082,0.000024976376,0.000015464586,0.97965235,0.001094493,0.001936838,0.0004729224,0.015762586],"study_design_scores_gemma":[9.474645e-7,0.0000070196143,0.000054530643,0.000002097188,8.8571835e-7,0.0000019354097,0.0000019507252,0.9994413,0.000115731506,0.00030548853,0.00006653118,0.0000015818877],"about_ca_topic_score_codex":0.0044410494,"about_ca_topic_score_gemma":0.004206452,"teacher_disagreement_score":0.0044410494,"about_ca_system_score_codex":0.0005304559,"about_ca_system_score_gemma":0.0008316705,"threshold_uncertainty_score":0.011736631},"labels":[],"label_agreement":null},{"id":"W4283692374","doi":"10.1016/j.cma.2022.115223","title":"An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems","year":2022,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Sorting; Benchmark (surveying); Computer science; Convergence (economics); Multi-objective optimization; Pareto principle; Algorithm; Hummingbird; Search-based software engineering; Metaheuristic; Population; Mathematics; Software; Software design; Software development","score_opus":0.01611159263480726,"score_gpt":0.28487867853895754,"score_spread":0.26876708590415027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283692374","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.018700074,0.000206336,0.97871894,0.000047725334,0.00005896024,0.00004039156,0.000010976983,0.00016597757,0.0020506482],"genre_scores_gemma":[0.44676208,0.0002118216,0.5487724,0.00013004629,0.00006461673,0.00030156237,0.00008589603,0.00006496256,0.0036065127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997063,0.00007526111,0.000013197322,0.000055527154,0.00011874556,0.000030986346],"domain_scores_gemma":[0.9996954,0.00013001692,0.000030266778,0.000020794276,0.00009394931,0.000029575293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308035,0.00091608067,0.0010281223,0.0008317104,0.00062297937,0.00050974265,0.0013392844,0.0011659025,0.0013834718],"category_scores_gemma":[0.0010368782,0.0004077336,0.0007428112,0.00054589624,0.00048371442,0.00062015303,0.0012261776,0.0005866379,0.00022208322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007819517,0.00007337214,0.0005381052,0.000112424415,0.00007304205,0.000061105915,0.000080419544,0.8853934,0.005315737,0.0051487708,0.000880228,0.10224526],"study_design_scores_gemma":[0.000008175324,0.000028498785,0.00005764032,0.0000033667586,0.0000070647084,0.00001066311,0.0000051966954,0.9987349,0.00036658064,0.00045522107,0.00031909288,0.0000036047509],"about_ca_topic_score_codex":0.003423597,"about_ca_topic_score_gemma":0.0028296586,"teacher_disagreement_score":0.003423597,"about_ca_system_score_codex":0.0003971985,"about_ca_system_score_gemma":0.00085102336,"threshold_uncertainty_score":0.0068073273},"labels":[],"label_agreement":null},{"id":"W4283835456","doi":"10.5281/zenodo.6801308","title":"Regularized Infill Criteria for Multi-objective Bayesian Optimization with Application to Aircraft Design","year":2022,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"Horizon 2020 Framework Programme; Office National d'études et de Recherches Aérospatiales; European Commission","keywords":"Bayesian optimization; Infill; Computer science; Bayesian probability; Engineering; Artificial intelligence; Structural engineering","score_opus":0.03771061288443587,"score_gpt":0.29096153915103806,"score_spread":0.25325092626660217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283835456","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.0025700412,0.00020923647,0.99548835,0.00007454547,0.000015081282,0.00003090208,0.000021950715,0.000121075296,0.0014687723],"genre_scores_gemma":[0.23771332,0.000534021,0.75633335,0.00016929455,0.00006415342,0.0006535196,0.00025668493,0.00032877532,0.003946892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985261,0.0008325367,0.00004872566,0.0000762984,0.0004634023,0.00005292667],"domain_scores_gemma":[0.9977574,0.0015134743,0.00020069511,0.00009729929,0.00037835015,0.000052832744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029458492,0.0012814093,0.0012462889,0.0011308667,0.0003225198,0.00089234003,0.00076962844,0.0013347752,0.0026136767],"category_scores_gemma":[0.0063376455,0.0005168043,0.0010666619,0.00072083494,0.0008704346,0.0008699089,0.0014922759,0.0012594855,0.00073808664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054430817,0.000037731792,0.00027138717,0.0001751195,0.000046060093,0.00006316211,0.000057364326,0.9217315,0.0029625094,0.02119529,0.0011792047,0.052226294],"study_design_scores_gemma":[0.0000035400296,0.000022886938,0.000043784225,0.000014022428,0.0000038446815,0.000010520377,0.0000031842662,0.99520975,0.0005841528,0.0032482059,0.0008509589,0.0000050524864],"about_ca_topic_score_codex":0.0012405744,"about_ca_topic_score_gemma":0.0013842989,"teacher_disagreement_score":0.0029458492,"about_ca_system_score_codex":0.0007169283,"about_ca_system_score_gemma":0.0008287837,"threshold_uncertainty_score":0.015579343},"labels":[],"label_agreement":null},{"id":"W4285288632","doi":"10.1109/tmtt.2022.3181127","title":"A Novel Surrogate-Based Approach to Yield Estimation and Optimization of Microwave Structures Using Combined Quadratic Mappings and Matrix Transfer Functions","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Surrogate model; Mathematical optimization; Quadratic equation; Transfer function; Yield (engineering); Set (abstract data type); Matrix (chemical analysis); Function (biology); Optimization problem; Algorithm; Computer science; Quadratic programming; Mathematics; Engineering","score_opus":0.018153227364804667,"score_gpt":0.25231180198815306,"score_spread":0.23415857462334838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285288632","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.0019922033,0.00004414359,0.9971222,0.00003251079,0.0000072058992,0.000009053043,0.000009000565,0.00008175767,0.00070181594],"genre_scores_gemma":[0.23314369,0.00031858764,0.7618729,0.00009851038,0.000036473084,0.00025077036,0.00018409359,0.00023332812,0.0038616736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995029,0.00018880746,0.000020648577,0.00004726245,0.00021417164,0.00002626984],"domain_scores_gemma":[0.99938226,0.00033164732,0.000066904795,0.000062322,0.00013771007,0.000019082345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011763372,0.0010559035,0.0007507173,0.00062869414,0.00026508517,0.0008330342,0.0007159881,0.0009349412,0.001538248],"category_scores_gemma":[0.0020095196,0.00054073887,0.0009044877,0.00060634903,0.0004978741,0.0009478534,0.00088661595,0.0010306053,0.00045491374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033191784,0.00003532698,0.0002724285,0.00008078339,0.000029706509,0.000047626316,0.000038633607,0.94354546,0.008714629,0.0152659565,0.0005277691,0.031408478],"study_design_scores_gemma":[0.0000023356863,0.000014959765,0.000023231094,0.0000031462635,0.0000023331706,0.000011085689,0.0000023548969,0.99696845,0.0009176163,0.0015731694,0.0004782749,0.0000030834353],"about_ca_topic_score_codex":0.00065421825,"about_ca_topic_score_gemma":0.0006641631,"teacher_disagreement_score":0.001538248,"about_ca_system_score_codex":0.00041019497,"about_ca_system_score_gemma":0.00074454566,"threshold_uncertainty_score":0.006221175},"labels":[],"label_agreement":null},{"id":"W4286569388","doi":"10.1109/compel53829.2022.9829984","title":"Multi-Objective Optimization of EE-core Transformers using Geometric Programming","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Xerox (Canada)","funders":"","keywords":"Geometric programming; Mathematical optimization; Transformer; Monomial; Computer science; Multi-objective optimization; Pareto optimal; Optimality criterion; Mathematics; Engineering; Discrete mathematics","score_opus":0.052099471536464236,"score_gpt":0.31889171392387183,"score_spread":0.2667922423874076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286569388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008124588,0.00008772246,0.9885089,0.000036633854,0.000009255584,0.000026788739,0.000017922323,0.00011838011,0.0030698262],"genre_scores_gemma":[0.39863232,0.00036363536,0.5945086,0.00007055103,0.000020277272,0.0002183816,0.00014150587,0.00027501816,0.0057697296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970835,0.00008479365,0.000009587341,0.000045027296,0.00011732969,0.000034916793],"domain_scores_gemma":[0.99974066,0.00014251056,0.000032967375,0.00002136673,0.00005083096,0.00001157576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008771,0.0010787752,0.0007634305,0.0005286555,0.00027717475,0.0009021122,0.00065954326,0.0005974279,0.0028257056],"category_scores_gemma":[0.0010103466,0.0003818865,0.00066207716,0.0005607463,0.0006251965,0.0008228567,0.0007628207,0.00076702336,0.00041882542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018470275,0.000018032952,0.000100604855,0.000048485643,0.000008941468,0.000020056543,0.000014991787,0.9597807,0.0030328394,0.012027179,0.00032843748,0.02460129],"study_design_scores_gemma":[0.0000058488154,0.000030805328,0.00003625095,0.0000055407595,0.000003902711,0.000013226343,0.0000061631636,0.9922816,0.0014576742,0.005156964,0.0009990411,0.0000030046115],"about_ca_topic_score_codex":0.00081160525,"about_ca_topic_score_gemma":0.0011699531,"teacher_disagreement_score":0.0028257056,"about_ca_system_score_codex":0.0006929966,"about_ca_system_score_gemma":0.00063972524,"threshold_uncertainty_score":0.009452939},"labels":[],"label_agreement":null},{"id":"W4288828694","doi":"10.1016/b978-0-323-85159-6.50284-0","title":"Adaptive least-squares surrogate modeling for reaction systems","year":2022,"lang":"en","type":"book-chapter","venue":"Computer-aided chemical engineering/Computer aided chemical engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Latin hypercube sampling; Mathematical optimization; Surrogate model; Convergence (economics); Sampling (signal processing); Computer science; Adaptive sampling; Optimization problem; Least-squares function approximation; Function (biology); Algorithm; Mathematics; Statistics","score_opus":0.017931534410239914,"score_gpt":0.2089007512247176,"score_spread":0.19096921681447768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288828694","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.0013928536,0.0005766223,0.99394554,0.00008923955,0.00005569544,0.000010711487,0.000040797426,0.00021550513,0.0036731202],"genre_scores_gemma":[0.32895404,0.0037567343,0.6256202,0.00023717919,0.00025876513,0.00039421723,0.00071154506,0.0005722452,0.039495107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965644,0.00014494966,0.000013754485,0.00003752717,0.00013404027,0.000013310063],"domain_scores_gemma":[0.9995919,0.0002505966,0.00003227526,0.000046638525,0.00006845392,0.000010228245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705275,0.00069360744,0.0009030122,0.00024367016,0.00018428925,0.00079800264,0.00085561123,0.001033025,0.0024978516],"category_scores_gemma":[0.0013080144,0.0004052561,0.0006973213,0.00063745945,0.00040590815,0.00067773013,0.00069727516,0.0013089778,0.0012567753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030544845,0.00003104782,0.00007573517,0.00013305811,0.000029563551,0.00002136547,0.000023711002,0.9205249,0.003926136,0.023730975,0.0023308664,0.049142115],"study_design_scores_gemma":[0.0000014562064,0.0000066932616,0.000020047457,0.0000042447614,0.0000017591218,0.0000051824113,0.0000014686273,0.9932541,0.00048197506,0.004821693,0.0013989524,0.0000024679744],"about_ca_topic_score_codex":0.00075336004,"about_ca_topic_score_gemma":0.00083385187,"teacher_disagreement_score":0.0024978516,"about_ca_system_score_codex":0.00034798382,"about_ca_system_score_gemma":0.00045371347,"threshold_uncertainty_score":0.008356154},"labels":[],"label_agreement":null},{"id":"W4289870909","doi":"10.1287/stsy.2022.0096","title":"Convergence Rates of Epsilon-Greedy Global Optimization Under Radial Basis Function Interpolation","year":2022,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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 Toronto","funders":"","keywords":"Mathematics; Rate of convergence; Interpolation (computer graphics); Convergence (economics); Mathematical optimization; Sampling (signal processing); Function (biology); Applied mathematics; Basis (linear algebra); Global optimization; Space (punctuation); Computer science; Filter (signal processing); Key (lock)","score_opus":0.018187653732222572,"score_gpt":0.26487037483204023,"score_spread":0.24668272109981765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289870909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03831788,0.0018731934,0.9512427,0.00073359784,0.00007331673,0.00009752615,0.000085220374,0.00038829554,0.0071882894],"genre_scores_gemma":[0.7420706,0.0019238493,0.24526337,0.00047895292,0.000108344626,0.0005982583,0.00039635503,0.00071839656,0.008441816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720734,0.0014600048,0.000113203096,0.00029310162,0.00066054496,0.00026578904],"domain_scores_gemma":[0.9762004,0.01808061,0.0012961883,0.0011934647,0.002638833,0.00059050514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016496629,0.0023172407,0.0020085997,0.0016300861,0.00082207297,0.0013483025,0.0025465628,0.0025900123,0.0022939153],"category_scores_gemma":[0.04442377,0.000887098,0.0015535161,0.00089161005,0.0029285275,0.0026957367,0.0035379569,0.002703267,0.00064966356],"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.00036816785,0.00006147294,0.0015928432,0.00029704822,0.00008727008,0.00015535393,0.00021101089,0.8753098,0.002559871,0.10003355,0.001492998,0.017830586],"study_design_scores_gemma":[0.000011816876,0.000054174998,0.00017303013,0.000046263132,0.00001205591,0.000031033276,0.00001882003,0.9811782,0.00088831485,0.017205715,0.0003671461,0.00001342065],"about_ca_topic_score_codex":0.0033693607,"about_ca_topic_score_gemma":0.0015323499,"teacher_disagreement_score":0.016496629,"about_ca_system_score_codex":0.0024017321,"about_ca_system_score_gemma":0.0017568233,"threshold_uncertainty_score":0.08724356},"labels":[],"label_agreement":null},{"id":"W4290466112","doi":"10.3390/a15080279","title":"High-Fidelity Surrogate Based Multi-Objective Optimization Algorithm","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Pareto principle; Surrogate model; Mathematical optimization; Multi-objective optimization; Engineering design process; Benchmark (surveying); Computer science; Weighting; Evolutionary algorithm; Algorithm; Optimization problem; Mathematics; Engineering","score_opus":0.016092029970673504,"score_gpt":0.2590570821470061,"score_spread":0.24296505217633263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290466112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004006754,0.0002015789,0.9917395,0.000087640714,0.000032661203,0.000039079532,0.000037882637,0.00022837266,0.003626549],"genre_scores_gemma":[0.3429309,0.00042207728,0.6469631,0.00019688897,0.000053629177,0.00063067774,0.00043143475,0.00015377603,0.008217454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949455,0.00018223432,0.00002398201,0.00005667575,0.00019755783,0.000044976645],"domain_scores_gemma":[0.99925727,0.00038457048,0.00006733025,0.00005076299,0.0002067129,0.000033366956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674949,0.00078610814,0.0011990091,0.0006223189,0.0004612944,0.0011513244,0.0012864909,0.0016611606,0.003636372],"category_scores_gemma":[0.0020580285,0.00046991758,0.0009034959,0.0007447213,0.0005339083,0.0006512496,0.0011869615,0.0012711423,0.00086978456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032392465,0.000023374178,0.00022150931,0.000051609717,0.000022220402,0.000041815074,0.000019532707,0.97034204,0.0012158992,0.0053111003,0.00070247136,0.022016108],"study_design_scores_gemma":[0.0000052237806,0.000010743267,0.000025478214,0.000005190241,0.0000020025436,0.000009311881,0.000001846824,0.9984862,0.00020057354,0.0007165977,0.00053470244,0.0000021186],"about_ca_topic_score_codex":0.0018663823,"about_ca_topic_score_gemma":0.0014979658,"teacher_disagreement_score":0.003636372,"about_ca_system_score_codex":0.00058130635,"about_ca_system_score_gemma":0.0010348231,"threshold_uncertainty_score":0.012164831},"labels":[],"label_agreement":null},{"id":"W4290755172","doi":"10.1016/j.swevo.2022.101145","title":"ACDB-EA: Adaptive convergence-diversity balanced evolutionary algorithm for many-objective optimization","year":2022,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Alberta","funders":"Science and Technology Program of Zhejiang Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Computer science; Evolutionary algorithm; Mathematical optimization; Benchmark (surveying); Similarity (geometry); Pareto principle; Selection (genetic algorithm); Cosine similarity; Population; Evolutionary computation; Algorithm; Mathematics; Artificial intelligence; Cluster analysis","score_opus":0.015022912938113494,"score_gpt":0.24065138581094397,"score_spread":0.22562847287283047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290755172","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.007406432,0.00042024048,0.98800814,0.000092874965,0.00011789932,0.000060166505,0.000042964588,0.0006954631,0.0031558417],"genre_scores_gemma":[0.24383952,0.00040002173,0.7479777,0.0001985652,0.00009842458,0.00046226612,0.00030485992,0.0003262184,0.006392412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00017098388,0.000022722335,0.00007559283,0.00025896385,0.00006324757],"domain_scores_gemma":[0.9996166,0.00014258192,0.000029531813,0.000049137638,0.00013107232,0.000030956515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009856706,0.0009432422,0.0012287229,0.00088600325,0.0005437715,0.0007802028,0.0016245997,0.0014972527,0.0039503495],"category_scores_gemma":[0.0021343527,0.00032868827,0.00063041283,0.0012092545,0.00048161598,0.0007674361,0.0014628718,0.0014441643,0.00091263023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019987099,0.0001548799,0.0006802285,0.00016697792,0.00012823341,0.00008143754,0.00008167741,0.6878572,0.0084296055,0.018925743,0.0056907027,0.27760333],"study_design_scores_gemma":[0.00004124036,0.00004742827,0.0001116713,0.000009631531,0.0000091973,0.000027314421,0.0000045637403,0.9947373,0.0009233624,0.002044527,0.0020373778,0.000006380732],"about_ca_topic_score_codex":0.0021259745,"about_ca_topic_score_gemma":0.0021946712,"teacher_disagreement_score":0.0039503495,"about_ca_system_score_codex":0.00046090063,"about_ca_system_score_gemma":0.0008794725,"threshold_uncertainty_score":0.013215244},"labels":[],"label_agreement":null},{"id":"W4291270603","doi":"10.1007/978-3-031-14714-2_6","title":"Adaptive Function Value Warping for Surrogate Model Assisted Evolutionary Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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; Surrogate model; Image warping; Mathematical optimization; Evolutionary algorithm; Function (biology); Bellman equation; Sensitivity (control systems); Black box; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.027269641510260293,"score_gpt":0.2562967161073696,"score_spread":0.2290270745971093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291270603","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.005268846,0.00032278316,0.98841816,0.00007014971,0.00007664718,0.000020463363,0.000023652543,0.0002466368,0.0055526076],"genre_scores_gemma":[0.29781038,0.00060323405,0.6869701,0.00016442787,0.00007671689,0.00019957154,0.00020588245,0.00052212225,0.013447548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997515,0.000092689486,0.000008985919,0.00002738407,0.000102576385,0.000016843025],"domain_scores_gemma":[0.9996631,0.00017957263,0.000019988644,0.00006548876,0.00005867251,0.000013226411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572182,0.00062581233,0.0007219817,0.00043763279,0.00023447695,0.0006962712,0.0009595887,0.001155668,0.0044757463],"category_scores_gemma":[0.0018506319,0.0004234064,0.00060498813,0.0006728368,0.00045768882,0.0007280116,0.0012107602,0.001484458,0.0010096966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000603269,0.000051013765,0.00015245068,0.000092572955,0.00004447523,0.00007860147,0.000051423583,0.7984613,0.010639532,0.023295578,0.0025510082,0.16452178],"study_design_scores_gemma":[0.0000022733166,0.000014250257,0.000029630264,0.000005840869,0.0000021017845,0.0000185615,0.0000025854906,0.9935736,0.0009779395,0.0039039874,0.0014661555,0.000003018631],"about_ca_topic_score_codex":0.0003891432,"about_ca_topic_score_gemma":0.00043937654,"teacher_disagreement_score":0.0044757463,"about_ca_system_score_codex":0.0002801116,"about_ca_system_score_gemma":0.0002511068,"threshold_uncertainty_score":0.014972866},"labels":[],"label_agreement":null},{"id":"W4292512861","doi":"10.1007/s41019-022-00193-5","title":"Dimensionality Reduction in Surrogate Modeling: A Review of Combined Methods","year":2022,"lang":"en","type":"review","venue":"Data Science and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate model; Dimensionality reduction; Curse of dimensionality; Computer science; Uncertainty quantification; Reduction (mathematics); Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.15616597191542345,"score_gpt":0.42200037778948857,"score_spread":0.26583440587406515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292512861","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.00048512343,0.94731724,0.04816126,0.0005989266,0.00043472878,0.000037725174,0.000082158156,0.000076847806,0.0028060062],"genre_scores_gemma":[0.0060553285,0.9654381,0.02622193,0.0002548196,0.0006937223,0.000099106794,0.00016421305,0.000051075487,0.0010216461],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984281,0.0004547194,0.00023187902,0.00023929875,0.0005936267,0.000052408883],"domain_scores_gemma":[0.9968844,0.0021179952,0.00018675507,0.00014485158,0.0006106627,0.00005515249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028396337,0.0016984879,0.002705367,0.0036334048,0.0004031257,0.0023673477,0.0016029258,0.0016554751,0.0038275952],"category_scores_gemma":[0.005493491,0.0008085365,0.0020019866,0.005649243,0.000922846,0.0023784405,0.0013355649,0.002107615,0.001796935],"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.000064211075,0.00010281147,0.00044635677,0.016695464,0.00030068975,0.00013667722,0.00011066516,0.013879827,0.0014195136,0.03512606,0.015240097,0.91647774],"study_design_scores_gemma":[0.000056506637,0.00040457622,0.001679634,0.0119948145,0.0007122155,0.001689805,0.0001716408,0.04744591,0.004852943,0.055338494,0.8753825,0.0002710152],"about_ca_topic_score_codex":0.0012900063,"about_ca_topic_score_gemma":0.0010933747,"teacher_disagreement_score":0.0038275952,"about_ca_system_score_codex":0.0007311967,"about_ca_system_score_gemma":0.0014183761,"threshold_uncertainty_score":0.015017629},"labels":[],"label_agreement":null},{"id":"W4292646494","doi":"","title":"Configuration of a dynamic MOLS algorithm for Bi-objective flowshop scheduling","year":2019,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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; Scheduling (production processes); Processor scheduling; Dynamic priority scheduling; Algorithm; Parallel computing; Mathematical optimization; Mathematics; Schedule; Operating system","score_opus":0.008833880944187689,"score_gpt":0.24371462329778404,"score_spread":0.23488074235359635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292646494","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.18284877,0.00040444377,0.7634877,0.00055562146,0.0005048816,0.00042794066,0.0006680187,0.010407,0.04069565],"genre_scores_gemma":[0.6177719,0.00008310142,0.37466362,0.0001338925,0.000049069557,0.0003503716,0.00076777546,0.0005630396,0.0056171953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995504,0.00012308767,0.000023202732,0.00007473203,0.00011276637,0.000115745235],"domain_scores_gemma":[0.99951506,0.00016817801,0.000032450298,0.00008109392,0.00013189006,0.00007135428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006523541,0.00079761876,0.0008205641,0.0009977435,0.0009132918,0.0013029713,0.0019292432,0.0010368619,0.014140423],"category_scores_gemma":[0.0017372477,0.0005081006,0.0005655486,0.0007173971,0.00042101325,0.0008122006,0.0012233346,0.00078795716,0.0021353199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011202525,0.00037493857,0.0012096299,0.00015170327,0.00007406391,0.00016094273,0.00012950032,0.7416019,0.010839062,0.0101239495,0.007957873,0.22625625],"study_design_scores_gemma":[0.000073833944,0.00007862836,0.000099614204,0.0000075245434,0.000008614123,0.000019532374,0.000023873255,0.99409336,0.002191586,0.0012006501,0.002193153,0.000009679708],"about_ca_topic_score_codex":0.003211817,"about_ca_topic_score_gemma":0.0031061838,"teacher_disagreement_score":0.014140423,"about_ca_system_score_codex":0.00087817083,"about_ca_system_score_gemma":0.0015489203,"threshold_uncertainty_score":0.04730445},"labels":[],"label_agreement":null},{"id":"W4293406243","doi":"","title":"A new hybrid method to solve the multi-objective optimization problem for a composite hat-stiffened panel","year":2016,"lang":"en","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Meta heuristic; Mathematical optimization; Heuristic; Optimization problem; Composite number; Rigidity (electromagnetism); Computer science; Mathematics; Algorithm; Engineering; Structural engineering","score_opus":0.022030631805040578,"score_gpt":0.2539166139755995,"score_spread":0.23188598217055892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293406243","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.0064930124,0.00021490926,0.9876352,0.000061895335,0.00013569754,0.000039577593,0.000029818919,0.0001357848,0.0052540614],"genre_scores_gemma":[0.1541101,0.00034579175,0.8244223,0.00021410492,0.0001367762,0.00044485758,0.00015237098,0.00018591738,0.019987902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998338,0.00004642914,0.00000711684,0.000027259373,0.00007151276,0.00001379742],"domain_scores_gemma":[0.99968123,0.00018637143,0.000018192804,0.000017369499,0.00007871814,0.000018078343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053627894,0.00076589163,0.0006441477,0.00043195565,0.00040931103,0.0006611591,0.0011561277,0.0017399449,0.005950922],"category_scores_gemma":[0.0007017854,0.00041753284,0.0008574998,0.00044432614,0.0004546148,0.000610978,0.0008247603,0.0010700016,0.0007426954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006874004,0.00008718775,0.00024545938,0.00022651476,0.00007736364,0.0001213515,0.00006644164,0.8818002,0.012070215,0.011783056,0.0022188884,0.09123461],"study_design_scores_gemma":[0.0000072245844,0.000025020401,0.00003790679,0.0000062282843,0.000005115133,0.000016109385,0.0000055443493,0.99753165,0.00041023496,0.0007458686,0.001204202,0.00000483229],"about_ca_topic_score_codex":0.0020192002,"about_ca_topic_score_gemma":0.0034072336,"teacher_disagreement_score":0.005950922,"about_ca_system_score_codex":0.00025199854,"about_ca_system_score_gemma":0.0005628467,"threshold_uncertainty_score":0.019907832},"labels":[],"label_agreement":null},{"id":"W4294811593","doi":"10.1109/cec55065.2022.9870282","title":"Bicriterion Coevolution for the Multi-objective Travelling Salesperson Problem","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Congress on Evolutionary Computation (CEC)","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematical optimization; Sorting; Evolutionary algorithm; Multi-objective optimization; Computer science; Pareto principle; Metric (unit); Crossover; Selection (genetic algorithm); Mathematics; Cluster analysis; Algorithm; Artificial intelligence; Engineering","score_opus":0.02872381173389856,"score_gpt":0.286230242511338,"score_spread":0.25750643077743945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11487077,0.0010067213,0.8725699,0.00042280936,0.00008284962,0.00013806314,0.000055992714,0.00028539065,0.010567554],"genre_scores_gemma":[0.671307,0.00060135487,0.32031846,0.00026160444,0.000029317633,0.00036600506,0.00017655622,0.00010093313,0.006838876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995084,0.00018903946,0.00002171572,0.000085602274,0.00014271775,0.000052532625],"domain_scores_gemma":[0.9995049,0.000283848,0.000048866168,0.000034514564,0.00009508878,0.000032821397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011263845,0.00085845427,0.00096214516,0.0009150538,0.00054859265,0.00071716367,0.0011831518,0.0011124092,0.0016368732],"category_scores_gemma":[0.0025052142,0.00034690998,0.00083460624,0.00086370826,0.00059649564,0.0006577295,0.0007652577,0.0010347451,0.0002368838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004000741,0.00006409777,0.00090929656,0.00005172053,0.00007367336,0.00011180321,0.00007858016,0.9409283,0.0016779465,0.007753812,0.00091804087,0.04739272],"study_design_scores_gemma":[0.000006766098,0.000024914465,0.00013652034,0.000005710251,0.000008206279,0.00002586816,0.000014751228,0.99734133,0.00026413996,0.0015544517,0.00061372516,0.0000036140443],"about_ca_topic_score_codex":0.006943539,"about_ca_topic_score_gemma":0.0057209437,"teacher_disagreement_score":0.006943539,"about_ca_system_score_codex":0.00090562296,"about_ca_system_score_gemma":0.000911967,"threshold_uncertainty_score":0.013806224},"labels":[],"label_agreement":null},{"id":"W4300388662","doi":"10.48550/arxiv.1305.0182","title":"Space-filling Latin Hypercube Designs based on Randomization\\n Restrictions in Factorial Experiments","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Orthogonality; Latin hypercube sampling; Minimax; Class (philosophy); Space (punctuation); Factorial; Computer science; Mathematics; Factorial experiment; Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Geometry; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.12179743036777486,"score_gpt":0.22985694994546127,"score_spread":0.1080595195776864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300388662","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.011720694,0.00018780564,0.98535776,0.000068686255,0.00004337345,0.0003741512,0.00015696461,0.00023623256,0.0018543655],"genre_scores_gemma":[0.21977083,0.0004270989,0.7730323,0.00023625429,0.00010738857,0.0037463228,0.00035372726,0.00013055104,0.0021955215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9735416,0.021473354,0.00077144825,0.0019786365,0.0016921244,0.0005429271],"domain_scores_gemma":[0.9601101,0.029051267,0.004140324,0.0043750275,0.0017538794,0.0005693174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015964665,0.0018009988,0.0023591153,0.0012064473,0.0005331427,0.0016085904,0.0018313157,0.0012940044,0.0047734827],"category_scores_gemma":[0.03905759,0.00097484316,0.001639116,0.0015702097,0.0031872066,0.002074638,0.0022906547,0.0019377853,0.0008448782],"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.0023116348,0.000317383,0.001671359,0.00080490037,0.00025573108,0.0001426935,0.000462433,0.32842755,0.008381386,0.496928,0.0023025577,0.15799436],"study_design_scores_gemma":[0.00084398047,0.002850003,0.0009280412,0.00014860586,0.00009649323,0.00010192077,0.00008158919,0.6402545,0.007732464,0.33659458,0.0102444645,0.00012334096],"about_ca_topic_score_codex":0.00037270554,"about_ca_topic_score_gemma":0.0003494689,"teacher_disagreement_score":0.015964665,"about_ca_system_score_codex":0.0012045354,"about_ca_system_score_gemma":0.0020662723,"threshold_uncertainty_score":0.08443028},"labels":[],"label_agreement":null},{"id":"W4306377333","doi":"10.3390/electronics11203317","title":"A Large Scale Evolutionary Algorithm Based on Determinantal Point Processes for Large Scale Multi-Objective Optimization Problems","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Advanced Multi-Objective Optimization Algorithms","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é de Moncton","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Evolutionary algorithm; Mathematical optimization; Evolutionary computation; Differential evolution; Multi-objective optimization; Population; Optimization problem; Sorting; Computer science; Particle swarm optimization; Scale (ratio); Algorithm; Mathematics","score_opus":0.008294595748993338,"score_gpt":0.2500965505629103,"score_spread":0.24180195481391697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306377333","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.012161893,0.000088962566,0.98609436,0.000060252518,0.000023891442,0.00003600132,0.0000062672875,0.00010012112,0.0014283609],"genre_scores_gemma":[0.41266987,0.00021390544,0.5840834,0.000096344054,0.000033817945,0.0002617988,0.00006851691,0.000049622246,0.0025227584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00010224266,0.000014193451,0.00004753288,0.000110396955,0.000022791935],"domain_scores_gemma":[0.99967706,0.00016041812,0.000025969475,0.00003333669,0.00008348647,0.000019632778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078060024,0.0004259788,0.0005673952,0.00047361202,0.000394788,0.00065198983,0.00074567785,0.00072400045,0.0012558032],"category_scores_gemma":[0.001432032,0.0001943697,0.0005789359,0.00058235135,0.00041637657,0.0005073591,0.0008855378,0.0008911391,0.00022306603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026114165,0.00007180523,0.0006938422,0.000049155373,0.00004319477,0.00007348617,0.00005761915,0.8614033,0.0040295566,0.017246725,0.0007469372,0.11555824],"study_design_scores_gemma":[0.000005155521,0.000020752432,0.000059427322,0.0000015315118,0.0000028570253,0.0000127379935,0.0000033678818,0.99809676,0.00024051112,0.0011912757,0.00036337206,0.000002114486],"about_ca_topic_score_codex":0.0013341316,"about_ca_topic_score_gemma":0.0014863585,"teacher_disagreement_score":0.0013341316,"about_ca_system_score_codex":0.00031564297,"about_ca_system_score_gemma":0.0007598443,"threshold_uncertainty_score":0.004201114},"labels":[],"label_agreement":null},{"id":"W4309231192","doi":"10.1007/s10479-022-05051-1","title":"Theory, computation, and practice of multiobjective optimisation","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Theory of computation; Computation; Computer science; Mathematical optimization; Multi-objective optimization; Mathematical economics; Mathematics; Algorithm","score_opus":0.15642541301236748,"score_gpt":0.4730439202187418,"score_spread":0.3166185072063743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309231192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021204466,0.034050696,0.90623266,0.01116632,0.0013561536,0.00012518895,0.00012876131,0.0001452939,0.044674486],"genre_scores_gemma":[0.19699752,0.042476855,0.7411262,0.0031792133,0.0036575978,0.0012268043,0.00034224347,0.000229066,0.010764497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869687,0.007837225,0.0008375818,0.0012333284,0.0028286641,0.00029451557],"domain_scores_gemma":[0.98065555,0.015013095,0.0009312801,0.0019850263,0.0011170065,0.00029811694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010182213,0.001541038,0.0024049284,0.0030671442,0.0012944803,0.0073315953,0.00199409,0.003148609,0.0069748606],"category_scores_gemma":[0.022842424,0.0007715196,0.0023088688,0.0041286065,0.011858841,0.0051524956,0.0037900277,0.0063795852,0.0015416925],"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.000011655363,0.000026871081,0.00032455413,0.00063007395,0.00008839978,0.000057878864,0.00019361539,0.02802561,0.00023416964,0.9231622,0.00661383,0.04063115],"study_design_scores_gemma":[0.000008626462,0.000017862294,0.00014941617,0.00023300367,0.000013966362,0.0000572136,0.000050901148,0.029712912,0.00011540361,0.94435245,0.025271624,0.000016603759],"about_ca_topic_score_codex":0.0019247989,"about_ca_topic_score_gemma":0.0013069808,"teacher_disagreement_score":0.010182213,"about_ca_system_score_codex":0.0041072643,"about_ca_system_score_gemma":0.0037417463,"threshold_uncertainty_score":0.05384934},"labels":[],"label_agreement":null},{"id":"W4310150506","doi":"10.1016/j.engappai.2022.105521","title":"A qualitative systematic review of metaheuristics applied to tension/compression spring design problem: Current situation, recommendations, and research direction","year":2022,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":59,"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":"Benchmarking; Benchmark (surveying); Computer science; Metaheuristic; Heuristics; Field (mathematics); Industrial engineering; Algorithm; Data mining; Management science; Mathematics","score_opus":0.1018654061451459,"score_gpt":0.40995978419979284,"score_spread":0.30809437805464696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310150506","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.0014125941,0.9926501,0.0021255247,0.0018474921,0.00023137938,0.00036208687,0.00033464129,0.0000109690745,0.0010252169],"genre_scores_gemma":[0.027516674,0.9606247,0.008612729,0.0019412923,0.00014300765,0.0007059756,0.00020443312,0.000013857888,0.00023734385],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9865708,0.0069401567,0.0035166391,0.00074524176,0.001986471,0.00024069389],"domain_scores_gemma":[0.9204318,0.06616554,0.005976667,0.0010649802,0.005826318,0.0005346864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028598346,0.0013070019,0.004098191,0.010568234,0.0008120768,0.004228215,0.002357338,0.0021030616,0.003884624],"category_scores_gemma":[0.09716595,0.00086601026,0.003967213,0.011094483,0.0015121656,0.0030241003,0.0018596798,0.0016772291,0.00030172066],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038151062,0.00007107407,0.0012022265,0.77698505,0.0048997286,0.00014429422,0.0009741639,0.0008283643,0.0005228256,0.0050605587,0.004063672,0.20486656],"study_design_scores_gemma":[0.00027232902,0.0005550967,0.0029732427,0.8844764,0.021773428,0.0004418431,0.0017706379,0.00063080684,0.0007831464,0.005958691,0.08028466,0.000079692225],"about_ca_topic_score_codex":0.0077283964,"about_ca_topic_score_gemma":0.02380625,"teacher_disagreement_score":0.028598346,"about_ca_system_score_codex":0.004649228,"about_ca_system_score_gemma":0.020025378,"threshold_uncertainty_score":0.15124434},"labels":[],"label_agreement":null},{"id":"W4311129318","doi":"10.1080/0305215x.2022.2147518","title":"Improved multi-objective structural optimization with adaptive repair-based constraint handling","year":2022,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":19,"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","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Mathematical optimization; Metaheuristic; Benchmark (surveying); Multi-objective optimization; Truss; Optimization problem; Population; Convergence (economics); Constraint (computer-aided design); Evolutionary algorithm; Pareto principle; Heuristics; Computer science; Engineering optimization; Mathematics; Engineering","score_opus":0.008933355860759627,"score_gpt":0.21428033340807276,"score_spread":0.20534697754731313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311129318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015593949,0.00024029668,0.9813292,0.00005734718,0.00002536917,0.00003649313,0.000031496806,0.00024874037,0.0024370577],"genre_scores_gemma":[0.44515693,0.00030868768,0.55052114,0.000114598784,0.000045254747,0.00028401625,0.00023764257,0.00014421705,0.0031875407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958545,0.00012352757,0.000021151805,0.00006669846,0.00016345341,0.000039642775],"domain_scores_gemma":[0.9994586,0.00025714238,0.00008789105,0.000072917624,0.0001004293,0.00002293232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078685983,0.00091443985,0.00086232094,0.0008544636,0.00029905443,0.000583912,0.0013324484,0.0010317084,0.0017796009],"category_scores_gemma":[0.0016543051,0.00037880955,0.0010440194,0.0011374257,0.0004293523,0.00068350957,0.0011075294,0.0009438742,0.00034014467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016196658,0.000024516354,0.00019634295,0.000035572328,0.000024873141,0.000021067808,0.000019944946,0.9671067,0.0023041859,0.0017934471,0.00028546056,0.02817158],"study_design_scores_gemma":[0.0000063636494,0.0000213943,0.00006231077,0.0000032946116,0.0000047427025,0.000010890415,0.000003052177,0.9986526,0.00044214987,0.00047625822,0.00031424276,0.0000026829744],"about_ca_topic_score_codex":0.0028690188,"about_ca_topic_score_gemma":0.0024444433,"teacher_disagreement_score":0.0028690188,"about_ca_system_score_codex":0.00044622328,"about_ca_system_score_gemma":0.0007358964,"threshold_uncertainty_score":0.005953312},"labels":[],"label_agreement":null},{"id":"W4312198775","doi":"10.1109/ieem55944.2022.9989719","title":"A Systematic Assessment of Genetic Algorithm (GA) in Optimizing Machine Learning Model: A Case Study from Building Science","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Hyperparameter; Bayesian optimization; Hyperparameter optimization; Genetic algorithm; Computer science; Algorithm; Metaheuristic; Machine learning; Artificial intelligence; Range (aeronautics); Materials science; Support vector machine","score_opus":0.038690728808870874,"score_gpt":0.29058298424018253,"score_spread":0.25189225543131166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312198775","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.6209916,0.01739832,0.33955505,0.0014889275,0.00013954692,0.0006349024,0.0003269084,0.0005777531,0.018886903],"genre_scores_gemma":[0.74777246,0.00469855,0.24569997,0.0002147281,0.000029627461,0.0002164465,0.00027162975,0.00010734762,0.0009893137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974826,0.0016183213,0.00010380904,0.00020301112,0.00048699556,0.000105181956],"domain_scores_gemma":[0.9922747,0.0059766755,0.00029832363,0.00051177747,0.0008572908,0.00008126918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004231718,0.0007941444,0.00075402146,0.001247331,0.00047461104,0.0012249973,0.00093405833,0.0016052328,0.00047010597],"category_scores_gemma":[0.010002355,0.00031027012,0.0009085135,0.0016168415,0.00056985684,0.00075869536,0.0005463996,0.0010174434,0.00013402646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027223217,0.00061655225,0.011079862,0.0013464261,0.00038134676,0.000297541,0.0002869554,0.7797405,0.005896464,0.014188891,0.0020456503,0.18384755],"study_design_scores_gemma":[0.00010437497,0.0015967824,0.0053503443,0.00045441117,0.00029489247,0.0002984497,0.0004867339,0.9617364,0.012409667,0.0064686714,0.010741208,0.000058076577],"about_ca_topic_score_codex":0.0039986125,"about_ca_topic_score_gemma":0.0052252756,"teacher_disagreement_score":0.004231718,"about_ca_system_score_codex":0.0008508453,"about_ca_system_score_gemma":0.0011589741,"threshold_uncertainty_score":0.022379756},"labels":[],"label_agreement":null},{"id":"W4312328538","doi":"10.1109/iros47612.2022.9982270","title":"Adaptive Sampling of Latent Phenomena using Heterogeneous Robot Teams (ASLaP-HR)","year":2022,"lang":"en","type":"article","venue":"2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"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":"Army Research Office; Office of Naval Research; Association of Research Libraries","keywords":"Observable; Sampling (signal processing); Computer science; Robot; Field (mathematics); Spatial analysis; Artificial intelligence; Data mining; Measure (data warehouse); Machine learning; Computer vision; Mathematics; Statistics; Physics","score_opus":0.10178456093365242,"score_gpt":0.3176104215629301,"score_spread":0.21582586062927772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312328538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017441276,0.00010624105,0.98102814,0.0001501788,0.00003280671,0.00007985336,0.000044478926,0.00027032418,0.0008467065],"genre_scores_gemma":[0.71607065,0.00012452112,0.27968282,0.0002861628,0.000103840255,0.00049814145,0.0003228497,0.00012261631,0.002788452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982393,0.00067072915,0.000062921295,0.00048697402,0.00032658692,0.0002134945],"domain_scores_gemma":[0.9956527,0.0025232444,0.00063472695,0.00046244703,0.0003720948,0.00035478556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030810079,0.0013955714,0.001976803,0.00056210253,0.00085230265,0.00097401364,0.0033700878,0.0014720598,0.0027301642],"category_scores_gemma":[0.007045081,0.0010146907,0.0012191549,0.0006399595,0.0015957413,0.0019245333,0.003423535,0.0021838394,0.00045309088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016453132,0.000092356226,0.0012663758,0.00007406092,0.00007280834,0.000121441306,0.00013622109,0.9600673,0.0011139304,0.00997532,0.0009143563,0.026001345],"study_design_scores_gemma":[0.000019243531,0.000039162573,0.00007432289,0.0000034237532,0.0000051372563,0.000010967614,0.0000120625355,0.9956664,0.0001712116,0.0038213113,0.00017234095,0.0000044120416],"about_ca_topic_score_codex":0.0070152595,"about_ca_topic_score_gemma":0.0062895115,"teacher_disagreement_score":0.0070152595,"about_ca_system_score_codex":0.0012030911,"about_ca_system_score_gemma":0.0018056079,"threshold_uncertainty_score":0.016294122},"labels":[],"label_agreement":null},{"id":"W4312424858","doi":"10.1109/iscas48785.2022.9937568","title":"Variation-Aware Analog Circuit Sizing in Carbon Nanotube","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Carbon nanotube field-effect transistor; Sizing; Computer science; Process variation; Electronic circuit; Electronic engineering; Transistor; Spice; Analogue electronics; Carbon nanotube; Circuit design; Integrated circuit design; Process (computing); Field-effect transistor; Materials science; Electrical engineering; Nanotechnology; Engineering; Embedded system; Voltage","score_opus":0.021991945027683504,"score_gpt":0.2541065315056993,"score_spread":0.23211458647801578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312424858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13648793,0.00030226383,0.85707414,0.000111428235,0.000017176171,0.00005123233,0.000035737834,0.00027287024,0.005647221],"genre_scores_gemma":[0.89060247,0.00010327247,0.108066134,0.00003989867,0.000007875215,0.000039526643,0.000031946463,0.000059319773,0.0010495045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998171,0.000036930236,0.000005513428,0.000038944625,0.000080470956,0.000021176227],"domain_scores_gemma":[0.99975866,0.00010907599,0.000058468475,0.000025990004,0.000039069793,0.000008640211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030302917,0.00045610563,0.00023440745,0.0003026397,0.00019945452,0.00041307465,0.00038665917,0.000318325,0.00061467785],"category_scores_gemma":[0.000711822,0.00020681176,0.00033233073,0.0002464891,0.00034292627,0.0003903587,0.0003186025,0.0002656299,0.00007888736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016950768,0.000012385479,0.00028992596,0.00003365226,0.000010290302,0.000030298866,0.000019688378,0.94940096,0.026778959,0.0030883425,0.00012891757,0.02018959],"study_design_scores_gemma":[0.0000031262716,0.000038570208,0.00017757362,0.0000026500209,0.0000060229613,0.000015885984,0.0000054421535,0.99054295,0.0072770016,0.0014780716,0.00044953535,0.000003172588],"about_ca_topic_score_codex":0.001254306,"about_ca_topic_score_gemma":0.0021719146,"teacher_disagreement_score":0.001254306,"about_ca_system_score_codex":0.00071022316,"about_ca_system_score_gemma":0.00060651486,"threshold_uncertainty_score":0.0051530004},"labels":[],"label_agreement":null},{"id":"W4312930523","doi":"10.1115/detc2022-87995","title":"Reinforcement Learning Based Sequential Batch-Sampling for Bayesian Optimal Experimental Design","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Reinforcement learning; Leverage (statistics); Bayesian optimization; Artificial intelligence; Suite; Bayesian probability; Machine learning; Time budget; Task (project management)","score_opus":0.048870433704315944,"score_gpt":0.31115947917202547,"score_spread":0.26228904546770954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312930523","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.011984576,0.00043725685,0.9849561,0.00031179975,0.00006943956,0.0004907582,0.00009495418,0.00060499436,0.0010500365],"genre_scores_gemma":[0.6060628,0.00033524394,0.38742915,0.0005513085,0.00012451762,0.0022360333,0.00040796542,0.00016611005,0.0026870195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934094,0.0041517536,0.00027686247,0.0010977602,0.0006744285,0.00038987218],"domain_scores_gemma":[0.9501204,0.04255804,0.0026462232,0.0015218372,0.0019744153,0.0011791904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015934639,0.0021724892,0.0040835375,0.0013639521,0.0005790703,0.0013754495,0.0034347645,0.002446903,0.005156002],"category_scores_gemma":[0.0362187,0.0018771645,0.0014079034,0.0009215438,0.0030129377,0.001644841,0.0023515064,0.0035824433,0.00059736805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006925956,0.00020660007,0.001134489,0.00033776424,0.0001303592,0.00009642052,0.000090209214,0.9287629,0.00092650374,0.027433,0.0007976769,0.039391518],"study_design_scores_gemma":[0.000085573825,0.00007582867,0.000089699846,0.000016298489,0.000014437498,0.0000072614653,0.000003859213,0.98786604,0.00030788203,0.011310083,0.00021477893,0.000008228334],"about_ca_topic_score_codex":0.0059580123,"about_ca_topic_score_gemma":0.005746954,"teacher_disagreement_score":0.015934639,"about_ca_system_score_codex":0.0030789976,"about_ca_system_score_gemma":0.0045922287,"threshold_uncertainty_score":0.08427137},"labels":[],"label_agreement":null},{"id":"W4312940312","doi":"10.23952/jnva.6.2022.6.07","title":"A nonmonotone gradient method for constrained multiobjective optimization problems","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Multi-objective optimization; Computer science; Gradient method; Proximal Gradient Methods; Constrained optimization; Mathematics; Gradient descent; Artificial intelligence; Artificial neural network","score_opus":0.013278285704088925,"score_gpt":0.2868655736015706,"score_spread":0.2735872878974817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312940312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036314318,0.0002439322,0.9943651,0.00007556092,0.00004102714,0.00004369045,0.000010332449,0.000033779976,0.0015551199],"genre_scores_gemma":[0.2473377,0.0007955277,0.7405168,0.0002680235,0.000111298796,0.00038231534,0.00006924567,0.00012549225,0.010393738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996668,0.00014741927,0.000012364777,0.000044872137,0.000109902314,0.000018595623],"domain_scores_gemma":[0.9998173,0.00008556751,0.000020346619,0.000011870693,0.000046742472,0.000018183659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010551488,0.0008909425,0.00081811246,0.00047223797,0.0003188459,0.0005040202,0.00071157404,0.0008921756,0.0018667236],"category_scores_gemma":[0.00100251,0.0003417409,0.0005081512,0.00037694216,0.00068348186,0.00085665006,0.00080610625,0.0008950065,0.00044527507],"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.00012397453,0.00013039439,0.00043721346,0.00049295725,0.000099853256,0.00028659488,0.00011780859,0.71370494,0.026171397,0.15929215,0.001783915,0.09735878],"study_design_scores_gemma":[0.000012797568,0.000081573795,0.00006915853,0.000013011429,0.000004790451,0.00003779094,0.0000043696155,0.98818386,0.0009212923,0.008358747,0.0023033614,0.000009257783],"about_ca_topic_score_codex":0.0009003322,"about_ca_topic_score_gemma":0.0013297335,"teacher_disagreement_score":0.0018667236,"about_ca_system_score_codex":0.00037632816,"about_ca_system_score_gemma":0.00085915637,"threshold_uncertainty_score":0.0062448382},"labels":[],"label_agreement":null},{"id":"W4313256689","doi":"10.1007/s00158-022-03435-2","title":"Variable functioning and its application to large scale steel frame design optimization","year":2022,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Technology Sydney; National Science Foundation","keywords":"Mathematical optimization; Particle swarm optimization; Heuristics; Multi-swarm optimization; Variable (mathematics); Engineering design process; Engineering optimization; Frame (networking); Process (computing); Metaheuristic; Computer science; Differential evolution; Optimization problem; Continuous optimization; Convergence (economics); Mathematics; Engineering","score_opus":0.01009886240194589,"score_gpt":0.2498449909690287,"score_spread":0.23974612856708283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313256689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07354102,0.00019797232,0.92383647,0.00008323559,0.000023160377,0.000044334185,0.00001097639,0.00015564566,0.0021072174],"genre_scores_gemma":[0.81686366,0.00011884002,0.18236332,0.00002640558,0.0000101986725,0.00007554565,0.000021681046,0.000025680056,0.0004946768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995616,0.00027541746,0.000012816171,0.000034625748,0.00008980225,0.000025611462],"domain_scores_gemma":[0.9991949,0.0005977525,0.000057751957,0.000038362105,0.00009278908,0.000018361316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019586782,0.0005610452,0.0004984668,0.0007045547,0.00032298136,0.00049895444,0.0006019401,0.00061223505,0.0007835011],"category_scores_gemma":[0.0021564222,0.00018779974,0.0003588076,0.00054555293,0.0006814195,0.00043425988,0.00048386244,0.0004883985,0.0000648403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030659507,0.000029543138,0.000684974,0.00004369383,0.000014590991,0.000043740154,0.000032915632,0.9619042,0.003110384,0.0069292667,0.00013547904,0.027040502],"study_design_scores_gemma":[0.0000046313085,0.000044231743,0.0001398851,0.0000037611503,0.0000031766563,0.0000096068525,0.000006773603,0.99760723,0.00091900537,0.0009539417,0.00030542264,0.0000022923844],"about_ca_topic_score_codex":0.001552158,"about_ca_topic_score_gemma":0.00084499543,"teacher_disagreement_score":0.0019586782,"about_ca_system_score_codex":0.0005158222,"about_ca_system_score_gemma":0.0005481813,"threshold_uncertainty_score":0.010358632},"labels":[],"label_agreement":null},{"id":"W4313299845","doi":"10.1287/moor.2022.1344","title":"Error Analysis of Surrogate Models Constructed Through Operations on Submodels","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Black box; Chen; Mathematics; Function (biology); Mathematical optimization; Surrogate model; Computer science; Algorithm; Artificial intelligence","score_opus":0.1705759330340063,"score_gpt":0.416556545346156,"score_spread":0.24598061231214968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313299845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029982677,0.0001855386,0.96770144,0.00018706676,0.000027922577,0.000039851493,0.00008503331,0.00012488518,0.0016656439],"genre_scores_gemma":[0.84182185,0.0003288653,0.1550245,0.000081318714,0.000027759326,0.0002564437,0.00048716788,0.00015740174,0.0018146399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996092,0.0021820376,0.00019319709,0.00041048272,0.00087291235,0.00024937408],"domain_scores_gemma":[0.97931355,0.015417189,0.0016346362,0.001573406,0.0017362983,0.00032489237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01275329,0.0016156128,0.0017546444,0.0019153948,0.0006557501,0.0021957324,0.0014156023,0.0015893483,0.0016134275],"category_scores_gemma":[0.028638832,0.0007795168,0.0019103731,0.0010058375,0.0020800834,0.0022240004,0.0028384917,0.0022663095,0.0001898307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004507721,0.000012924742,0.00046227564,0.000029573126,0.000024680328,0.000014807413,0.000024451138,0.97950464,0.00024187082,0.015791358,0.0000876237,0.0037606389],"study_design_scores_gemma":[0.000002527012,0.000015601368,0.000052079606,0.000009023311,0.0000031217348,0.000002856105,0.0000046264554,0.9937943,0.00018992678,0.0058272574,0.000095852105,0.0000027397095],"about_ca_topic_score_codex":0.0062047928,"about_ca_topic_score_gemma":0.0029467705,"teacher_disagreement_score":0.01275329,"about_ca_system_score_codex":0.001934077,"about_ca_system_score_gemma":0.0022252526,"threshold_uncertainty_score":0.06744665},"labels":[],"label_agreement":null},{"id":"W4317633855","doi":"10.2514/6.2023-2097","title":"Thermal Packaging Optimization of a UAM Nacelle Using a Dynamic Acceleration Methodology","year":2023,"lang":"en","type":"article","venue":"AIAA SCITECH 2023 Forum","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"","keywords":"Nacelle; Acceleration; Component (thermodynamics); Computer science; Finite element method; Multidisciplinary design optimization; Software; Mechanical engineering; Engineering; Structural engineering; Physics; Thermodynamics","score_opus":0.056703414930786976,"score_gpt":0.33732921558385237,"score_spread":0.2806258006530654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317633855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22857471,0.00035443797,0.73399186,0.00019583307,0.000068395195,0.00012957027,0.00015682759,0.0006565272,0.035871897],"genre_scores_gemma":[0.73044086,0.00013747558,0.26282442,0.000033553406,0.000010773291,0.0001588026,0.00013653433,0.00013970338,0.006117938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989283,0.000025846488,0.0000037201391,0.000022007918,0.000041420866,0.000014073655],"domain_scores_gemma":[0.9998698,0.000044470915,0.00001927412,0.000015107496,0.00004463505,0.0000067499473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035406975,0.0004965478,0.00029436016,0.00038409868,0.00033911926,0.00060696364,0.00046901248,0.0005435717,0.0020622713],"category_scores_gemma":[0.0006473727,0.00034323294,0.00040010252,0.00025332754,0.00029463475,0.00035154884,0.00037070946,0.0003762146,0.00045088664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024766596,0.000028916753,0.00039193867,0.000059720263,0.000010661798,0.000047185837,0.00003983421,0.9572286,0.016010385,0.0041420194,0.00043319078,0.021582793],"study_design_scores_gemma":[0.000003623371,0.00008113582,0.00021180153,0.0000063105986,0.0000043558475,0.00002223855,0.000015223278,0.9938345,0.0039723944,0.000496075,0.0013469642,0.0000053874915],"about_ca_topic_score_codex":0.0011981073,"about_ca_topic_score_gemma":0.0020038548,"teacher_disagreement_score":0.0020622713,"about_ca_system_score_codex":0.00055514724,"about_ca_system_score_gemma":0.0006409877,"threshold_uncertainty_score":0.0068989396},"labels":[],"label_agreement":null},{"id":"W4319597796","doi":"10.3390/a16020092","title":"A Hybrid Direct Search and Model-Based Derivative-Free Optimization Method with Dynamic Decision Processing and Application in Solid-Tank Design","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Kelowna General Hospital; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Robustness (evolution); Mathematical optimization; Derivative (finance); Mathematics","score_opus":0.01851464791214632,"score_gpt":0.3200928443406451,"score_spread":0.3015781964284988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319597796","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.0050106323,0.00013880293,0.99237365,0.000094231786,0.000020864296,0.00003234686,0.000019345702,0.00015930006,0.0021507682],"genre_scores_gemma":[0.3180457,0.00019475089,0.6763711,0.00016603511,0.000033390636,0.00026791712,0.00009901861,0.00011604037,0.0047060465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00008768869,0.00001326024,0.000048405975,0.00012959041,0.000023245806],"domain_scores_gemma":[0.9995896,0.00023818496,0.000041368246,0.000026554671,0.000080389844,0.000023904275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086780026,0.00063630246,0.0007818662,0.0005084126,0.00032087349,0.0006927608,0.0008551922,0.0010141892,0.0023214875],"category_scores_gemma":[0.0014313366,0.00045817596,0.00051303994,0.00054676377,0.0005020239,0.0006579599,0.000782653,0.0007408282,0.00036352215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047512367,0.00004417929,0.00021884407,0.00007831724,0.000022106367,0.00003721504,0.000028589411,0.93707925,0.0025864318,0.006797021,0.00076809595,0.052292462],"study_design_scores_gemma":[0.00000787436,0.000014049176,0.000017041692,0.0000025549998,0.0000017670677,0.0000048150564,0.0000014220051,0.9986469,0.0002277795,0.00064491836,0.00042804948,0.0000027534127],"about_ca_topic_score_codex":0.0040908256,"about_ca_topic_score_gemma":0.004201751,"teacher_disagreement_score":0.0040908256,"about_ca_system_score_codex":0.0005160226,"about_ca_system_score_gemma":0.0012892865,"threshold_uncertainty_score":0.008134007},"labels":[],"label_agreement":null},{"id":"W4320916811","doi":"10.1201/9781003399759-88","title":"Comparison of metaheuristic algorithms and constraint handling approaches for multi-objective optimization of a tanker","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; University of British Columbia","keywords":"Metaheuristic; Computer science; Mathematical optimization; Constraint (computer-aided design); Parallel metaheuristic; Algorithm; Engineering; Mathematics; Meta-optimization; Mechanical engineering","score_opus":0.13241466009339742,"score_gpt":0.33189028492600703,"score_spread":0.1994756248326096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320916811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076940544,0.014114829,0.8619074,0.00040189986,0.00024006411,0.00016961143,0.0002526786,0.0008480507,0.04512496],"genre_scores_gemma":[0.31312934,0.008732311,0.6640783,0.00017518518,0.00010515978,0.00033607127,0.000585524,0.00038111408,0.01247697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968064,0.00011877206,0.00001602524,0.00003261488,0.0001340535,0.000017953564],"domain_scores_gemma":[0.999491,0.00034198983,0.00003180429,0.000035233967,0.000088877896,0.000011047449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073056394,0.001045893,0.0006748945,0.0008356773,0.00025503876,0.0009133349,0.00087843195,0.0010067348,0.0024513376],"category_scores_gemma":[0.001188562,0.00026977685,0.0009239682,0.0016405641,0.00022338187,0.00060127635,0.0003457282,0.0007669382,0.00052251783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007718505,0.000094561154,0.000463199,0.00031322206,0.00011183864,0.00004362723,0.000041243475,0.8078286,0.0022038515,0.0052272505,0.0015161157,0.18207932],"study_design_scores_gemma":[0.000010682345,0.000083817635,0.00038549362,0.00004146406,0.000022423585,0.00004058645,0.000021693222,0.9931907,0.001566267,0.0013644231,0.0032643464,0.000007973567],"about_ca_topic_score_codex":0.0017438981,"about_ca_topic_score_gemma":0.001990997,"teacher_disagreement_score":0.0024513376,"about_ca_system_score_codex":0.00047518505,"about_ca_system_score_gemma":0.00048254145,"threshold_uncertainty_score":0.008200526},"labels":[],"label_agreement":null},{"id":"W4321214511","doi":"10.1016/j.swevo.2023.101262","title":"Cooperative coevolutionary multi-guide particle swarm optimization algorithm for large-scale multi-objective optimization problems","year":2023,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":73,"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":"Computer science; Metaheuristic; Multi-swarm optimization; Particle swarm optimization; Benchmark (surveying); Mathematical optimization; Imperialist competitive algorithm; Optimization problem; Metric (unit); Scalability; Heuristic; Parallel metaheuristic; Continuous optimization; Scale (ratio); Algorithm; Artificial intelligence; Mathematics","score_opus":0.02114357018829575,"score_gpt":0.28732133859146136,"score_spread":0.2661777684031656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321214511","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.021155007,0.00035966837,0.97472656,0.000114091454,0.00006131268,0.00005320521,0.000011554333,0.00016169371,0.0033568926],"genre_scores_gemma":[0.6017949,0.00036944746,0.3906923,0.00018692375,0.0000633464,0.00040497893,0.00010157229,0.00008462162,0.0063019157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.00014946143,0.000024185241,0.00007025582,0.00019155443,0.000041689036],"domain_scores_gemma":[0.99925214,0.00034682223,0.00005931584,0.00007880451,0.00021880896,0.000044070755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958167,0.00079956837,0.0011225155,0.0006411319,0.00069304876,0.000835884,0.0019168714,0.0016255395,0.0012458183],"category_scores_gemma":[0.002524537,0.00048428928,0.00066910015,0.0010130391,0.00067988306,0.00086718984,0.0015576829,0.0010130034,0.0003205766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060767088,0.00008292588,0.0006297244,0.000052194064,0.000089410896,0.00008294074,0.00009825271,0.9335371,0.0020161832,0.007857403,0.0014872167,0.05400577],"study_design_scores_gemma":[0.000007752901,0.000016377413,0.000055616838,0.0000016818681,0.0000052729547,0.000008178542,0.0000036371646,0.99899656,0.00013086502,0.00053651945,0.00023540838,0.000002071347],"about_ca_topic_score_codex":0.005784427,"about_ca_topic_score_gemma":0.0058235917,"teacher_disagreement_score":0.005784427,"about_ca_system_score_codex":0.0005333938,"about_ca_system_score_gemma":0.0010481926,"threshold_uncertainty_score":0.011501491},"labels":[],"label_agreement":null},{"id":"W4321435904","doi":"10.1007/s00521-023-08332-3","title":"Multi-objective fitness-dependent optimizer algorithm","year":2023,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Fanshawe College","funders":"","keywords":"Computer science; Benchmark (surveying); Sorting; Evolutionary algorithm; Mathematical optimization; Test suite; Particle swarm optimization; Algorithm; Genetic algorithm; Fitness function; Variety (cybernetics); Domain (mathematical analysis); Computation; Test case; Machine learning; Artificial intelligence; Mathematics","score_opus":0.022267228978825993,"score_gpt":0.3027546914269665,"score_spread":0.2804874624481405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321435904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01194451,0.0003276246,0.98187447,0.0001463326,0.00008595758,0.00008370645,0.00006512926,0.00054018904,0.0049322164],"genre_scores_gemma":[0.28323555,0.00020536718,0.7061498,0.0002703071,0.00007729678,0.00042280948,0.00035114904,0.00023456263,0.009053136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993231,0.00022134969,0.00003656095,0.00013312347,0.00023041412,0.000055421504],"domain_scores_gemma":[0.99927956,0.0002700917,0.00007067345,0.00008889945,0.00025437723,0.000036554437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015982228,0.0010426318,0.0013531935,0.0008185262,0.00050428713,0.00082808547,0.0018021814,0.001753323,0.0049518426],"category_scores_gemma":[0.0025852015,0.0005074392,0.0008995154,0.00079267396,0.00042319336,0.0007082401,0.0011697882,0.0012232064,0.0012772055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016491376,0.00013355174,0.000819999,0.00012855089,0.00015260439,0.00009724903,0.00004353358,0.79614574,0.004651733,0.00915498,0.0038283458,0.18467876],"study_design_scores_gemma":[0.000017105287,0.000037251983,0.0001801736,0.000006607764,0.000012471033,0.000019485638,0.0000023740722,0.9979546,0.0006241515,0.0006154003,0.00052588683,0.0000044218355],"about_ca_topic_score_codex":0.0016206623,"about_ca_topic_score_gemma":0.0018315772,"teacher_disagreement_score":0.0049518426,"about_ca_system_score_codex":0.00057856494,"about_ca_system_score_gemma":0.001000136,"threshold_uncertainty_score":0.016565561},"labels":[],"label_agreement":null},{"id":"W4321599248","doi":"10.1007/s43069-022-00180-6","title":"A General Mathematical Framework for Constrained Mixed-variable Blackbox Optimization Problems with Meta and Categorical Variables","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Institut de Valorisation des Données; Hydro-Québec; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Computer science; Notation; Mathematical optimization; Optimization problem; Variable (mathematics); Continuous optimization; Context (archaeology); Flexibility (engineering); Artificial intelligence; Machine learning; Algorithm; Mathematics; Multi-swarm optimization","score_opus":0.07086614826535843,"score_gpt":0.35872397314201365,"score_spread":0.28785782487665523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321599248","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.0007638152,0.0002143268,0.99586487,0.00021912272,0.00006244973,0.000029247723,0.000051318482,0.0000437508,0.0027510792],"genre_scores_gemma":[0.12285795,0.0014314611,0.85770625,0.00073054165,0.00054872275,0.0008604408,0.0003155639,0.00024236692,0.015306751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977889,0.0010382567,0.0001117058,0.00038090695,0.0005266396,0.00015349049],"domain_scores_gemma":[0.99778396,0.0012356669,0.00025673627,0.00025359256,0.0003104332,0.00015966495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057305563,0.002120749,0.0021064247,0.0020770717,0.0011288051,0.0034074408,0.0042916215,0.0025789128,0.008406902],"category_scores_gemma":[0.008772265,0.0012226944,0.003068976,0.0030963626,0.00264659,0.0052953456,0.0051469724,0.0049681086,0.0015672484],"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.000013001362,0.000024248682,0.00008314895,0.00008519564,0.000026874757,0.00004565747,0.000041930667,0.043868903,0.00056319585,0.94584376,0.0016321802,0.0077718874],"study_design_scores_gemma":[0.00001739502,0.00003938784,0.00006985027,0.000047223904,0.000025172709,0.000058470887,0.000021605922,0.3724517,0.00027323116,0.62003195,0.006941783,0.000022261855],"about_ca_topic_score_codex":0.0012829859,"about_ca_topic_score_gemma":0.0017982596,"teacher_disagreement_score":0.008406902,"about_ca_system_score_codex":0.0016326219,"about_ca_system_score_gemma":0.0024707254,"threshold_uncertainty_score":0.030306458},"labels":[],"label_agreement":null},{"id":"W4353034571","doi":"10.1016/j.ijheatfluidflow.2023.109129","title":"Optimization of a double-intake squirrel cage fan using OpenFoam and metamodels","year":2023,"lang":"en","type":"article","venue":"International Journal of Heat and Fluid Flow","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Trimming; Latin hypercube sampling; Kriging; Impeller; Squirrel-cage rotor; Computer science; Rotor (electric); Optimal design; Computational fluid dynamics; Sampling (signal processing); Coupling (piping); Engineering design process; Automotive engineering; Mechanical engineering; Mathematics; Aerospace engineering; Engineering; Voltage; Electrical engineering","score_opus":0.032926945430452464,"score_gpt":0.3111025548807021,"score_spread":0.27817560945024966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353034571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34704447,0.00060647767,0.6221539,0.00032076545,0.00017957416,0.00016742526,0.00029559628,0.0006201755,0.028611604],"genre_scores_gemma":[0.9688854,0.00009339563,0.026768949,0.00002721568,0.000012450589,0.00010288521,0.00009069904,0.000046385365,0.003972501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986744,0.000042944328,0.000003778043,0.000027315462,0.000030084828,0.000028389395],"domain_scores_gemma":[0.99980956,0.00007768654,0.000023988192,0.000013274628,0.00004343618,0.00003216585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043400616,0.0007206598,0.0009921707,0.00040889924,0.0005754053,0.0007711433,0.00063697324,0.0015785444,0.0028821277],"category_scores_gemma":[0.00054188404,0.00036702966,0.00061941025,0.00023684991,0.00042954308,0.00042442573,0.0006594656,0.00043832313,0.0003110915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045042587,0.000026504058,0.00028449905,0.00002309341,0.0000086519385,0.000041068182,0.000008672591,0.99450594,0.0015004062,0.0007103516,0.00012376539,0.002721881],"study_design_scores_gemma":[0.000007983577,0.000026801876,0.00010142674,0.000002649431,0.000002775563,0.000004172873,0.0000049736227,0.9993612,0.00022301235,0.000100155536,0.00016265409,0.0000021347084],"about_ca_topic_score_codex":0.0068571474,"about_ca_topic_score_gemma":0.0055375067,"teacher_disagreement_score":0.0068571474,"about_ca_system_score_codex":0.0004887117,"about_ca_system_score_gemma":0.00085375924,"threshold_uncertainty_score":0.013634503},"labels":[],"label_agreement":null},{"id":"W4361285183","doi":"10.1002/qre.3331","title":"Is designed data collection still relevant in the big data era? – A discussion","year":2023,"lang":"en","type":"article","venue":"Quality and Reliability Engineering International","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Computer science; Robustness (evolution); Data collection; Variance (accounting); Data science; Big data; Research design; Management science; Statistics; Data mining; Mathematics; Engineering","score_opus":0.09944997944038245,"score_gpt":0.34847735036604677,"score_spread":0.24902737092566432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361285183","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028251574,0.014787057,0.0038118558,0.9688467,0.0110392785,0.000051352687,0.000039999806,0.000018984685,0.0011223243],"genre_scores_gemma":[0.025090372,0.04483657,0.012841875,0.8630019,0.05005548,0.0007811475,0.0001339747,0.000247279,0.003011372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.81207585,0.14453036,0.00663954,0.011496432,0.020670934,0.004586905],"domain_scores_gemma":[0.45018277,0.47763893,0.010051421,0.008977242,0.039078314,0.014071386],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.22761248,0.001688425,0.0032316134,0.0035272927,0.010369723,0.025324225,0.007652201,0.03102102,0.011973947],"category_scores_gemma":[0.30932638,0.0011588433,0.0029736625,0.0057149366,0.03273634,0.051649544,0.01024645,0.046790693,0.003354931],"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.00018512455,0.00014376955,0.0012473922,0.0035955298,0.00014865476,0.0008638876,0.023104042,0.0007113845,0.00055080553,0.4641503,0.43337193,0.07192718],"study_design_scores_gemma":[0.00006230784,0.000099898265,0.00064600527,0.0072727385,0.00003730128,0.00045075946,0.023689356,0.0008118763,0.00032027464,0.20829315,0.75815094,0.00016540468],"about_ca_topic_score_codex":0.0043524955,"about_ca_topic_score_gemma":0.0024659857,"teacher_disagreement_score":0.7723875,"about_ca_system_score_codex":0.019553065,"about_ca_system_score_gemma":0.028435007,"threshold_uncertainty_score":0.95249134},"labels":[],"label_agreement":null},{"id":"W4362504276","doi":"10.1007/978-3-030-54621-2_737-1","title":"Inverse Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.011426362640778473,"score_gpt":0.22846590064887615,"score_spread":0.21703953800809767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504276","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.0013689947,0.012218368,0.45504093,0.0008811574,0.0016332816,0.000058635884,0.00060240214,0.0014799723,0.52671623],"genre_scores_gemma":[0.053128418,0.017271731,0.27385542,0.0010277207,0.00096674875,0.0002554636,0.002227731,0.0016528146,0.6496139],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971575,0.0000328416,0.000009090086,0.000055534456,0.00017148953,0.000015328415],"domain_scores_gemma":[0.9998441,0.00004367936,0.000008903262,0.00003849848,0.00005356047,0.00001128003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023494467,0.0011817855,0.0011423222,0.000862392,0.0004687115,0.0019975605,0.0009897122,0.0012348684,0.06496328],"category_scores_gemma":[0.00075195456,0.0004900063,0.00077520515,0.000988782,0.0006693958,0.0013198471,0.0015192863,0.0018948971,0.034101132],"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.00006022045,0.0000757141,0.0002049958,0.00070808793,0.000064311804,0.000113738184,0.00008379787,0.031509526,0.009998824,0.27721137,0.17267792,0.50729144],"study_design_scores_gemma":[0.00001852184,0.00005206015,0.00045709,0.00024080816,0.00003137221,0.0005347334,0.000055730492,0.07826604,0.0069253617,0.17135434,0.74201715,0.00004682834],"about_ca_topic_score_codex":0.0006558176,"about_ca_topic_score_gemma":0.0011016525,"teacher_disagreement_score":0.06496328,"about_ca_system_score_codex":0.0004097018,"about_ca_system_score_gemma":0.0005634497,"threshold_uncertainty_score":0.21732384},"labels":[],"label_agreement":null},{"id":"W4362504304","doi":"10.1007/978-3-030-54621-2_736-1","title":"Data-Driven Inverse Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Inverse; Computer science; Mathematics; Geometry","score_opus":0.02618374193444844,"score_gpt":0.2597484799584814,"score_spread":0.23356473802403294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504304","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.0011143931,0.0025299718,0.9485799,0.00024850667,0.00037084744,0.000024026158,0.00026816272,0.00095424475,0.045909975],"genre_scores_gemma":[0.103355855,0.0067429445,0.73746276,0.0005181441,0.0005096926,0.0002672547,0.0022875047,0.0021063786,0.14674948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997732,0.000031805994,0.000008247183,0.000041506577,0.00013516044,0.000010145893],"domain_scores_gemma":[0.99975795,0.00010613348,0.000011337488,0.000048779628,0.000065528206,0.000010260302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028150942,0.0009189038,0.0009385295,0.0004207164,0.0002253218,0.0013747934,0.00089462125,0.0008209007,0.018222209],"category_scores_gemma":[0.00080947584,0.0004964224,0.00057696743,0.00072796753,0.0005005975,0.00085580436,0.0014143956,0.0014207236,0.008470865],"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.00009026362,0.00008390834,0.00021131702,0.00056971156,0.000077116936,0.00009090868,0.00006247318,0.294116,0.014462382,0.11198411,0.084464274,0.49378762],"study_design_scores_gemma":[0.000010859769,0.000030764546,0.00018661804,0.0000761939,0.00001406462,0.00014254362,0.000018049515,0.8283418,0.0063083353,0.06655482,0.09829119,0.000024809922],"about_ca_topic_score_codex":0.00072440936,"about_ca_topic_score_gemma":0.0012737275,"teacher_disagreement_score":0.018222209,"about_ca_system_score_codex":0.00030827193,"about_ca_system_score_gemma":0.00048353212,"threshold_uncertainty_score":0.0609594},"labels":[],"label_agreement":null},{"id":"W4362704594","doi":"10.4018/ijoris.321119","title":"A Computational Comparison of Three Nature-Inspired, Population-Based Metaheuristic Algorithms for Modelling-to-Generate Alternatives","year":2023,"lang":"en","type":"article","venue":"International Journal of Operations Research and Information Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Mathematical optimization; Construct (python library); Set (abstract data type); Population; Computer science; Metaheuristic; Algorithm; Mathematics","score_opus":0.1021787136612811,"score_gpt":0.42633645130629017,"score_spread":0.32415773764500905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362704594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26556987,0.0051117344,0.6640746,0.001502678,0.00044461756,0.0007028531,0.00056142034,0.0011589978,0.060873337],"genre_scores_gemma":[0.5296627,0.0014353351,0.46401256,0.00028880496,0.00006590154,0.0006752084,0.0005073132,0.00016755094,0.0031845656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857104,0.00067083375,0.000073123076,0.00013761655,0.00042983994,0.00011749668],"domain_scores_gemma":[0.99624074,0.0026788441,0.00020166494,0.00029381784,0.00041722474,0.00016777645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032784333,0.0012221466,0.0011401941,0.0027870862,0.0007349622,0.0019887423,0.0019415729,0.00213028,0.0024122682],"category_scores_gemma":[0.008063975,0.00034619437,0.0013226029,0.0023765324,0.00082151307,0.0013264643,0.0011313894,0.0015147171,0.00032581892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005521179,0.0004940528,0.0025830104,0.00034333623,0.00026131913,0.00007143332,0.00014287475,0.80085355,0.001081777,0.035548165,0.0021341175,0.15593432],"study_design_scores_gemma":[0.00008638488,0.00030246613,0.0007860934,0.00003581635,0.00006184835,0.000040057166,0.000044858265,0.98955524,0.00084744795,0.0066431123,0.0015756105,0.000021134689],"about_ca_topic_score_codex":0.0045509413,"about_ca_topic_score_gemma":0.00678325,"teacher_disagreement_score":0.0045509413,"about_ca_system_score_codex":0.0019879134,"about_ca_system_score_gemma":0.0020199749,"threshold_uncertainty_score":0.017338216},"labels":[],"label_agreement":null},{"id":"W4366085886","doi":"10.1016/j.apenergy.2023.121132","title":"Robust metamodel-based simulation-optimization approaches for designing hybrid renewable energy systems","year":2023,"lang":"en","type":"article","venue":"Applied Energy","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":14,"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":"Mathematical optimization; Metamodeling; Computer science; Renewable energy; Reliability (semiconductor); Mathematics; Power (physics); Engineering","score_opus":0.06428875591203222,"score_gpt":0.2419704108847037,"score_spread":0.17768165497267147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366085886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049716327,0.00011852704,0.9922792,0.000057190737,0.00001602794,0.00003013303,0.000030312825,0.00020551735,0.0022914496],"genre_scores_gemma":[0.755673,0.00038470517,0.24023148,0.000105441584,0.000039406204,0.00048878137,0.00018724534,0.00021057118,0.0026794404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964345,0.000183449,0.000017813998,0.00003754795,0.000093824274,0.000024016572],"domain_scores_gemma":[0.99933475,0.00040177355,0.00009720324,0.000056119046,0.00009143774,0.000018636929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010778368,0.0010893424,0.0011619522,0.00074219407,0.00037499683,0.00092505437,0.00095673586,0.0010012672,0.002282485],"category_scores_gemma":[0.0021536928,0.00071183214,0.0010144119,0.0005669227,0.00055058143,0.000718039,0.0009575192,0.0008216497,0.00038525826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009148318,0.000007712947,0.000041491556,0.000015188801,0.000012926602,0.0000064413057,0.000005415228,0.994789,0.00040414787,0.0022347406,0.000036031266,0.0024377024],"study_design_scores_gemma":[0.0000024729002,0.0000058920746,0.000012854891,0.0000029265016,0.000002388115,0.000001531849,0.0000015237596,0.9986879,0.00012291544,0.0010419226,0.00011636336,0.0000013887319],"about_ca_topic_score_codex":0.0029178967,"about_ca_topic_score_gemma":0.0033915897,"teacher_disagreement_score":0.0029178967,"about_ca_system_score_codex":0.0006535648,"about_ca_system_score_gemma":0.00079120684,"threshold_uncertainty_score":0.007635653},"labels":[],"label_agreement":null},{"id":"W4376277151","doi":"10.1287/ijoc.2022.0090","title":"Learning for Spatial Branching: An Algorithm Selection Approach","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Branching (polymer chemistry); Algorithm; Christian ministry; Artificial intelligence; Machine learning; Context (archaeology)","score_opus":0.021761022975442072,"score_gpt":0.2951156799378986,"score_spread":0.27335465696245653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376277151","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.007425815,0.00034121145,0.98783815,0.00041233914,0.00004459019,0.00012476192,0.00003896264,0.00084233534,0.002931788],"genre_scores_gemma":[0.24757548,0.0004766758,0.74511874,0.0006309056,0.00026329962,0.00057943515,0.00040451845,0.00048556752,0.0044654193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611604,0.0018100862,0.00019131946,0.00064137945,0.00090061757,0.00034060306],"domain_scores_gemma":[0.9884968,0.008035735,0.00068572746,0.0010358016,0.0012988048,0.00044720696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005609752,0.0015104961,0.0019479564,0.0022910459,0.00087325444,0.0018980895,0.003571936,0.0019989412,0.007820109],"category_scores_gemma":[0.016088754,0.0007792959,0.0017651897,0.0021444336,0.001497943,0.0032034758,0.0029714748,0.0033431323,0.0022165056],"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.0003942661,0.00043846885,0.003716667,0.0002916078,0.00015404451,0.00023628051,0.00026044107,0.33709985,0.0030225758,0.081266694,0.009467347,0.5636518],"study_design_scores_gemma":[0.000054098342,0.00009162191,0.00009977783,0.000023945833,0.000024533267,0.000049654172,0.000022596643,0.9669261,0.000716853,0.030552821,0.0014304494,0.0000075493836],"about_ca_topic_score_codex":0.0012950012,"about_ca_topic_score_gemma":0.0018568848,"teacher_disagreement_score":0.007820109,"about_ca_system_score_codex":0.0013975059,"about_ca_system_score_gemma":0.0028689299,"threshold_uncertainty_score":0.029667556},"labels":[],"label_agreement":null},{"id":"W4376618927","doi":"10.1007/s12652-023-04630-9","title":"Deep reinforcement learning-based framework for constrained any-objective optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Reinforcement learning; Mathematical optimization; Optimization problem; Computer science; Test functions for optimization; Multi-objective optimization; Continuous optimization; Vector optimization; Constrained optimization; Bilevel optimization; Random optimization; Metaheuristic; Multi-swarm optimization; Artificial intelligence; Mathematics","score_opus":0.030893696484508786,"score_gpt":0.30807106873541024,"score_spread":0.27717737225090144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376618927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004463328,0.00023947042,0.9928611,0.0001349885,0.00005062629,0.000024568797,0.000034157823,0.00019589663,0.001995825],"genre_scores_gemma":[0.6256607,0.00044103796,0.3613586,0.00039775117,0.00014854246,0.00037510577,0.0003036494,0.0002747716,0.01103978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995466,0.00014761789,0.000020835701,0.000083581595,0.00012643708,0.000074914984],"domain_scores_gemma":[0.99910873,0.0004839688,0.000062705214,0.000064400825,0.00020884363,0.00007143249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013600516,0.0010374092,0.0018581739,0.000467328,0.00040767025,0.0010693275,0.0023441135,0.0016884924,0.0053860107],"category_scores_gemma":[0.0028648258,0.0006366276,0.0006606269,0.0005815216,0.0009981229,0.0010805349,0.0020728665,0.00269385,0.00068343955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046236644,0.000056732068,0.00021196384,0.000058348236,0.000032728272,0.00004275008,0.000024453318,0.9481266,0.0005807333,0.020465806,0.0015169545,0.02883665],"study_design_scores_gemma":[0.0000028568656,0.000005686993,0.000008465549,0.00000193488,0.0000012993687,0.0000017834436,8.6776805e-7,0.9977984,0.00003633043,0.0020361634,0.000105033396,0.00000116567],"about_ca_topic_score_codex":0.008555111,"about_ca_topic_score_gemma":0.009959154,"teacher_disagreement_score":0.008555111,"about_ca_system_score_codex":0.00103957,"about_ca_system_score_gemma":0.0020656195,"threshold_uncertainty_score":0.018018067},"labels":[],"label_agreement":null},{"id":"W4376640789","doi":"10.1115/1.4062548","title":"A Dimension Selection-Based Constrained Multi-Objective Optimization Algorithm Using a Combination of Artificial Intelligence Methods","year":2023,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Dimension (graph theory); Computer science; Artificial neural network; Selection (genetic algorithm); Engineering optimization; Optimization problem; Algorithm; Engineering design process; Mathematics; Artificial intelligence; Engineering","score_opus":0.08441302958133033,"score_gpt":0.36912135011791164,"score_spread":0.2847083205365813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376640789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065574558,0.0002587676,0.9916367,0.00007978561,0.000032370313,0.000040349638,0.000016325599,0.00020763016,0.0011705235],"genre_scores_gemma":[0.2675619,0.0003010296,0.72787756,0.00026800323,0.00009038458,0.0005944945,0.00017418228,0.00011659213,0.0030159426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935764,0.00025338042,0.000037019025,0.00010463492,0.00019952573,0.000047759702],"domain_scores_gemma":[0.9993538,0.00036073496,0.00007554099,0.000034542536,0.00014588081,0.000029482015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014109771,0.0011338438,0.0014613305,0.00089129485,0.00040197044,0.0006612114,0.0009771455,0.0012650887,0.0016602925],"category_scores_gemma":[0.0016731229,0.00060532463,0.0009149789,0.0009536566,0.0005200814,0.00065964705,0.0010573298,0.0010384435,0.0003621094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005931558,0.00006724401,0.00056711165,0.00009420746,0.00009491855,0.000056129684,0.000037734357,0.8924746,0.0033709703,0.0047621042,0.0016404147,0.09677529],"study_design_scores_gemma":[0.000006718162,0.000016564098,0.000044853554,0.0000033847084,0.0000039086144,0.0000060129796,0.0000014522617,0.99908507,0.00018425593,0.0004491393,0.00019620563,0.0000024659032],"about_ca_topic_score_codex":0.0023230186,"about_ca_topic_score_gemma":0.0021119497,"teacher_disagreement_score":0.0023230186,"about_ca_system_score_codex":0.0003951184,"about_ca_system_score_gemma":0.0009471686,"threshold_uncertainty_score":0.0074620247},"labels":[],"label_agreement":null},{"id":"W4377090272","doi":"10.1016/j.swevo.2023.101325","title":"Flow measurement data quality improvement-oriented optimal flow sensor configuration","year":2023,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Professional Engineers Ontario","funders":"National Natural Science Foundation of China","keywords":"Computer science; Observability; Initialization; Mathematical optimization; Redundancy (engineering); Evolutionary algorithm; Population; Artificial intelligence; Mathematics","score_opus":0.05776581992754409,"score_gpt":0.31222624011525335,"score_spread":0.25446042018770926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377090272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03850408,0.00013873982,0.9562325,0.00030515678,0.00005456715,0.0000906789,0.00006131207,0.0005759185,0.0040369593],"genre_scores_gemma":[0.87131655,0.00007811919,0.12683557,0.000094400726,0.000036872294,0.000083848754,0.00010920108,0.00005516253,0.0013902553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992986,0.00015417358,0.000039373943,0.00021215051,0.00019216037,0.00010348594],"domain_scores_gemma":[0.99916244,0.00014564897,0.00014891975,0.000109162,0.00037413454,0.00005977575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078620366,0.0009870708,0.00082301936,0.001060219,0.00055598293,0.0013113699,0.0009951887,0.0007566047,0.0018875197],"category_scores_gemma":[0.002876572,0.00038024053,0.0003575987,0.0007336148,0.00052579603,0.0015743243,0.0009726199,0.0006053688,0.00029418143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006325728,0.00031962318,0.0045477576,0.000180984,0.00007714358,0.00017252986,0.00014905153,0.67150515,0.06432539,0.010601443,0.0038164232,0.24367194],"study_design_scores_gemma":[0.000031098352,0.00011111839,0.0013975435,0.000011116189,0.000022430686,0.000053883647,0.00004003922,0.98203343,0.012756942,0.0027755764,0.00075282,0.000013936989],"about_ca_topic_score_codex":0.002834866,"about_ca_topic_score_gemma":0.0028712035,"teacher_disagreement_score":0.002834866,"about_ca_system_score_codex":0.0007584059,"about_ca_system_score_gemma":0.001414752,"threshold_uncertainty_score":0.006314397},"labels":[],"label_agreement":null},{"id":"W4377864823","doi":"10.48550/arxiv.2305.12871","title":"MMGP: a Mesh Morphing Gaussian Process-based machine learning method for regression of physical problems under non-parameterized geometrical variability","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Safran Electronics (Canada)","funders":"","keywords":"Morphing; Computer science; Polygon mesh; Kriging; Artificial neural network; Machine learning; Artificial intelligence; Gaussian process; Deep learning; Parameterized complexity; Graph; Curse of dimensionality; Algorithm; Gaussian; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.08206313325169935,"score_gpt":0.27648527676735,"score_spread":0.19442214351565068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377864823","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.042699557,0.002928261,0.40699503,0.0016966298,0.0014357492,0.0008757209,0.42014548,0.110370286,0.0128533235],"genre_scores_gemma":[0.056474365,0.00070232997,0.27378953,0.00055308425,0.00021166872,0.0017452467,0.6504012,0.006252204,0.009870321],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998809,0.0002844286,0.000083282896,0.00030927567,0.00042984355,0.00008428092],"domain_scores_gemma":[0.99796665,0.0009905567,0.000078768455,0.00049697957,0.0003903625,0.000076771255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588995,0.0030916766,0.0015027463,0.0017115549,0.00052538596,0.0013641377,0.00432878,0.0021409937,0.020884976],"category_scores_gemma":[0.0065486147,0.0007205822,0.0022151438,0.001862893,0.0005682381,0.0013162977,0.0017912271,0.0027143452,0.01614625],"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.00045223802,0.00038362114,0.0038601318,0.0017566354,0.0002548523,0.00021329944,0.00009930307,0.1273084,0.0034966848,0.004432472,0.67329997,0.18444245],"study_design_scores_gemma":[0.0004626199,0.00035030823,0.007218296,0.00023425183,0.00008000447,0.00028076084,0.00011257,0.742209,0.009021219,0.014599873,0.22531578,0.00011528975],"about_ca_topic_score_codex":0.007236175,"about_ca_topic_score_gemma":0.015313615,"teacher_disagreement_score":0.020884976,"about_ca_system_score_codex":0.0008174708,"about_ca_system_score_gemma":0.0012483669,"threshold_uncertainty_score":0.069867134},"labels":[],"label_agreement":null},{"id":"W4378446702","doi":"10.1016/j.advengsoft.2023.103571","title":"SMT 2.0: A Surrogate Modeling Toolbox with a focus on hierarchical and mixed variables Gaussian processes","year":2023,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Office National d'études et de Recherches Aérospatiales; HORIZON EUROPE Framework Programme; University of California, San Diego; Glenn Research Center; European Commission; Polytechnique Montréal; National Aeronautics and Space Administration","keywords":"Computer science; Kriging; Surrogate model; Toolbox; Python (programming language); MIT License; Data mining; Machine learning; Software; Artificial intelligence; Programming language","score_opus":0.0080770724748144,"score_gpt":0.23167608308100854,"score_spread":0.22359901060619414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378446702","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.0008246917,0.00008455851,0.9871743,0.00007897513,0.000040472452,0.000034152345,0.0005619706,0.008892409,0.002308499],"genre_scores_gemma":[0.038314234,0.0004521741,0.9437026,0.00025634415,0.00006577658,0.00054518116,0.0021275028,0.008735965,0.0058002197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.00026861273,0.00005058803,0.00006385474,0.00023233773,0.0000512113],"domain_scores_gemma":[0.9981675,0.0011207039,0.00013192091,0.0001676752,0.00033101055,0.00008112102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019720027,0.00136939,0.0009000114,0.0007161611,0.0003597039,0.00125539,0.001726492,0.0017329957,0.023829553],"category_scores_gemma":[0.0058355713,0.0007725368,0.0011756765,0.0007251965,0.00046191528,0.0009317265,0.0016392821,0.0029733414,0.008271938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332599,0.00023878054,0.0012834764,0.0010881287,0.00029279644,0.0005058104,0.00031321179,0.5904178,0.011730542,0.111173384,0.072524205,0.2100986],"study_design_scores_gemma":[0.00004898643,0.000033924658,0.00014233714,0.000051954128,0.000018605426,0.000104668456,0.000017313625,0.94804066,0.0036213144,0.018453488,0.029441692,0.00002508655],"about_ca_topic_score_codex":0.0016693526,"about_ca_topic_score_gemma":0.0027252366,"teacher_disagreement_score":0.023829553,"about_ca_system_score_codex":0.00026043213,"about_ca_system_score_gemma":0.0017403176,"threshold_uncertainty_score":0.079717755},"labels":[],"label_agreement":null},{"id":"W4378942269","doi":"10.48550/arxiv.2305.18352","title":"Multi-Objective Genetic Algorithm for Multi-View Feature Selection","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"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":"Canadian Institutes of Health Research; National Institutes of Health; Genentech; IXICO; H. Lundbeck A/S; Servier; Jane ja Aatos Erkon Säätiö; Eisai; Northern California Institute for Research and Education; Pfizer; Novartis Pharmaceuticals Corporation; Itä-Suomen Yliopisto; Biogen; Eli Lilly and Company; Bristol-Myers Squibb; BioClinica; U.S. Department of Defense; Alzheimer's Disease Neuroimaging Initiative; Meso Scale Diagnostics; Alzheimer's Association","keywords":"Interpretability; Computer science; Feature selection; Benchmark (surveying); Feature (linguistics); Artificial intelligence; Machine learning; Selection (genetic algorithm); Data mining; Generalization; Generalizability theory; Genetic algorithm; Mathematics","score_opus":0.09182659539403061,"score_gpt":0.2447307976027236,"score_spread":0.152904202208693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378942269","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.010732451,0.00025028677,0.9879574,0.00011242,0.00002707093,0.00005046194,0.000032489206,0.00020627689,0.000631023],"genre_scores_gemma":[0.29942974,0.00027957116,0.69767475,0.0002295395,0.000049051785,0.00048376838,0.00034491796,0.00009398594,0.0014147515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.00028612767,0.00003160288,0.00013658585,0.0001535585,0.000060931077],"domain_scores_gemma":[0.998879,0.00074399187,0.00007665187,0.00005149561,0.00021326654,0.000035551442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016740494,0.0014552744,0.0015315484,0.0014660088,0.00046692372,0.0007757243,0.0013249643,0.0015314952,0.0012063346],"category_scores_gemma":[0.0036178571,0.0005421457,0.0013247909,0.0014234945,0.0006598045,0.000749107,0.00085224584,0.0015704436,0.00027069458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043899494,0.00006255725,0.0009221332,0.000047419973,0.000098497585,0.00006818676,0.000053346634,0.9105796,0.001732723,0.005116576,0.0010862157,0.080188945],"study_design_scores_gemma":[0.000007856416,0.000014433703,0.000071365495,0.0000037139832,0.000006481578,0.0000086286345,0.000004500439,0.99790895,0.00022018039,0.0015657964,0.00018497565,0.0000031559211],"about_ca_topic_score_codex":0.0058577973,"about_ca_topic_score_gemma":0.004599342,"teacher_disagreement_score":0.0058577973,"about_ca_system_score_codex":0.00096140517,"about_ca_system_score_gemma":0.0015403177,"threshold_uncertainty_score":0.011647403},"labels":[],"label_agreement":null},{"id":"W4379260268","doi":"10.5267/j.dsl.2023.4.006","title":"MaOMFO: Many-objective moth flame optimizer using reference-point based non-dominated sorting mechanism for global optimization problems","year":2023,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Multi-objective optimization; Mathematical optimization; Sorting; Optimization problem; Benchmark (surveying); Multi-swarm optimization; Particle swarm optimization; Computer science; Evolutionary algorithm; Convergence (economics); Pareto principle; Set (abstract data type); Derivative-free optimization; Metaheuristic; Mathematics; Algorithm","score_opus":0.034199022540272364,"score_gpt":0.3175204760569047,"score_spread":0.28332145351663235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379260268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015061237,0.00042557632,0.9792692,0.00010693891,0.000067124114,0.00012411416,0.000041882395,0.0007337118,0.0041701254],"genre_scores_gemma":[0.22561845,0.00048494284,0.7686465,0.00017644513,0.00004475656,0.00054100034,0.00021010426,0.0002186135,0.004059159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.0000512248,0.000010679236,0.000024301065,0.00013386825,0.000022864273],"domain_scores_gemma":[0.9998018,0.00007731654,0.00003304787,0.000017052389,0.00005690524,0.000013949739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010164522,0.0010160587,0.0007392742,0.0008463117,0.0005442218,0.00057988305,0.001292647,0.0010224812,0.0019336306],"category_scores_gemma":[0.0010726706,0.00032171738,0.0009883374,0.0006323972,0.0004812172,0.0005237153,0.0007255808,0.00096086855,0.00033788872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018896956,0.000110270485,0.0010038286,0.00027763273,0.00011705412,0.00013633168,0.00012259623,0.7678839,0.019112276,0.022575807,0.0032648896,0.18520646],"study_design_scores_gemma":[0.000043792992,0.000107898704,0.00017906203,0.000015926766,0.0000125336755,0.000044653025,0.000008374643,0.9915868,0.0025854234,0.0022138203,0.003186678,0.000015016117],"about_ca_topic_score_codex":0.002238969,"about_ca_topic_score_gemma":0.002471392,"teacher_disagreement_score":0.002238969,"about_ca_system_score_codex":0.00047349356,"about_ca_system_score_gemma":0.0010045996,"threshold_uncertainty_score":0.0064686537},"labels":[],"label_agreement":null},{"id":"W4379386943","doi":"10.1017/jpr.2023.30","title":"Moderate deviations inequalities for Gaussian process regression","year":2023,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mathematics; Gaussian process; Point process; Applied mathematics; Regression; Regression analysis; Inverse Gaussian distribution; Statistics; Large deviations theory; Gaussian; Mathematical analysis; Distribution (mathematics)","score_opus":0.04313765905341929,"score_gpt":0.3233364822857144,"score_spread":0.28019882323229506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379386943","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.007229841,0.0010019526,0.983423,0.0012738872,0.00013004651,0.000032813612,0.00028281158,0.00011675528,0.0065089082],"genre_scores_gemma":[0.7559227,0.0037510563,0.22091624,0.0025735826,0.0013121015,0.00090501766,0.0010833518,0.00037921008,0.013156651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98828983,0.0051506623,0.00053814996,0.0015502162,0.0037012899,0.00076974905],"domain_scores_gemma":[0.8989452,0.08553738,0.005114208,0.0030809548,0.005463957,0.0018581641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01987376,0.0022778702,0.001983472,0.003366256,0.0012478752,0.003594967,0.0036329026,0.002821259,0.006751065],"category_scores_gemma":[0.07931893,0.0008748727,0.0034323218,0.0028338889,0.007378929,0.0060536163,0.00553013,0.009349263,0.0009577432],"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.000068856985,0.000025615222,0.0010109288,0.00014969945,0.00007742412,0.00016161073,0.00012582561,0.089317925,0.0009685042,0.8985392,0.0015320586,0.008022431],"study_design_scores_gemma":[0.000013802034,0.000048811464,0.00044760577,0.00008714431,0.000021325126,0.00008036629,0.000030281986,0.41239214,0.0005323773,0.58450896,0.0018023209,0.000034887707],"about_ca_topic_score_codex":0.0041940887,"about_ca_topic_score_gemma":0.0022974222,"teacher_disagreement_score":0.01987376,"about_ca_system_score_codex":0.004541022,"about_ca_system_score_gemma":0.0017478217,"threshold_uncertainty_score":0.10510373},"labels":[],"label_agreement":null},{"id":"W4379415007","doi":"10.1214/23-sts865a","title":"Comment: A Quarter Century of Methodological Research in Response-Adaptive Randomization","year":2023,"lang":"en","type":"article","venue":"Statistical Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Econometrics; Randomization; Statistics; Computer science; Mathematics; History; Medicine; Randomized controlled trial; Archaeology","score_opus":0.18301209058970766,"score_gpt":0.45778046848013415,"score_spread":0.2747683778904265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379415007","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008018479,0.0007974048,0.00047205464,0.98842746,0.009525945,0.000010613326,0.00006907398,0.00002288169,0.00059436203],"genre_scores_gemma":[0.0010296138,0.00026818615,0.0004131971,0.9853467,0.012450364,0.000039780018,0.000012441658,0.000018537716,0.0004211639],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9487093,0.021529097,0.006743012,0.00810813,0.012171628,0.002738812],"domain_scores_gemma":[0.5730514,0.35393715,0.013079943,0.01310007,0.041724518,0.005106929],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06410407,0.0013284569,0.0025268148,0.0017692063,0.005046537,0.006776436,0.007984825,0.06971556,0.018419014],"category_scores_gemma":[0.39118233,0.0012066925,0.0034375617,0.002905442,0.019637039,0.013630577,0.005535863,0.07741229,0.010660519],"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.00015682267,0.000023136154,0.00047739258,0.00041008776,0.00009076451,0.00018603697,0.00056867703,0.00013882275,0.00013207732,0.037117288,0.9523668,0.008332071],"study_design_scores_gemma":[0.00053653686,0.00006148056,0.0012843844,0.0021665783,0.00016672192,0.0005282604,0.0011296677,0.0008319577,0.000787732,0.124867134,0.86743516,0.00020430509],"about_ca_topic_score_codex":0.0139237,"about_ca_topic_score_gemma":0.008662704,"teacher_disagreement_score":0.9358959,"about_ca_system_score_codex":0.006756218,"about_ca_system_score_gemma":0.011579005,"threshold_uncertainty_score":0.33901882},"labels":[],"label_agreement":null},{"id":"W4379744505","doi":"10.1016/j.compind.2023.103957","title":"A similarity-assisted multi-fidelity approach to conceptual design space exploration","year":2023,"lang":"en","type":"article","venue":"Computers in Industry","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McGill University","funders":"Horizon 2020; HORIZON EUROPE Framework Programme; Horizon 2020 Framework Programme; Cleansky; VINNOVA; European Commission","keywords":"Similarity (geometry); Fidelity; Metric (unit); Data mining; Computer science; Reuse; Surrogate model; Conceptual design; Software; Visualization; Machine learning; Artificial intelligence; Engineering; Image (mathematics); Human–computer interaction","score_opus":0.15164267006233353,"score_gpt":0.3277300605853636,"score_spread":0.17608739052303005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379744505","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.002234038,0.000047901343,0.9966928,0.000051478,0.000009119631,0.000051489198,0.000017865963,0.00015643655,0.00073902553],"genre_scores_gemma":[0.17311813,0.000120958684,0.8247449,0.00008641346,0.000027215978,0.0003888226,0.00012772641,0.00016640611,0.0012193943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970528,0.0012358865,0.00015237245,0.00030885733,0.0011313651,0.00011866858],"domain_scores_gemma":[0.99173486,0.004883682,0.00088609505,0.0012252707,0.0010750676,0.00019507129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051033786,0.0012147559,0.0012019479,0.00224124,0.0007059123,0.0020127392,0.0020083322,0.0018485219,0.0035154698],"category_scores_gemma":[0.013965551,0.001021165,0.0014584541,0.0012288861,0.001192417,0.0019847173,0.0033234719,0.0021622994,0.00064086955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010127387,0.00014511697,0.0010483731,0.0002744924,0.00006982937,0.00010831746,0.0003200884,0.86726654,0.0071986658,0.02555692,0.00081550184,0.097094856],"study_design_scores_gemma":[0.000009906351,0.00006771008,0.000117252785,0.000018079412,0.000007125111,0.000047607613,0.00001980287,0.9892848,0.0016545011,0.0074592847,0.0013008285,0.000013057193],"about_ca_topic_score_codex":0.0015813924,"about_ca_topic_score_gemma":0.0017207544,"teacher_disagreement_score":0.0051033786,"about_ca_system_score_codex":0.000910616,"about_ca_system_score_gemma":0.0015596034,"threshold_uncertainty_score":0.02698958},"labels":[],"label_agreement":null},{"id":"W4379805925","doi":"10.2514/6.2023-4261","title":"Efficient Acquisition Functions for Bayesian Optimization in the Presence of Hidden Constraints","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; McGill University","funders":"","keywords":"Bayesian optimization; Computer science; Bayesian probability; Classifier (UML); Artificial intelligence; Machine learning; Test functions for optimization; Optimization problem; Convergence (economics); Context (archaeology); Mathematical optimization; Algorithm; Multi-swarm optimization; Mathematics","score_opus":0.017063412263986204,"score_gpt":0.27593371855277427,"score_spread":0.25887030628878804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379805925","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.0015971686,0.000064130945,0.9975802,0.000052742118,0.0000048737634,0.000016955146,0.000007810164,0.00006118466,0.00061486353],"genre_scores_gemma":[0.18449733,0.00049380714,0.8105323,0.00014446926,0.000052870742,0.0005281056,0.00015800253,0.00028477478,0.0033083335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879044,0.00057764794,0.00005531531,0.00010687012,0.00038441026,0.00008524306],"domain_scores_gemma":[0.9962405,0.0029590921,0.000221081,0.0001462783,0.0003567694,0.00007619428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040786145,0.0013932674,0.0015140343,0.0009985341,0.00045497683,0.0014720346,0.0011656898,0.0017123073,0.003682688],"category_scores_gemma":[0.011334821,0.00092304597,0.00095018756,0.0007908986,0.0011359812,0.0017527556,0.00218295,0.002560447,0.0011067573],"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.00012559404,0.00007629493,0.0006577552,0.0002503507,0.00005831644,0.00008698227,0.00014833822,0.77730167,0.005148575,0.0689361,0.0017309828,0.14547895],"study_design_scores_gemma":[0.000004491497,0.000019509689,0.000055985325,0.000016595253,0.0000041711805,0.000014182237,0.0000056574722,0.99124336,0.00060733076,0.0075220545,0.00050197484,0.000004647146],"about_ca_topic_score_codex":0.0020085548,"about_ca_topic_score_gemma":0.0022389083,"teacher_disagreement_score":0.0040786145,"about_ca_system_score_codex":0.0009682379,"about_ca_system_score_gemma":0.0018419455,"threshold_uncertainty_score":0.021570027},"labels":[],"label_agreement":null},{"id":"W4384575254","doi":"10.23952/asvao.5.2023.2.12","title":"Quasi-Newton methods for multiobjective optimization problems: A systematic review","year":2023,"lang":"en","type":"review","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Banaras Hindu University; National Natural Science Foundation of China; Science and Engineering Research Board; Indian Institute of Technology, Patna","keywords":"Hessian matrix; Broyden–Fletcher–Goldfarb–Shanno algorithm; Quasi-Newton method; Line search; Mathematical optimization; Convergence (economics); Mathematics; Multi-objective optimization; Optimization problem; Newton's method; Computer science; Trust region; Applied mathematics; Nonlinear system","score_opus":0.05209892652927674,"score_gpt":0.39214884851045045,"score_spread":0.34004992198117373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575254","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.00015027578,0.9947337,0.003929084,0.00028178887,0.00016453443,0.000030757128,0.000044502765,0.00002269552,0.000642659],"genre_scores_gemma":[0.002109338,0.99003524,0.006979718,0.00019527816,0.00015061532,0.00008389315,0.00009198917,0.000024166895,0.0003298405],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99858105,0.00043701945,0.00026245372,0.00019106029,0.0004864757,0.000041826806],"domain_scores_gemma":[0.99408984,0.0046011303,0.000348922,0.00013679804,0.0007566217,0.00006678663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034276212,0.0016243932,0.0026505664,0.0036876984,0.0004763034,0.0018619966,0.0019520452,0.0017649477,0.0056889355],"category_scores_gemma":[0.008515138,0.00092325406,0.0027458328,0.0054003084,0.0008859683,0.0021246872,0.00090041105,0.0016215353,0.0014892734],"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.00007764127,0.00008297844,0.00044249275,0.13239205,0.0007096598,0.00012544304,0.00018037632,0.005607611,0.00057665503,0.01384802,0.016191488,0.82976556],"study_design_scores_gemma":[0.00010875178,0.00035575082,0.0024239433,0.08549113,0.0023023793,0.0013191036,0.00028521035,0.007231301,0.0012144692,0.01937784,0.87968236,0.00020762875],"about_ca_topic_score_codex":0.004287689,"about_ca_topic_score_gemma":0.0062676803,"teacher_disagreement_score":0.0056889355,"about_ca_system_score_codex":0.0009475342,"about_ca_system_score_gemma":0.004732134,"threshold_uncertainty_score":0.019031405},"labels":[],"label_agreement":null},{"id":"W4384831640","doi":"10.1016/j.swevo.2023.101360","title":"Redefined decision variable analysis method for large-scale optimization and its application to feature selection","year":2023,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of British Columbia","funders":"Guangdong Provincial Pearl River Talents Program; Science, Technology and Innovation Commission of Shenzhen Municipality; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Feature selection; Selection (genetic algorithm); Variable (mathematics); Scale (ratio); Feature (linguistics); Artificial intelligence; Data mining; Machine learning; Mathematics","score_opus":0.008654312035199448,"score_gpt":0.293204422974132,"score_spread":0.28455011093893257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384831640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016366491,0.00013751567,0.99759835,0.00003261894,0.000042571897,0.000012815858,0.000014277612,0.00007792773,0.00044730018],"genre_scores_gemma":[0.121737555,0.00040809318,0.8732686,0.00010698509,0.00010234635,0.0002409939,0.00012551366,0.0001970773,0.003812738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993149,0.00026836147,0.000040963245,0.000108664266,0.00023185689,0.00003531784],"domain_scores_gemma":[0.99903893,0.00051952846,0.00005432337,0.00007431621,0.00028636988,0.00002651636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016140337,0.0009045463,0.0012137463,0.00110757,0.00044033522,0.00095832377,0.001201458,0.0008398492,0.0031475215],"category_scores_gemma":[0.002939025,0.00039642854,0.0010923247,0.0011272653,0.00055974134,0.0008517688,0.00088582723,0.0016438273,0.0006693779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001521799,0.00015235298,0.00068531587,0.00027144965,0.00019472645,0.0001695277,0.00009167024,0.5369456,0.020335209,0.055234198,0.0041751307,0.38159278],"study_design_scores_gemma":[0.0000057695343,0.000015012949,0.00009133353,0.0000051725465,0.0000106714315,0.00001804873,0.0000026187054,0.9950423,0.000848591,0.0029660542,0.0009874139,0.0000069146126],"about_ca_topic_score_codex":0.0017226221,"about_ca_topic_score_gemma":0.001554763,"teacher_disagreement_score":0.0031475215,"about_ca_system_score_codex":0.000480335,"about_ca_system_score_gemma":0.0007712811,"threshold_uncertainty_score":0.0105294585},"labels":[],"label_agreement":null},{"id":"W4385219046","doi":"10.1145/3583133.3596345","title":"Personalized Group Itinerary Recommendation using a Knowledge-based Evolutionary Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Windsor","funders":"","keywords":"Computer science; Set (abstract data type); Space (punctuation); Normative; Recommender system; Process (computing); Group (periodic table); Artificial intelligence; Collaborative filtering; Evolutionary algorithm; Machine learning","score_opus":0.04963183026447662,"score_gpt":0.3080158847591299,"score_spread":0.2583840544946533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385219046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11488157,0.0009534185,0.8750276,0.00049374904,0.000087320346,0.00019168523,0.00015580199,0.00055548537,0.007653324],"genre_scores_gemma":[0.6675353,0.00045271555,0.32593557,0.00026383053,0.00007864009,0.0002101293,0.00039486817,0.000067083456,0.005061842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994235,0.00012797235,0.000029309944,0.00015866627,0.00018155144,0.00007905983],"domain_scores_gemma":[0.9993026,0.0003199845,0.00007210676,0.000072465795,0.00016826161,0.00006461784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766263,0.0008119483,0.0012907186,0.0018215056,0.0006933414,0.0010227872,0.0020951838,0.0015169682,0.0016000132],"category_scores_gemma":[0.0025543557,0.00040309344,0.0010456189,0.0019246276,0.00036467542,0.0012707642,0.000693897,0.0008872088,0.000318025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013743619,0.0005455914,0.0057345913,0.00011768899,0.00027009507,0.00024970103,0.00027617277,0.64517975,0.0036860316,0.007840204,0.0037388774,0.33222392],"study_design_scores_gemma":[0.00001542906,0.000057472284,0.0005871836,0.000010046412,0.00003902519,0.00005581598,0.000039222006,0.99555737,0.00047666358,0.0022339898,0.0009177282,0.000010166823],"about_ca_topic_score_codex":0.010510156,"about_ca_topic_score_gemma":0.013744939,"teacher_disagreement_score":0.010510156,"about_ca_system_score_codex":0.0008659971,"about_ca_system_score_gemma":0.00094263355,"threshold_uncertainty_score":0.020897925},"labels":[],"label_agreement":null},{"id":"W4385457286","doi":"10.1002/cjce.25055","title":"Global optimization of the design of intensified shell and tube heat exchanger using tube inserts","year":2023,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Fundamental Research Funds for the Central Universities; Chongqing University; National Natural Science Foundation of China","keywords":"Trimming; Heat exchanger; Shell and tube heat exchanger; Tube (container); Baffle; Mechanical engineering; Process (computing); Multi-objective optimization; Set (abstract data type); Shell (structure); Computer science; Pareto principle; Engineering; Mathematical optimization; Mathematics","score_opus":0.023255233854076452,"score_gpt":0.22431676982389034,"score_spread":0.20106153596981388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385457286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34114668,0.00031549696,0.6483226,0.0000889743,0.000020194642,0.00009353649,0.00007462665,0.00030664582,0.009631194],"genre_scores_gemma":[0.9151333,0.00012723249,0.082200535,0.000018068256,0.000005537036,0.000095679025,0.000055144315,0.000042714102,0.0023218375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998085,0.00006242396,0.000006134476,0.00003403445,0.000056163484,0.00003283719],"domain_scores_gemma":[0.99974626,0.00012443893,0.00004693891,0.000019652816,0.000046451776,0.000016158103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006264986,0.00069658173,0.0007131946,0.00042378594,0.00022434471,0.0006249496,0.00051305344,0.0006739316,0.0016845465],"category_scores_gemma":[0.0007834996,0.00035140326,0.0005785209,0.00025575224,0.0004038804,0.00050713815,0.0005535856,0.00037479293,0.00016688033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038002607,0.000022925096,0.00024741027,0.000049001228,0.000012230672,0.000037246256,0.000017216442,0.98499876,0.007198306,0.0011559189,0.00010578129,0.0061171795],"study_design_scores_gemma":[0.000008532677,0.000110106594,0.00022874703,0.0000052722235,0.000010738783,0.000012673789,0.000013844568,0.99591404,0.0029753842,0.00040527474,0.00031107783,0.0000041951816],"about_ca_topic_score_codex":0.0011165551,"about_ca_topic_score_gemma":0.0013673609,"teacher_disagreement_score":0.0016845465,"about_ca_system_score_codex":0.00041080412,"about_ca_system_score_gemma":0.0005749963,"threshold_uncertainty_score":0.0056353807},"labels":[],"label_agreement":null},{"id":"W4385581085","doi":"10.7717/peerj-cs.1431","title":"A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)","year":2023,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Benchmark (surveying); Simplicity; MATLAB; Simple (philosophy)","score_opus":0.03195693581331657,"score_gpt":0.31061099094447847,"score_spread":0.2786540551311619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385581085","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.0038230782,0.0002480195,0.9925527,0.00013310224,0.00006469877,0.000056095956,0.000024106146,0.00041513945,0.0026830193],"genre_scores_gemma":[0.10280867,0.00033231926,0.8914007,0.000274605,0.00007437127,0.0003430476,0.0001284675,0.000183129,0.0044547254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990945,0.0003624149,0.000052499057,0.00015624566,0.00026885935,0.00006550433],"domain_scores_gemma":[0.9986462,0.00072196877,0.00013589201,0.00018279384,0.0002521862,0.000061111714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015489565,0.0012985336,0.0011900715,0.001327342,0.0006773969,0.0012273483,0.0019463393,0.002531971,0.0044459603],"category_scores_gemma":[0.00488022,0.0006127522,0.0013021649,0.0009758724,0.0011327448,0.0017100614,0.0016293841,0.0016145303,0.0014296774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018113793,0.0001265583,0.001026688,0.00025692748,0.00017991214,0.00013182552,0.0001735612,0.642094,0.008820171,0.054642636,0.00649773,0.2858688],"study_design_scores_gemma":[0.000038790276,0.000110349356,0.00013841015,0.000024126419,0.000019253612,0.000115341136,0.000016244181,0.9861043,0.0016431488,0.0067377733,0.0050206175,0.00003154695],"about_ca_topic_score_codex":0.002839439,"about_ca_topic_score_gemma":0.003461497,"teacher_disagreement_score":0.0044459603,"about_ca_system_score_codex":0.0005491137,"about_ca_system_score_gemma":0.0019524123,"threshold_uncertainty_score":0.014873266},"labels":[],"label_agreement":null},{"id":"W4385723738","doi":"10.1007/s00245-023-10036-y","title":"An Adaptive Consensus Based Method for Multi-objective Optimization with Uniform Pareto Front Approximation","year":2023,"lang":"en","type":"article","venue":"Applied Mathematics & Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Banff International Research Station for Mathematical Innovation and Discovery; Ministero dell’Istruzione, dell’Università e della Ricerca; Deutsche Forschungsgemeinschaft","keywords":"Mathematical optimization; Multi-objective optimization; Convergence (economics); Pareto principle; Heuristic; Computer science; Computation; Parametric statistics; Mathematics; Metaheuristic; Algorithm","score_opus":0.03278531748220069,"score_gpt":0.3032746034102,"score_spread":0.2704892859279993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385723738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040936973,0.00006756227,0.9943229,0.000050208306,0.00002396048,0.000021754995,0.0000063468733,0.000056427947,0.0013571203],"genre_scores_gemma":[0.5566564,0.00024987228,0.43714008,0.00014377804,0.00006898869,0.00039185295,0.00007493165,0.000094917355,0.005179081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996055,0.00013452288,0.000016337679,0.000059301743,0.00015515179,0.000029297365],"domain_scores_gemma":[0.9994429,0.00026233224,0.00005519889,0.000042219293,0.00017156378,0.000025857878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549267,0.0006046996,0.00082958525,0.00063511863,0.0004058447,0.0006492197,0.0011857824,0.0010609763,0.0018289803],"category_scores_gemma":[0.002001701,0.0003192669,0.0007999944,0.0005413164,0.00063554366,0.0006832282,0.0009949261,0.00097068463,0.00030531516],"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.00002377533,0.000018952202,0.00012855654,0.000039273058,0.000023818066,0.00002740099,0.000026409212,0.96323824,0.001794195,0.013833917,0.00039483455,0.020450603],"study_design_scores_gemma":[0.0000025378233,0.00000651595,0.000010339521,0.0000015799188,0.0000011730159,0.0000023170253,0.0000012226774,0.9989478,0.0001081335,0.0007787599,0.00013848978,0.000001194051],"about_ca_topic_score_codex":0.00277667,"about_ca_topic_score_gemma":0.0015317658,"teacher_disagreement_score":0.00277667,"about_ca_system_score_codex":0.00067485904,"about_ca_system_score_gemma":0.00094342243,"threshold_uncertainty_score":0.006118536},"labels":[],"label_agreement":null},{"id":"W4386429413","doi":"10.1109/intermagshortpapers58606.2023.10228231","title":"Surrogate-Based Modeling of Induction Machines to Reduce the Computational Burden of Robust Multi-Objective Optimization","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Surrogate model; Computer science; Bottleneck; Multi-objective optimization; Robust optimization; Optimization problem; Engineering optimization; Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.04502553625917919,"score_gpt":0.2987310368157614,"score_spread":0.2537055005565822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386429413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069675543,0.00019462958,0.9890458,0.000058627516,0.000028494265,0.000017655426,0.000043005857,0.000173524,0.0034707545],"genre_scores_gemma":[0.6882398,0.00088043866,0.30436632,0.00008590779,0.00005825599,0.00022371259,0.00040502608,0.00019769285,0.005542865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997197,0.00011267979,0.000012983997,0.0000210506,0.000115097515,0.00001840642],"domain_scores_gemma":[0.999678,0.00015696707,0.000036830912,0.00004471859,0.0000689106,0.000014651164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053466,0.0006275731,0.0008202071,0.00038053206,0.00021017126,0.00062419026,0.0005818237,0.00075835816,0.0018804132],"category_scores_gemma":[0.0011151078,0.00032799682,0.00079286087,0.0004954084,0.00034295378,0.00053772156,0.00059981644,0.0009017689,0.0005373048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001751954,0.000012896275,0.00011778592,0.000039838465,0.000011224371,0.000024328785,0.0000113379365,0.9836158,0.0029924235,0.0059992075,0.00028320335,0.0068743606],"study_design_scores_gemma":[9.730387e-7,0.000009359053,0.000025377933,0.0000033209267,0.0000014154402,0.000006586795,0.0000012950269,0.9984231,0.00036041703,0.0007510772,0.00041594528,0.0000012264821],"about_ca_topic_score_codex":0.0005189377,"about_ca_topic_score_gemma":0.0005481508,"teacher_disagreement_score":0.0018804132,"about_ca_system_score_codex":0.00018659742,"about_ca_system_score_gemma":0.00042555667,"threshold_uncertainty_score":0.0062906146},"labels":[],"label_agreement":null},{"id":"W4386447329","doi":"10.1016/j.eswa.2023.121375","title":"Sustainable group tourist trip planning: An adaptive large neighborhood search algorithm","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Tourism; Computer science; Operations research; Sustainability; Profit (economics); Environmental economics; Sustainable tourism; Heuristic; Mathematical optimization; Marketing; Business; Economics; Microeconomics; Mathematics; Artificial intelligence","score_opus":0.02209203793765084,"score_gpt":0.3019378705525617,"score_spread":0.27984583261491086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386447329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03205745,0.00021609657,0.9619299,0.00013696325,0.000062698506,0.00010009987,0.000056269837,0.00036499542,0.005075411],"genre_scores_gemma":[0.4716046,0.00016549291,0.52195185,0.00011395746,0.000056989735,0.00036400193,0.00018775888,0.00011927352,0.005436075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997515,0.00008873107,0.000010140913,0.000055825156,0.00006573283,0.00002799056],"domain_scores_gemma":[0.9995819,0.00024350312,0.000033230357,0.000026916052,0.000084920415,0.000029491273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762408,0.0005564908,0.0010887345,0.0008040177,0.00053595647,0.0005986365,0.0016747486,0.001164209,0.0027480037],"category_scores_gemma":[0.0015475258,0.0004642345,0.0006626548,0.00097135856,0.0004914878,0.000790093,0.0010061043,0.0006201793,0.0003444607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100361685,0.000072457464,0.0004062738,0.000033951903,0.000046002857,0.000037969432,0.00003956334,0.9390547,0.00055433426,0.0043019215,0.0014268504,0.05392554],"study_design_scores_gemma":[0.000009504555,0.000012118383,0.00003141567,0.0000012443721,0.0000038442913,0.000003997926,0.0000032594016,0.99926645,0.000044259785,0.00048722554,0.00013522636,0.0000015482944],"about_ca_topic_score_codex":0.009451428,"about_ca_topic_score_gemma":0.011329831,"teacher_disagreement_score":0.009451428,"about_ca_system_score_codex":0.0006319887,"about_ca_system_score_gemma":0.0011127653,"threshold_uncertainty_score":0.018792808},"labels":[],"label_agreement":null},{"id":"W4386803120","doi":"10.23977/acss.2023.070703","title":"A Self-Organizing Multimodal Multi-Objective Coati Optimization Algorithm","year":2023,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Evolutionary algorithm; Multi-objective optimization; Computer science; Sorting; Pareto principle; Mathematical optimization; Optimization problem; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.0156873036427435,"score_gpt":0.2729975300320266,"score_spread":0.2573102263892831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386803120","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.0283105,0.0005340146,0.95401317,0.00037405195,0.00011693428,0.00022226696,0.00010743721,0.00064401224,0.015677588],"genre_scores_gemma":[0.4180457,0.00040352525,0.5680144,0.00043171036,0.00007686552,0.0008120898,0.00037375494,0.00017745496,0.011664503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999684,0.000064114865,0.000011535411,0.000058595448,0.00013835571,0.000043403517],"domain_scores_gemma":[0.99968576,0.00009229969,0.00004261645,0.00002684832,0.00011745041,0.00003499064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095881,0.0008994661,0.00081611535,0.00089513964,0.0007085405,0.0011073005,0.0017850242,0.0013999603,0.003214007],"category_scores_gemma":[0.0012089176,0.00040241578,0.0008234156,0.00077871094,0.00051635323,0.0006218031,0.001345242,0.0009371775,0.0005568672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078981815,0.00009139928,0.0013576756,0.00014144916,0.00009728828,0.00014897526,0.000111821355,0.85160214,0.0069274586,0.014135564,0.0054187933,0.11988839],"study_design_scores_gemma":[0.000014401974,0.000025484263,0.00013236863,0.000006987138,0.000007285248,0.00003181031,0.000009458088,0.99652654,0.0005568386,0.00082639564,0.0018555922,0.0000068401637],"about_ca_topic_score_codex":0.004316725,"about_ca_topic_score_gemma":0.003697259,"teacher_disagreement_score":0.004316725,"about_ca_system_score_codex":0.0007461306,"about_ca_system_score_gemma":0.0013124251,"threshold_uncertainty_score":0.010751903},"labels":[],"label_agreement":null},{"id":"W4386916513","doi":"10.1080/00224065.2023.2241680","title":"Adaptive-region sequential design with quantitative and qualitative factors in application to HPC configuration","year":2023,"lang":"en","type":"article","venue":"Journal of Quality Technology","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Constructive; Computer science; Process (computing); Adaptive design; Operations research; Point (geometry); Management science; Industrial engineering; Engineering; Mathematics; Programming language","score_opus":0.11262002623504903,"score_gpt":0.39984248294129476,"score_spread":0.28722245670624574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386916513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005991625,0.00008328644,0.9931438,0.000013833075,0.000009536293,0.00004531367,0.000005152093,0.00008107881,0.00062624895],"genre_scores_gemma":[0.5197737,0.000192899,0.47844565,0.000042578733,0.000026058755,0.00033796727,0.00003641407,0.00006305212,0.001081675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.0007625663,0.00007888508,0.00033517432,0.000548596,0.00009172989],"domain_scores_gemma":[0.9980476,0.0009849904,0.00032641058,0.00016475732,0.00041888788,0.000057346282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028217004,0.0009223177,0.0007839511,0.00065350876,0.00034509835,0.0007541638,0.0010129228,0.00056411256,0.0013879203],"category_scores_gemma":[0.0039446126,0.0004830247,0.00079389097,0.0005640188,0.0008522682,0.0006760268,0.00092701794,0.0006803167,0.00024758553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028009963,0.00011023936,0.0010968708,0.00028351354,0.00007001756,0.00007879789,0.00015214903,0.8553465,0.026490226,0.013425025,0.00027048122,0.10239614],"study_design_scores_gemma":[0.000029411613,0.0004037486,0.0003310173,0.000013916744,0.000025039037,0.0000415103,0.000016386364,0.98784757,0.0058782455,0.0042152433,0.0011799639,0.000017978236],"about_ca_topic_score_codex":0.0009388153,"about_ca_topic_score_gemma":0.00077093753,"teacher_disagreement_score":0.0028217004,"about_ca_system_score_codex":0.0005017395,"about_ca_system_score_gemma":0.000995084,"threshold_uncertainty_score":0.014922738},"labels":[],"label_agreement":null},{"id":"W4386983380","doi":"10.1016/j.knosys.2023.111032","title":"Neural network-enabled discovery of mapping between variables and constraints for autonomous repair-based constraint handling in multi-objective structural optimization","year":2023,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":9,"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; University of British Columbia","keywords":"Constraint (computer-aided design); Benchmark (surveying); Sorting; Mathematical optimization; Computer science; Population; Genetic algorithm; Optimization problem; Artificial neural network; Variable (mathematics); Algorithm; Artificial intelligence; Mathematics","score_opus":0.03595841161778918,"score_gpt":0.2854779191023652,"score_spread":0.24951950748457602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386983380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06154771,0.00026023833,0.9329059,0.00027345668,0.000042969008,0.00005447775,0.00013330621,0.0006086878,0.0041731554],"genre_scores_gemma":[0.8586738,0.00011231881,0.1391557,0.00010046487,0.000018178702,0.000107375265,0.00021751548,0.00006858745,0.0015460077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974996,0.0000686499,0.00001575999,0.0000618486,0.00006835852,0.000035449462],"domain_scores_gemma":[0.9992779,0.0004053338,0.00009026035,0.00006798902,0.00012903033,0.000029511477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069061853,0.0006462455,0.0007081794,0.00060612685,0.00034666975,0.0009542156,0.0011842416,0.00091164734,0.0019898687],"category_scores_gemma":[0.002947285,0.00052240654,0.0004486818,0.0005535387,0.00049918116,0.0011820052,0.001160461,0.0012744112,0.0002495847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006013736,0.00007639904,0.0006412211,0.000053397067,0.000032843247,0.000053226137,0.00004460122,0.9311346,0.0025858555,0.006083528,0.0007795921,0.058454596],"study_design_scores_gemma":[0.0000013998299,0.000003678878,0.000036826714,0.0000016981743,0.0000012875217,0.0000021719773,0.0000020653038,0.99850637,0.00019482983,0.001202214,0.000046379304,0.0000010062414],"about_ca_topic_score_codex":0.007985425,"about_ca_topic_score_gemma":0.0101999855,"teacher_disagreement_score":0.007985425,"about_ca_system_score_codex":0.00067011453,"about_ca_system_score_gemma":0.0009981722,"threshold_uncertainty_score":0.015877843},"labels":[],"label_agreement":null},{"id":"W4387005540","doi":"10.1109/cec53210.2023.10254163","title":"A Comparative Study of Multi-Guide Particle Swarm Optimization Topologies in Dynamic Multi-Objective Environments","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Particle swarm optimization; Network topology; Computer science; Mathematical optimization; Set (abstract data type); Multi-swarm optimization; Topology optimization; Swarm behaviour; Topology (electrical circuits); Metaheuristic; Algorithm; Mathematics; Engineering; Finite element method","score_opus":0.04313637816854552,"score_gpt":0.3424501964806616,"score_spread":0.29931381831211606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387005540","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.75747716,0.0037057416,0.20355505,0.00056849257,0.00016826433,0.00023492379,0.00033212636,0.0006054943,0.033352807],"genre_scores_gemma":[0.9517209,0.00088240276,0.04559412,0.000033405355,0.000014643319,0.00008210513,0.0002481165,0.000046564877,0.0013778245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945587,0.00024290745,0.000026609723,0.000049635815,0.00017268286,0.000052383188],"domain_scores_gemma":[0.9980696,0.00112431,0.00015515264,0.0001481827,0.00037715235,0.0001256251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016044534,0.0006640694,0.00062764075,0.0012247728,0.00045321876,0.001098245,0.0007122566,0.0006981808,0.0010983204],"category_scores_gemma":[0.0037260533,0.00023144796,0.00044649112,0.00099579,0.0003584185,0.0012769714,0.00053246145,0.00040376396,0.00020025714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018868907,0.00010794627,0.002317426,0.00011899426,0.00004708579,0.000097990065,0.00007219129,0.9519088,0.001181369,0.0038879635,0.0005967841,0.039474722],"study_design_scores_gemma":[0.000018207134,0.00035567107,0.001532783,0.000021297283,0.000017366778,0.000053943386,0.00011253237,0.9945023,0.0010793813,0.0011226176,0.0011719759,0.000012068419],"about_ca_topic_score_codex":0.002197735,"about_ca_topic_score_gemma":0.0023738942,"teacher_disagreement_score":0.002197735,"about_ca_system_score_codex":0.0005799751,"about_ca_system_score_gemma":0.00053427025,"threshold_uncertainty_score":0.008485258},"labels":[],"label_agreement":null},{"id":"W4387006045","doi":"10.1109/cec53210.2023.10254106","title":"Multi-Objective Coordinate Search Optimization","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Benchmark (surveying); Computer science; Optimization problem; Pareto principle; Set (abstract data type); Population; Evolutionary algorithm; Computation; Algorithm; Mathematics","score_opus":0.02979666514102418,"score_gpt":0.3015909265642199,"score_spread":0.2717942614231957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387006045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01205434,0.0011562774,0.9736211,0.0001682157,0.000076226184,0.00009801273,0.00011266681,0.00035125326,0.012361856],"genre_scores_gemma":[0.46060914,0.0018363714,0.5235363,0.00021037752,0.00012419176,0.00077232276,0.0004895456,0.0002106415,0.012211123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999332,0.00026641527,0.000021859065,0.00013624795,0.00019286448,0.00005068329],"domain_scores_gemma":[0.99956304,0.0002272697,0.000061125065,0.000029365941,0.00009707961,0.000022083526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090795534,0.0013326552,0.0013306253,0.00079401693,0.0004843786,0.0013533707,0.0012900063,0.0014112097,0.003900923],"category_scores_gemma":[0.0016977289,0.0003940505,0.00106056,0.0010288429,0.000608596,0.0006526629,0.0010125557,0.00086062995,0.00090522226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045453988,0.000040653867,0.0005803585,0.00019484622,0.00007023179,0.000100007215,0.000051065927,0.93355066,0.0021472152,0.021598965,0.0021342319,0.039486356],"study_design_scores_gemma":[0.000012014588,0.000038060272,0.00012298644,0.000011626096,0.000010531869,0.0000273532,0.000008329027,0.99481285,0.0004299091,0.0024455218,0.0020746682,0.000006118972],"about_ca_topic_score_codex":0.0028969406,"about_ca_topic_score_gemma":0.0020283947,"teacher_disagreement_score":0.003900923,"about_ca_system_score_codex":0.00073737133,"about_ca_system_score_gemma":0.00088059535,"threshold_uncertainty_score":0.013049841},"labels":[],"label_agreement":null},{"id":"W4387251127","doi":"10.1109/intermag50591.2023.10265080","title":"Surrogate-Based Modeling of Induction Machines to Reduce the Computational Burden of Robust Multi-Objective Optimization","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Surrogate model; Computer science; Bottleneck; Multi-objective optimization; Process (computing); Robust optimization; Optimization problem; Mathematical optimization; Engineering optimization; Machine learning; Algorithm; Mathematics","score_opus":0.04502553625917919,"score_gpt":0.2987310368157614,"score_spread":0.2537055005565822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387251127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007773209,0.00015827392,0.98923445,0.000047407066,0.000023397226,0.000016647986,0.000034667617,0.00015009775,0.002561905],"genre_scores_gemma":[0.677401,0.0006371095,0.3169159,0.00006555609,0.000046169705,0.00018997525,0.00032880236,0.00016931073,0.00424622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997335,0.00010545712,0.00001223565,0.000020939486,0.00011029037,0.000017529082],"domain_scores_gemma":[0.99968183,0.00015629086,0.00003644566,0.000044774493,0.00006666178,0.000014044649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005968317,0.0005600477,0.0007601644,0.00033489964,0.0001911557,0.0005434976,0.0005444535,0.0006673145,0.0017019364],"category_scores_gemma":[0.0011385862,0.00030256496,0.00070400833,0.00045541962,0.00030863335,0.000506862,0.0005116089,0.0008571437,0.0004589908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018516512,0.00001358555,0.00012720346,0.00003539599,0.000009468156,0.000020982336,0.000011706964,0.98337144,0.0031737771,0.0054678046,0.00023647399,0.0075135194],"study_design_scores_gemma":[8.2512486e-7,0.0000086673435,0.000023579343,0.000002440513,0.0000010420841,0.00000481711,0.0000010733277,0.99874145,0.00034197248,0.000567939,0.00030525363,9.72461e-7],"about_ca_topic_score_codex":0.0005754478,"about_ca_topic_score_gemma":0.000593683,"teacher_disagreement_score":0.0017019364,"about_ca_system_score_codex":0.0001842095,"about_ca_system_score_gemma":0.000408576,"threshold_uncertainty_score":0.0056936145},"labels":[],"label_agreement":null},{"id":"W4387260729","doi":"10.23952/jnva.7.2023.5.03","title":"Further results on quasi efficient solutions in multiobjective optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Agencia Estatal de Investigación; Ministerio de Ciencia e Innovación","keywords":"Mathematical optimization; Multi-objective optimization; Computer science; Mathematics","score_opus":0.01994990746582334,"score_gpt":0.2847101795413509,"score_spread":0.26476027207552755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011669256,0.0041835927,0.9334988,0.0014505798,0.00055206387,0.00008468628,0.000117257594,0.000077788434,0.048365925],"genre_scores_gemma":[0.3959471,0.011293428,0.5074692,0.0017835838,0.001252878,0.0007109876,0.00044368318,0.0007450297,0.0803541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.00062991364,0.000050183677,0.00010477676,0.0003054132,0.00009575234],"domain_scores_gemma":[0.99568033,0.0032819882,0.00015047619,0.0002935218,0.00044125583,0.00015227217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004783512,0.0020776866,0.0013431713,0.0017267556,0.0010250332,0.0019254008,0.0014602073,0.0015677924,0.011346572],"category_scores_gemma":[0.012042394,0.000888794,0.0023851003,0.0020563311,0.0021483717,0.0037089933,0.0026270624,0.00484201,0.0010050514],"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.00008950269,0.0001141641,0.00029696387,0.0005328452,0.00011239317,0.000119937446,0.00028010484,0.14397341,0.0034354974,0.80164546,0.005401117,0.043998525],"study_design_scores_gemma":[0.00003156798,0.000108239445,0.00051651744,0.00016732633,0.00006521883,0.00008547106,0.00007957713,0.45490378,0.0015409961,0.5288367,0.013638187,0.000026396165],"about_ca_topic_score_codex":0.0015506638,"about_ca_topic_score_gemma":0.0017751771,"teacher_disagreement_score":0.011346572,"about_ca_system_score_codex":0.0012723046,"about_ca_system_score_gemma":0.0011939672,"threshold_uncertainty_score":0.037958086},"labels":[],"label_agreement":null},{"id":"W4388441216","doi":"10.18280/isi.280503","title":"An Improved Harris Hawks Optimization Algorithm Based on Bi-Goal Evolution and Multi-Leader Selection Strategy for Multi-Objective Optimization","year":2023,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Selection (genetic algorithm); Mathematical optimization; Computer science; Optimization algorithm; Multi-objective optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.024219127616420314,"score_gpt":0.280037891088677,"score_spread":0.2558187634722567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388441216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017399022,0.0005060616,0.97529715,0.00012389656,0.000086395645,0.00007965549,0.000038350707,0.00035671866,0.006112654],"genre_scores_gemma":[0.53264177,0.000532834,0.4560282,0.0002921458,0.00007240465,0.0004612657,0.00022881177,0.00015942163,0.009583264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.000058000023,0.000012611575,0.000047979225,0.00010258346,0.00003642437],"domain_scores_gemma":[0.99981195,0.00006614304,0.000028038206,0.000014340235,0.000059804286,0.000019792393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048217273,0.00087662967,0.0008977264,0.0005958797,0.00038207078,0.00071280566,0.0012337404,0.0008973329,0.002564087],"category_scores_gemma":[0.00079201703,0.00036241522,0.0007508808,0.0005434759,0.00044954658,0.0005718425,0.0009454609,0.00075337116,0.00042816045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005160683,0.00004399163,0.0007479283,0.00011539505,0.00007773953,0.00012864375,0.00009695244,0.8943092,0.0057150964,0.010361353,0.0018898374,0.08646224],"study_design_scores_gemma":[0.000012975498,0.000030492667,0.000087902044,0.0000053916674,0.0000075919343,0.00001938265,0.0000085540305,0.9973232,0.00039329892,0.0011164019,0.0009889401,0.000005901439],"about_ca_topic_score_codex":0.0044758446,"about_ca_topic_score_gemma":0.0038765138,"teacher_disagreement_score":0.0044758446,"about_ca_system_score_codex":0.00053080893,"about_ca_system_score_gemma":0.001109082,"threshold_uncertainty_score":0.0088995695},"labels":[],"label_agreement":null},{"id":"W4388808998","doi":"10.1016/j.asoc.2023.111065","title":"Adaptive surrogate assisted multi-objective optimization approach for highly nonlinear and complex engineering design problems","year":2023,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Victoria","funders":"Ministry of Higher Education and Scientific Research","keywords":"Surrogate model; Mathematical optimization; Kriging; Computer science; Pareto principle; Engineering optimization; Engineering design process; Multi-objective optimization; Benchmark (surveying); Test functions for optimization; Finite element method; Optimization problem; Computation; Multi-swarm optimization; Mathematics; Algorithm; Engineering; Machine learning","score_opus":0.0551484492833532,"score_gpt":0.26404139441171676,"score_spread":0.20889294512836357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388808998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005465161,0.0001999208,0.9908737,0.000096221556,0.000041596497,0.0000242331,0.000015856833,0.00008046139,0.0032029683],"genre_scores_gemma":[0.46118653,0.00055787375,0.52997786,0.00022996991,0.000106757274,0.00044132752,0.00017364346,0.00017785304,0.007148163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00026621108,0.000024561976,0.00003944723,0.00020657638,0.000034979956],"domain_scores_gemma":[0.9990393,0.0005638919,0.00008159333,0.000059426402,0.00021683153,0.000038963495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411677,0.00089986733,0.0012582889,0.00086143357,0.00038500695,0.0010903483,0.0011842152,0.001732981,0.0023335256],"category_scores_gemma":[0.0024568918,0.0005811811,0.00095880777,0.00085679867,0.00061948784,0.0007198262,0.0013067487,0.0013890979,0.00042519296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029605544,0.000033955355,0.00013659771,0.00007204236,0.000035199522,0.00004879272,0.000021748096,0.97815186,0.0013235931,0.006548048,0.00035195026,0.013246564],"study_design_scores_gemma":[0.0000018517162,0.000008717886,0.000017840273,0.0000031522643,0.0000020366801,0.000005147685,0.000001562414,0.998911,0.00008978866,0.0007859118,0.00017176708,0.0000012818564],"about_ca_topic_score_codex":0.0010997573,"about_ca_topic_score_gemma":0.0010676195,"teacher_disagreement_score":0.0023335256,"about_ca_system_score_codex":0.0003938599,"about_ca_system_score_gemma":0.0007962131,"threshold_uncertainty_score":0.009208322},"labels":[],"label_agreement":null},{"id":"W4388896605","doi":"10.1016/j.swevo.2023.101432","title":"A constrained multi-objective evolutionary algorithm with clustering based weight vector adaptation","year":2023,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"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 Foundation of Korea; Ministry of Education; CHEO Research Institute","keywords":"Cluster analysis; Mathematical optimization; Computer science; Population; Evolutionary algorithm; Classification of discontinuities; Convergence (economics); Multi-objective optimization; Set (abstract data type); Pareto principle; Optimization problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.01732310024901803,"score_gpt":0.24958132146428144,"score_spread":0.2322582212152634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388896605","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.008571883,0.0001813875,0.9885844,0.0000758723,0.000081954946,0.000059065802,0.000016986229,0.00018182238,0.00224672],"genre_scores_gemma":[0.21797624,0.00018403171,0.77573675,0.00016201386,0.00006130685,0.00039102224,0.00011186715,0.00010955916,0.0052671996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996494,0.00008047542,0.000022743232,0.00007241728,0.00014982102,0.000025092777],"domain_scores_gemma":[0.99960774,0.00013184204,0.00003495886,0.000040689967,0.00016026829,0.00002460146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080495875,0.00074651686,0.0012343228,0.0007326349,0.00053612946,0.0007905697,0.0018153882,0.001746195,0.0022428103],"category_scores_gemma":[0.0018194226,0.00055380835,0.0006710539,0.0012956082,0.0004161611,0.0007537661,0.0010390838,0.00082538417,0.0005161695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008498507,0.0001130762,0.00048938056,0.00008582636,0.0001273794,0.00009480833,0.000059710812,0.82550144,0.008405154,0.006910592,0.0018314712,0.15629609],"study_design_scores_gemma":[0.000010176325,0.000016850277,0.000074563686,0.0000030751728,0.0000064428737,0.000015553978,0.0000022231768,0.99879885,0.0003552229,0.000343452,0.00036892045,0.0000046480955],"about_ca_topic_score_codex":0.0040459055,"about_ca_topic_score_gemma":0.004039944,"teacher_disagreement_score":0.0040459055,"about_ca_system_score_codex":0.00042664324,"about_ca_system_score_gemma":0.00077548815,"threshold_uncertainty_score":0.00804472},"labels":[],"label_agreement":null},{"id":"W4389444046","doi":"10.1007/978-981-19-8851-6_40-1","title":"Overcoming Constraints: The Critical Role of Penalty Functions as Constraint-Handling Methods in Structural Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Mathematical optimization; Constraint (computer-aided design); Robustness (evolution); Penalty method; Computer science; Optimization problem; Constrained optimization problem; Variety (cybernetics); Constrained optimization; Engineering; Mathematics; Artificial intelligence","score_opus":0.028300588328692106,"score_gpt":0.34362735257027427,"score_spread":0.3153267642415822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389444046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00193508,0.005780939,0.95915914,0.0013686549,0.0005436742,0.000028464414,0.000050139788,0.0002465826,0.030887358],"genre_scores_gemma":[0.080223344,0.015547908,0.8434791,0.0013392164,0.0013998295,0.00019467394,0.00018587169,0.0012641203,0.056365825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.00020779046,0.00002434738,0.000073741314,0.00035970798,0.000035360456],"domain_scores_gemma":[0.998486,0.001060361,0.000080916616,0.00013769395,0.00018002644,0.000055052766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012924661,0.0014997341,0.0009484771,0.00073455676,0.0006048002,0.002760962,0.0019091461,0.0017081277,0.0073188003],"category_scores_gemma":[0.0048326906,0.0006840618,0.0005195475,0.0016711226,0.0024505788,0.0043679094,0.0017306793,0.004917615,0.0022534807],"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.000039005772,0.000051054696,0.00008663354,0.00037442773,0.000029137484,0.000051261948,0.00011357526,0.105795644,0.0033482201,0.6272905,0.026222764,0.23659776],"study_design_scores_gemma":[0.000012669446,0.000031939257,0.00011081033,0.00014875384,0.0000130833905,0.00007645107,0.000036688376,0.37138367,0.0018080642,0.56293976,0.0634042,0.000033931236],"about_ca_topic_score_codex":0.0011484212,"about_ca_topic_score_gemma":0.0015196111,"teacher_disagreement_score":0.0073188003,"about_ca_system_score_codex":0.00048441344,"about_ca_system_score_gemma":0.0008078002,"threshold_uncertainty_score":0.0244838},"labels":[],"label_agreement":null},{"id":"W4389704887","doi":"10.1016/j.knosys.2023.111227","title":"A fuzzy-guided adaptive algorithm with hierarchy mechanism for solving dynamic multi-objective optimization problems","year":2023,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Multi-Objective Optimization Algorithms","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 Alberta","funders":"","keywords":"Population; Mathematical optimization; Fuzzy logic; Benchmark (surveying); Computer science; Algorithm; Evolutionary algorithm; Mathematics; Artificial intelligence","score_opus":0.031460737057492257,"score_gpt":0.2840208351324829,"score_spread":0.25256009807499064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389704887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012639375,0.00024272007,0.98373914,0.00007780664,0.0000627972,0.000065845874,0.000020856947,0.00024116955,0.0029103227],"genre_scores_gemma":[0.30819592,0.00023671794,0.6880798,0.00014920121,0.000060871822,0.00030207558,0.00008378893,0.00006639486,0.002825355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970526,0.00005730944,0.000017155864,0.00004506806,0.00014141298,0.00003371806],"domain_scores_gemma":[0.99967134,0.00013817409,0.000028187931,0.000022043328,0.00011551101,0.000024701956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007403994,0.00065537175,0.0009238067,0.0007432763,0.0005710443,0.0006167558,0.0015244089,0.0013098713,0.00229211],"category_scores_gemma":[0.0015766893,0.00040602777,0.0006292099,0.00088807615,0.0004707405,0.0006073988,0.00097109674,0.0009169687,0.000359455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013395656,0.00012369786,0.00047168235,0.00016735951,0.00009677955,0.00009250847,0.00013828884,0.7153658,0.010634301,0.012489635,0.0027597432,0.25752622],"study_design_scores_gemma":[0.000015995172,0.00003228548,0.00006008252,0.000004894007,0.00000742287,0.000011254342,0.000003917943,0.99819523,0.00036580383,0.00085240335,0.00044581035,0.0000050157582],"about_ca_topic_score_codex":0.00844177,"about_ca_topic_score_gemma":0.0071824123,"teacher_disagreement_score":0.00844177,"about_ca_system_score_codex":0.0004971969,"about_ca_system_score_gemma":0.0011873811,"threshold_uncertainty_score":0.016785264},"labels":[],"label_agreement":null},{"id":"W4390590962","doi":"10.1007/s11227-023-05790-3","title":"Prism refraction search: a novel physics-based metaheuristic algorithm","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":44,"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":"Metaheuristic; Computer science; Algorithm; Test suite; Robustness (evolution); Suite; Benchmark (surveying); Heuristics; Prism; Test case; Machine learning; Optics","score_opus":0.033782771308699056,"score_gpt":0.2937976566970732,"score_spread":0.26001488538837414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018981624,0.00061688403,0.9634777,0.00055211026,0.0003918328,0.00016941837,0.00012030922,0.00062002655,0.015070268],"genre_scores_gemma":[0.28419206,0.00039839104,0.70529085,0.00083924487,0.00018476018,0.0005433517,0.0002585282,0.00026157213,0.008031233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999637,0.00011622738,0.000017967457,0.000055582055,0.00013021394,0.000042904223],"domain_scores_gemma":[0.9994216,0.00030103535,0.000056684694,0.000042356034,0.0001319293,0.000046447458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009425244,0.0010246279,0.0013638051,0.0013304803,0.0007662865,0.0011622909,0.0023918606,0.0024859526,0.004415323],"category_scores_gemma":[0.0018712255,0.0005844134,0.0012222537,0.0013567965,0.0008335857,0.0010324725,0.0018546873,0.0015792947,0.000601321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010633545,0.00011864873,0.00047340203,0.00008793259,0.000105722174,0.000060023805,0.000045582517,0.9216217,0.0017605927,0.018929185,0.0031226333,0.053568218],"study_design_scores_gemma":[0.000033279925,0.000027291591,0.000034140136,0.000005861396,0.000011468419,0.000009408562,0.0000054936836,0.9974572,0.00014374069,0.0016457203,0.00062193203,0.0000045395327],"about_ca_topic_score_codex":0.006080605,"about_ca_topic_score_gemma":0.007535724,"teacher_disagreement_score":0.006080605,"about_ca_system_score_codex":0.0010307162,"about_ca_system_score_gemma":0.0025896525,"threshold_uncertainty_score":0.014770746},"labels":[],"label_agreement":null},{"id":"W4390751793","doi":"10.1145/3637065","title":"Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Guangdong Provincial Pearl River Talents Program; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Human multitasking; Task (project management); Surrogate model; Computer science; Curse of dimensionality; Dimension (graph theory); Evolutionary algorithm; Dimensionality reduction; Artificial intelligence; Machine learning; Convergence (economics); Mathematical optimization; Optimization problem; Algorithm; Mathematics; Engineering","score_opus":0.009643095064869094,"score_gpt":0.24360168410106506,"score_spread":0.23395858903619596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390751793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03962944,0.00037808204,0.9561446,0.00025899097,0.0000728007,0.00009367285,0.000049185997,0.0003487452,0.0030244167],"genre_scores_gemma":[0.53297824,0.0003296864,0.46134865,0.00030650303,0.00008299542,0.0005368595,0.00034846007,0.0001660476,0.0039026495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921477,0.00036829597,0.000044362714,0.00011652582,0.00018109959,0.00007507032],"domain_scores_gemma":[0.99840945,0.0009248551,0.00011961229,0.0002141192,0.00023451848,0.000097579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020467434,0.001309047,0.0014221497,0.0006335721,0.00049524225,0.0008965868,0.0014194754,0.0014405684,0.0022257026],"category_scores_gemma":[0.0043172184,0.0005236594,0.001098043,0.00059074163,0.00076169195,0.0009551839,0.0015223091,0.0017246603,0.00042475865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046344776,0.000077848104,0.0004970945,0.00006813364,0.000037907008,0.00007889077,0.000043736054,0.9664215,0.0014944719,0.004700392,0.00073321094,0.025800604],"study_design_scores_gemma":[0.000009864816,0.0000293426,0.00006304688,0.0000039021515,0.0000049408322,0.000013320392,0.0000061693713,0.9980021,0.00023769875,0.0011968688,0.0004296096,0.0000031612403],"about_ca_topic_score_codex":0.002104349,"about_ca_topic_score_gemma":0.0021895429,"teacher_disagreement_score":0.0022257026,"about_ca_system_score_codex":0.00044343062,"about_ca_system_score_gemma":0.0009606947,"threshold_uncertainty_score":0.010824382},"labels":[],"label_agreement":null},{"id":"W4391037431","doi":"10.1016/b978-0-32-395365-8.00019-1","title":"Multi-objective archived-based whale optimization algorithm","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Optimization algorithm; Whale; Computer science; Mathematical optimization; Meta heuristic; Grid; Selection (genetic algorithm); Heuristic; Algorithm; Engineering optimization; Optimization problem; Artificial intelligence; Mathematics; Fishery","score_opus":0.014487197367694332,"score_gpt":0.2519603506566221,"score_spread":0.23747315328892776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391037431","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.020625683,0.00043854155,0.96420294,0.000115645205,0.00020863675,0.0000634582,0.000090742134,0.0005557421,0.013698564],"genre_scores_gemma":[0.46010113,0.00034876482,0.51839644,0.00018537065,0.00015481857,0.00034849418,0.00045381542,0.00021626201,0.019794865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.000060253056,0.000015023252,0.000045593173,0.000111140806,0.000027391083],"domain_scores_gemma":[0.9996636,0.00013235433,0.000022666858,0.00005330592,0.00010848449,0.000019684765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009134,0.0007222246,0.0010570397,0.000604015,0.00050104887,0.00088659563,0.001877403,0.001138348,0.005526848],"category_scores_gemma":[0.001123983,0.00037642627,0.0007744015,0.0009920346,0.00038358165,0.0008172971,0.0013105634,0.0008695356,0.0008991123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009026917,0.00007163142,0.00029707165,0.000093522685,0.00006328339,0.00006347808,0.000045802546,0.86410594,0.0016275304,0.005961645,0.0028510133,0.12472895],"study_design_scores_gemma":[0.000008515658,0.000019732935,0.00006367246,0.000004576384,0.000007053086,0.000013751762,0.0000060237635,0.99782616,0.00030743852,0.0011486885,0.00059108186,0.0000032743828],"about_ca_topic_score_codex":0.0030792872,"about_ca_topic_score_gemma":0.003918431,"teacher_disagreement_score":0.005526848,"about_ca_system_score_codex":0.00044898107,"about_ca_system_score_gemma":0.00062691193,"threshold_uncertainty_score":0.018489122},"labels":[],"label_agreement":null},{"id":"W4391306046","doi":"10.1109/smc53992.2023.10394458","title":"Compact NSGA-II for Multi-objective Feature Selection","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"","keywords":"Feature selection; Computer science; Metric (unit); Artificial intelligence; Selection (genetic algorithm); Evolutionary algorithm; Binary classification; Feature (linguistics); Population; Binary number; Task (project management); Data mining; Machine learning; Feature vector; Optimization problem; Compact space; Multi-objective optimization; Pattern recognition (psychology); Algorithm; Mathematics; Support vector machine; Engineering","score_opus":0.06181858722780776,"score_gpt":0.3416014521611343,"score_spread":0.27978286493332655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391306046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04272459,0.000501032,0.9507486,0.00022470148,0.00008986975,0.00032779225,0.00019513861,0.0006142601,0.004574023],"genre_scores_gemma":[0.52898127,0.0004546028,0.462083,0.00022563331,0.00004665487,0.002270334,0.00076913653,0.00015072736,0.0050185584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993318,0.00030871038,0.00004530741,0.000074564625,0.00017607611,0.000063530584],"domain_scores_gemma":[0.9987961,0.0007323557,0.00012725087,0.00008093141,0.00022320574,0.000040112584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012522008,0.0017005848,0.0011629066,0.0010046479,0.00042653,0.00081919454,0.0012888212,0.0011076042,0.003026951],"category_scores_gemma":[0.0033976922,0.0005150371,0.00093149696,0.0009443505,0.00060375803,0.00062722276,0.00091847224,0.0012382022,0.0004311697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042051575,0.000034400142,0.0003676005,0.00008821978,0.000038524864,0.00005293346,0.00004470774,0.9690196,0.0011143389,0.004071564,0.00087332056,0.02425267],"study_design_scores_gemma":[0.000018858727,0.000031229156,0.00012409803,0.000011881239,0.000008093421,0.000013805801,0.000009878312,0.99697626,0.00038365056,0.001600063,0.0008176166,0.000004572682],"about_ca_topic_score_codex":0.004857763,"about_ca_topic_score_gemma":0.004667789,"teacher_disagreement_score":0.004857763,"about_ca_system_score_codex":0.00094331,"about_ca_system_score_gemma":0.0014833877,"threshold_uncertainty_score":0.0101261735},"labels":[],"label_agreement":null},{"id":"W4391308277","doi":"10.1109/smc53992.2023.10394620","title":"Ranking Center-based NSGA-II","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Benchmark (surveying); Mathematical optimization; Cluster analysis; Multi-objective optimization; Computer science; Ranking (information retrieval); Evolutionary algorithm; Evolutionary computation; Sampling (signal processing); Pareto principle; Computation; Population; Optimization problem; Set (abstract data type); Algorithm; Mathematics; Machine learning","score_opus":0.019424780803398788,"score_gpt":0.27294786421223877,"score_spread":0.25352308340884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391308277","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.093415245,0.00083165104,0.8871284,0.0003113105,0.00020945232,0.00046408846,0.00028524714,0.001238874,0.016115759],"genre_scores_gemma":[0.7968519,0.00044872268,0.19232303,0.0002866775,0.000044026354,0.00068604073,0.00084050064,0.00015781698,0.008361438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990951,0.00033234188,0.000039740946,0.00010741604,0.0002987196,0.00012671632],"domain_scores_gemma":[0.9992829,0.00016378134,0.00006149032,0.00005254938,0.00038158096,0.00005772786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009687514,0.0013579865,0.0012174747,0.0009061283,0.00070998026,0.00082092854,0.0013953808,0.0006976836,0.0035121208],"category_scores_gemma":[0.0020076183,0.00028167316,0.00068854407,0.0007750036,0.00044951012,0.000563918,0.0007408913,0.0006642026,0.0006413709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001346516,0.00008141152,0.0011350329,0.00011643071,0.00006912259,0.000058910366,0.000053706422,0.9048276,0.0026310254,0.007924619,0.0047003245,0.078267194],"study_design_scores_gemma":[0.000023162687,0.000057640576,0.00022259148,0.000009375,0.00001332179,0.00001711043,0.000017512666,0.9954833,0.0011375677,0.0015486005,0.001459721,0.000010205953],"about_ca_topic_score_codex":0.010488329,"about_ca_topic_score_gemma":0.009976089,"teacher_disagreement_score":0.010488329,"about_ca_system_score_codex":0.0012681234,"about_ca_system_score_gemma":0.0020859952,"threshold_uncertainty_score":0.020854592},"labels":[],"label_agreement":null},{"id":"W4392704563","doi":"10.1287/ijoc.2021.0186","title":"A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; University of Alberta; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bounding overwatch; Dual (grammatical number); Mathematical optimization; Binary number; Quadratic equation; Mathematics; Quadratic programming; Computer science; Arithmetic; Artificial intelligence","score_opus":0.029879238130132633,"score_gpt":0.33712413251070306,"score_spread":0.3072448943805704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392704563","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.0018534551,0.00025950558,0.99229807,0.00018943258,0.000058972684,0.00003332631,0.00005405856,0.00012497349,0.005128275],"genre_scores_gemma":[0.18730819,0.00076839386,0.8026375,0.00037301853,0.00024304977,0.0003097964,0.00038853448,0.000499843,0.0074716746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984902,0.0005621627,0.00004602163,0.00019380818,0.0005430076,0.00016467688],"domain_scores_gemma":[0.9985116,0.00078415923,0.000113238784,0.00018690157,0.00029739,0.00010681757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022045476,0.0012727894,0.0009954429,0.00089761126,0.00057914865,0.0015823187,0.0017388859,0.00097178906,0.00848798],"category_scores_gemma":[0.005233087,0.0006008848,0.0010826982,0.0014287736,0.0012125307,0.0018091429,0.0024478692,0.0031539763,0.0014524914],"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.000086526685,0.00008635876,0.0004099018,0.00023218797,0.000037761765,0.0001326514,0.00012415955,0.5255317,0.0030555439,0.3628847,0.01143956,0.09597896],"study_design_scores_gemma":[0.000017141228,0.000026132839,0.000060530656,0.00003015589,0.000008945214,0.00003924257,0.0000145404965,0.9239019,0.0007899634,0.06917072,0.0059321634,0.00000855795],"about_ca_topic_score_codex":0.0023897986,"about_ca_topic_score_gemma":0.0023757662,"teacher_disagreement_score":0.00848798,"about_ca_system_score_codex":0.0014069236,"about_ca_system_score_gemma":0.0018478095,"threshold_uncertainty_score":0.028395116},"labels":[],"label_agreement":null},{"id":"W4393108629","doi":"10.48550/arxiv.2504.09930","title":"Multi-objective Bayesian Optimization With Mixed-categorical Design Variables for Expensive-to-evaluate Aeronautical Applications","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"Office National d'études et de Recherches Aérospatiales; European Commission","keywords":"Categorical variable; Bayesian optimization; Computer science; Bayesian probability; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.053877816185044725,"score_gpt":0.3173958982520774,"score_spread":0.2635180820670327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393108629","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.0049002487,0.00019197365,0.99368745,0.00008246335,0.000018192946,0.000025226484,0.0000240162,0.00009784607,0.00097248005],"genre_scores_gemma":[0.26667988,0.00036105973,0.7297028,0.00015400734,0.00005356376,0.0004084236,0.0002075358,0.0002129517,0.0022198523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.0010595082,0.000047770875,0.000105172185,0.00047680325,0.00007302314],"domain_scores_gemma":[0.99782795,0.0015337036,0.00017795482,0.00011505888,0.00026082984,0.00008447095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032675082,0.0011551298,0.0012706352,0.00085755374,0.0003648562,0.0010607787,0.0010151095,0.0014874041,0.0030386802],"category_scores_gemma":[0.0054148296,0.0006991416,0.0011125247,0.0008085793,0.00071771746,0.0006904309,0.001390168,0.0019674057,0.00052708917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055380504,0.0000560549,0.00031333597,0.00011618246,0.000036702957,0.000026415759,0.000021301175,0.9621933,0.0017766248,0.0121955,0.00043980547,0.022769324],"study_design_scores_gemma":[0.0000067658284,0.000023052251,0.000055013697,0.000008882148,0.0000034052046,0.0000063391817,0.0000028166082,0.9953614,0.000353998,0.0037319213,0.00044281114,0.0000037049751],"about_ca_topic_score_codex":0.0012397859,"about_ca_topic_score_gemma":0.0015526629,"teacher_disagreement_score":0.0032675082,"about_ca_system_score_codex":0.00069525035,"about_ca_system_score_gemma":0.0010903396,"threshold_uncertainty_score":0.01728046},"labels":[],"label_agreement":null},{"id":"W4393403568","doi":"10.2139/ssrn.4780792","title":"Experimental Design through an Optimization Lens","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Quest University Canada","funders":"","keywords":"Lens (geology); Computer science; Optics; Physics","score_opus":0.02382728496989278,"score_gpt":0.2960992441367749,"score_spread":0.2722719591668821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393403568","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.023246342,0.00016623054,0.9629573,0.000301345,0.00015664553,0.0010432889,0.00033228405,0.0016507494,0.010145759],"genre_scores_gemma":[0.1761124,0.00027567736,0.81148785,0.00029658285,0.000063637446,0.0023959535,0.00017050709,0.00046214627,0.008735159],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741614,0.00066034624,0.00018218049,0.00069495424,0.00082893536,0.00021746583],"domain_scores_gemma":[0.99775654,0.0009894868,0.0003726937,0.00039723617,0.00033755368,0.00014660489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002803764,0.0014925494,0.00086897076,0.00086312904,0.00079037907,0.0019380474,0.0014167259,0.0011335555,0.014425999],"category_scores_gemma":[0.00391466,0.0010559814,0.0007477782,0.0007762712,0.0012135364,0.0017246717,0.0021585084,0.0012413829,0.0022760308],"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.0026967798,0.00078642566,0.0014716659,0.0010899041,0.00012568926,0.00025327038,0.0003932398,0.057214636,0.705824,0.09213035,0.0034044941,0.13460949],"study_design_scores_gemma":[0.00096395676,0.0047542895,0.0029799188,0.00014061992,0.00020767258,0.0003075277,0.00020004083,0.27885148,0.6286952,0.02166197,0.06103006,0.00020733578],"about_ca_topic_score_codex":0.00071717874,"about_ca_topic_score_gemma":0.0007520839,"teacher_disagreement_score":0.014425999,"about_ca_system_score_codex":0.0014543649,"about_ca_system_score_gemma":0.0025288924,"threshold_uncertainty_score":0.048259735},"labels":[],"label_agreement":null},{"id":"W4396566994","doi":"10.23952/jnva.8.2024.4.03","title":"An inexact nonmonotone projected gradient method for constrained multiobjective optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"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":"Mathematical optimization; Multi-objective optimization; Computer science; Gradient method; Proximal Gradient Methods; Constrained optimization problem; Mathematics; Applied mathematics; Optimization problem; Gradient descent; Artificial intelligence; Artificial neural network","score_opus":0.012907212004415157,"score_gpt":0.3293124258374892,"score_spread":0.3164052138330741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396566994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018279026,0.00013771119,0.9960296,0.000059425965,0.00008105573,0.00002895185,0.000022065225,0.00007981301,0.001733486],"genre_scores_gemma":[0.1096924,0.0003822865,0.88140666,0.00019852008,0.0001297145,0.00032840014,0.00013456671,0.00019175024,0.007535734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.00022003808,0.000024627388,0.00005972702,0.00024302976,0.000023399878],"domain_scores_gemma":[0.99930906,0.00034485804,0.00004481315,0.000058784222,0.00019288746,0.000049638606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014240905,0.0010089278,0.0014351542,0.00052649714,0.0004544034,0.0010865586,0.0013509408,0.0017047605,0.004257295],"category_scores_gemma":[0.0024949068,0.0007271421,0.00075304275,0.0006577019,0.00089850975,0.0012590165,0.0018293418,0.0019010812,0.00078696257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014280398,0.0001312672,0.00025692047,0.0004987273,0.000109509885,0.0001740189,0.00011358019,0.7852315,0.005479224,0.054602396,0.0045588235,0.14870133],"study_design_scores_gemma":[0.0000074591526,0.000027466598,0.00003416937,0.000010822698,0.000004526306,0.000017910546,0.00000329837,0.9949419,0.00027176432,0.0034235436,0.0012517954,0.0000053744657],"about_ca_topic_score_codex":0.0017615384,"about_ca_topic_score_gemma":0.0022845783,"teacher_disagreement_score":0.004257295,"about_ca_system_score_codex":0.0003929671,"about_ca_system_score_gemma":0.0012559018,"threshold_uncertainty_score":0.014242053},"labels":[],"label_agreement":null},{"id":"W4396718738","doi":"10.48550/arxiv.2405.02983","title":"CVXSADes: a stochastic algorithm for constructing optimal exact regression designs with single or multiple objectives","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","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","keywords":"Computer science; Algorithm; Mathematical optimization; Regression; Mathematics; Statistics","score_opus":0.08872447866530268,"score_gpt":0.23605253591144282,"score_spread":0.14732805724614012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396718738","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.00095104246,0.000051859803,0.9980124,0.000033677337,0.000012776724,0.00004210904,0.000025465393,0.00042478912,0.000445825],"genre_scores_gemma":[0.027748503,0.0000993554,0.9705247,0.000075298965,0.000021303133,0.00039205127,0.00014192684,0.00017029436,0.000826522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982589,0.00070731604,0.000088427834,0.00025772932,0.00058393605,0.00010372311],"domain_scores_gemma":[0.99736613,0.0018005406,0.0002206263,0.00019937399,0.00034030646,0.000073005736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029519475,0.0015345986,0.0015286847,0.0017500586,0.0005748643,0.00092392985,0.001506871,0.0012796816,0.005419582],"category_scores_gemma":[0.0071032555,0.0011785603,0.0016050265,0.0012296548,0.0010166619,0.0008328378,0.0017041254,0.0021575287,0.0012457406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000180667,0.00009673073,0.00093155453,0.00027318354,0.000117460266,0.00007322497,0.000090007874,0.69698066,0.0036606374,0.04056872,0.004222183,0.25280505],"study_design_scores_gemma":[0.00008661014,0.0001131235,0.00012044275,0.000031525473,0.000018858304,0.00004279286,0.000013771106,0.97381026,0.0015344097,0.019424826,0.004786925,0.000016392818],"about_ca_topic_score_codex":0.0035790778,"about_ca_topic_score_gemma":0.0041358867,"teacher_disagreement_score":0.005419582,"about_ca_system_score_codex":0.0010252148,"about_ca_system_score_gemma":0.0032309315,"threshold_uncertainty_score":0.018130302},"labels":[],"label_agreement":null},{"id":"W4396829234","doi":"10.1007/s00158-024-03785-z","title":"High-dimensional mixed-categorical Gaussian processes with application to multidisciplinary design optimization for a green aircraft","year":2024,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Office National d'études et de Recherches Aérospatiales; European Commission","keywords":"Categorical variable; Hyperparameter; Bayesian optimization; Context (archaeology); Kriging; Dimensionality reduction; Mathematical optimization; Dimension (graph theory); Computer science; Gaussian process; Engineering design process; Reduction (mathematics); Gaussian; Machine learning; Artificial intelligence; Mathematics; Engineering","score_opus":0.01160922037110698,"score_gpt":0.2675283932445456,"score_spread":0.2559191728734386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396829234","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.028207617,0.00016316303,0.9701772,0.00020456954,0.00006240263,0.000029593975,0.000027693635,0.00007065192,0.0010571814],"genre_scores_gemma":[0.76661885,0.00032149913,0.22872259,0.00014824614,0.00009114412,0.00020190701,0.00009174192,0.00006187739,0.0037420387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914193,0.0004365133,0.000030018735,0.00010437576,0.00019866024,0.00008844091],"domain_scores_gemma":[0.99706596,0.0019248552,0.00023259361,0.00010705628,0.00045861307,0.00021099791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029709209,0.00093646615,0.0013112513,0.0010323746,0.0008451214,0.0015668224,0.001640458,0.0021645061,0.0013840147],"category_scores_gemma":[0.006076013,0.00055565365,0.0014313312,0.0013167365,0.0021172676,0.0011658436,0.002716255,0.0020900168,0.00017563718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006965813,0.00008461921,0.00072804367,0.00005777307,0.000031716623,0.000080868354,0.00007506619,0.9154381,0.0011886772,0.07334023,0.00026434968,0.008640907],"study_design_scores_gemma":[0.0000023919406,0.000007973341,0.000033547127,0.0000011750836,0.0000019933066,0.0000028447778,0.000004760327,0.99589974,0.00007923589,0.0039070533,0.00005626618,0.0000029692592],"about_ca_topic_score_codex":0.006866847,"about_ca_topic_score_gemma":0.007097467,"teacher_disagreement_score":0.006866847,"about_ca_system_score_codex":0.001093308,"about_ca_system_score_gemma":0.002027886,"threshold_uncertainty_score":0.015711904},"labels":[],"label_agreement":null},{"id":"W4396877656","doi":"10.1109/tem.2024.3399773","title":"Product Concept Development and Evaluation Using Multiagent Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Engineering Management","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"New product development; Reinforcement learning; Computer science; Product (mathematics); Engineering; Knowledge management; Manufacturing engineering; Artificial intelligence; Business; Marketing; Mathematics","score_opus":0.020888549429454305,"score_gpt":0.26316011754327406,"score_spread":0.24227156811381975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396877656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703059,0.00026696018,0.92689806,0.00018499835,0.00003642893,0.0004994563,0.000038733302,0.000757284,0.004287422],"genre_scores_gemma":[0.71380717,0.00012216173,0.2842139,0.00004691415,0.000011938233,0.0003762864,0.000078430465,0.00005737395,0.0012859277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941749,0.0029099518,0.00029779924,0.0005174575,0.0019277331,0.00017210019],"domain_scores_gemma":[0.9888833,0.005633149,0.0012542827,0.0008110492,0.0030564717,0.00036175188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007800727,0.0010512583,0.0009730417,0.0013541514,0.00043280533,0.0015406015,0.0013547763,0.00079842325,0.0019132129],"category_scores_gemma":[0.017458133,0.00039999993,0.00045911767,0.0005981432,0.0007067962,0.0014035011,0.0013746414,0.00089887285,0.0002845486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037113501,0.0005119844,0.0038100136,0.00025997288,0.00012420384,0.00014598716,0.00024627545,0.6997611,0.006306702,0.009110616,0.0011788489,0.27817315],"study_design_scores_gemma":[0.000030143125,0.00012141379,0.00030102348,0.000013289836,0.000010680955,0.000016383518,0.000019572668,0.9945152,0.0025322794,0.0020009074,0.0004277435,0.000011325977],"about_ca_topic_score_codex":0.0024938819,"about_ca_topic_score_gemma":0.002163037,"teacher_disagreement_score":0.007800727,"about_ca_system_score_codex":0.0018507668,"about_ca_system_score_gemma":0.0014964909,"threshold_uncertainty_score":0.0412547},"labels":[],"label_agreement":null},{"id":"W4396903002","doi":"10.1002/nme.7498","title":"A solution to the ill‐conditioning of gradient‐enhanced covariance matrices for Gaussian processes","year":2024,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Conditioning; Covariance; Gaussian; Applied mathematics; Mathematics; Covariance matrix; Statistical physics; Statistics; Physics","score_opus":0.023548986070546018,"score_gpt":0.3915172263562382,"score_spread":0.3679682402856922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396903002","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.0026068054,0.00019231177,0.99485683,0.00051660324,0.000087537606,0.000032908167,0.000063882115,0.0001745345,0.0014684775],"genre_scores_gemma":[0.1853905,0.000979046,0.7997744,0.00090981345,0.00042472794,0.00038031142,0.00048225015,0.00097151304,0.01068742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984798,0.0005741077,0.00008468169,0.0002757737,0.00042582216,0.00015991062],"domain_scores_gemma":[0.99215055,0.005444139,0.0004390027,0.0004084662,0.0012762342,0.00028152627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037302668,0.0016781728,0.0015014268,0.00088626076,0.000726203,0.0019741755,0.0014857535,0.0029019988,0.008284818],"category_scores_gemma":[0.019278895,0.0010859624,0.0015693838,0.0007544937,0.00252572,0.002170459,0.0035583153,0.0048756097,0.0010635711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011421159,0.00007741264,0.00082097796,0.00036664304,0.00008674899,0.0003092545,0.00024977195,0.734448,0.0043462627,0.21063778,0.009143962,0.03939895],"study_design_scores_gemma":[0.000012095344,0.000014925506,0.00010039168,0.000027380773,0.000006323009,0.000033826094,0.000013709233,0.96607643,0.0006664327,0.03143685,0.0015966764,0.000014864778],"about_ca_topic_score_codex":0.009122568,"about_ca_topic_score_gemma":0.007952002,"teacher_disagreement_score":0.009122568,"about_ca_system_score_codex":0.0014692324,"about_ca_system_score_gemma":0.004525999,"threshold_uncertainty_score":0.027715445},"labels":[],"label_agreement":null},{"id":"W4397005521","doi":"10.1007/s11425-023-2302-9","title":"Gradient-based algorithms for multi-objective bi-level optimization","year":2024,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"","keywords":"Computer science; Optimization algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.05965773506906244,"score_gpt":0.335359040844253,"score_spread":0.2757013057751906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397005521","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.0010582143,0.00023629963,0.9971209,0.00006926167,0.000040817216,0.000030151545,0.000015511641,0.00014596507,0.0012828968],"genre_scores_gemma":[0.09632522,0.00045199489,0.8980334,0.00015195202,0.00007131892,0.0004482063,0.00015440129,0.00033830677,0.0040253294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00046746474,0.00006019693,0.00009527467,0.00041100665,0.000078638084],"domain_scores_gemma":[0.9980983,0.0011006531,0.000117092364,0.00013238349,0.00046826003,0.0000832673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028033094,0.0016946654,0.002082501,0.001408415,0.00080243294,0.001562975,0.0024451285,0.0020475832,0.005080343],"category_scores_gemma":[0.006552161,0.001030568,0.0011853549,0.0022212625,0.0010903832,0.0018654873,0.0025399462,0.003287639,0.0016119964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376877,0.00009993302,0.00022762107,0.0002072035,0.00008596143,0.000032508728,0.00006268462,0.8409004,0.0012482988,0.042659655,0.003022931,0.11135899],"study_design_scores_gemma":[0.000008543435,0.000011162235,0.00002340447,0.000007256786,0.000003831804,0.0000042811653,0.0000025997501,0.9937453,0.00013376752,0.0055111116,0.0005451254,0.0000035183307],"about_ca_topic_score_codex":0.005503177,"about_ca_topic_score_gemma":0.004541408,"teacher_disagreement_score":0.005503177,"about_ca_system_score_codex":0.0013005963,"about_ca_system_score_gemma":0.0018316626,"threshold_uncertainty_score":0.01699543},"labels":[],"label_agreement":null},{"id":"W4399858594","doi":"10.1007/s10589-024-00590-8","title":"Q-fully quadratic modeling and its application in a random subspace derivative-free method","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Subspace topology; Derivative (finance); Quadratic equation; Applied mathematics; Quadratic model; Mathematical optimization; Combinatorics; Mathematical analysis; Statistics; Geometry","score_opus":0.01475561811600928,"score_gpt":0.30298641349624533,"score_spread":0.28823079538023605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399858594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016808197,0.00011722615,0.99690574,0.00011818759,0.000034023877,0.000014141582,0.000019900916,0.00013354441,0.0009764115],"genre_scores_gemma":[0.22921355,0.00050027116,0.75734913,0.00033614773,0.00012552935,0.00022189123,0.00022425069,0.0005516477,0.011477617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00038385976,0.00002489337,0.000075739445,0.0001735099,0.00003290434],"domain_scores_gemma":[0.9986106,0.0007773334,0.00007899432,0.00016661063,0.00029093598,0.00007541056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022723414,0.0007147023,0.0010065425,0.00040433847,0.00047131634,0.000780014,0.0016616422,0.0015563472,0.0035518087],"category_scores_gemma":[0.0042124866,0.0005367602,0.0007185586,0.0006639017,0.0009754614,0.0014384846,0.0018000493,0.00134785,0.0010680477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010518201,0.000100601304,0.00025575384,0.00020077603,0.000056818004,0.000078764984,0.00008176317,0.78249526,0.004690867,0.15486845,0.003411424,0.05365434],"study_design_scores_gemma":[0.000002621294,0.000008572854,0.000015986474,0.000002748319,0.0000018735294,0.000005851294,0.0000012839216,0.99462295,0.00020415128,0.0046085087,0.00052121363,0.0000042725615],"about_ca_topic_score_codex":0.0031976723,"about_ca_topic_score_gemma":0.0028752882,"teacher_disagreement_score":0.0035518087,"about_ca_system_score_codex":0.0003851949,"about_ca_system_score_gemma":0.0012273133,"threshold_uncertainty_score":0.012017429},"labels":[],"label_agreement":null},{"id":"W4400678945","doi":"10.1109/tro.2024.3428990","title":"Regret-Based Sampling of Pareto Fronts for Multiobjective Robot Planning Problems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Regret; Pareto principle; Multi-objective optimization; Robot; Computer science; Sampling (signal processing); Mathematical optimization; Pareto optimal; Motion planning; Artificial intelligence; Mathematics; Machine learning; Computer vision","score_opus":0.05610988369127533,"score_gpt":0.3238587836040615,"score_spread":0.26774889991278616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400678945","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.016361302,0.0003936932,0.98001647,0.00025288152,0.000041001316,0.000095975134,0.00005671996,0.00040335118,0.0023784288],"genre_scores_gemma":[0.53104556,0.00038093943,0.463917,0.00038255076,0.00012547766,0.0004222589,0.00044511343,0.0002921859,0.0029889033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795604,0.0010454194,0.00008193053,0.00020545462,0.0005072274,0.00020380657],"domain_scores_gemma":[0.99331516,0.0048125004,0.0004544907,0.00043005042,0.00068839605,0.00029941098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005237808,0.0016550733,0.001856139,0.0011240686,0.0008708817,0.001310081,0.0018032101,0.0015566864,0.0030156674],"category_scores_gemma":[0.01264614,0.0008915038,0.0010665816,0.0009702769,0.0013815187,0.0013935554,0.0018669359,0.0023693047,0.00061161915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080245285,0.000044702814,0.00045819487,0.00005477354,0.000027586711,0.000035902427,0.00002788864,0.9725001,0.0005061386,0.008655253,0.00086989667,0.016739395],"study_design_scores_gemma":[0.000007983781,0.000013236444,0.000038263137,0.000005084692,0.0000021741887,0.000004859303,0.0000035267522,0.99610114,0.00014479327,0.0035606844,0.00011626668,0.0000020517932],"about_ca_topic_score_codex":0.0038449832,"about_ca_topic_score_gemma":0.0049727876,"teacher_disagreement_score":0.005237808,"about_ca_system_score_codex":0.002175376,"about_ca_system_score_gemma":0.0018970347,"threshold_uncertainty_score":0.027700484},"labels":[],"label_agreement":null},{"id":"W4400689395","doi":"10.1007/s10589-024-00588-2","title":"Handling of constraints in multiobjective blackbox optimization","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"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; HEC Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Universidade Nova de Lisboa; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Multi-objective optimization","score_opus":0.00938289075054676,"score_gpt":0.27438086545607177,"score_spread":0.264997974705525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400689395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012888791,0.00029378087,0.9831836,0.00015120323,0.00008014437,0.00003780185,0.00002796005,0.00010670208,0.0032299215],"genre_scores_gemma":[0.62029684,0.00044312855,0.37115404,0.00024064525,0.000106805834,0.0002753289,0.00009057788,0.00032653814,0.00706612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.00043027854,0.000024476592,0.00007921777,0.00016974965,0.000060937262],"domain_scores_gemma":[0.9980313,0.0014297744,0.00014997488,0.00013357807,0.00015728,0.000097985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022800842,0.0008957496,0.0014760147,0.00044297666,0.0006864223,0.0015587921,0.0011652047,0.0014295242,0.004775952],"category_scores_gemma":[0.007327109,0.0006773043,0.0005456819,0.00057440856,0.0007668702,0.0019183935,0.0017268971,0.0015042716,0.00037703718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104066814,0.00005801749,0.0002101029,0.0001488451,0.000047448197,0.000121021396,0.000053268028,0.92458916,0.0019670276,0.041689858,0.0013002951,0.029710835],"study_design_scores_gemma":[0.000007794959,0.000013128083,0.000030538817,0.000010678145,0.000003890852,0.0000107044325,0.000005954539,0.9858279,0.000470228,0.013176996,0.00043902211,0.0000030366266],"about_ca_topic_score_codex":0.0010291792,"about_ca_topic_score_gemma":0.0009295935,"teacher_disagreement_score":0.004775952,"about_ca_system_score_codex":0.00038789373,"about_ca_system_score_gemma":0.000645056,"threshold_uncertainty_score":0.015977144},"labels":[],"label_agreement":null},{"id":"W4400887229","doi":"10.1063/5.0214337","title":"Optimization framework for multi-fidelity surrogate model based on adaptive addition strategy—A case study of self-excited oscillation cavity","year":2024,"lang":"en","type":"article","venue":"Physics of Fluids","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Physics; Oscillation (cell signaling); Excited state; Fidelity; Self-oscillation; Statistical physics; Quantum electrodynamics; Applied mathematics; Quantum mechanics","score_opus":0.05778049419117064,"score_gpt":0.3347453272227133,"score_spread":0.2769648330315426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018407356,0.00020520545,0.97788185,0.00017255214,0.000017173825,0.000037818125,0.000037092,0.00008045301,0.0031604993],"genre_scores_gemma":[0.8199898,0.00033965852,0.17509787,0.0000843482,0.000022309907,0.00032648008,0.000137444,0.00007379389,0.00392825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.00014673479,0.000015754022,0.00005904371,0.00011335596,0.000041182528],"domain_scores_gemma":[0.9994854,0.0002846318,0.00006254493,0.000037168666,0.00010256541,0.000027610084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013918517,0.0007561399,0.00088143145,0.0005021361,0.00043865942,0.000915989,0.00090343563,0.0012544164,0.0014081374],"category_scores_gemma":[0.0016843468,0.00040055535,0.0009401377,0.00041724098,0.00065418176,0.0007977985,0.0011110097,0.00094502914,0.00013928555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011737442,0.00001179712,0.00026060018,0.00002770348,0.000009119925,0.0000481432,0.000017518783,0.98889774,0.0010064159,0.0062702936,0.00011751425,0.0033214865],"study_design_scores_gemma":[0.0000016767509,0.0000087248445,0.000029752911,0.000001955201,0.0000015799518,0.0000073218193,0.0000030482731,0.9990545,0.0001263071,0.00063896587,0.0001244171,0.0000017656829],"about_ca_topic_score_codex":0.003731855,"about_ca_topic_score_gemma":0.0020351007,"teacher_disagreement_score":0.003731855,"about_ca_system_score_codex":0.0005653743,"about_ca_system_score_gemma":0.00091344456,"threshold_uncertainty_score":0.007420242},"labels":[],"label_agreement":null},{"id":"W4401397640","doi":"10.1007/978-981-97-3820-5_40","title":"Overcoming Constraints: The Critical Role of Penalty Functions as Constraint-Handling Methods in Structural Optimization","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Constraint (computer-aided design); Penalty method; Mathematical optimization; Computer science; Mathematics","score_opus":0.01986767899879309,"score_gpt":0.3384124223212969,"score_spread":0.3185447433225038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401397640","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.0019672732,0.0057216804,0.95871043,0.0014215113,0.0005429925,0.000028380962,0.00005178615,0.0002492318,0.031306777],"genre_scores_gemma":[0.081535734,0.015134653,0.8423319,0.0013862131,0.0014058249,0.00019641661,0.0001903539,0.0012781469,0.056540705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992872,0.00021358923,0.00002423638,0.000075997246,0.00036291959,0.00003612884],"domain_scores_gemma":[0.99850607,0.0010453289,0.00008022738,0.00013822537,0.000174945,0.000055147466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012976576,0.0014953804,0.00093423465,0.0007275996,0.0006135374,0.0027732723,0.0019281995,0.0017246791,0.0073862006],"category_scores_gemma":[0.004833583,0.0006775328,0.00051739253,0.0016638024,0.0024975436,0.0044578905,0.0017242669,0.004984558,0.0022582244],"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.00003901596,0.00005008382,0.000084291605,0.00036564594,0.000028365152,0.0000502461,0.00011327497,0.10044929,0.0033059504,0.6400776,0.02600898,0.22942731],"study_design_scores_gemma":[0.0000126783425,0.000031969823,0.000110620815,0.00014427537,0.00001293606,0.00007534595,0.000036984347,0.3546124,0.0018432795,0.58010805,0.06297798,0.00003346328],"about_ca_topic_score_codex":0.0011281719,"about_ca_topic_score_gemma":0.0015052317,"teacher_disagreement_score":0.0073862006,"about_ca_system_score_codex":0.00049187377,"about_ca_system_score_gemma":0.00081250013,"threshold_uncertainty_score":0.024709344},"labels":[],"label_agreement":null},{"id":"W4401970555","doi":"10.2139/ssrn.4939115","title":"Population-Level Center-Based Sampling for Meta-Heuristic Algorithms","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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; Ontario Tech University; Brock University","funders":"","keywords":"Meta heuristic; Center (category theory); Heuristic; Sampling (signal processing); Computer science; Population; Algorithm; Mathematics; Artificial intelligence; Medicine; Computer vision","score_opus":0.07654958494798271,"score_gpt":0.3386249083362406,"score_spread":0.2620753233882579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401970555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00967821,0.00022290376,0.9879268,0.00011050375,0.00005242267,0.00014060683,0.00003955788,0.00025950745,0.0015695405],"genre_scores_gemma":[0.35957956,0.00032998182,0.635057,0.0003636685,0.00013292796,0.0013019781,0.00042910536,0.00027688403,0.0025289215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969463,0.0019831634,0.00007529363,0.00023386792,0.00058265124,0.00017861044],"domain_scores_gemma":[0.989611,0.007443116,0.0003272155,0.00075688807,0.0015813718,0.00028035886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066720406,0.000959981,0.0022448292,0.0016648442,0.0012110047,0.0012749565,0.0033160914,0.0019159346,0.003786076],"category_scores_gemma":[0.022450292,0.00104616,0.0012354249,0.0017759096,0.0012516094,0.0016351052,0.0021816003,0.0027011647,0.0006528576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000278751,0.00028202473,0.0017784126,0.00015302244,0.0001498465,0.00007110438,0.00014255224,0.8560827,0.0012314187,0.0512388,0.0038163057,0.08477504],"study_design_scores_gemma":[0.000028499622,0.000037505586,0.00006352188,0.000008090177,0.000010196916,0.000008789696,0.000007352939,0.99323225,0.00026941538,0.0059914845,0.0003389057,0.00000397549],"about_ca_topic_score_codex":0.0042950953,"about_ca_topic_score_gemma":0.00422836,"teacher_disagreement_score":0.0066720406,"about_ca_system_score_codex":0.0014184795,"about_ca_system_score_gemma":0.0021492878,"threshold_uncertainty_score":0.035285532},"labels":[],"label_agreement":null},{"id":"W4402028590","doi":"10.1609/aaai.v39i25.34894","title":"Scenario-Based Robust Optimization of Tree Structures","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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 International Peace and Security","funders":"Agence Nationale de la Recherche","keywords":"Regret; Mathematics; Huffman coding; Binary search tree; Tree (set theory); Combinatorics; Time complexity; Upper and lower bounds; Context (archaeology); Discrete mathematics; Algorithm; Computer science; Binary tree; Data compression; Statistics","score_opus":0.048309295751383735,"score_gpt":0.29297862948640047,"score_spread":0.24466933373501673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402028590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018079754,0.00032023113,0.97667605,0.00040400942,0.000037263755,0.0000901154,0.00025250457,0.00018804675,0.00395191],"genre_scores_gemma":[0.66028446,0.0008306832,0.33365613,0.0002862657,0.00008870627,0.00041155287,0.00068540324,0.00024807805,0.0035086707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978332,0.0010155935,0.000062440944,0.00035006515,0.00042809677,0.00031059398],"domain_scores_gemma":[0.9928893,0.0052852873,0.0006113522,0.00044140505,0.00043906362,0.00033349296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032764317,0.0013041676,0.0014855334,0.0010284676,0.0005607693,0.0020311263,0.0018284249,0.0015727773,0.0042226757],"category_scores_gemma":[0.012487706,0.0006696768,0.0013290017,0.0016420488,0.0013552784,0.003419105,0.0018652653,0.002303404,0.00048500946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034629185,0.000028744766,0.00016751274,0.000041822306,0.00002489636,0.000032383337,0.000021005504,0.96175414,0.00039986137,0.03064581,0.0006486233,0.0062005795],"study_design_scores_gemma":[0.0000091774455,0.0000405891,0.000068608155,0.000010542574,0.000006885071,0.000022193848,0.000016939413,0.9604341,0.0002835145,0.038453188,0.0006472646,0.0000069322714],"about_ca_topic_score_codex":0.0022636522,"about_ca_topic_score_gemma":0.0019114681,"teacher_disagreement_score":0.0042226757,"about_ca_system_score_codex":0.002391036,"about_ca_system_score_gemma":0.0019419731,"threshold_uncertainty_score":0.01734829},"labels":[],"label_agreement":null},{"id":"W4402147782","doi":"","title":"A study of quadratic search step formulations for multiobjective derivative free optimization","year":2022,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Derivative (finance); Mathematical optimization; Quadratic equation; Mathematics; Quadratic model; Computer science; Multi-objective optimization; Statistics; Response surface methodology","score_opus":0.020547317540403242,"score_gpt":0.26551070040638397,"score_spread":0.24496338286598074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402147782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012849188,0.0008723818,0.96809655,0.0004640357,0.00012343495,0.0000988877,0.000039525232,0.00005027248,0.017405737],"genre_scores_gemma":[0.5384207,0.0016958781,0.42743257,0.0005041605,0.00021723755,0.00048877165,0.00017160486,0.00038002626,0.030689014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922943,0.00046223105,0.000024707668,0.00005544961,0.00019263715,0.000035669684],"domain_scores_gemma":[0.9947514,0.0044511836,0.00017362938,0.00014519942,0.00038346156,0.00009515402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033253075,0.0011544928,0.00074399315,0.00054071384,0.00039487664,0.0012377971,0.001198149,0.0013358231,0.0066459435],"category_scores_gemma":[0.010121135,0.0005099752,0.00091399736,0.0008489386,0.00091460237,0.0014936201,0.0011295027,0.0022588132,0.00038766363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011772788,0.00016880168,0.00027491638,0.0005394516,0.0000617596,0.00014286814,0.00017586276,0.73012245,0.0020921878,0.22375487,0.0031474803,0.039401665],"study_design_scores_gemma":[0.000010477101,0.00007741382,0.000069653994,0.000022893697,0.000008528959,0.00001974183,0.000011581465,0.9812042,0.00025693883,0.017218737,0.001094716,0.0000050233157],"about_ca_topic_score_codex":0.0012787294,"about_ca_topic_score_gemma":0.0012212268,"teacher_disagreement_score":0.0066459435,"about_ca_system_score_codex":0.00067044573,"about_ca_system_score_gemma":0.0008789197,"threshold_uncertainty_score":0.02223289},"labels":[],"label_agreement":null},{"id":"W4402474870","doi":"10.1109/ccece59415.2024.10667108","title":"Surrogate-Assisted Multi-Objective Design Optimization of a Lorentz Force Actuator","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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 Institute for Nanotechnology; National Research Council Canada; University of Manitoba","funders":"National Research Council","keywords":"Surrogate model; Lorentz force; Actuator; Computer science; Multi-objective optimization; Mathematical optimization; Control theory (sociology); Physics; Mathematics; Artificial intelligence; Magnetic field; Control (management)","score_opus":0.03271863339698354,"score_gpt":0.2882338698910352,"score_spread":0.25551523649405167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06607161,0.00026790277,0.92676175,0.00022255443,0.000042788968,0.000060650887,0.00009469962,0.00023590312,0.0062420922],"genre_scores_gemma":[0.7246629,0.00024437506,0.27016056,0.00012081496,0.000016028516,0.00035612847,0.00025320705,0.000093457274,0.0040924866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995994,0.0001973326,0.000015381085,0.00003940135,0.00011408641,0.00003447683],"domain_scores_gemma":[0.99886227,0.0007403633,0.00011841526,0.00006956655,0.000166509,0.00004293873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014782569,0.0007451767,0.0007747126,0.00045103088,0.0002706128,0.0007152921,0.0004927569,0.0011744105,0.0016846556],"category_scores_gemma":[0.0022024496,0.0003818237,0.0007449566,0.0003480069,0.0005391938,0.00041093805,0.00066994625,0.0007803228,0.00029931427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024145626,0.000018593139,0.00013009406,0.000030474419,0.000009077142,0.000019087507,0.000009984961,0.99359435,0.001567156,0.0012537703,0.00009879542,0.0032445744],"study_design_scores_gemma":[0.000002970093,0.000022585378,0.000033241027,0.000002762181,0.0000014268096,0.0000037758211,0.0000020389066,0.9990621,0.00043683784,0.00029565676,0.00013496412,0.000001689109],"about_ca_topic_score_codex":0.0009836232,"about_ca_topic_score_gemma":0.0009250115,"teacher_disagreement_score":0.0016846556,"about_ca_system_score_codex":0.00035477223,"about_ca_system_score_gemma":0.0010314982,"threshold_uncertainty_score":0.007817864},"labels":[],"label_agreement":null},{"id":"W4402475374","doi":"10.1109/ccece59415.2024.10667327","title":"Exploring Long-term Memory in Evolutionary Multi-objective Algorithms: A Case Study with NSGA-III","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Term (time); Computer science; Algorithm; Evolutionary algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.07021689969061078,"score_gpt":0.31114488042521227,"score_spread":0.24092798073460148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475374","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.890965,0.003023182,0.09151408,0.0010610702,0.00011034458,0.00019483951,0.00029754988,0.0002695707,0.0125643965],"genre_scores_gemma":[0.9512441,0.0005359237,0.045796163,0.00014463201,0.000017049528,0.00013409548,0.00019973786,0.000035852678,0.0018924881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.00032150192,0.00003091746,0.00004877665,0.000097426164,0.00008648379],"domain_scores_gemma":[0.99699485,0.002393152,0.00013090845,0.00013878303,0.0002476594,0.000094714036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021818494,0.0009828199,0.0009297378,0.0006734703,0.00049579464,0.00097498763,0.0010816205,0.0012677388,0.0011754854],"category_scores_gemma":[0.004054665,0.00027055552,0.00063638255,0.00088515395,0.0006196559,0.00068035204,0.0007373706,0.00125364,0.00011564002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011545518,0.00018058084,0.0024561558,0.00016126437,0.00007024381,0.00016531647,0.00006890621,0.9760206,0.00038517918,0.0026318019,0.000723318,0.017021334],"study_design_scores_gemma":[0.00004273787,0.00020303273,0.0009229628,0.000038312497,0.00002499765,0.00003752395,0.000106218984,0.9950329,0.00067112176,0.0019139851,0.0009965855,0.000009563238],"about_ca_topic_score_codex":0.01049838,"about_ca_topic_score_gemma":0.014237756,"teacher_disagreement_score":0.01049838,"about_ca_system_score_codex":0.0008445064,"about_ca_system_score_gemma":0.0011637422,"threshold_uncertainty_score":0.02087456},"labels":[],"label_agreement":null},{"id":"W4402687508","doi":"10.2514/6.2024-4405","title":"Gradient-Enhanced Bayesian Optimization With Application to Aerodynamic Shape Optimization","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Bayesian optimization; Aerodynamics; Computer science; Bayesian probability; Shape optimization; Mathematical optimization; Artificial intelligence; Mathematics; Aerospace engineering; Engineering; Finite element method; Structural engineering","score_opus":0.004667329597921192,"score_gpt":0.2387497747661841,"score_spread":0.2340824451682629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402687508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012300963,0.00015259544,0.9969837,0.00009979004,0.000017187496,0.000012041242,0.000012702934,0.00012268066,0.0013691871],"genre_scores_gemma":[0.19053863,0.0009265534,0.80154306,0.00025474874,0.00011649053,0.00022115021,0.00015997297,0.0005171733,0.0057222294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992662,0.00030550372,0.00002622285,0.00006921753,0.0002951714,0.000037736423],"domain_scores_gemma":[0.998676,0.00075239746,0.00012800428,0.00009959328,0.00028394684,0.000060019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018036807,0.0010059025,0.0010599172,0.00061093376,0.0004061559,0.00078451383,0.00078404445,0.0014207555,0.0027666471],"category_scores_gemma":[0.0052432544,0.00068667805,0.0008180821,0.00063025067,0.0010624531,0.0010457907,0.0016790599,0.0019032675,0.0009149846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039496397,0.00002802579,0.00023037354,0.000100194084,0.000028586206,0.000045960693,0.000051772116,0.9108589,0.0039029107,0.04554999,0.0013619293,0.037801795],"study_design_scores_gemma":[0.000004493178,0.00001112938,0.000039326267,0.000008339663,0.0000026051187,0.000011200688,0.0000022265767,0.99179876,0.000506537,0.006605934,0.001003325,0.0000060777625],"about_ca_topic_score_codex":0.003715635,"about_ca_topic_score_gemma":0.003923973,"teacher_disagreement_score":0.003715635,"about_ca_system_score_codex":0.0007141689,"about_ca_system_score_gemma":0.001441065,"threshold_uncertainty_score":0.009538889},"labels":[],"label_agreement":null},{"id":"W4402835221","doi":"10.1109/icmmt61774.2024.10672001","title":"Recent Advances in Surrogate-Assisted Optimization Techniques Using Feature and Feature Sensitivity for Microwave Filter Design","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Sensitivity (control systems); Feature (linguistics); Computer science; Filter (signal processing); Pattern recognition (psychology); Microwave; Artificial intelligence; Surrogate model; Electronic engineering; Machine learning; Engineering; Computer vision; Telecommunications","score_opus":0.027975088047102373,"score_gpt":0.29946892601127467,"score_spread":0.2714938379641723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402835221","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.00357052,0.00061629515,0.9939499,0.00009976287,0.000025671998,0.000008909091,0.000011897784,0.0001453529,0.001571794],"genre_scores_gemma":[0.21301839,0.0031194873,0.7794054,0.00018998532,0.00015494398,0.00014357937,0.00020404796,0.00032355968,0.0034406392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994512,0.0002084549,0.000035498535,0.000057050824,0.00022921753,0.000018580959],"domain_scores_gemma":[0.99872005,0.0007744028,0.00013176164,0.0001266743,0.00021726245,0.000029829165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012228615,0.001098674,0.0008459307,0.0006219234,0.00021383024,0.0006892781,0.0006734225,0.0007952956,0.0016734096],"category_scores_gemma":[0.0030374047,0.00046164633,0.0010401624,0.0008685672,0.0004611665,0.0008282106,0.00067633926,0.0011524947,0.0005172796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056280536,0.000059265105,0.00048369574,0.00025328426,0.0001045296,0.000055934917,0.000056539193,0.8457143,0.009944138,0.015586607,0.0011374903,0.12654792],"study_design_scores_gemma":[0.000005415497,0.00003856566,0.00010690384,0.000011907965,0.000010043946,0.00003240383,0.0000037940692,0.9917824,0.0017873197,0.003354809,0.002858164,0.000008245118],"about_ca_topic_score_codex":0.0006148967,"about_ca_topic_score_gemma":0.00077248045,"teacher_disagreement_score":0.0016734096,"about_ca_system_score_codex":0.0002434412,"about_ca_system_score_gemma":0.0004268271,"threshold_uncertainty_score":0.006467223},"labels":[],"label_agreement":null},{"id":"W4403059377","doi":"10.1080/08982112.2024.2410012","title":"A review of leveraged sample selection in variation reduction projects","year":2024,"lang":"en","type":"review","venue":"Quality Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Selection (genetic algorithm); Sample (material); Variation (astronomy); Reduction (mathematics); Business; Engineering; Statistics; Operations management; Manufacturing engineering; Computer science; Mathematics; Artificial intelligence; Chemistry","score_opus":0.07500702337839112,"score_gpt":0.3798421957638481,"score_spread":0.304835172385457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403059377","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.00041344087,0.98776746,0.0075506493,0.00068924,0.00020685552,0.00007140287,0.00009972705,0.000040973708,0.003160379],"genre_scores_gemma":[0.005393578,0.9845664,0.008027872,0.0004317244,0.00035564465,0.00012310107,0.00015960129,0.000027754098,0.000914267],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99560106,0.0017418609,0.00056561735,0.0005995396,0.001358699,0.0001331781],"domain_scores_gemma":[0.9728969,0.021870296,0.001519991,0.000618721,0.0028016376,0.0002924155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008881238,0.0014231062,0.0021640891,0.0055389376,0.0005812434,0.0024395254,0.002351551,0.0019255384,0.0064165615],"category_scores_gemma":[0.024578419,0.000951687,0.0018438648,0.009612961,0.0010414087,0.0025690554,0.0012254642,0.0016351847,0.0024469912],"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.000083871615,0.00010079222,0.0012084811,0.034260713,0.0003288244,0.00012759364,0.00015845399,0.0030446385,0.0004563255,0.014380552,0.01463968,0.93121004],"study_design_scores_gemma":[0.000055051012,0.0005003642,0.004293058,0.033486083,0.00093522173,0.00089772715,0.00023208463,0.002842843,0.0013630976,0.015091806,0.9401854,0.000117223615],"about_ca_topic_score_codex":0.0039432,"about_ca_topic_score_gemma":0.0050574807,"teacher_disagreement_score":0.008881238,"about_ca_system_score_codex":0.0014672735,"about_ca_system_score_gemma":0.0041242954,"threshold_uncertainty_score":0.046969056},"labels":[],"label_agreement":null},{"id":"W4403088095","doi":"10.1016/j.swevo.2024.101742","title":"A comparative study of evolutionary algorithms and particle swarm optimization approaches for constrained multi-objective optimization problems","year":2024,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":16,"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; Metaheuristic; Multi-swarm optimization; Particle swarm optimization; Mathematical optimization; Evolutionary algorithm; Imperialist competitive algorithm; Algorithm; Multi-objective optimization; Meta-optimization; Derivative-free optimization; Optimization algorithm; Parallel metaheuristic; Artificial intelligence; Machine learning; Mathematics","score_opus":0.05117202170374641,"score_gpt":0.2966133150463342,"score_spread":0.2454412933425878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093242384,0.11694547,0.7309185,0.0022540179,0.0005622612,0.00035400176,0.00012757098,0.0002557116,0.055340074],"genre_scores_gemma":[0.4955162,0.07439662,0.42293924,0.00060408894,0.0003643781,0.0003305064,0.00034170336,0.00009417711,0.0054130303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798334,0.0008034862,0.00015240852,0.00018020612,0.00079925073,0.00008129431],"domain_scores_gemma":[0.99739635,0.0017466103,0.00013878357,0.000098621626,0.00056615414,0.000053489406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483358,0.0011763957,0.0010072332,0.0020872015,0.00054499344,0.0016318253,0.00091949716,0.0013295448,0.0014073832],"category_scores_gemma":[0.0062215608,0.000326246,0.0011174264,0.0034343419,0.00055588776,0.0023752463,0.00077723636,0.0011625849,0.00020804629],"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.00018891858,0.00029208983,0.003819643,0.001502916,0.00045773096,0.00025345857,0.00024189937,0.4712007,0.0016467993,0.04420607,0.003173877,0.47301596],"study_design_scores_gemma":[0.00006305541,0.00053183455,0.004545319,0.000593452,0.00022783439,0.0004287731,0.00035986345,0.94532555,0.0017689803,0.015918195,0.030177511,0.00005961956],"about_ca_topic_score_codex":0.0027142083,"about_ca_topic_score_gemma":0.0023358993,"teacher_disagreement_score":0.0029483358,"about_ca_system_score_codex":0.000764798,"about_ca_system_score_gemma":0.0010686533,"threshold_uncertainty_score":0.015592456},"labels":[],"label_agreement":null},{"id":"W4403430192","doi":"10.1145/3638530.3664091","title":"Parallel Co-Evolutionary Algorithm and Implementation on CPU-GPU Multicore","year":2024,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Advanced Multi-Objective Optimization Algorithms","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","keywords":"Computer science; Parallel computing; Multi-core processor; CUDA; General-purpose computing on graphics processing units; Operating system; Graphics","score_opus":0.019496839192251866,"score_gpt":0.2871141515943981,"score_spread":0.26761731240214626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403430192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074685834,0.0007012197,0.899317,0.00028672942,0.00022386094,0.00015412277,0.00023029603,0.0050627,0.019338185],"genre_scores_gemma":[0.3465615,0.00032259335,0.6428891,0.000119634075,0.000025751548,0.0003040367,0.0006501406,0.0003127732,0.008814482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967146,0.00006758478,0.000023180903,0.000069122085,0.00011106849,0.00005753152],"domain_scores_gemma":[0.99959224,0.0000632936,0.000022996668,0.000105732426,0.00019003254,0.000025695013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038356392,0.00048375013,0.0004471852,0.00043649581,0.0004874332,0.00072153116,0.00116756,0.0005474104,0.004540173],"category_scores_gemma":[0.0011683145,0.00023651705,0.00051870453,0.0009264563,0.00021608823,0.0006102779,0.00049240055,0.00060167245,0.0011093239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038234054,0.00027737653,0.0053205835,0.000264668,0.00021476454,0.00047239463,0.00019933436,0.52473485,0.032493863,0.024835544,0.013069021,0.39773533],"study_design_scores_gemma":[0.00004952676,0.000071120754,0.0007372696,0.000009508739,0.000022944761,0.000111922156,0.000030620613,0.9785487,0.0073785656,0.002992744,0.010035723,0.000011350684],"about_ca_topic_score_codex":0.007701742,"about_ca_topic_score_gemma":0.006661178,"teacher_disagreement_score":0.007701742,"about_ca_system_score_codex":0.00049482135,"about_ca_system_score_gemma":0.0010641386,"threshold_uncertainty_score":0.015313864},"labels":[],"label_agreement":null},{"id":"W4403527956","doi":"10.1088/1402-4896/ad88b1","title":"Deep optimal experimental design for parameter estimation problems","year":2024,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Advanced Multi-Objective Optimization Algorithms","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 British Columbia","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Estimation; Optimal design; Mathematical optimization; Estimation theory; Applied mathematics; Statistical physics; Algorithm; Mathematics; Physics; Machine learning; Systems engineering; Engineering","score_opus":0.03744974030778888,"score_gpt":0.3021189406322928,"score_spread":0.2646692003245039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403527956","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.004647902,0.00008567253,0.9938313,0.0002042463,0.00002406737,0.00009665687,0.000037540198,0.00011063602,0.0009619304],"genre_scores_gemma":[0.44567165,0.0002763724,0.54848,0.0004188285,0.00005547208,0.0014906955,0.00016268954,0.00015554207,0.0032887238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558556,0.0024664146,0.00017979887,0.0007499483,0.00079838734,0.0002198593],"domain_scores_gemma":[0.9855962,0.0098653305,0.0017746286,0.0013838706,0.001058113,0.00032194695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011117535,0.0014141222,0.0014756874,0.00089362444,0.00045868484,0.0013573613,0.0018056915,0.002219719,0.004475674],"category_scores_gemma":[0.02364713,0.0011990995,0.00088347425,0.00050140364,0.003221481,0.0019978657,0.0030878873,0.002931075,0.00046662806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050257985,0.00024079162,0.0009675375,0.00060344907,0.000115858355,0.00011278521,0.00011040857,0.72196656,0.017083984,0.20876126,0.001155571,0.04837924],"study_design_scores_gemma":[0.000059961265,0.00012957255,0.00016231438,0.000034701065,0.000015605756,0.0000138428095,0.000009430141,0.9428143,0.0044914805,0.051234346,0.0010175811,0.000016886355],"about_ca_topic_score_codex":0.00088485336,"about_ca_topic_score_gemma":0.0007049194,"teacher_disagreement_score":0.011117535,"about_ca_system_score_codex":0.0022437368,"about_ca_system_score_gemma":0.0020519793,"threshold_uncertainty_score":0.05879581},"labels":[],"label_agreement":null},{"id":"W4403636947","doi":"10.1007/s11227-024-06525-8","title":"Cooperative, collaborative, coevolutionary multi-objective optimization on CPU-GPU multi-core","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","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 Manitoba","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Core (optical fiber); Many core; CUDA; Computational science","score_opus":0.028781018083377546,"score_gpt":0.2976588001028732,"score_spread":0.26887778201949564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403636947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22000033,0.00048951333,0.765138,0.00042561343,0.00017563856,0.000105645326,0.00006793034,0.00083163276,0.012765633],"genre_scores_gemma":[0.79050773,0.000101275764,0.20459291,0.00014048483,0.000038697268,0.00015412107,0.000113298935,0.00012219428,0.004229253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.0001773828,0.000021280668,0.000086046515,0.00014482823,0.00008136526],"domain_scores_gemma":[0.9991485,0.00031497172,0.00004912512,0.00014412895,0.00023350102,0.000109839246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949969,0.0006707688,0.0010042976,0.00044831412,0.00066350575,0.00074329233,0.0017916526,0.0011952069,0.0017300583],"category_scores_gemma":[0.0022899713,0.00043040383,0.00071134896,0.00063199655,0.0006267718,0.0008455749,0.0016805282,0.0012097612,0.0003590139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012803994,0.00013295852,0.00089366816,0.00004190534,0.00007415714,0.00010828529,0.000066053355,0.9532689,0.0037139354,0.0037269727,0.0015208252,0.036324263],"study_design_scores_gemma":[0.0000096581225,0.000019408692,0.000072779505,9.222135e-7,0.000004179983,0.00000611334,0.0000053650197,0.9988992,0.00025322242,0.00059258856,0.0001345638,0.0000018924956],"about_ca_topic_score_codex":0.0059945364,"about_ca_topic_score_gemma":0.0076565254,"teacher_disagreement_score":0.0059945364,"about_ca_system_score_codex":0.0004841607,"about_ca_system_score_gemma":0.0011448817,"threshold_uncertainty_score":0.01191926},"labels":[],"label_agreement":null},{"id":"W4403855116","doi":"10.1016/j.rser.2024.115058","title":"Systematic review of the life cycle optimization literature, and recommendations for performance of life cycle optimization studies","year":2024,"lang":"en","type":"article","venue":"Renewable and Sustainable Energy Reviews","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Management science; Engineering","score_opus":0.014188714476609974,"score_gpt":0.2780181345139497,"score_spread":0.2638294200373397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403855116","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024438733,0.92996854,0.01062656,0.024095284,0.004163751,0.019050298,0.005770405,0.00029441415,0.0035868145],"genre_scores_gemma":[0.027881075,0.8681626,0.05456041,0.014307505,0.00080825534,0.029871427,0.003256305,0.00012948814,0.0010229731],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.8375449,0.08286791,0.047796298,0.005515692,0.024231914,0.0020431974],"domain_scores_gemma":[0.60234463,0.24536227,0.049820956,0.010271585,0.089521505,0.0026790558],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.16641708,0.0032983648,0.008822064,0.034088764,0.0024739502,0.007946252,0.0060598105,0.0051351143,0.007654094],"category_scores_gemma":[0.4391202,0.002462706,0.014962288,0.024483342,0.0029939914,0.010234541,0.00515024,0.0045926557,0.0013534713],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013647102,0.000040965642,0.00085066905,0.90277684,0.0041575297,0.00013818062,0.0006371961,0.0005779928,0.00023098015,0.0015074228,0.011781111,0.07716448],"study_design_scores_gemma":[0.00013645846,0.00006356168,0.0009869485,0.9610388,0.007866227,0.000061204075,0.00044185523,0.00018975776,0.00019907505,0.001336145,0.027631734,0.00004819841],"about_ca_topic_score_codex":0.021041362,"about_ca_topic_score_gemma":0.054940134,"teacher_disagreement_score":0.83358294,"about_ca_system_score_codex":0.016239092,"about_ca_system_score_gemma":0.107103564,"threshold_uncertainty_score":0.8801081},"labels":[],"label_agreement":null},{"id":"W4403897142","doi":"10.1016/j.eswa.2024.125613","title":"Artificial bee colony algorithm based on multiple indicators for many-objective optimization with irregular Pareto fronts","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Brock University","funders":"Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Pareto principle; Artificial bee colony algorithm; Multi-objective optimization; Mathematical optimization; Optimization algorithm; Pareto optimal; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.010151162525947797,"score_gpt":0.25836093192546555,"score_spread":0.24820976939951775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403897142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017410932,0.00030079487,0.9796397,0.00008876103,0.00007341515,0.000039489016,0.000019547735,0.00017048692,0.002256803],"genre_scores_gemma":[0.48713407,0.0003665182,0.5094237,0.00007459752,0.00006139151,0.00029097265,0.00012807372,0.00009537711,0.0024253842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.00029832797,0.000050270646,0.00007449492,0.00034664854,0.000059456455],"domain_scores_gemma":[0.9990507,0.00044580663,0.000075015196,0.000053538082,0.00033351232,0.000041490348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015031004,0.0009782657,0.0012810994,0.001113279,0.00059156487,0.0010391863,0.0013040085,0.0011003935,0.0012018078],"category_scores_gemma":[0.0034910997,0.0004421553,0.0008781554,0.0014979786,0.00052285887,0.0010207974,0.0011657058,0.0012226793,0.00020355775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111764246,0.00007418087,0.0006538188,0.0001026072,0.00008607913,0.000064490036,0.00006419366,0.9005245,0.0033490492,0.009871437,0.0011114536,0.0839864],"study_design_scores_gemma":[0.000006237205,0.0000130012995,0.000056922243,0.000003458709,0.0000050910617,0.000005916891,0.000002552696,0.9988757,0.00022310179,0.0006456283,0.00015937023,0.0000029539617],"about_ca_topic_score_codex":0.0034691524,"about_ca_topic_score_gemma":0.002272752,"teacher_disagreement_score":0.0034691524,"about_ca_system_score_codex":0.00051758735,"about_ca_system_score_gemma":0.00094025326,"threshold_uncertainty_score":0.007949233},"labels":[],"label_agreement":null},{"id":"W4404141415","doi":"10.3390/jrfm17110498","title":"A Double Optimum New Solution Method Based on EVA and Knapsack","year":2024,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Knapsack problem; Mathematics; Mathematical optimization; Computer science","score_opus":0.011285561035038244,"score_gpt":0.27533079971067037,"score_spread":0.2640452386756321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404141415","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.0023743208,0.00028113244,0.99087393,0.00006706422,0.00014033601,0.000051256447,0.000024538384,0.00015592543,0.006031445],"genre_scores_gemma":[0.13620524,0.00071648334,0.84911823,0.00020418101,0.00013880235,0.000601315,0.00019591376,0.0002155849,0.0126042105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918026,0.00021334203,0.0000523313,0.00014968117,0.0003217448,0.0000827458],"domain_scores_gemma":[0.9996118,0.00016653308,0.000049446906,0.00003104059,0.00011673588,0.000024443654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009325596,0.0014435573,0.0017482818,0.0017242448,0.0007043496,0.0014951576,0.0012905508,0.0017350394,0.0053577563],"category_scores_gemma":[0.0015908253,0.0007408787,0.0017479539,0.0016062021,0.00060888205,0.0012356114,0.0016972626,0.0016423794,0.0011338665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006780148,0.00007907648,0.0003452807,0.0002582616,0.00011775116,0.00010719812,0.0000893574,0.8042057,0.0032876267,0.031485293,0.0030191205,0.1569375],"study_design_scores_gemma":[0.0000179313,0.00006705119,0.00009198856,0.000033326345,0.00002386169,0.00007588061,0.000019781393,0.9872925,0.0006537661,0.0058200276,0.0058868974,0.000016940347],"about_ca_topic_score_codex":0.003189181,"about_ca_topic_score_gemma":0.0029135535,"teacher_disagreement_score":0.0053577563,"about_ca_system_score_codex":0.0006378469,"about_ca_system_score_gemma":0.001440801,"threshold_uncertainty_score":0.017923415},"labels":[],"label_agreement":null},{"id":"W4404469638","doi":"10.1109/tcyb.2024.3489885","title":"A Hierarchical Surrogate-Assisted Differential Evolution With Core Space Localization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Nipissing University","funders":"Fujian University of Technology","keywords":"Core (optical fiber); Space (punctuation); Differential (mechanical device); Differential evolution; Computer science; Artificial intelligence; Engineering; Telecommunications; Aerospace engineering","score_opus":0.01622192325667977,"score_gpt":0.25467102370266737,"score_spread":0.2384491004459876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404469638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011160945,0.0002940043,0.9842786,0.00013627637,0.0000447925,0.00004003917,0.000038213802,0.0002482484,0.0037588198],"genre_scores_gemma":[0.5146064,0.00048687667,0.4776586,0.00038014795,0.000057516765,0.00042997193,0.00033198576,0.0001637791,0.0058848104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966407,0.00009077545,0.000015845393,0.00005284856,0.00014497024,0.00003148001],"domain_scores_gemma":[0.99949944,0.00023655292,0.000044498083,0.000053599328,0.00012720758,0.000038727696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006687638,0.0006945371,0.00080514053,0.00054996804,0.00028974036,0.000663207,0.0012630966,0.000978522,0.0021063094],"category_scores_gemma":[0.00204914,0.00033758834,0.0007977563,0.0005416127,0.00047160866,0.0006590023,0.0014802641,0.0009436512,0.0004292991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033056152,0.000041854975,0.0007130895,0.00007829038,0.000034773064,0.00007880109,0.000054378634,0.9405255,0.0048223506,0.009406123,0.0012101395,0.043001696],"study_design_scores_gemma":[0.0000051425473,0.000019230292,0.000036698384,0.000003738604,0.0000029834594,0.000013075543,0.0000032117587,0.99824995,0.00033405892,0.00077549386,0.0005535528,0.0000028607901],"about_ca_topic_score_codex":0.0019403471,"about_ca_topic_score_gemma":0.0017184265,"teacher_disagreement_score":0.0021063094,"about_ca_system_score_codex":0.00043497325,"about_ca_system_score_gemma":0.0008891099,"threshold_uncertainty_score":0.0070462823},"labels":[],"label_agreement":null},{"id":"W4404629207","doi":"10.2514/1.j063488","title":"High-Dimensional Bayesian Optimization Using Both Random and Supervised Embeddings","year":2024,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Institut Supérieur de l'Aéronautique et de l'Espace; Office National d'études et de Recherches Aérospatiales; Polytechnique Montréal","keywords":"Bayesian optimization; Curse of dimensionality; Embedding; Computer science; Optimization problem; Mathematical optimization; Random optimization; Continuous optimization; Dimension (graph theory); Global optimization; Linear subspace; Dimensionality reduction; Algorithm; Artificial intelligence; Multi-swarm optimization; Mathematics","score_opus":0.010725472379701602,"score_gpt":0.25926868146017773,"score_spread":0.24854320908047614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404629207","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.006054084,0.00009148737,0.9923515,0.00005670355,0.000009314613,0.000021805137,0.00001578126,0.00019200188,0.0012074173],"genre_scores_gemma":[0.36687043,0.00022160978,0.62860864,0.00016087573,0.000035139245,0.00031759762,0.00020686878,0.00032149797,0.0032573736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991779,0.0004110866,0.00002969034,0.00012733812,0.00020127316,0.00005273015],"domain_scores_gemma":[0.99865025,0.000845446,0.00014691446,0.00011956289,0.00018287565,0.000054979602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018424954,0.001366291,0.001298802,0.00067728583,0.00040143335,0.000960158,0.0010385851,0.0013129201,0.0024464128],"category_scores_gemma":[0.0036827018,0.0007010992,0.0010817662,0.00049282296,0.0011104674,0.0014917772,0.0016257981,0.0012639391,0.0005787373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029893585,0.000036698202,0.00028131626,0.00006448024,0.000037771017,0.000023691022,0.000025313804,0.9642741,0.0012758173,0.009390754,0.0005380055,0.024022257],"study_design_scores_gemma":[0.0000033190859,0.00001002303,0.000029772402,0.000003950201,0.000002257866,0.0000047988033,0.0000026805103,0.9972656,0.00024709402,0.0022375295,0.00019022792,0.0000028793079],"about_ca_topic_score_codex":0.0023240724,"about_ca_topic_score_gemma":0.0031775213,"teacher_disagreement_score":0.0024464128,"about_ca_system_score_codex":0.00058861973,"about_ca_system_score_gemma":0.0010860991,"threshold_uncertainty_score":0.009744167},"labels":[],"label_agreement":null},{"id":"W4404639573","doi":"10.1038/s41598-024-76877-x","title":"External archive guided radial-grid multi objective differential evolution","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Laurentian University","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center; National Research Foundation of Korea","keywords":"Computer science; Multi-objective optimization; Benchmark (surveying); Cluster analysis; Differential evolution; Mathematical optimization; Grid; Population; Pareto principle; Evolutionary algorithm; Metric (unit); Data mining; Mutation; Machine learning; Artificial intelligence; Mathematics","score_opus":0.01596524355204873,"score_gpt":0.276251492298607,"score_spread":0.26028624874655826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404639573","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.038376868,0.00027707784,0.95452595,0.00009193313,0.000050986015,0.00005817807,0.000046322777,0.0005105236,0.0060620923],"genre_scores_gemma":[0.68431556,0.00020733924,0.30991575,0.00014909096,0.000023352106,0.00020391616,0.00021993845,0.00011804137,0.0048469338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.0000893182,0.000015438181,0.000043419182,0.00011132517,0.000026598194],"domain_scores_gemma":[0.9994748,0.00022799138,0.0000563518,0.000066148175,0.00014925968,0.000025464991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078761455,0.0005797808,0.00079739833,0.00045239824,0.0002457544,0.0006032478,0.0012217113,0.00069532753,0.0015152249],"category_scores_gemma":[0.0016538169,0.00018476661,0.0005051377,0.00042208136,0.00034721702,0.00046214036,0.0009567937,0.0006015182,0.00040067066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007362762,0.00004574652,0.00081680267,0.00007091809,0.000036919937,0.00010491675,0.00006233892,0.9127819,0.0039909733,0.0068714907,0.0009905247,0.07415386],"study_design_scores_gemma":[0.0000068536715,0.000018609613,0.000056364806,0.0000035615365,0.0000033212052,0.000019639067,0.000004617193,0.997752,0.0008579846,0.00075212837,0.0005218494,0.0000031213644],"about_ca_topic_score_codex":0.0011059406,"about_ca_topic_score_gemma":0.0012609876,"teacher_disagreement_score":0.0015152249,"about_ca_system_score_codex":0.00035073725,"about_ca_system_score_gemma":0.0004634764,"threshold_uncertainty_score":0.005068958},"labels":[],"label_agreement":null},{"id":"W4404915738","doi":"10.1109/acsos-c63493.2024.00033","title":"Online Learning of Temporal Dependencies for the Sustainable Foraging Problem","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Foraging; Computer science; Artificial intelligence; Online learning; Machine learning; World Wide Web; Ecology; Biology","score_opus":0.014923948136683338,"score_gpt":0.28416273074462994,"score_spread":0.2692387826079466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404915738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12853204,0.0007677042,0.8642137,0.0017730203,0.000091116155,0.000078857316,0.00017264971,0.0002816837,0.004089115],"genre_scores_gemma":[0.9120593,0.0003821438,0.0826656,0.00026464928,0.0000570332,0.00020076796,0.00026465656,0.00009330524,0.0040123854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996101,0.00015495304,0.000025086692,0.00010023994,0.000054714586,0.000054897],"domain_scores_gemma":[0.994197,0.004734897,0.00038250373,0.00016573083,0.00028986923,0.00023001463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021725283,0.000676652,0.001132911,0.0004811268,0.00053996034,0.00081765576,0.0015413227,0.0014637867,0.0033038475],"category_scores_gemma":[0.010921879,0.00059895153,0.0005277759,0.00042652694,0.0011013955,0.00228818,0.0015136221,0.002485618,0.00024005692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008637091,0.00008921458,0.001195858,0.00007982308,0.000035735156,0.000070635884,0.000075344105,0.95562434,0.0005475267,0.022157185,0.0011379177,0.018900026],"study_design_scores_gemma":[0.0000051570387,0.000008537271,0.00005315251,0.0000035150179,0.0000024620847,0.0000040296613,0.0000040012314,0.9901186,0.00006120874,0.0096454155,0.00009156836,0.000002228933],"about_ca_topic_score_codex":0.004535428,"about_ca_topic_score_gemma":0.005625718,"teacher_disagreement_score":0.004535428,"about_ca_system_score_codex":0.0010468853,"about_ca_system_score_gemma":0.0014207372,"threshold_uncertainty_score":0.01148957},"labels":[],"label_agreement":null},{"id":"W4405429622","doi":"10.1109/jiot.2024.3518581","title":"MOSSA: An Efficient Swarm Intelligent Algorithm to Solve Global Optimization and Carbon Fiber Drawing Process Problems","year":2024,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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 Calgary","funders":"","keywords":"Computer science; Process (computing); Swarm behaviour; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.012839217186999853,"score_gpt":0.288572968888972,"score_spread":0.2757337517019721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405429622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016568528,0.0005747062,0.97822326,0.00014546915,0.00006986639,0.0000800932,0.00006317112,0.0006968317,0.0035780224],"genre_scores_gemma":[0.31439203,0.0005917358,0.6791989,0.00019587853,0.0000733156,0.0005085031,0.0003312001,0.00016760419,0.0045408206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997781,0.00007297321,0.000016008547,0.000037431684,0.00007168959,0.00002382293],"domain_scores_gemma":[0.99970967,0.0001512766,0.00003638236,0.000025311158,0.000060040686,0.00001734202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061085867,0.0012942947,0.0010290914,0.000799779,0.00045439583,0.0005525166,0.00092739466,0.0010507496,0.0017571946],"category_scores_gemma":[0.0011260675,0.0004054648,0.00088220194,0.00079009635,0.00040992897,0.00062019465,0.0008706818,0.0007807085,0.00038130773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030699666,0.000025924937,0.00043845363,0.00008037772,0.00005399811,0.000054809345,0.000037882284,0.93074477,0.0012374314,0.0030806907,0.0012351705,0.06297972],"study_design_scores_gemma":[0.000009252727,0.000026129184,0.00005362097,0.0000052268238,0.0000059602885,0.000013666795,0.0000067471387,0.9977216,0.00020605754,0.0009963926,0.0009522177,0.0000030798847],"about_ca_topic_score_codex":0.0055231275,"about_ca_topic_score_gemma":0.00614605,"teacher_disagreement_score":0.0055231275,"about_ca_system_score_codex":0.00035097523,"about_ca_system_score_gemma":0.0011346585,"threshold_uncertainty_score":0.010981917},"labels":[],"label_agreement":null},{"id":"W4405730979","doi":"","title":"Processus gaussien pour l'optimisation bayésienne avec variables mixtes hiérarchiques: Application à l'éco-conception avion","year":2024,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","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","funders":"","keywords":"Bayesian optimization; Gaussian process; Computer science; Process (computing); Bayesian probability; Mathematical optimization; Gaussian; Artificial intelligence; Mathematics","score_opus":0.012496815171707927,"score_gpt":0.24570580978321102,"score_spread":0.2332089946115031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405730979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011856857,0.00018229186,0.9869283,0.0001110067,0.000037555536,0.000039397517,0.000026419913,0.00017496663,0.00064314716],"genre_scores_gemma":[0.24092893,0.00060915365,0.7494409,0.00019234285,0.00011074537,0.00046975596,0.00014888198,0.00024463903,0.007854652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989581,0.0005339844,0.00003980483,0.00013522914,0.00025672774,0.000076112905],"domain_scores_gemma":[0.9938876,0.005140908,0.00016029696,0.00014124115,0.0005718985,0.00009807282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004998396,0.0011181138,0.0014205241,0.0008933988,0.00086421863,0.0018468318,0.0011265648,0.0022506036,0.0028706016],"category_scores_gemma":[0.00922183,0.0008882056,0.0011786771,0.0008769463,0.0016366558,0.0013641929,0.0014381633,0.003079602,0.0007291603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018067182,0.00006936133,0.00082917925,0.00012800167,0.000081833765,0.00012302489,0.0002623492,0.89169496,0.0038490847,0.052354913,0.00058904587,0.049837478],"study_design_scores_gemma":[0.000008542579,0.000014591672,0.0000767728,0.000008410107,0.0000052022256,0.0000076145384,0.000007766633,0.9956558,0.00060928514,0.0032996875,0.00030095567,0.000005406627],"about_ca_topic_score_codex":0.015086247,"about_ca_topic_score_gemma":0.0116168475,"teacher_disagreement_score":0.015086247,"about_ca_system_score_codex":0.0013617435,"about_ca_system_score_gemma":0.0022654794,"threshold_uncertainty_score":0.029996872},"labels":[],"label_agreement":null},{"id":"W4405929204","doi":"10.1016/j.swevo.2024.101827","title":"Population-level center-based sampling for meta-heuristic algorithms","year":2024,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"Brock University","keywords":"Computer science; Center (category theory); Heuristic; Sampling (signal processing); Algorithm; Population; Meta heuristic; Artificial intelligence; Telecommunications","score_opus":0.0861505226043258,"score_gpt":0.33446159651186075,"score_spread":0.24831107390753493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405929204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01695291,0.00041486692,0.9801194,0.00012676865,0.00003922371,0.000112191534,0.000027541244,0.00036301004,0.0018439427],"genre_scores_gemma":[0.59924537,0.00048711675,0.3975523,0.00025240684,0.00007155466,0.00053431035,0.00019886665,0.00016086969,0.0014971562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985057,0.0007901206,0.000052740026,0.00017687114,0.00036400545,0.000110643654],"domain_scores_gemma":[0.99722433,0.0016584634,0.0001881264,0.00029407596,0.00055239926,0.00008258894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030132243,0.0008895564,0.0011499631,0.00092093163,0.0007135889,0.0009338684,0.0015901627,0.0009566598,0.0013638929],"category_scores_gemma":[0.0073336805,0.00040562986,0.0007580034,0.0008157841,0.0008701456,0.0010817492,0.0011424534,0.0012348096,0.0003768135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001579362,0.00014778029,0.0020699964,0.00014689956,0.00011438585,0.00008069231,0.00015404694,0.85902923,0.0038670818,0.0292065,0.0020434486,0.10298196],"study_design_scores_gemma":[0.00001862161,0.00006258476,0.00010458988,0.000008852145,0.000014419391,0.000019734889,0.00001748866,0.99214774,0.001180385,0.0054534646,0.0009659893,0.0000062054182],"about_ca_topic_score_codex":0.0025172806,"about_ca_topic_score_gemma":0.0026681356,"teacher_disagreement_score":0.0030132243,"about_ca_system_score_codex":0.0010256486,"about_ca_system_score_gemma":0.0014970361,"threshold_uncertainty_score":0.01593566},"labels":[],"label_agreement":null},{"id":"W4406214684","doi":"10.1007/s10589-024-00645-w","title":"Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal; Hydro-Québec; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Solver; Computer science; Fidelity; Mathematical optimization; Bridging (networking); Point (geometry); Algorithm; Mathematics","score_opus":0.019205981593508156,"score_gpt":0.3145895859890645,"score_spread":0.29538360439555633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406214684","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.0027702127,0.000097305485,0.99274194,0.00008528539,0.00009603684,0.000038912603,0.00005402387,0.0010760879,0.0030401328],"genre_scores_gemma":[0.12157807,0.00012630202,0.86851424,0.00021695641,0.000073774536,0.00025986202,0.00025309753,0.0012424486,0.007735145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.00012608871,0.000016593445,0.00005629316,0.00020340811,0.000044336375],"domain_scores_gemma":[0.999243,0.0003402998,0.000043385244,0.00014724271,0.0001426649,0.0000833651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326628,0.0011633697,0.0013064625,0.00077322207,0.00057216524,0.0010918191,0.0021615648,0.0014778423,0.013579154],"category_scores_gemma":[0.0026494786,0.00057129905,0.00070169417,0.00064795447,0.0007188178,0.0013311736,0.0027374132,0.00229066,0.0024060488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003027582,0.0001669914,0.00038518268,0.00017458109,0.00010539622,0.00008976351,0.000070132264,0.65194404,0.0054008737,0.059379447,0.014329515,0.26765123],"study_design_scores_gemma":[0.00001685981,0.000016037255,0.000023059754,0.0000058398678,0.000004193842,0.000010883955,0.000003637597,0.9918224,0.0009743854,0.0051538744,0.0019645023,0.0000042861],"about_ca_topic_score_codex":0.0021525514,"about_ca_topic_score_gemma":0.0033964608,"teacher_disagreement_score":0.013579154,"about_ca_system_score_codex":0.00071666937,"about_ca_system_score_gemma":0.0012241919,"threshold_uncertainty_score":0.045426786},"labels":[],"label_agreement":null},{"id":"W4407140437","doi":"10.1002/est2.70136","title":"Multi‐Objective Optimization of a Spherical Thermal Storage Tank Using a Student Psychology‐Based Approach","year":2025,"lang":"en","type":"article","venue":"Energy Storage","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Hydro One (Canada); University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thermal; Psychology; Computer science; Mathematics education; Physics; Thermodynamics","score_opus":0.020473279761038958,"score_gpt":0.31295504334394714,"score_spread":0.29248176358290817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407140437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24484071,0.00027662684,0.7438045,0.00018552446,0.000048761973,0.00019216337,0.00009240812,0.0002085504,0.010350784],"genre_scores_gemma":[0.9245814,0.00008725188,0.072617434,0.000041706026,0.000008669454,0.00026129512,0.00006709737,0.000020963389,0.0023141948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999741,0.00010370894,0.000010481466,0.00003417685,0.00007612303,0.000034429337],"domain_scores_gemma":[0.99955016,0.00025545174,0.000050692997,0.000017455592,0.00010559798,0.000020696356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337675,0.0006248027,0.0006111152,0.00072904816,0.00029947984,0.0009151629,0.00053782103,0.0009780062,0.0019352757],"category_scores_gemma":[0.0010746036,0.00041486527,0.0007919227,0.00048814996,0.0004178655,0.00039516605,0.0005608992,0.00042025282,0.0001753004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003131162,0.00003770195,0.00018289575,0.000032860713,0.0000122635165,0.00001650929,0.000009979271,0.9919492,0.0017735894,0.00064698874,0.00007137651,0.0052353134],"study_design_scores_gemma":[0.000004256183,0.000041081574,0.000073692274,0.0000021065391,0.0000032752414,0.0000020513105,0.0000048108463,0.99926883,0.00039667613,0.00012215434,0.000079194506,0.0000017882381],"about_ca_topic_score_codex":0.0033384804,"about_ca_topic_score_gemma":0.0023538498,"teacher_disagreement_score":0.0033384804,"about_ca_system_score_codex":0.0006017958,"about_ca_system_score_gemma":0.0010747393,"threshold_uncertainty_score":0.0066381097},"labels":[],"label_agreement":null},{"id":"W4407558133","doi":"10.29169/1927-5129.2025.21.07","title":"Optimal Design of a Biconvex Airfoil for a Supersonic Aircraft Using the Basin-Hopping and Exhaustive Search Methods","year":2025,"lang":"en","type":"article","venue":"Journal of Basic & Applied Sciences","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Airfoil; Supersonic speed; Aerospace engineering; Computer science; Angle of attack; Environmental science; Geology; Aerodynamics; Acoustics; Aeronautics; Engineering; Physics","score_opus":0.065701559064253,"score_gpt":0.377463104524327,"score_spread":0.311761545460074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407558133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15892774,0.0006122808,0.82876176,0.00016953817,0.000039766426,0.00013582948,0.000051143026,0.00023382326,0.011068116],"genre_scores_gemma":[0.8277998,0.00030718787,0.16854605,0.00009288332,0.00001019952,0.00038893492,0.000092428694,0.000053147734,0.0027094209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980944,0.0000678223,0.000006916984,0.000022613354,0.000064408334,0.000028845627],"domain_scores_gemma":[0.99970907,0.00016482004,0.000031947526,0.000012973586,0.00006329345,0.000017927827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045498786,0.0006369699,0.00062598835,0.0004887107,0.00031133747,0.0005022991,0.00032313107,0.000747031,0.001780448],"category_scores_gemma":[0.0011938745,0.00039822506,0.00039234964,0.00025764163,0.00037306672,0.00041255148,0.00048207253,0.00034143074,0.00022817444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026944943,0.00001948451,0.0003299431,0.000055231678,0.000014933466,0.00003398405,0.000025774654,0.9827932,0.0019164768,0.0018339483,0.00019354733,0.012756454],"study_design_scores_gemma":[0.0000075145704,0.000052649986,0.00012062338,0.000005473419,0.000005522443,0.000010637147,0.000011885384,0.9984785,0.00050151936,0.00047494294,0.0003268191,0.000003888319],"about_ca_topic_score_codex":0.0029093775,"about_ca_topic_score_gemma":0.002842507,"teacher_disagreement_score":0.0029093775,"about_ca_system_score_codex":0.00027228362,"about_ca_system_score_gemma":0.0011737384,"threshold_uncertainty_score":0.005956173},"labels":[],"label_agreement":null},{"id":"W4407638347","doi":"10.1109/tetci.2025.3537916","title":"Population Stream-Driven Scalable Evolutionary Many-Objective Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computational Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Scalability; Computer science; Population; Evolutionary algorithm; Artificial intelligence; Demography","score_opus":0.017092192909028806,"score_gpt":0.3029121016931501,"score_spread":0.2858199087841213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407638347","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.06466284,0.00053409935,0.9286827,0.00025277765,0.000092567076,0.00011974023,0.000081963604,0.00050473656,0.0050686407],"genre_scores_gemma":[0.7413685,0.00039876197,0.25438404,0.00015278638,0.000055580065,0.000325847,0.0002807026,0.00010587828,0.0029279017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969244,0.00010692605,0.000014059405,0.000042492553,0.000105523315,0.00003866825],"domain_scores_gemma":[0.9994586,0.00025548658,0.000047478323,0.000058096975,0.00014135127,0.000039089668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012337033,0.00061678694,0.0009435041,0.00049297494,0.00037226238,0.00076161063,0.0014405545,0.0006289911,0.0015007063],"category_scores_gemma":[0.0015442064,0.00026448662,0.00051729364,0.000685395,0.0003353893,0.0009682517,0.0010540079,0.0009030944,0.0002588809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003706931,0.0000492311,0.0006823596,0.00003888322,0.000029366605,0.00005468487,0.00003355659,0.9498355,0.0012859848,0.004481765,0.0009725001,0.042499077],"study_design_scores_gemma":[0.0000053784574,0.000013389821,0.000048550737,0.0000015095819,0.0000026357573,0.0000057351804,0.000004800641,0.9987165,0.00016839273,0.0007935731,0.00023840852,0.0000012500501],"about_ca_topic_score_codex":0.0017493656,"about_ca_topic_score_gemma":0.0019663516,"teacher_disagreement_score":0.0017493656,"about_ca_system_score_codex":0.0005244034,"about_ca_system_score_gemma":0.0007074037,"threshold_uncertainty_score":0.006524503},"labels":[],"label_agreement":null},{"id":"W4408185721","doi":"10.1016/j.enbuild.2025.115539","title":"Examining the generalizability of inverse surrogate models for different geometries and locations","year":2025,"lang":"en","type":"article","venue":"Energy and Buildings","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Canadian Council of Professional Engineers; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalizability theory; Inverse; Surrogate model; Econometrics; Inverse method; Statistics; Applied mathematics; Computer science; Mathematics; Geometry","score_opus":0.02374986492304802,"score_gpt":0.2533005811959907,"score_spread":0.22955071627294268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408185721","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.5245339,0.0008267787,0.457227,0.0016520078,0.00024094076,0.00042045687,0.0015450664,0.002120586,0.011433188],"genre_scores_gemma":[0.97738636,0.00021686907,0.019395778,0.00020287675,0.000027021637,0.0001419403,0.0012824186,0.00023031693,0.0011162969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976411,0.0007433452,0.00019385772,0.00080683513,0.0004570516,0.00015787057],"domain_scores_gemma":[0.9838896,0.009236494,0.0012266061,0.003359633,0.002075102,0.00021268333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007742869,0.0014567025,0.0009634147,0.0012677478,0.00062346226,0.0019719077,0.0018048193,0.0018645107,0.0022988084],"category_scores_gemma":[0.037779506,0.0008648435,0.0026475477,0.00083809,0.0014901899,0.0032422077,0.0019514656,0.00278886,0.0007574842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020980807,0.000102080514,0.019079939,0.0001580576,0.00017619236,0.00011489771,0.00014251603,0.9488402,0.002090218,0.0050598527,0.00092481746,0.023101479],"study_design_scores_gemma":[0.0000232281,0.00010538189,0.0052380566,0.000054548236,0.000052402826,0.00006839201,0.00010540772,0.98533547,0.0017873317,0.00610699,0.0010865596,0.0000362157],"about_ca_topic_score_codex":0.017998531,"about_ca_topic_score_gemma":0.012937493,"teacher_disagreement_score":0.017998531,"about_ca_system_score_codex":0.0013860367,"about_ca_system_score_gemma":0.0015464408,"threshold_uncertainty_score":0.04094869},"labels":[],"label_agreement":null},{"id":"W4408421961","doi":"10.1016/j.energy.2025.135422","title":"A multi-criteria assessment method for design and dispatch of distributed energy systems considering different energy consumption attributes","year":2025,"lang":"en","type":"article","venue":"Energy","topic":"Advanced Multi-Objective Optimization Algorithms","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":"St. Francis Xavier University","funders":"Natural Science Foundation of Tianjin-Science and Technology Correspondent Project; Natural Science Foundation of Tianjin City","keywords":"Computer science; Energy (signal processing); Gradient method; Mathematical optimization; Algorithm; Mathematics; Statistics","score_opus":0.037817911156329286,"score_gpt":0.33529400483538696,"score_spread":0.2974760936790577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408421961","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.0033495168,0.00007834511,0.9951137,0.000037590107,0.000026631671,0.00005398041,0.00003073453,0.00015786187,0.0011517182],"genre_scores_gemma":[0.20208105,0.00013856073,0.7948813,0.00007380461,0.000042088064,0.0004555427,0.00012567033,0.000120574034,0.002081469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989171,0.0004034436,0.000059633832,0.00010581197,0.00044974912,0.00006419589],"domain_scores_gemma":[0.99829775,0.0009185542,0.00011373853,0.000071423405,0.00052944425,0.000069060945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027576867,0.0016550024,0.0013874717,0.0018648613,0.0007526905,0.0012782898,0.0014022893,0.0013871995,0.003873602],"category_scores_gemma":[0.0036434762,0.00081874616,0.0014559543,0.001352602,0.00053072145,0.0011581088,0.00094650785,0.0013939616,0.00050732336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091088084,0.00010109135,0.0003785201,0.00017991566,0.00011006502,0.00007114978,0.000070384056,0.8646316,0.0044246865,0.00823072,0.0011689345,0.12054188],"study_design_scores_gemma":[0.000008132389,0.00002927036,0.00007408407,0.0000092166365,0.000010468967,0.0000093129265,0.0000053469334,0.99776447,0.00026209335,0.0014211437,0.0004001856,0.0000062371564],"about_ca_topic_score_codex":0.0045155655,"about_ca_topic_score_gemma":0.0050845095,"teacher_disagreement_score":0.0045155655,"about_ca_system_score_codex":0.0009135164,"about_ca_system_score_gemma":0.001306307,"threshold_uncertainty_score":0.014584184},"labels":[],"label_agreement":null},{"id":"W4408864303","doi":"10.1080/0305215x.2025.2453542","title":"Conservative surrogate models for optimization with the active subspace method","year":2025,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Institut des Sciences Mathématiques, Université du Québec à Montréal","keywords":"Surrogate model; Subspace topology; Mathematical optimization; Computer science; Mathematics; Artificial intelligence","score_opus":0.009513816565957506,"score_gpt":0.2562027188241931,"score_spread":0.2466889022582356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408864303","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.0010532925,0.000092216396,0.99781454,0.00006236105,0.000013079291,0.000011845298,0.000013021618,0.00007370765,0.0008659808],"genre_scores_gemma":[0.25887415,0.0008322622,0.73076326,0.00025313828,0.00012799242,0.0008696257,0.00033426427,0.0003881426,0.007557223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988533,0.00060413044,0.000037223315,0.00006934026,0.00038899053,0.00004693663],"domain_scores_gemma":[0.99776554,0.0015985948,0.00012686742,0.00018213675,0.0002632879,0.00006344209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022823133,0.0012118298,0.0013900131,0.00080018386,0.00056936085,0.0013400135,0.0012578137,0.0016513035,0.0027034057],"category_scores_gemma":[0.005970969,0.00064605207,0.0009853743,0.00094933965,0.0012099786,0.0014013696,0.0017465225,0.0026537913,0.00090210576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003160577,0.000030113546,0.0001308698,0.0000732529,0.000023428756,0.000042915482,0.000044449196,0.8934297,0.0018335759,0.08419582,0.0011253894,0.019038903],"study_design_scores_gemma":[0.0000024039164,0.000005735072,0.00000892511,0.000004453901,0.0000011702151,0.0000035471382,0.0000018904939,0.9885462,0.0002082459,0.010623772,0.000590915,0.000002693147],"about_ca_topic_score_codex":0.0012571872,"about_ca_topic_score_gemma":0.0010695324,"teacher_disagreement_score":0.0027034057,"about_ca_system_score_codex":0.0006383832,"about_ca_system_score_gemma":0.001095621,"threshold_uncertainty_score":0.012070119},"labels":[],"label_agreement":null},{"id":"W4409364742","doi":"10.1609/aaai.v39i13.33576","title":"Forward KL Regularized Preference Optimization for Aligning Diffusion Policies","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Preference; Diffusion; Computer science; Mathematical optimization; Mathematics; Statistics; Physics; Thermodynamics","score_opus":0.0602084729461822,"score_gpt":0.310791092154396,"score_spread":0.2505826192082138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01895857,0.00017586429,0.97826684,0.00023987256,0.00003579905,0.000056636956,0.00008133661,0.0008673052,0.001317784],"genre_scores_gemma":[0.6584073,0.00023099926,0.33449507,0.000538095,0.00006723336,0.0003169397,0.0005901175,0.0005237301,0.004830477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.0005122615,0.00009821427,0.00035559863,0.00029010038,0.0001559826],"domain_scores_gemma":[0.9974819,0.0014678821,0.00027743517,0.00027253604,0.00035671899,0.00014360243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023464921,0.001550689,0.001490708,0.0008744851,0.000544067,0.0012396541,0.0013321546,0.0017296349,0.0030083046],"category_scores_gemma":[0.008027262,0.0007929636,0.0009805023,0.0010232647,0.0011815334,0.0028460312,0.0017039152,0.00282319,0.0008177913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010842306,0.000104612765,0.00081067736,0.00008765625,0.000039803093,0.000060011473,0.0000670688,0.9050245,0.002618057,0.010230356,0.001959916,0.07888887],"study_design_scores_gemma":[0.000009445017,0.000022606719,0.000044438897,0.000004107048,0.0000028300838,0.000010347702,0.0000064204833,0.9942008,0.0006194442,0.0048658145,0.00020895807,0.00000477168],"about_ca_topic_score_codex":0.003981606,"about_ca_topic_score_gemma":0.0045838337,"teacher_disagreement_score":0.003981606,"about_ca_system_score_codex":0.0013376112,"about_ca_system_score_gemma":0.002087411,"threshold_uncertainty_score":0.012409568},"labels":[],"label_agreement":null},{"id":"W4409991914","doi":"10.1109/alife-cis64968.2025.10979840","title":"Frequency-Based Multi-Objective Feature Selection to Enhance the Generalization of Evolutionary Algorithms","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wilfrid Laurier University","funders":"","keywords":"Generalization; Computer science; Feature selection; Evolutionary algorithm; Selection (genetic algorithm); Algorithm; Artificial intelligence; Evolutionary computation; Feature (linguistics); Machine learning; Mathematics","score_opus":0.008427663799172449,"score_gpt":0.2921659980145152,"score_spread":0.2837383342153428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409991914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050340608,0.00026919277,0.9476396,0.00013456435,0.000044992372,0.00007067637,0.000038508173,0.0004947994,0.00096707116],"genre_scores_gemma":[0.6129101,0.00016057407,0.3847994,0.00016063826,0.00007534508,0.0002786228,0.00024815812,0.0001642953,0.0012029127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990357,0.0003361923,0.00007337426,0.00016151895,0.00031447515,0.000078702586],"domain_scores_gemma":[0.99774265,0.0011548023,0.00020093384,0.00023704281,0.00062000443,0.00004465151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029500313,0.0013165371,0.0012986641,0.0017407252,0.000507232,0.0008371087,0.0011406456,0.0009585973,0.0011484622],"category_scores_gemma":[0.0072088833,0.0004194845,0.0010237483,0.001365606,0.00047413103,0.0010153198,0.00076133525,0.0009651138,0.0002860634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010569942,0.00016718215,0.002661761,0.00009908087,0.00015255026,0.0001161809,0.000102785605,0.73587847,0.009583783,0.0031884036,0.0012821071,0.24666211],"study_design_scores_gemma":[0.000007610477,0.00004287871,0.00044714208,0.000005611079,0.000011009422,0.000022109694,0.000007005393,0.99687445,0.0013378995,0.0009563241,0.00028167208,0.0000062877075],"about_ca_topic_score_codex":0.0017020312,"about_ca_topic_score_gemma":0.0021615936,"teacher_disagreement_score":0.0029500313,"about_ca_system_score_codex":0.0004724224,"about_ca_system_score_gemma":0.0006318474,"threshold_uncertainty_score":0.015601397},"labels":[],"label_agreement":null},{"id":"W4410012132","doi":"10.1016/j.asoc.2025.113216","title":"Knowledge-guided global optimization for expensive and black-box constrained multi-objective engineering design problems","year":2025,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","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 Victoria","funders":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Black box; Box–Behnken design; Computer science; Mathematical optimization; Multi-objective optimization; Engineering optimization; Artificial intelligence; Optimization problem; Machine learning; Response surface methodology; Mathematics; Algorithm","score_opus":0.023721737601208367,"score_gpt":0.2872424935392727,"score_spread":0.26352075593806434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410012132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011451691,0.00027697292,0.9840464,0.00017498143,0.00003284362,0.000042757554,0.000047292473,0.00023060922,0.003696406],"genre_scores_gemma":[0.59980965,0.00038844795,0.39375424,0.00032801548,0.00007958774,0.00043548524,0.00025913317,0.0002949408,0.0046504904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992194,0.00030352923,0.000031882493,0.000112817856,0.00025511064,0.000077107856],"domain_scores_gemma":[0.99712795,0.0021858604,0.00018761447,0.00017349167,0.00024562544,0.00007952298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002631202,0.0016064958,0.0024449923,0.0011428631,0.0006172171,0.0014981198,0.0016731069,0.0023586,0.0035939508],"category_scores_gemma":[0.0063736215,0.0011704448,0.0011472212,0.00089875766,0.0017009085,0.0016244495,0.0023618462,0.0018213209,0.00047783792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032225824,0.000024428897,0.00009130245,0.00005863699,0.000017748536,0.000024929584,0.000020391633,0.9821938,0.00037265808,0.004496853,0.00035413372,0.012312821],"study_design_scores_gemma":[0.000006524398,0.000013107871,0.000025984149,0.00000720635,0.000003665962,0.0000040453265,0.0000036961555,0.9954543,0.00013380857,0.0042187944,0.00012639008,0.000002407057],"about_ca_topic_score_codex":0.004378868,"about_ca_topic_score_gemma":0.0056233713,"teacher_disagreement_score":0.004378868,"about_ca_system_score_codex":0.0010816256,"about_ca_system_score_gemma":0.0015642404,"threshold_uncertainty_score":0.0139153},"labels":[],"label_agreement":null},{"id":"W4410124548","doi":"10.1016/j.swevo.2025.101962","title":"Multimodal multi-objective optimization via multi-operator adaptation and clustering-based environmental selection","year":2025,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","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 Fredericton","funders":"National Natural Science Foundation of China","keywords":"Computer science; Adaptation (eye); Selection (genetic algorithm); Cluster analysis; Operator (biology); Artificial intelligence; Mathematical optimization","score_opus":0.010375414389769737,"score_gpt":0.2416787254102316,"score_spread":0.23130331102046187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410124548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021111052,0.00016079866,0.97556496,0.00007539126,0.000037038044,0.0000363755,0.000015806634,0.00018824742,0.002810378],"genre_scores_gemma":[0.6585433,0.00017520516,0.3375637,0.00010319759,0.000046517507,0.00021638603,0.000081397746,0.00013537463,0.0031348905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958485,0.00015320016,0.000016135324,0.00007726858,0.00012727147,0.000041352858],"domain_scores_gemma":[0.9995152,0.00021650946,0.000059288697,0.00005739567,0.00012620963,0.0000254077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656119,0.0009054577,0.00087519374,0.0007147221,0.0005413435,0.00059619726,0.0012265916,0.0010615891,0.0015602324],"category_scores_gemma":[0.002216764,0.0003891445,0.0009158655,0.0010068681,0.0006981758,0.0011111251,0.001322183,0.00077784987,0.00029760896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050516017,0.00006135859,0.00036635372,0.000034555866,0.00006488538,0.000049494272,0.000059524744,0.9384826,0.005187327,0.0052093384,0.00062887534,0.04980529],"study_design_scores_gemma":[0.0000029021894,0.000010743801,0.00008042459,0.0000017520135,0.000004378023,0.00000797325,0.0000042683105,0.9986141,0.0003647756,0.0007944609,0.00011022247,0.0000039969896],"about_ca_topic_score_codex":0.0022840633,"about_ca_topic_score_gemma":0.0027852908,"teacher_disagreement_score":0.0022840633,"about_ca_system_score_codex":0.0004496777,"about_ca_system_score_gemma":0.000492559,"threshold_uncertainty_score":0.005219519},"labels":[],"label_agreement":null},{"id":"W4410460921","doi":"10.1007/s10957-025-02691-8","title":"Adaptive Generalized Conditional Gradient Method for Multiobjective Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Perimeter Institute","funders":"","keywords":"Mathematics; Theory of computation; Mathematical optimization; Multi-objective optimization; Gradient method; Applied mathematics; Algorithm","score_opus":0.010650661419480616,"score_gpt":0.312289075429338,"score_spread":0.30163841400985736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410460921","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.001490079,0.0001982448,0.997122,0.00008480001,0.00005162857,0.00002209878,0.000017309705,0.00010376419,0.0009100773],"genre_scores_gemma":[0.1934838,0.0006135502,0.7978236,0.0002823482,0.00016130132,0.0005550169,0.00022058758,0.00035974116,0.0065001114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923646,0.00042126307,0.00002329327,0.000071871735,0.00020452923,0.000042539203],"domain_scores_gemma":[0.99801505,0.0013365955,0.00009673109,0.00009777561,0.0003932802,0.000060501032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020695156,0.0011974599,0.0016353148,0.0009106294,0.00049349066,0.00093100505,0.0018880374,0.0017722077,0.0037883897],"category_scores_gemma":[0.0053102374,0.0007055686,0.0009276125,0.0011066013,0.0012608411,0.0011197824,0.0019556643,0.0022552395,0.00064173155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067435125,0.000059380887,0.00022931688,0.00020758883,0.00009992045,0.00005215541,0.000041538595,0.898976,0.0015837193,0.04576968,0.0028916774,0.050021555],"study_design_scores_gemma":[0.000005202632,0.0000070443048,0.000026714572,0.00000463876,0.0000033815998,0.000003927898,0.0000012265062,0.99617237,0.00007559985,0.003368502,0.0003283851,0.0000031374045],"about_ca_topic_score_codex":0.0059081274,"about_ca_topic_score_gemma":0.0046826024,"teacher_disagreement_score":0.0059081274,"about_ca_system_score_codex":0.0007900267,"about_ca_system_score_gemma":0.0019928273,"threshold_uncertainty_score":0.012673378},"labels":[],"label_agreement":null},{"id":"W4410767107","doi":"10.4271/02-18-04-0023","title":"Design Space Exploration of a Continuous Rubber Track System via Surrogate Modeling","year":2025,"lang":"en","type":"article","venue":"SAE International journal of commercial vehicles","topic":"Advanced Multi-Objective Optimization Algorithms","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 Sherbrooke","funders":"","keywords":"Track (disk drive); Natural rubber; Space (punctuation); Computer science; Aerospace engineering; Engineering; Mechanical engineering; Materials science","score_opus":0.031083650341654966,"score_gpt":0.29757846423496737,"score_spread":0.2664948138933124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410767107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08586737,0.0003205267,0.90108746,0.00017827787,0.000026167427,0.000080112186,0.00010681427,0.00028770076,0.012045612],"genre_scores_gemma":[0.8610704,0.00029247906,0.13372476,0.00004711773,0.0000104676465,0.00023237236,0.0001774207,0.00006305134,0.004381884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996762,0.00014156486,0.000012194549,0.00003711767,0.0001037688,0.000029157669],"domain_scores_gemma":[0.9993943,0.00039247208,0.00006646337,0.00005121457,0.00007288874,0.000022565626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093014777,0.00059595634,0.0005864383,0.00043077735,0.00026045696,0.0008437097,0.00043641054,0.00086770597,0.0019621088],"category_scores_gemma":[0.0011743484,0.00040152317,0.00087396,0.00025377746,0.00053415494,0.00049589557,0.0006647868,0.00066293654,0.00027018896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020729225,0.000014772312,0.00015620442,0.000032591564,0.0000071997797,0.000021640648,0.000018224642,0.9926374,0.0018135986,0.0012953012,0.000073806084,0.003908518],"study_design_scores_gemma":[0.000002713868,0.000028809505,0.000053048963,0.000004464349,0.0000017298945,0.000005721605,0.000005204982,0.9986546,0.00055180996,0.00039474538,0.0002947995,0.000002287484],"about_ca_topic_score_codex":0.0014341931,"about_ca_topic_score_gemma":0.0012121635,"teacher_disagreement_score":0.0019621088,"about_ca_system_score_codex":0.00039532525,"about_ca_system_score_gemma":0.0007614782,"threshold_uncertainty_score":0.0065638423},"labels":[],"label_agreement":null},{"id":"W4410904053","doi":"10.21203/rs.3.rs-6657064/v1","title":"Benchmarking constrained, multi-objective and surrogate-assisted derivative-free optimization methods","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Multi-Objective Optimization Algorithms","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; Polytechnique Montréal","funders":"","keywords":"Benchmarking; Derivative (finance); Computer science; Mathematical optimization; Mathematics; Economics","score_opus":0.08449971043528098,"score_gpt":0.44349993854042585,"score_spread":0.35900022810514487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410904053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14379188,0.0028657948,0.8264671,0.00078423397,0.0005681435,0.00022543264,0.0010760057,0.002061078,0.02216029],"genre_scores_gemma":[0.6809189,0.00047397995,0.3123138,0.0002197588,0.00008229168,0.00028228978,0.0014656227,0.0007676444,0.0034757832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956729,0.0021346512,0.00022406226,0.00038429128,0.0013673244,0.0002166878],"domain_scores_gemma":[0.9906653,0.005309275,0.0003888429,0.0016477973,0.0016948719,0.00029385908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077180774,0.0017895909,0.0022544102,0.0018455671,0.0007636168,0.002212725,0.0025253587,0.0037669255,0.005097395],"category_scores_gemma":[0.018857516,0.0005927418,0.0013777018,0.002564736,0.0012930416,0.0020803697,0.002094226,0.002157965,0.00081776606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036859917,0.00021023268,0.00059401273,0.00034028201,0.00011031516,0.00004892279,0.000027931275,0.95278007,0.0014463481,0.008686179,0.00226517,0.03312194],"study_design_scores_gemma":[0.000020215739,0.000049777045,0.00019431564,0.000019235871,0.000007984077,0.0000130102435,0.0000059392737,0.99654657,0.00091747206,0.0017823924,0.00043552206,0.0000075837074],"about_ca_topic_score_codex":0.003037048,"about_ca_topic_score_gemma":0.0031776284,"teacher_disagreement_score":0.0077180774,"about_ca_system_score_codex":0.0012012137,"about_ca_system_score_gemma":0.0020189956,"threshold_uncertainty_score":0.04081756},"labels":[],"label_agreement":null},{"id":"W4411879513","doi":"10.3390/mi16070753","title":"Using Adaptive Surrogate Models to Accelerate Multi-Objective Design Optimization of MEMS","year":2025,"lang":"en","type":"article","venue":"Micromachines","topic":"Advanced Multi-Objective Optimization Algorithms","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":"National Institute for Nanotechnology; National Research Council Canada; University of Manitoba","funders":"National Research Council Canada","keywords":"Robustness (evolution); Actuator; Finite element method; Flexibility (engineering); Computer science; Microelectromechanical systems; Engineering optimization; Mathematical optimization; Surrogate model; Optimization problem; Multi-objective optimization; Control engineering; Engineering; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.08309343457273025,"score_gpt":0.32098100372323973,"score_spread":0.2378875691505095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411879513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075098877,0.00020626042,0.9900932,0.00007608556,0.000025223795,0.000022323315,0.000017132015,0.0001468159,0.0019031698],"genre_scores_gemma":[0.45654693,0.00052080106,0.5384291,0.00017572183,0.000056678247,0.00035148824,0.00017705647,0.0001794279,0.0035628325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996511,0.00015388713,0.000013475481,0.000034053082,0.00011990698,0.000027635157],"domain_scores_gemma":[0.9992735,0.00045464523,0.000084386484,0.000055652847,0.000104363615,0.000027497921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011808892,0.0008922861,0.0007146823,0.0004829646,0.00024838658,0.0006694583,0.00069730636,0.00092010055,0.0014395699],"category_scores_gemma":[0.0022001811,0.0004035685,0.00071888184,0.0003973896,0.00044999912,0.0006434114,0.00092415966,0.0011184755,0.0002986544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011241246,0.0000157581,0.00013959073,0.00003538685,0.000014216326,0.000014488536,0.000009279324,0.98372597,0.0010110955,0.0030051754,0.00017629101,0.011841529],"study_design_scores_gemma":[0.0000018844923,0.000011345733,0.00001896754,0.0000034973104,0.0000013118791,0.0000031770755,0.000001537943,0.99858993,0.00022067467,0.00085826335,0.00028801337,0.0000013372587],"about_ca_topic_score_codex":0.0012667008,"about_ca_topic_score_gemma":0.0014562696,"teacher_disagreement_score":0.0014395699,"about_ca_system_score_codex":0.00033948573,"about_ca_system_score_gemma":0.0008735025,"threshold_uncertainty_score":0.006245196},"labels":[],"label_agreement":null},{"id":"W4412749127","doi":"10.1016/j.asoc.2025.113510","title":"Multi-scale niching based differential evolution for feature selection on high-dimensional data","year":2025,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Hubei University of Technology; National Natural Science Foundation of China; Ontario Ministry of Natural Resources and Forestry","keywords":"Feature selection; Computer science; Scale (ratio); Differential evolution; Selection (genetic algorithm); Feature (linguistics); Differential (mechanical device); Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning; Physics","score_opus":0.01595772653215268,"score_gpt":0.28278824228581445,"score_spread":0.2668305157536618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412749127","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.0319741,0.00017855059,0.96632284,0.00010766638,0.000048819347,0.000040995805,0.000018723731,0.00012505538,0.0011831709],"genre_scores_gemma":[0.6435051,0.00016950184,0.3530434,0.00012887374,0.000041495256,0.0002290253,0.000078814104,0.00005701149,0.0027467841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977833,0.00005650627,0.000014129976,0.000037130765,0.00009261581,0.000021256075],"domain_scores_gemma":[0.99928075,0.00044366176,0.000049975246,0.000050804767,0.00015200519,0.00002276559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386077,0.00043049204,0.00083734887,0.00058720313,0.00037964524,0.00046356238,0.0012278886,0.00070910493,0.0009156409],"category_scores_gemma":[0.0029234805,0.00030032246,0.00062187656,0.000720916,0.0005160061,0.00062174205,0.0008802032,0.0007216436,0.000120644116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008721761,0.000055595974,0.0009052593,0.00008811107,0.00007381056,0.000068239984,0.00010688714,0.8779939,0.005684865,0.0074966047,0.0008765689,0.10656293],"study_design_scores_gemma":[0.0000033097867,0.0000072596654,0.00004916895,0.0000013281733,0.0000022915644,0.0000058709825,0.0000017785418,0.99916196,0.0002490869,0.0004233407,0.00009341971,0.000001329064],"about_ca_topic_score_codex":0.0031811208,"about_ca_topic_score_gemma":0.003661476,"teacher_disagreement_score":0.0031811208,"about_ca_system_score_codex":0.00072823046,"about_ca_system_score_gemma":0.00054935535,"threshold_uncertainty_score":0.006325245},"labels":[],"label_agreement":null},{"id":"W4413189063","doi":"10.3390/math13162579","title":"Beyond the Pareto Front: Utilizing the Entire Population for Decision-Making in Evolutionary Machine Learning","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Multi-Objective Optimization Algorithms","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; Wilfrid Laurier University","funders":"","keywords":"Pareto principle; Population; Artificial intelligence; Computer science; Front (military); Multi-objective optimization; Evolutionary algorithm; Machine learning; Operations research; Economics; Engineering; Sociology; Operations management; Demography; Mechanical engineering","score_opus":0.012432316410969544,"score_gpt":0.2949834346573994,"score_spread":0.28255111824642987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413189063","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.03333879,0.000972148,0.95866954,0.00063362723,0.00005331312,0.00015966344,0.000041416923,0.00016623382,0.0059652175],"genre_scores_gemma":[0.5816465,0.0012257608,0.4132003,0.0005385815,0.000083085935,0.0006097465,0.00013927088,0.00015207783,0.0024047024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974789,0.0012849729,0.00011337482,0.0002762787,0.00064250996,0.00020410291],"domain_scores_gemma":[0.9943891,0.0039019627,0.00034900891,0.00040551432,0.00079935655,0.00015510502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00799619,0.002093192,0.0017376274,0.0019037438,0.0012273653,0.0025063774,0.00151486,0.0019996844,0.00203696],"category_scores_gemma":[0.013642314,0.00074660184,0.0012638164,0.001070234,0.0022627164,0.0027200046,0.0027149455,0.0021134454,0.00045587373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078506026,0.0001046036,0.0014200626,0.00018226531,0.00009303832,0.00013200227,0.00030236822,0.8706085,0.0020891922,0.025185162,0.0007854448,0.0990189],"study_design_scores_gemma":[0.000021549555,0.00017328396,0.0003597631,0.00012846939,0.000034362016,0.000057457855,0.00012845897,0.96279174,0.0014151823,0.032891076,0.0019698376,0.00002871426],"about_ca_topic_score_codex":0.002456233,"about_ca_topic_score_gemma":0.0018710403,"teacher_disagreement_score":0.00799619,"about_ca_system_score_codex":0.001215175,"about_ca_system_score_gemma":0.0020825071,"threshold_uncertainty_score":0.042288363},"labels":[],"label_agreement":null},{"id":"W4413215786","doi":"10.1145/3712255.3726660","title":"A Hyper-feasible Solutions Based Update Weight Vectors Evolutionary Algorithm for Constrained Multiobjective Optimization Problem","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Evolutionary algorithm; Computer science; Multi-objective optimization; Evolutionary computation; Algorithm; Mathematics","score_opus":0.014630136503367846,"score_gpt":0.24461295393666962,"score_spread":0.2299828174333018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413215786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010866156,0.00020314695,0.986555,0.0000821054,0.000035773402,0.00005780887,0.000018105857,0.00014451811,0.0020373624],"genre_scores_gemma":[0.2519808,0.00040044557,0.7428986,0.00017314599,0.000041180683,0.00046238714,0.00016724001,0.000093763236,0.0037824442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960047,0.00012529048,0.000022367103,0.00006814095,0.0001413096,0.000042353557],"domain_scores_gemma":[0.99962187,0.00016684044,0.000038730774,0.000028996863,0.00011885981,0.000024750065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009580882,0.00089674443,0.00083470246,0.0010566431,0.0004056722,0.0007986439,0.0012950746,0.0008999411,0.0018829796],"category_scores_gemma":[0.0021882027,0.00043561956,0.00048846204,0.001066605,0.00042180443,0.0009394756,0.0011703968,0.0009967497,0.00031207682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056924924,0.0000789251,0.0007585287,0.00007590501,0.000062953986,0.000070443624,0.000105422354,0.718875,0.0046022907,0.016841142,0.001867352,0.25660518],"study_design_scores_gemma":[0.000013301237,0.000026935917,0.00007303349,0.0000070016836,0.000007673552,0.000015819714,0.000007532262,0.9971631,0.0003693066,0.001555866,0.00075565954,0.000004823508],"about_ca_topic_score_codex":0.0027860287,"about_ca_topic_score_gemma":0.0030724471,"teacher_disagreement_score":0.0027860287,"about_ca_system_score_codex":0.00042186075,"about_ca_system_score_gemma":0.0009079631,"threshold_uncertainty_score":0.006299138},"labels":[],"label_agreement":null},{"id":"W4413217170","doi":"10.1145/3712255.3734303","title":"BEACON: Continuous Bi-objective Benchmark problems with Explicit Adjustable COrrelatioN control","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Engineering and Physical Sciences Research Council; Foreign, Commonwealth and Development Office; International Development Research Centre","keywords":"Benchmark (surveying); Computer science; Correlation; Control (management); Mathematics; Artificial intelligence; Geometry; Geology","score_opus":0.007286590246987096,"score_gpt":0.21249624364268402,"score_spread":0.2052096533956969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413217170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06495704,0.0004156671,0.9269068,0.00028369538,0.00009993369,0.00017196986,0.00019431586,0.0008843399,0.0060861954],"genre_scores_gemma":[0.6879744,0.00017896759,0.3077587,0.00017312041,0.00003243515,0.0005496264,0.00044828752,0.0002546306,0.002629837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990227,0.00039926503,0.00004650647,0.00011553552,0.00032390162,0.000091971444],"domain_scores_gemma":[0.99686915,0.002096631,0.0002896218,0.00023605126,0.0003653747,0.00014314584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023070055,0.0009831645,0.0007940438,0.00076808943,0.0002856418,0.0009677163,0.001379404,0.0010212595,0.0019336115],"category_scores_gemma":[0.007667942,0.00035472435,0.00055952533,0.00065396546,0.0009273783,0.0007972586,0.001375363,0.0015715117,0.00032056007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010080528,0.000071051836,0.00047221032,0.00009112784,0.000024652114,0.000038827442,0.000021596674,0.97106916,0.0017541462,0.0076931952,0.00084003917,0.017823288],"study_design_scores_gemma":[0.000024618363,0.000066227294,0.00010244678,0.000008013484,0.0000035285789,0.000008160516,0.000006343536,0.9957411,0.00078352354,0.0028445027,0.00040652213,0.0000049942214],"about_ca_topic_score_codex":0.0016401503,"about_ca_topic_score_gemma":0.0014882344,"teacher_disagreement_score":0.0023070055,"about_ca_system_score_codex":0.00056759425,"about_ca_system_score_gemma":0.001016229,"threshold_uncertainty_score":0.012200773},"labels":[],"label_agreement":null},{"id":"W4413217398","doi":"10.1145/3712255.3726593","title":"A Constrained Multi-objective Co-Evolutionary Algorithm Based on Operator Score and Reward","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Operator (biology); Evolutionary algorithm; Evolutionary computation; Mathematical optimization; Artificial intelligence; Mathematics; Biology","score_opus":0.017290752717829837,"score_gpt":0.2625716933148158,"score_spread":0.24528094059698594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413217398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01323649,0.000186492,0.98284805,0.00010842096,0.00005628395,0.00009303305,0.000019740819,0.00022594174,0.0032255813],"genre_scores_gemma":[0.3192073,0.00026258477,0.6740991,0.00017706059,0.000041152958,0.00042458143,0.00010677055,0.000094432035,0.005587003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994221,0.00015677056,0.00002877045,0.00009936342,0.00024452922,0.00004858675],"domain_scores_gemma":[0.99941957,0.00023981661,0.000058652848,0.000053157684,0.00017824632,0.000050610688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288247,0.0007169368,0.0008675266,0.00084313954,0.0006212433,0.0007943844,0.0011567103,0.0010887884,0.001725593],"category_scores_gemma":[0.0021395658,0.00023677945,0.00060465233,0.0009796199,0.000506634,0.00085103716,0.0009329573,0.000959959,0.00033297198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013195616,0.00021256355,0.0020570708,0.00014598903,0.00014243649,0.00021026068,0.00017829215,0.6518396,0.027227916,0.036016352,0.0032193456,0.27861828],"study_design_scores_gemma":[0.000021116211,0.00006884962,0.00019586705,0.00000769556,0.000015693358,0.00010741977,0.000007773762,0.9935541,0.002256709,0.0018520566,0.0018979551,0.000014813123],"about_ca_topic_score_codex":0.0031088444,"about_ca_topic_score_gemma":0.003145215,"teacher_disagreement_score":0.0031088444,"about_ca_system_score_codex":0.0004723951,"about_ca_system_score_gemma":0.0014081709,"threshold_uncertainty_score":0.006181538},"labels":[],"label_agreement":null},{"id":"W4413217936","doi":"10.2139/ssrn.5386966","title":"A Reward-Directed Diffusion Framework for Generative Design Optimization","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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; University of British Columbia Hospital","funders":"","keywords":"Diffusion; Generative grammar; Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Thermodynamics; Physics","score_opus":0.019654085544513294,"score_gpt":0.29512955125753837,"score_spread":0.27547546571302506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413217936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011120079,0.0001804504,0.9967615,0.0001293771,0.0000203169,0.0000182024,0.000021415173,0.000055834007,0.0017008455],"genre_scores_gemma":[0.31908455,0.0014874368,0.6581081,0.00033211792,0.00020730209,0.0005072684,0.0002253463,0.00041711723,0.019630741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885297,0.00060797844,0.00004291929,0.00015343321,0.00026570412,0.000077108765],"domain_scores_gemma":[0.9971961,0.0020332865,0.00015358388,0.00016725867,0.0003136259,0.00013620668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030770528,0.001481364,0.002084835,0.0013318305,0.0007995329,0.0017889029,0.002568138,0.0030353218,0.0054435227],"category_scores_gemma":[0.007140348,0.0013484758,0.001521686,0.0016537934,0.001957983,0.0017057648,0.002765892,0.0025904335,0.0010215426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002081586,0.000028974302,0.00014758382,0.000077452125,0.000033463337,0.000051045652,0.00005407401,0.82550365,0.00071834377,0.15687028,0.0010100655,0.015484238],"study_design_scores_gemma":[0.0000070756214,0.00000950591,0.000016922942,0.000007696168,0.000005739983,0.00000913953,0.0000028601373,0.9660293,0.000077344186,0.033060603,0.0007683639,0.0000054628417],"about_ca_topic_score_codex":0.005570546,"about_ca_topic_score_gemma":0.005714996,"teacher_disagreement_score":0.005570546,"about_ca_system_score_codex":0.0016828121,"about_ca_system_score_gemma":0.0017953662,"threshold_uncertainty_score":0.018210351},"labels":[],"label_agreement":null},{"id":"W4414140393","doi":"10.1016/j.eswa.2025.129460","title":"Regularity model-driven large-scale multi-objective evolutionary algorithm based on dual-information offspring reproduction strategy","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"Dalian Science and Technology Innovation Fund; Higher Education Discipline Innovation Project; China Academy of Space Technology; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Evolutionary algorithm; Benchmark (surveying); Population; Exploit; Set (abstract data type); Estimation of distribution algorithm; Pareto principle; Optimization problem","score_opus":0.011455052258397037,"score_gpt":0.266928922922486,"score_spread":0.25547387066408894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414140393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05155669,0.00023028861,0.94026244,0.00023426425,0.00007203708,0.000060473347,0.000035084675,0.00017236621,0.0073763547],"genre_scores_gemma":[0.8425604,0.00017160203,0.15106627,0.00011186086,0.00003762869,0.0002318618,0.0001045043,0.00007454895,0.005641242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999798,0.0000563926,0.000008093309,0.000039419927,0.00007215448,0.000025982477],"domain_scores_gemma":[0.9995715,0.00020350961,0.000050721304,0.000038333987,0.000098400866,0.000037503447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061798503,0.00044838185,0.0010936481,0.00047032896,0.00051940215,0.0007285949,0.0016330362,0.0010320771,0.0017787456],"category_scores_gemma":[0.0016753833,0.00032668514,0.00065617176,0.00043724565,0.00059977156,0.00071803556,0.0012482693,0.000689652,0.00023755779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003708936,0.000034164408,0.0005531727,0.000039183436,0.000029692406,0.00007833052,0.00003879658,0.96300536,0.002805468,0.01858999,0.00064156647,0.014147109],"study_design_scores_gemma":[0.000005033363,0.000008911956,0.000038973143,0.0000012028833,0.0000030168871,0.000010046513,0.0000017556313,0.99884075,0.000086739565,0.00091270905,0.00008893518,0.0000019978208],"about_ca_topic_score_codex":0.0022986268,"about_ca_topic_score_gemma":0.0015661325,"teacher_disagreement_score":0.0022986268,"about_ca_system_score_codex":0.0006163489,"about_ca_system_score_gemma":0.00080632523,"threshold_uncertainty_score":0.0059505105},"labels":[],"label_agreement":null},{"id":"W4414222950","doi":"10.1609/icaps.v35i1.36109","title":"Parallelizing Multi-objective A* Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Curse of dimensionality; Graph; Enhanced Data Rates for GSM Evolution; Shortest path problem; Optimization problem; Path (computing); Search algorithm; Key (lock)","score_opus":0.04308071131536093,"score_gpt":0.3321844671879373,"score_spread":0.28910375587257636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414222950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063910104,0.00043620868,0.92119205,0.00027202154,0.00014207819,0.00018862139,0.00010362672,0.0020787462,0.0116764],"genre_scores_gemma":[0.37985003,0.00018920933,0.6159288,0.00015012333,0.00004495465,0.0003081045,0.00025232468,0.00019327282,0.0030831862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937636,0.0001920599,0.00003732544,0.00012361402,0.0001830245,0.000087676955],"domain_scores_gemma":[0.99875414,0.0006633897,0.00010742814,0.00019036567,0.00021398895,0.00007073208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010676149,0.0009978138,0.0010069866,0.0008792066,0.00060833676,0.0008228653,0.0014034176,0.00088070944,0.0034111363],"category_scores_gemma":[0.0027259092,0.00040966805,0.0007847789,0.0011254171,0.0005548804,0.00095921574,0.0015720774,0.0011879286,0.00069355586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019102244,0.00020140482,0.0005897422,0.00011104995,0.00006818108,0.000081773214,0.00005201204,0.8152531,0.004792115,0.012002715,0.002251023,0.16440584],"study_design_scores_gemma":[0.000028863074,0.000040068706,0.0000731809,0.0000044507583,0.0000054880543,0.000012760887,0.000010531734,0.9947754,0.000760514,0.0034512212,0.0008344257,0.0000031696545],"about_ca_topic_score_codex":0.005534154,"about_ca_topic_score_gemma":0.00498952,"teacher_disagreement_score":0.005534154,"about_ca_system_score_codex":0.0006034767,"about_ca_system_score_gemma":0.0017339975,"threshold_uncertainty_score":0.011411428},"labels":[],"label_agreement":null},{"id":"W4414261676","doi":"10.1002/nme.70118","title":"A Framework for Nonlinearly‐Constrained Gradient‐Enhanced Local Bayesian Optimization With Comparisons to Quasi‐Newton Optimizers","year":2025,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Institute for Christian Studies; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian optimization; Leverage (statistics); Bayesian probability; Convergence (economics); Minification; Function (biology); Global optimization; Optimization problem","score_opus":0.0196110175085854,"score_gpt":0.3928689335461665,"score_spread":0.3732579160375811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414261676","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.00043859743,0.00021675817,0.997795,0.00012884648,0.000025811847,0.000021404077,0.000013419826,0.00008965149,0.0012705406],"genre_scores_gemma":[0.08020919,0.0009713476,0.9114049,0.00036779087,0.00020929378,0.00048621674,0.00012975333,0.0006189631,0.005602568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998548,0.0007921942,0.00006334796,0.00014158132,0.00038759722,0.00006729504],"domain_scores_gemma":[0.99795216,0.0011868974,0.00016106058,0.00014165076,0.0004518368,0.00010643973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043397625,0.0013864374,0.0013784124,0.0011507373,0.00065460027,0.0018450781,0.0025068757,0.0018956313,0.005498049],"category_scores_gemma":[0.007347137,0.0009874776,0.0013408203,0.0008554706,0.0020777588,0.0021062554,0.0029149586,0.0029210907,0.0016317298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040803825,0.000047861122,0.00026276842,0.00023357915,0.00007015599,0.00008312936,0.00013576094,0.60062575,0.0021329627,0.34737068,0.003993192,0.04500344],"study_design_scores_gemma":[0.000007382146,0.00001495095,0.000034563,0.00002312367,0.0000066051193,0.000012642794,0.0000067940227,0.9716286,0.00024432255,0.025572374,0.0024388365,0.000009791756],"about_ca_topic_score_codex":0.006835531,"about_ca_topic_score_gemma":0.00610985,"teacher_disagreement_score":0.006835531,"about_ca_system_score_codex":0.0013820357,"about_ca_system_score_gemma":0.002546116,"threshold_uncertainty_score":0.022951186},"labels":[],"label_agreement":null},{"id":"W4415598810","doi":"10.1115/detc2025-168995","title":"RePaint-Enhanced Conditional Diffusion Model for Generating Designs Under Performance Constraints","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Flexibility (engineering); Controllability; Parametric statistics; Hull; Probabilistic logic; Design of experiments; Parametric model; Optimal design; Diffusion","score_opus":0.04076867937342012,"score_gpt":0.307810912348404,"score_spread":0.2670422329749839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415598810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007519395,0.00012261054,0.99064445,0.000061821134,0.00001060024,0.000027682998,0.00007153753,0.0005212742,0.0010206578],"genre_scores_gemma":[0.42739227,0.00024171792,0.5648727,0.00021740964,0.000035158293,0.00038317614,0.000618714,0.0005007805,0.005738099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924004,0.00020262,0.000029116694,0.00018145736,0.00028917822,0.000057563815],"domain_scores_gemma":[0.9978517,0.0013722894,0.00023075275,0.00021524649,0.0002761833,0.000053753716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019380315,0.0011758108,0.000967709,0.00094040786,0.0002724293,0.0006241555,0.0015855469,0.001160103,0.0031738442],"category_scores_gemma":[0.004904882,0.0007260643,0.0013002655,0.00056993286,0.0008049411,0.0009016782,0.0008981952,0.0012770541,0.0006886609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003942997,0.000027563357,0.000312113,0.000076481105,0.000021452286,0.00003725554,0.000037171216,0.95177305,0.0039665336,0.008745048,0.00057434343,0.0343896],"study_design_scores_gemma":[0.000005119085,0.000022328622,0.000040117,0.000004093944,0.000004691779,0.000010966772,0.0000016713137,0.9960828,0.0010424949,0.0023814575,0.00040011475,0.000004153492],"about_ca_topic_score_codex":0.002804915,"about_ca_topic_score_gemma":0.0040320316,"teacher_disagreement_score":0.0031738442,"about_ca_system_score_codex":0.0009428527,"about_ca_system_score_gemma":0.0010413537,"threshold_uncertainty_score":0.010617614},"labels":[],"label_agreement":null},{"id":"W4415960426","doi":"10.26434/chemrxiv-2025-f1wcr","title":"Honegumi RAG Assistant: An Agentic System for Accelerating Bayesian Optimization Adoption in Experimental Sciences","year":2025,"lang":"","type":"article","venue":"ChemRxiv","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Code (set theory); Domain (mathematical analysis); Documentation; Bayesian optimization; Code generation; Bayesian network; Source code; Bayesian probability","score_opus":0.035920299597437456,"score_gpt":0.31785016600266486,"score_spread":0.2819298664052274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415960426","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.0044843038,0.00020187933,0.7748919,0.00027308412,0.00011939006,0.0003098385,0.00093253737,0.21050344,0.00828361],"genre_scores_gemma":[0.05588805,0.00035679192,0.9044062,0.000740665,0.000058853344,0.0009149953,0.0034186053,0.021955198,0.012260717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991405,0.00022395511,0.00007406465,0.00020168143,0.00030211042,0.00005768546],"domain_scores_gemma":[0.9978073,0.0010295005,0.00018599707,0.00051109894,0.00033956225,0.00012647336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028563396,0.0010133972,0.0004621831,0.00079921953,0.0005831604,0.0015806998,0.0025353814,0.0012960562,0.020067383],"category_scores_gemma":[0.0076637706,0.00093801186,0.00115003,0.00035321628,0.0007706456,0.0017352318,0.0023525208,0.002151169,0.0102072675],"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.0015781141,0.0006495504,0.0047964896,0.0015472941,0.0003853195,0.0008772846,0.001244043,0.07352345,0.08222269,0.08698402,0.20833954,0.5378522],"study_design_scores_gemma":[0.00048712554,0.00027447796,0.0011419308,0.0001685604,0.000108572436,0.00040131964,0.00007942972,0.6097011,0.06037443,0.040703755,0.28639543,0.00016380571],"about_ca_topic_score_codex":0.0029823396,"about_ca_topic_score_gemma":0.0036595387,"teacher_disagreement_score":0.020067383,"about_ca_system_score_codex":0.00085303263,"about_ca_system_score_gemma":0.0021020272,"threshold_uncertainty_score":0.067132115},"labels":[],"label_agreement":null},{"id":"W4416008725","doi":"10.1080/00401706.2025.2584500","title":"Genetic Algorithm-Based Bayesian Optimal Design for Network Experiments","year":2025,"lang":"en","type":"article","venue":"Technometrics","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian probability; Design of experiments; Bayesian network; Bayesian experimental design; Genetic algorithm; Optimal design","score_opus":0.0236615742409144,"score_gpt":0.2951492238251354,"score_spread":0.271487649584221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416008725","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.004650421,0.00018681008,0.9937831,0.00015250471,0.000019539766,0.00014310393,0.000027060476,0.00009669367,0.00094081316],"genre_scores_gemma":[0.20739265,0.00038618542,0.7887028,0.00029462026,0.000033607084,0.0015201214,0.00017504959,0.00009245232,0.0014025499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916426,0.006322076,0.00017064868,0.0007231028,0.00087810634,0.00026340046],"domain_scores_gemma":[0.9779403,0.018726302,0.0013423415,0.00055867335,0.0010887557,0.0003436635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013697451,0.0023011994,0.0028088305,0.0027737052,0.00073762046,0.0014386264,0.0021419628,0.0026247744,0.0025415076],"category_scores_gemma":[0.03427554,0.0013069297,0.0013921182,0.0017903986,0.0027733913,0.0016891703,0.0021372642,0.0023703396,0.0004463094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010763324,0.00007444666,0.00039249778,0.0001050378,0.000070866314,0.000032928532,0.000045953086,0.9413671,0.00048453838,0.03200045,0.00032286972,0.024995614],"study_design_scores_gemma":[0.00006755778,0.000067868394,0.00009111977,0.000019924388,0.00001578295,0.000008271083,0.0000073773062,0.97286385,0.0002526889,0.026143657,0.00045263206,0.0000092200935],"about_ca_topic_score_codex":0.0034097538,"about_ca_topic_score_gemma":0.0031405543,"teacher_disagreement_score":0.013697451,"about_ca_system_score_codex":0.0031659638,"about_ca_system_score_gemma":0.0044022338,"threshold_uncertainty_score":0.07243991},"labels":[],"label_agreement":null},{"id":"W4416034102","doi":"10.18653/v1/2025.findings-emnlp.838","title":"LLMs for Bayesian Optimization in Scientific Domains: Are We There Yet?","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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; Canadian Institute for Advanced Research","keywords":"Bayesian probability; Key (lock); Bayesian inference; Bayesian optimization","score_opus":0.01814474607173039,"score_gpt":0.2931597976741683,"score_spread":0.2750150516024379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416034102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007445728,0.0007227695,0.98638666,0.0014797935,0.00005623295,0.000072218994,0.000083321815,0.001973172,0.001780114],"genre_scores_gemma":[0.27501267,0.0007084781,0.718918,0.0015799459,0.00014400882,0.0006269102,0.0002681075,0.0007281082,0.002013776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958197,0.00281164,0.00013935614,0.00049393985,0.0006205351,0.00011484198],"domain_scores_gemma":[0.98348886,0.012860598,0.0007710166,0.0017239862,0.00070715795,0.00044837434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008854064,0.0010532174,0.0015848903,0.0005840456,0.0005946202,0.0022537282,0.0025905308,0.0023480277,0.004470298],"category_scores_gemma":[0.03943722,0.0007953581,0.0008907719,0.0006800577,0.0024635543,0.0032403865,0.0028599275,0.0044482825,0.00146348],"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.0005118233,0.00024445532,0.0016724649,0.00058987376,0.00019907785,0.00008159058,0.00028563917,0.6912615,0.0038997796,0.115955174,0.0057469415,0.17955169],"study_design_scores_gemma":[0.00006377816,0.000045224715,0.00010809673,0.000030210194,0.000012318859,0.000012064796,0.000017983093,0.89776254,0.0011530718,0.09814065,0.002637621,0.000016463497],"about_ca_topic_score_codex":0.0026056266,"about_ca_topic_score_gemma":0.004857035,"teacher_disagreement_score":0.008854064,"about_ca_system_score_codex":0.0019933158,"about_ca_system_score_gemma":0.0027729613,"threshold_uncertainty_score":0.04682529},"labels":[],"label_agreement":null},{"id":"W4416893698","doi":"10.1016/j.engappai.2025.113378","title":"A reward-directed diffusion framework for generative design","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Compute Canada","keywords":"Diffusion; Generative grammar; Generative model; Generative Design; Surface fitting","score_opus":0.02645839830539809,"score_gpt":0.3086985925554244,"score_spread":0.28224019425002633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416893698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012787825,0.0001451929,0.9957983,0.000120975616,0.000015974532,0.000019495543,0.00001827351,0.00007126251,0.0025316598],"genre_scores_gemma":[0.3001311,0.0009868791,0.6805926,0.00019202384,0.00010221445,0.00037943674,0.00013673266,0.0003312942,0.017147738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991412,0.00042248456,0.000035602305,0.00011445795,0.00022524087,0.00006103009],"domain_scores_gemma":[0.9982285,0.0012099275,0.000093117545,0.00015603284,0.00022041878,0.00009203427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148535,0.0009403133,0.0012843785,0.0010996321,0.0008415663,0.0017638627,0.0022827531,0.0022652692,0.0060557993],"category_scores_gemma":[0.005443636,0.0009149296,0.0012589032,0.0012205504,0.0018509642,0.001635272,0.002136145,0.001876166,0.001017281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019242023,0.000027665741,0.00015322007,0.00006684917,0.000023997565,0.000051576408,0.00008929119,0.59120023,0.0011283866,0.38515115,0.0009716786,0.02111662],"study_design_scores_gemma":[0.0000089718715,0.00001097319,0.000020099556,0.000009367669,0.000006318071,0.000014076224,0.0000047367575,0.921367,0.00017764112,0.07663876,0.0017353394,0.0000068278814],"about_ca_topic_score_codex":0.0047265585,"about_ca_topic_score_gemma":0.005457934,"teacher_disagreement_score":0.0060557993,"about_ca_system_score_codex":0.001557192,"about_ca_system_score_gemma":0.0015600935,"threshold_uncertainty_score":0.020258665},"labels":[],"label_agreement":null},{"id":"W4416939867","doi":"10.2139/ssrn.5851456","title":"HeatGen: A Guided Diffusion Framework for Multiphysics Heat Sink Design Optimization","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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; University of British Columbia Hospital","funders":"","keywords":"Multiphysics; Surrogate model; Heat sink; Probabilistic logic; Pressure drop; Topology optimization; Optimization problem; Boundary value problem; Artificial neural network","score_opus":0.027805355877525875,"score_gpt":0.3117422621490365,"score_spread":0.28393690627151064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416939867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012441911,0.00015318223,0.99496585,0.000107742424,0.000050372084,0.000035449197,0.00007130527,0.0005162048,0.0028557251],"genre_scores_gemma":[0.13376577,0.00056333974,0.85346454,0.0002685331,0.000105846666,0.00049618917,0.00028630326,0.0015957493,0.009453705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996735,0.00011950063,0.0000088518555,0.00003411157,0.0001400161,0.000024079904],"domain_scores_gemma":[0.99967134,0.00015842132,0.00002368163,0.000042648604,0.000074813805,0.000029012128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009112417,0.0016814123,0.0010623079,0.0006817349,0.00056160346,0.0011099909,0.0017873037,0.0018939206,0.0060579614],"category_scores_gemma":[0.0014365818,0.0007337742,0.0010858668,0.00069570367,0.0007783259,0.0007233132,0.001776592,0.0021215626,0.001345649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000442033,0.00005008184,0.000116448864,0.00012826882,0.000044396966,0.000036375004,0.000039721577,0.91890526,0.0040367176,0.041317128,0.0033504188,0.031930964],"study_design_scores_gemma":[0.000011487787,0.000009757007,0.000015976006,0.000007047421,0.0000042128654,0.0000056268714,0.000003291783,0.9886905,0.0004688644,0.008198673,0.002580234,0.0000043104023],"about_ca_topic_score_codex":0.0034937283,"about_ca_topic_score_gemma":0.0047162045,"teacher_disagreement_score":0.0060579614,"about_ca_system_score_codex":0.00072695676,"about_ca_system_score_gemma":0.001394215,"threshold_uncertainty_score":0.020265877},"labels":[],"label_agreement":null},{"id":"W4417136649","doi":"10.1016/j.cor.2025.107351","title":"An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: Application in supervised machine learning","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"Iran National Science Foundation","keywords":"Line search; Penalty method; Convergence (economics); Constraint (computer-aided design); Quadratic programming; Sequential quadratic programming; Line (geometry); Quadratic equation","score_opus":0.03756761558015091,"score_gpt":0.3951614774180427,"score_spread":0.35759386183789177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417136649","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.0028408258,0.000060811624,0.996011,0.000040256367,0.000051372193,0.000042286072,0.000017752689,0.00022810875,0.00070741266],"genre_scores_gemma":[0.076394565,0.00007639261,0.9200265,0.000093373776,0.000041615578,0.00023468614,0.000080071215,0.00021214585,0.002840748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911886,0.0003362033,0.000053335538,0.00010153578,0.00034495557,0.000045106575],"domain_scores_gemma":[0.997678,0.001183972,0.00023838761,0.00023427047,0.00054510566,0.000120437864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412642,0.0010769053,0.0011083896,0.0009228455,0.000416849,0.0008705341,0.0015198389,0.0014986235,0.005133938],"category_scores_gemma":[0.0047752378,0.0005958927,0.00055573386,0.0008652951,0.0007313323,0.0014178292,0.0013383873,0.0016079573,0.0011633133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049716455,0.00042315168,0.00079925446,0.00053825695,0.000106186824,0.00026094777,0.0001240323,0.50977,0.023682171,0.0371199,0.0066405134,0.42003846],"study_design_scores_gemma":[0.000013396849,0.000039923234,0.000058990114,0.0000059690788,0.0000027882513,0.000028560107,0.0000027438248,0.9971283,0.00089066854,0.0012629367,0.000557657,0.000008073722],"about_ca_topic_score_codex":0.0014091623,"about_ca_topic_score_gemma":0.002692965,"teacher_disagreement_score":0.005133938,"about_ca_system_score_codex":0.00036031377,"about_ca_system_score_gemma":0.0011735595,"threshold_uncertainty_score":0.01717472},"labels":[],"label_agreement":null},{"id":"W4417382663","doi":"10.1145/3785134","title":"Algorithm 1060: EDOLAB, a Platform for Research and Education in Evolutionary Dynamic Optimization","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Benchmark (surveying); Suite; Consistency (knowledge bases); MATLAB; Evolutionary algorithm; Optimization problem; Genetic algorithm","score_opus":0.030343149558077168,"score_gpt":0.3628512883966522,"score_spread":0.33250813883857505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417382663","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057704616,0.0011680416,0.8149617,0.00093450904,0.00041051378,0.00031883141,0.0062547866,0.14340119,0.026780065],"genre_scores_gemma":[0.05685782,0.0011450372,0.8846599,0.0008589185,0.0000920478,0.0015625317,0.01569837,0.023654947,0.015470342],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992545,0.00018270347,0.000060915998,0.00014129477,0.00029430562,0.000066277484],"domain_scores_gemma":[0.99843436,0.00085172174,0.000116815856,0.00022802246,0.00026548363,0.00010359631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018258187,0.0014023035,0.00081294077,0.001116311,0.00041992444,0.0014516715,0.0028104712,0.0012910793,0.040098783],"category_scores_gemma":[0.0074504986,0.0005497265,0.0007593185,0.00094300584,0.0005667563,0.0016172981,0.0023539797,0.0022575853,0.015463314],"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.00093155634,0.00053236494,0.002674928,0.0018414814,0.0002550109,0.00037641506,0.00026810792,0.1858237,0.012973377,0.06647216,0.34801927,0.3798317],"study_design_scores_gemma":[0.0007152655,0.00019403792,0.0007914373,0.00018939396,0.000042728458,0.0002463167,0.00003576118,0.7109838,0.0104057565,0.03478653,0.24151653,0.00009237976],"about_ca_topic_score_codex":0.0021429749,"about_ca_topic_score_gemma":0.003575135,"teacher_disagreement_score":0.040098783,"about_ca_system_score_codex":0.0006183591,"about_ca_system_score_gemma":0.0018609503,"threshold_uncertainty_score":0.13414383},"labels":[],"label_agreement":null},{"id":"W60686164","doi":"10.1007/978-3-642-25566-3_40","title":"Sequential Model-Based Optimization for General Algorithm Configuration","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2377,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Computer science; Algorithm; Categorical variable; Mathematical optimization; Satisfiability; Integer programming; State (computer science); Optimization problem; Search algorithm; State space; Mathematics; Machine learning","score_opus":0.026164776281192334,"score_gpt":0.26749758618354724,"score_spread":0.2413328099023549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60686164","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.0028432456,0.00013416489,0.9934348,0.00005289417,0.000035354133,0.000055271663,0.000037255573,0.00043139665,0.0029755428],"genre_scores_gemma":[0.4251452,0.00036758278,0.5631585,0.00015413295,0.0000967744,0.0007861002,0.00040676165,0.0007836013,0.009101368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989687,0.00045174678,0.000039851664,0.00016313164,0.00027588665,0.00010059849],"domain_scores_gemma":[0.99839395,0.0010247183,0.00009995732,0.00021559937,0.0002075213,0.000058109854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016653412,0.001775204,0.0021757933,0.0007076579,0.0006251879,0.0011343344,0.0021628302,0.0014750262,0.009855783],"category_scores_gemma":[0.0049166447,0.0013055787,0.001339748,0.0012269474,0.00085519755,0.001942891,0.0019183343,0.0017440942,0.0012819617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005862716,0.000025490059,0.00006596276,0.000060202106,0.000019879677,0.00001620018,0.000012594809,0.97034204,0.00038615297,0.0064986045,0.0010193058,0.021494962],"study_design_scores_gemma":[0.0000064043747,0.000013011742,0.000017163842,0.00000251529,0.0000032553405,0.000004587291,0.0000014348634,0.9956923,0.000091713635,0.0039519,0.00021367581,0.000001937667],"about_ca_topic_score_codex":0.004568542,"about_ca_topic_score_gemma":0.0055337213,"teacher_disagreement_score":0.009855783,"about_ca_system_score_codex":0.00112615,"about_ca_system_score_gemma":0.0017168238,"threshold_uncertainty_score":0.032970846},"labels":[],"label_agreement":null},{"id":"W626466576","doi":"10.1016/j.eswa.2015.05.036","title":"A combined interactive procedure using preference-based evolutionary multiobjective optimization. Application to the efficiency improvement of the auxiliary services of power plants","year":2015,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Multi-objective optimization; Computer science; Mathematical optimization; Evolutionary algorithm; Profitability index; Set (abstract data type); Pareto principle; Preference; Decision maker; Optimization problem; Operations research; Mathematics; Artificial intelligence; Machine learning; Economics","score_opus":0.01707482874664799,"score_gpt":0.2587027076591576,"score_spread":0.2416278789125096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W626466576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009545129,0.000048916587,0.9873191,0.000027770902,0.000018661347,0.00010357399,0.000047019206,0.0004479533,0.0024418917],"genre_scores_gemma":[0.23477137,0.00006391599,0.7617756,0.00006176493,0.000018496037,0.0003860899,0.00014063176,0.00021495503,0.0025671115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.0002694036,0.000033731805,0.00007226364,0.0002551007,0.00007370087],"domain_scores_gemma":[0.9988463,0.00057615066,0.000063061954,0.00013957708,0.00031938936,0.00005555854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585291,0.0009903876,0.0011358021,0.0014807753,0.0007074617,0.0006755618,0.001669878,0.0010993854,0.008700339],"category_scores_gemma":[0.0032942083,0.00045993662,0.0010667773,0.0017125435,0.00033507627,0.00075040443,0.0014243807,0.00078953826,0.0008349924],"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.000276786,0.00047664606,0.0011935036,0.00033183134,0.00019298652,0.00021945663,0.00016205314,0.48161387,0.017106974,0.010462971,0.0026122348,0.48535073],"study_design_scores_gemma":[0.000032976477,0.00011913252,0.00033742675,0.000010886753,0.000036194513,0.000059819162,0.000021819373,0.99153835,0.0037581178,0.0027923859,0.0012751627,0.000017681921],"about_ca_topic_score_codex":0.0025973308,"about_ca_topic_score_gemma":0.0049301824,"teacher_disagreement_score":0.008700339,"about_ca_system_score_codex":0.0003572667,"about_ca_system_score_gemma":0.000899668,"threshold_uncertainty_score":0.029105544},"labels":[],"label_agreement":null},{"id":"W6893880472","doi":"10.5281/zenodo.6521193","title":"Deep Reinforcement Learning for Optimal Experimental Design in Biology","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"European Commission","keywords":"Python (programming language); Reinforcement learning; Reinforcement; Directory; Learning classifier system; Optimal design","score_opus":0.039867878897461885,"score_gpt":0.28847799848019645,"score_spread":0.24861011958273457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893880472","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.0014246374,0.00025567482,0.9781965,0.0007613026,0.00014327798,0.000069809,0.0023863548,0.011891554,0.004870931],"genre_scores_gemma":[0.060421888,0.00058945373,0.9149643,0.00097374484,0.00014357772,0.0009433189,0.0051330565,0.008225322,0.008605296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983374,0.0006800155,0.00008357074,0.0002674998,0.0005341653,0.000097378506],"domain_scores_gemma":[0.99422777,0.0036068235,0.0003816141,0.00081551104,0.00071089587,0.0002573705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049153827,0.0009963072,0.0009470031,0.0006684175,0.00044988826,0.0015108896,0.0021546346,0.0012035811,0.03962586],"category_scores_gemma":[0.016982317,0.00090704265,0.0008238342,0.00071223726,0.0010690739,0.002181697,0.0022175848,0.0035906634,0.010630517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005409656,0.00018638944,0.0022470457,0.0016044508,0.00023809228,0.00014965802,0.00016329615,0.2783868,0.013985791,0.23596983,0.22569102,0.2408367],"study_design_scores_gemma":[0.00013674007,0.00006776352,0.00050601724,0.00012741663,0.00002829943,0.000048959748,0.00001528015,0.7323981,0.014768575,0.19380987,0.058044508,0.00004854761],"about_ca_topic_score_codex":0.0016494571,"about_ca_topic_score_gemma":0.003133334,"teacher_disagreement_score":0.03962586,"about_ca_system_score_codex":0.001763672,"about_ca_system_score_gemma":0.0025829955,"threshold_uncertainty_score":0.13256168},"labels":[],"label_agreement":null},{"id":"W6906506499","doi":"10.17863/cam.22360","title":"Rejoinder","year":2016,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Advanced Multi-Objective Optimization Algorithms","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; Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Implementation; Variation (astronomy); Statistical model; Empirical research; Statistical analysis","score_opus":0.007116720672522968,"score_gpt":0.18367624383046538,"score_spread":0.1765595231579424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6906506499","genre_codex":"commentary","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.00038269648,0.0027935766,0.0018051616,0.9055611,0.08152581,0.000023330591,0.000115128314,0.0001951847,0.0075980863],"genre_scores_gemma":[0.010624757,0.0014861143,0.0025955075,0.8980745,0.041514263,0.0001273549,0.000094621006,0.00038874347,0.045094047],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9883532,0.003942307,0.00076455437,0.0023338448,0.0039086263,0.00069756416],"domain_scores_gemma":[0.96346784,0.01394475,0.0015658346,0.002624346,0.01461844,0.0037788686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011030204,0.0011258567,0.0010176488,0.0009853228,0.0037426585,0.006396047,0.0038494747,0.013680216,0.02257215],"category_scores_gemma":[0.08160361,0.00040578377,0.0011604389,0.00074130704,0.004741632,0.011226625,0.005493405,0.03173811,0.016293526],"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.000026273408,0.000011078077,0.00013788027,0.000051590094,0.000010010566,0.00019558836,0.00061588676,0.000057954643,0.00011067923,0.02016775,0.9728663,0.0057489057],"study_design_scores_gemma":[0.000007904464,0.0000077137465,0.00011659284,0.00009378197,0.0000066499124,0.00021126214,0.00072549074,0.00012210065,0.00013362133,0.015124498,0.983426,0.000024339475],"about_ca_topic_score_codex":0.0033893292,"about_ca_topic_score_gemma":0.0041752453,"teacher_disagreement_score":0.02257215,"about_ca_system_score_codex":0.0031784095,"about_ca_system_score_gemma":0.004627543,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6925642956","doi":"10.17895/ices.pub.19936694","title":"Report of the Working Group on Oceanic Hydrography (WGOH)","year":2002,"lang":"en","type":"report","venue":"International Council for the Exploration of the Sea (ICES)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Hydrography; Group (periodic table); Buoy; Indian ocean","score_opus":0.1896767795538437,"score_gpt":0.30695874407967555,"score_spread":0.11728196452583184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925642956","genre_codex":"dataset","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.029447274,0.011882287,0.029468406,0.033012744,0.019149791,0.0033050622,0.60560846,0.0034029104,0.26472303],"genre_scores_gemma":[0.040466882,0.006790355,0.025733968,0.0023561718,0.002019263,0.0017036054,0.3320273,0.0017850746,0.5871174],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988356,0.00011732389,0.000057123776,0.0001437666,0.000649725,0.00019632715],"domain_scores_gemma":[0.9923739,0.00036613105,0.0003073206,0.0004855483,0.0050132815,0.0014537043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002995532,0.0015427,0.0007873346,0.0028978912,0.0013308098,0.0019365371,0.0017065469,0.0012452097,0.03084772],"category_scores_gemma":[0.0032681965,0.00044582933,0.00036813767,0.0037145813,0.0004670174,0.0011032011,0.0017522933,0.0013844328,0.013586751],"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.0001565973,0.000089672256,0.006324096,0.00023605359,0.000021429425,0.00009274367,0.00024087008,0.0009642901,0.0011667366,0.0012041144,0.9466602,0.042843353],"study_design_scores_gemma":[0.000044009794,0.00004261469,0.026597798,0.00020698617,0.00002515809,0.000043001874,0.0005995887,0.0005441117,0.0016403229,0.00056203373,0.96967065,0.000023728284],"about_ca_topic_score_codex":0.40584806,"about_ca_topic_score_gemma":0.44756573,"teacher_disagreement_score":0.40584806,"about_ca_system_score_codex":0.0031344143,"about_ca_system_score_gemma":0.020769859,"threshold_uncertainty_score":0.80697155},"labels":[],"label_agreement":null},{"id":"W6931264233","doi":"10.5281/zenodo.3596164","title":"Sound Comparisons: Romance","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Romance; Pronunciation; Romance languages; Focus (optics); Portuguese; Diversity (politics); Resource (disambiguation)","score_opus":0.030349878604876524,"score_gpt":0.25715795744363296,"score_spread":0.22680807883875642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931264233","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.003755223,0.0022541666,0.008054475,0.0056583527,0.004827775,0.00012108703,0.013328681,0.0060218317,0.9559784],"genre_scores_gemma":[0.127921,0.004685039,0.02934366,0.0097829625,0.0045268433,0.00080886047,0.037186608,0.035425365,0.7503198],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9969308,0.001139098,0.00017747971,0.0005278754,0.000927872,0.00029686425],"domain_scores_gemma":[0.9966552,0.00095965597,0.00019125093,0.00070178835,0.0010661953,0.0004258571],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018705878,0.00094947766,0.0005672573,0.002244277,0.0025474594,0.00656046,0.0010630095,0.0013779484,0.41234386],"category_scores_gemma":[0.012141198,0.00034312773,0.00044231102,0.0029576821,0.0014815863,0.0071610864,0.004953168,0.0024482612,0.19462864],"study_design_candidate":"observational","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.00008637195,0.000023281438,0.00079569686,0.00036702005,0.0000072321513,0.0001706823,0.0034896496,0.000053834894,0.00052595604,0.03214809,0.8161064,0.14622588],"study_design_scores_gemma":[0.000004326945,0.0000065782506,0.0007020007,0.000101366895,0.0000015345421,0.000112413814,0.0008791271,0.00002085637,0.00017164649,0.002993077,0.9949982,0.000008866299],"about_ca_topic_score_codex":0.0027393457,"about_ca_topic_score_gemma":0.005397664,"teacher_disagreement_score":0.41234386,"about_ca_system_score_codex":0.0012018959,"about_ca_system_score_gemma":0.0009045333,"threshold_uncertainty_score":0.8382202},"labels":[],"label_agreement":null},{"id":"W6931389591","doi":"10.5281/zenodo.5248501","title":"Eudendrium arbuscula Wright 1859","year":2012,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Wright; Specific name; Index (typography); Species name; Correct name","score_opus":0.028199456488809227,"score_gpt":0.2549779151213515,"score_spread":0.22677845863254226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931389591","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.30240268,0.038477246,0.012869154,0.0013386102,0.0015244684,0.0005393377,0.006594446,0.0011965798,0.6350575],"genre_scores_gemma":[0.9333473,0.008513903,0.00922754,0.00096217333,0.0004090237,0.00012700542,0.0027506945,0.00008337079,0.044578977],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998357,0.00002728585,0.000017476737,0.00004896277,0.000049994705,0.000020534035],"domain_scores_gemma":[0.9998766,0.00001558232,0.000048474045,0.00001303266,0.000034930395,0.000011326621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014310586,0.000563757,0.0002315504,0.0011452924,0.0010379842,0.00037889247,0.00042394822,0.0005102081,0.016326483],"category_scores_gemma":[0.00034081886,0.00019707263,0.00010428053,0.000783531,0.00034413807,0.0007897655,0.00059214554,0.00035251505,0.0063675484],"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.00022619717,0.00014897274,0.027032983,0.00091703294,0.000054448097,0.0013263838,0.0012084269,0.00044752882,0.019484622,0.005568219,0.053602867,0.8899823],"study_design_scores_gemma":[0.00005772735,0.00013922491,0.21316373,0.00043398858,0.000060213166,0.0031720144,0.0004910441,0.00033098867,0.0021435665,0.0012841979,0.7787009,0.00002239905],"about_ca_topic_score_codex":0.0045083715,"about_ca_topic_score_gemma":0.008863924,"teacher_disagreement_score":0.016326483,"about_ca_system_score_codex":0.0003250089,"about_ca_system_score_gemma":0.00014506862,"threshold_uncertainty_score":0.054617524},"labels":[],"label_agreement":null},{"id":"W6931432950","doi":"10.5281/zenodo.5576033","title":"Simple layers for species distribution modeling and bioclimatic data","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.08000480673845832,"score_gpt":0.2904689596343653,"score_spread":0.21046415289590698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931432950","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.0027813446,0.00023551447,0.6508705,0.00023044855,0.00027245822,0.0001320338,0.04937636,0.28368288,0.012418372],"genre_scores_gemma":[0.062070183,0.00085436733,0.5467026,0.0009846517,0.00018954877,0.001460626,0.12672046,0.20006151,0.060955964],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932456,0.0001072767,0.000076894925,0.00013405444,0.00026503397,0.000092240465],"domain_scores_gemma":[0.9987826,0.0004400875,0.00007861574,0.00037945964,0.00023501771,0.000084312145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141105,0.0029678575,0.0013398093,0.001408686,0.00065333344,0.002673942,0.003293399,0.0015017027,0.09049745],"category_scores_gemma":[0.0045219124,0.0021395069,0.0029794276,0.0015529438,0.0004686121,0.0033108187,0.0025079814,0.0027324907,0.0533126],"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.0007500591,0.00023690258,0.0051281247,0.0016035188,0.00070004666,0.00047532693,0.000504895,0.06640148,0.013520475,0.04529634,0.6774705,0.18791226],"study_design_scores_gemma":[0.00033025307,0.000054184387,0.0022028035,0.00020400704,0.00018498773,0.00035918612,0.000051862164,0.28723592,0.025167277,0.051090274,0.6328512,0.00026809124],"about_ca_topic_score_codex":0.0067611067,"about_ca_topic_score_gemma":0.007768001,"teacher_disagreement_score":0.09049745,"about_ca_system_score_codex":0.0007588287,"about_ca_system_score_gemma":0.0010601055,"threshold_uncertainty_score":0.30274415},"labels":[],"label_agreement":null},{"id":"W6931664732","doi":"10.5281/zenodo.5784787","title":"Assessing and assuring interoperability of a genomics file format: results and scripts","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Princess Margaret Cancer Centre","funders":"","keywords":"Interoperability; Scripting language; File format; Test (biology); Genomics","score_opus":0.03452343956077849,"score_gpt":0.26027700939468384,"score_spread":0.22575356983390535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931664732","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.017204685,0.00022996322,0.13079318,0.0012640816,0.00049623364,0.0022671972,0.47935182,0.33952245,0.028870245],"genre_scores_gemma":[0.038886264,0.00021428533,0.1769599,0.00047720884,0.000097961776,0.0035222967,0.66324484,0.10238241,0.014214769],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9889341,0.0025276935,0.0015314439,0.0015027508,0.00489288,0.00061116484],"domain_scores_gemma":[0.9653625,0.011951414,0.0013108484,0.0077985125,0.012633675,0.00094303564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012410867,0.002665926,0.0012341805,0.004887455,0.0016179142,0.00447148,0.0033471389,0.0013184035,0.07947646],"category_scores_gemma":[0.050302133,0.0011252338,0.0014523317,0.0036225908,0.0009737785,0.0033812404,0.0036747712,0.001701909,0.068542086],"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.0015079258,0.00060125784,0.005421667,0.0011416149,0.00017400087,0.00037844412,0.0005589767,0.0067883655,0.006988869,0.005384321,0.880676,0.09037869],"study_design_scores_gemma":[0.0012869034,0.0005542464,0.022637788,0.0008734646,0.0003102625,0.0010317189,0.001204698,0.07508468,0.14552404,0.019440755,0.7313023,0.0007490723],"about_ca_topic_score_codex":0.009215959,"about_ca_topic_score_gemma":0.005923554,"teacher_disagreement_score":0.07947646,"about_ca_system_score_codex":0.0017695641,"about_ca_system_score_gemma":0.0036430676,"threshold_uncertainty_score":0.26587522},"labels":[],"label_agreement":null},{"id":"W6931913177","doi":"10.5683/sp3/1jf2kt","title":"Aboriginal Peoples Survey, 2006 [Canada]: Adults","year":2009,"lang":"en","type":"dataset","venue":"Borealis","topic":"Advanced Multi-Objective Optimization Algorithms","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":"General partnership; Product (mathematics); Population; Indigenous; Ethnic group","score_opus":0.007760170416241743,"score_gpt":0.2614338810864885,"score_spread":0.2536737106702468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931913177","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.00053947093,0.00006136653,0.000028547835,0.00007313628,0.000020046797,0.000022398266,0.99857795,0.000064233245,0.0006128332],"genre_scores_gemma":[0.0016317723,0.000092186514,0.00028211012,0.00005033986,0.000007385538,0.000089645204,0.99633694,0.000023161756,0.0014864414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993672,0.00005530441,0.00006302592,0.00012973015,0.00023982143,0.00014493243],"domain_scores_gemma":[0.9970387,0.00013148464,0.00012238919,0.00023693453,0.0021640023,0.00030644095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974637,0.001695862,0.0014316086,0.002342537,0.002406147,0.0016585294,0.003941747,0.001114382,0.017578546],"category_scores_gemma":[0.0043566492,0.0007764869,0.0010273777,0.00836802,0.00045092596,0.00069526356,0.0010339293,0.0020344122,0.015280998],"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.00006998078,0.000026709009,0.0034521502,0.00019922403,0.000025974978,0.000021416578,0.00003399219,0.00020470005,0.000027397,0.00016741392,0.99400556,0.0017654959],"study_design_scores_gemma":[0.0007679368,0.000045913643,0.14518766,0.000669739,0.00014240289,0.00016673673,0.0007293249,0.0027219115,0.00047032547,0.0007528566,0.8482249,0.00012034567],"about_ca_topic_score_codex":0.97375816,"about_ca_topic_score_gemma":0.9848931,"teacher_disagreement_score":0.026241839,"about_ca_system_score_codex":0.012784079,"about_ca_system_score_gemma":0.02882809,"threshold_uncertainty_score":0.09275544},"labels":[],"label_agreement":null},{"id":"W6957698311","doi":"10.60527/75xq-p143","title":"Ma thèse en 180 secondes, finale canadienne - Édition 2016Maud Gratuze, Université Laval (Québec) - Troisième prix","year":2016,"lang":"fr","type":"other","venue":"Fondation Maison des sciences de l'homme","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Doors; Section (typography)","score_opus":0.027856192350369458,"score_gpt":0.27270072643363513,"score_spread":0.24484453408326567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957698311","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.0028718146,0.05546433,0.0031978276,0.038386233,0.12309867,0.0003967655,0.023021694,0.0029205298,0.75064206],"genre_scores_gemma":[0.002750651,0.0049940916,0.0005874079,0.0007750011,0.0019566237,0.000049783725,0.0025762748,0.0005217009,0.9857885],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975668,0.00012332656,0.00008510274,0.00021974582,0.001623513,0.000381517],"domain_scores_gemma":[0.99494934,0.0002581499,0.00013579398,0.00047195493,0.0033252381,0.00085945736],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002161058,0.0020136742,0.0016795588,0.0046013617,0.003646302,0.0111042475,0.0018778525,0.0021812143,0.38451463],"category_scores_gemma":[0.0064179786,0.00060157356,0.0012768734,0.004568329,0.0017690194,0.002641203,0.0028461614,0.0033372275,0.16971003],"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.000035001718,0.000020520267,0.00015462007,0.00011635971,0.0000070069823,0.000028183122,0.00007032016,0.00014274688,0.00016885155,0.002733004,0.9643507,0.03217266],"study_design_scores_gemma":[0.0000069083126,0.0000079142665,0.00067521865,0.000099647055,0.0000030223416,0.000021015954,0.000052610507,0.000045385503,0.00010026151,0.0004694589,0.99851125,0.0000072621647],"about_ca_topic_score_codex":0.4195817,"about_ca_topic_score_gemma":0.5825435,"teacher_disagreement_score":0.5804183,"about_ca_system_score_codex":0.016736023,"about_ca_system_score_gemma":0.025846587,"threshold_uncertainty_score":0.8779152},"labels":[],"label_agreement":null},{"id":"W6981641240","doi":"","title":"Evaluating approaches to EAL newcomer support: protocol for a systematic review.","year":2022,"lang":"en","type":"dissertation","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mainstream; Variety (cybernetics); Inclusion (mineral); Trustworthiness; Protocol (science); Qualitative research; Mainstreaming; Narrative","score_opus":0.14197026140373678,"score_gpt":0.379817873403489,"score_spread":0.2378476119997522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981641240","genre_codex":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035916935,0.0027271172,0.001091567,0.00052954623,0.00037737095,0.98937327,0.004927941,0.00009505166,0.0005189558],"genre_scores_gemma":[0.000329819,0.00082524336,0.0024153686,0.00014664228,0.000016485697,0.995606,0.00039477609,0.000008209136,0.0002574185],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9287171,0.036248483,0.018975787,0.0051603555,0.008010601,0.0028877102],"domain_scores_gemma":[0.9071307,0.0439361,0.016721075,0.009479066,0.019638732,0.003094265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.12459875,0.0058882125,0.015552691,0.014876396,0.0046723085,0.009352505,0.005697727,0.0067704376,0.089350834],"category_scores_gemma":[0.1612698,0.005645288,0.01586038,0.016759658,0.0049951198,0.009514546,0.005968304,0.010109976,0.011339208],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065717553,0.00027904878,0.000717969,0.91237324,0.0029638107,0.0004604246,0.0030725887,0.0008471764,0.000948394,0.004346614,0.03514633,0.032272585],"study_design_scores_gemma":[0.043266434,0.001888102,0.004521646,0.74125266,0.012479218,0.00045854613,0.0046978933,0.0012610676,0.0019935535,0.013885314,0.17373347,0.0005621816],"about_ca_topic_score_codex":0.012563281,"about_ca_topic_score_gemma":0.028806223,"teacher_disagreement_score":0.12459875,"about_ca_system_score_codex":0.022648744,"about_ca_system_score_gemma":0.08317007,"threshold_uncertainty_score":0.658949},"labels":[],"label_agreement":null},{"id":"W6990440976","doi":"","title":"Designing Radiotherapy Plans with Elastic Constraints and Interior Point Methods","year":2003,"lang":"en","type":"article","venue":"Digital Commons - Trinity University (Trinity University)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Trinity College","funders":"","keywords":"Point (geometry); Interior point method; Path (computing); Plan (archaeology); Linear programming; Planner; Mathematical model","score_opus":0.0187459869925336,"score_gpt":0.24051442660506625,"score_spread":0.22176843961253265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990440976","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.0006981324,0.000031905438,0.99836344,0.000029619776,0.000005930987,0.000016370703,0.0000085086795,0.00010017699,0.0007459756],"genre_scores_gemma":[0.051980175,0.00018318748,0.94469136,0.00005315834,0.000015549907,0.000236002,0.00006809133,0.0002569269,0.0025154362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908006,0.0003242339,0.000035408684,0.00009321013,0.00041576987,0.000051326795],"domain_scores_gemma":[0.9993143,0.00044376703,0.00008170473,0.000056206754,0.00007664477,0.000027425504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013266096,0.00096316775,0.00096272654,0.00077941176,0.00043675158,0.0010157475,0.0012502964,0.0010604964,0.0036882842],"category_scores_gemma":[0.0022666135,0.0011475579,0.0010090042,0.00063519157,0.0009503171,0.0012376574,0.0016299582,0.0018125165,0.0008732799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002730835,0.000019574443,0.00008378578,0.000057824236,0.000009846403,0.000033472355,0.000049523267,0.9497508,0.0024971375,0.01813428,0.00066161953,0.028674878],"study_design_scores_gemma":[0.000011398989,0.000020850777,0.000022156264,0.000012933461,0.000004579574,0.000029045419,0.000011626076,0.9860006,0.001575024,0.009404553,0.0028974055,0.000009819554],"about_ca_topic_score_codex":0.0015961309,"about_ca_topic_score_gemma":0.001786142,"teacher_disagreement_score":0.0036882842,"about_ca_system_score_codex":0.0006526147,"about_ca_system_score_gemma":0.001191482,"threshold_uncertainty_score":0.012338519},"labels":[],"label_agreement":null},{"id":"W7020499438","doi":"","title":"L’intégration linguistique et sociale à la langue française des étudiants internationaux d’origine iranienne aux cycles supérieurs dans le contexte de Montréal","year":2022,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ethnography; Sociolinguistics; Social worlds","score_opus":0.008202413356822029,"score_gpt":0.2312472905507475,"score_spread":0.22304487719392546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020499438","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.9862701,0.00070898567,0.00037613173,0.0012129593,0.000022874552,0.00006072821,0.00030126804,0.000012923013,0.011033993],"genre_scores_gemma":[0.99079096,0.0006006421,0.00043617917,0.00016883695,0.000006627232,0.00007065967,0.00011841871,0.000011837665,0.0077958414],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9975836,0.0006620533,0.000084997606,0.00039722226,0.0005465417,0.00072544813],"domain_scores_gemma":[0.9961952,0.0007439503,0.00041408767,0.00016227835,0.001659816,0.00082462607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003233995,0.0004558944,0.0005489988,0.0013650066,0.008350201,0.005550188,0.0010029246,0.0006461556,0.0055591725],"category_scores_gemma":[0.0047082785,0.0003909943,0.0003227613,0.0036514248,0.004434369,0.001499732,0.0028777474,0.0011143475,0.00040597667],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00014214325,0.00006190249,0.23203851,0.00019004366,0.000048947928,0.00090769836,0.71953,0.00020906358,0.0029953362,0.0070083886,0.0024975636,0.03437045],"study_design_scores_gemma":[0.000009919463,0.00006727292,0.38918638,0.00017760026,0.000038487182,0.00015502039,0.56745195,0.00020108209,0.00048660918,0.0003232468,0.041832007,0.00007035338],"about_ca_topic_score_codex":0.9513532,"about_ca_topic_score_gemma":0.97442853,"teacher_disagreement_score":0.048646808,"about_ca_system_score_codex":0.03151604,"about_ca_system_score_gemma":0.045877505,"threshold_uncertainty_score":0.22866601},"labels":[],"label_agreement":null},{"id":"W7023810788","doi":"","title":"Proceedings of the First International Workshop on Multidisciplinary Design Optimisation","year":2001,"lang":"en","type":"other","venue":"NPARC","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Multidisciplinary approach; Work (physics); Key (lock); Field (mathematics)","score_opus":0.02243639356204879,"score_gpt":0.2676957113606331,"score_spread":0.2452593177985843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023810788","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.01549531,0.016624562,0.1420559,0.04890338,0.11947774,0.001146249,0.0026700364,0.0026792136,0.6509476],"genre_scores_gemma":[0.027392892,0.005026502,0.019359728,0.0013583319,0.0074617793,0.00024975746,0.0016921974,0.0009914273,0.9364674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807274,0.0005399626,0.00006466251,0.0002499696,0.0009156126,0.00015705224],"domain_scores_gemma":[0.99445444,0.0011826437,0.00015014465,0.0007666046,0.0025364908,0.0009096508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037522553,0.0009070025,0.0017809379,0.0010609127,0.0013484573,0.0042304946,0.0016736775,0.0018164875,0.20777117],"category_scores_gemma":[0.0074763866,0.0004455487,0.00082204986,0.0008638041,0.00059034035,0.002247117,0.0016796691,0.002349184,0.09244981],"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.00029469634,0.00017954619,0.00026917344,0.00043094842,0.0000408156,0.00013319612,0.000074323754,0.0028696791,0.0016667153,0.0060863406,0.74106556,0.246889],"study_design_scores_gemma":[0.000077266915,0.00014096258,0.0010332196,0.00021556696,0.000034843506,0.00016361696,0.000101644604,0.0073612966,0.002193825,0.012930842,0.9757186,0.000028304938],"about_ca_topic_score_codex":0.00081859244,"about_ca_topic_score_gemma":0.0027052872,"teacher_disagreement_score":0.20777117,"about_ca_system_score_codex":0.00078972225,"about_ca_system_score_gemma":0.0019038954,"threshold_uncertainty_score":0.6950638},"labels":[],"label_agreement":null},{"id":"W7033793758","doi":"","title":"Search for a new Z' gauge boson via the pp → W ð Þ → Z0μ ν → μ μ∓μν process in pp collisions at √s p =13TeV with the ATLAS detector","year":2024,"lang":"en","type":"article","venue":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; CERN; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Institut National de Physique Nucléaire et de Physique des Particules; Austrian Science Fund; Agencia Nacional de Promoción Científica y Tecnológica; Fundação de Amparo à Pesquisa do Estado de São Paulo; TRIUMF","keywords":"Atlas (anatomy); Atlas detector; Large Hadron Collider; Branching fraction; Gauge boson; Detector; ATLAS experiment; Hadron; Boson","score_opus":0.03304694388255139,"score_gpt":0.2815733238931616,"score_spread":0.2485263800106102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033793758","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.9832519,0.00007557187,0.01484622,0.000041424817,0.0000034664668,0.000015198366,0.00018038019,0.00009828242,0.0014875266],"genre_scores_gemma":[0.9823009,0.00006698479,0.016478037,0.000017343631,0.000004704829,0.000012318466,0.00044700113,0.000016222413,0.0006565177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998153,0.00004448558,0.0000069514786,0.00003859383,0.000062148996,0.000032679523],"domain_scores_gemma":[0.9997676,0.00011427299,0.00004452509,0.000013130463,0.000019167783,0.000041212494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244698,0.00039942987,0.00054195966,0.0006916595,0.000339047,0.0008809722,0.00051510363,0.00031145415,0.0009165543],"category_scores_gemma":[0.00054306706,0.00034046164,0.0003713203,0.0007948796,0.00024273153,0.0003858088,0.00053048274,0.0002355076,0.00021663285],"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.005272198,0.0010107055,0.25182128,0.00039666975,0.0009449281,0.0025817738,0.0002395856,0.2947988,0.32926458,0.021956444,0.002030672,0.08968241],"study_design_scores_gemma":[0.00032870047,0.0007330981,0.036977127,0.000009367064,0.00017207215,0.00044169938,0.0001361878,0.8292657,0.12683396,0.0039699506,0.001071949,0.000060119277],"about_ca_topic_score_codex":0.0027619516,"about_ca_topic_score_gemma":0.0029951434,"teacher_disagreement_score":0.0027619516,"about_ca_system_score_codex":0.0003754289,"about_ca_system_score_gemma":0.00062440627,"threshold_uncertainty_score":0.005491793},"labels":[],"label_agreement":null},{"id":"W7039156554","doi":"","title":"Life cycle cost of support poles in distribution lines","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"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":"Distribution (mathematics); Class (philosophy); Selection (genetic algorithm); Production (economics); Service life; Line (geometry)","score_opus":0.012981845667449718,"score_gpt":0.26298490565358174,"score_spread":0.25000305998613204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039156554","genre_codex":"empirical","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.86988795,0.0008358795,0.053656265,0.0007714106,0.000108205204,0.00066758087,0.0038533085,0.0012160311,0.06900343],"genre_scores_gemma":[0.9676097,0.0002060408,0.008512776,0.000028030221,0.000009593852,0.00010659206,0.001233075,0.0000843898,0.022209847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993742,0.0001512668,0.000022847413,0.000077644276,0.00024142116,0.00013270018],"domain_scores_gemma":[0.9984403,0.00058117957,0.00020105766,0.00014997426,0.00041196597,0.00021560403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081429136,0.00044376278,0.0003046028,0.0011834579,0.0006523678,0.0015581783,0.00083944714,0.0008653583,0.025794884],"category_scores_gemma":[0.0037562987,0.00035347213,0.0004568569,0.0008776769,0.0003477996,0.0016276932,0.0005477267,0.0005273331,0.0034502216],"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.0020128756,0.00032386623,0.01439144,0.00035016818,0.00007029554,0.00075621536,0.00018226566,0.6400422,0.016234897,0.018045144,0.012067866,0.29552272],"study_design_scores_gemma":[0.00024591514,0.002300975,0.029756986,0.00014617533,0.00015534573,0.0007519404,0.0008644211,0.8975183,0.015171169,0.018753357,0.034245353,0.00009001291],"about_ca_topic_score_codex":0.007075494,"about_ca_topic_score_gemma":0.005827088,"teacher_disagreement_score":0.025794884,"about_ca_system_score_codex":0.0025868067,"about_ca_system_score_gemma":0.0007398193,"threshold_uncertainty_score":0.086292505},"labels":[],"label_agreement":null},{"id":"W7039984523","doi":"","title":"Numerical methods to solve stochastic differential equations","year":2021,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Numerical analysis; Discretization; Stochastic differential equation; Numerical stability; Differential equation; Numerical partial differential equations; Point (geometry); Stochastic partial differential equation","score_opus":0.023832901751491244,"score_gpt":0.31863410796160707,"score_spread":0.29480120621011585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039984523","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.0006520745,0.003972678,0.9836295,0.0005660212,0.00049908104,0.00009746725,0.00010436953,0.00017408705,0.010304696],"genre_scores_gemma":[0.06660882,0.014614318,0.8820512,0.0010214241,0.0014292075,0.0016439384,0.0004838997,0.0005623775,0.031584796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984408,0.00053155684,0.00010141019,0.00011396516,0.0007554554,0.000056781188],"domain_scores_gemma":[0.9980292,0.0011060926,0.0001290676,0.00015621501,0.00053346466,0.000045946977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002115931,0.0011684296,0.0011650166,0.0010806313,0.0005786835,0.001331076,0.0012089607,0.001388598,0.00666014],"category_scores_gemma":[0.006285701,0.00043336395,0.0012903964,0.0013751005,0.0012806333,0.0011537381,0.0018614649,0.0037186297,0.0023806342],"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.000026398897,0.00006299469,0.0004483708,0.0006947656,0.00010326335,0.00008001322,0.00019425763,0.2439891,0.0030799957,0.636294,0.011373723,0.10365319],"study_design_scores_gemma":[0.000044429416,0.000039718856,0.00019562188,0.0001707115,0.000021311736,0.00009049134,0.00003644897,0.7251553,0.0011006617,0.21126306,0.06185177,0.000030435038],"about_ca_topic_score_codex":0.0028313433,"about_ca_topic_score_gemma":0.0017302361,"teacher_disagreement_score":0.00666014,"about_ca_system_score_codex":0.0008216771,"about_ca_system_score_gemma":0.0015135703,"threshold_uncertainty_score":0.022280395},"labels":[],"label_agreement":null},{"id":"W7067275600","doi":"","title":"Modeling and Analysis of Dynamic Computer Experiments","year":2018,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Queen's University","funders":"","keywords":"Nucleofection; Process (computing); TSG101; Frame (networking); Tubulopathy; Articular cartilage damage","score_opus":0.0068488552941887194,"score_gpt":0.22512261067413306,"score_spread":0.21827375537994434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067275600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016383251,0.00025078002,0.9771204,0.00045712074,0.00006334408,0.00022360639,0.0005294952,0.00065062026,0.004321354],"genre_scores_gemma":[0.6656036,0.0019361504,0.312345,0.00054483506,0.00019532301,0.0025096063,0.0022725784,0.0004101186,0.014182833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970497,0.00097500166,0.00014749075,0.00078433886,0.00085123186,0.00019220171],"domain_scores_gemma":[0.991256,0.0053247935,0.00096494204,0.001269375,0.0010538673,0.00013102859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003321534,0.00078898435,0.0008392764,0.0010165403,0.00032186403,0.0019845616,0.0017829066,0.0011587224,0.0036093656],"category_scores_gemma":[0.015641028,0.00053797074,0.0009327671,0.0009388448,0.001424241,0.001642381,0.0011157995,0.0018479931,0.000841926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007146087,0.00010930316,0.0022898794,0.00021119029,0.00005656298,0.000093281415,0.00011574767,0.82723355,0.004925999,0.12185937,0.002299552,0.04073411],"study_design_scores_gemma":[0.000009136321,0.000037154114,0.00065262656,0.000015630261,0.000008599723,0.00001871411,0.000016701346,0.9734701,0.0011236791,0.022314226,0.0023178214,0.000015585249],"about_ca_topic_score_codex":0.0044040713,"about_ca_topic_score_gemma":0.0022758867,"teacher_disagreement_score":0.0044040713,"about_ca_system_score_codex":0.001465627,"about_ca_system_score_gemma":0.0017818172,"threshold_uncertainty_score":0.017566144},"labels":[],"label_agreement":null},{"id":"W7084067593","doi":"10.6084/m9.figshare.c.8053060.v1","title":"The intersections of palliative care and homelessness in social policy: A content analysis of Canadian policy documents","year":2025,"lang":"en","type":"other","venue":"Figshare","topic":"Advanced Multi-Objective Optimization Algorithms","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":true,"ca_institutions":"Université du Québec à Montréal; Providence Health Care; University of British Columbia; McGill University; Simon Fraser University","funders":"","keywords":"Palliative care; Content analysis; Ethnic group; Social policy; Social care; National Policy; Social work","score_opus":0.03859248159582912,"score_gpt":0.32451256951242435,"score_spread":0.28592008791659523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084067593","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.9340153,0.0056648613,0.0018565925,0.011515978,0.00011229344,0.0012389271,0.00479413,0.000067945664,0.04073391],"genre_scores_gemma":[0.9861637,0.004202167,0.0036993516,0.00087137875,0.00002735679,0.0007175875,0.0016758025,0.00004436762,0.0025981923],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9780572,0.006642984,0.0023272356,0.0013359189,0.00879531,0.002841367],"domain_scores_gemma":[0.89390546,0.058268085,0.00900176,0.0018940091,0.033044145,0.003886428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026681291,0.00060976244,0.0007234087,0.026877685,0.02061395,0.01021791,0.0018606731,0.0012991342,0.0021283356],"category_scores_gemma":[0.072626024,0.00064534106,0.0004996741,0.043452404,0.012417041,0.0030058715,0.004590043,0.0015991133,0.0001676609],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053269145,0.00003310608,0.037545964,0.001366753,0.000021173024,0.00065784325,0.915383,0.0002409602,0.00064452755,0.0116169285,0.004587837,0.02784863],"study_design_scores_gemma":[0.000011108502,0.00001824596,0.07990636,0.0024545204,0.000042366122,0.00013108707,0.8121705,0.0003885627,0.0004857349,0.0008915026,0.10342739,0.00007269889],"about_ca_topic_score_codex":0.96948236,"about_ca_topic_score_gemma":0.9646583,"teacher_disagreement_score":0.23558821,"about_ca_system_score_codex":0.23558821,"about_ca_system_score_gemma":0.3082841,"threshold_uncertainty_score":0.8866093},"labels":[],"label_agreement":null},{"id":"W7097417421","doi":"","title":"Canada under Grants RGPIN7239-06 and STPGP336760-06.","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Space (punctuation); Space mapping; Convergence (economics); Quality (philosophy); Similarity (geometry)","score_opus":0.009277922983905167,"score_gpt":0.23396603230233945,"score_spread":0.22468810931843428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097417421","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.01614507,0.0065200906,0.043157842,0.06023716,0.008309062,0.0015739892,0.061002985,0.00919496,0.7938588],"genre_scores_gemma":[0.10919793,0.003688754,0.039619174,0.0037483806,0.00073981413,0.00040498938,0.03394981,0.0020304185,0.8066207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919882,0.0008687027,0.00016124465,0.000996999,0.004471398,0.001513456],"domain_scores_gemma":[0.9820073,0.0019226315,0.0005092679,0.0010774367,0.0115152905,0.0029681635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0056925076,0.002809536,0.0027452335,0.0030767207,0.004290424,0.0033799713,0.00451187,0.003500964,0.22890364],"category_scores_gemma":[0.011364677,0.0005186188,0.001306839,0.0029146455,0.0022864041,0.002858045,0.0044508255,0.0025437982,0.077523254],"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.0009291987,0.00031180572,0.0033236002,0.00033459367,0.00012917709,0.00055192487,0.0006956819,0.0035855025,0.0028059438,0.07178504,0.7752183,0.14032911],"study_design_scores_gemma":[0.00044075662,0.00025713642,0.0040917895,0.00031553756,0.00007031918,0.00045671006,0.0007984086,0.019461984,0.0024560255,0.016081829,0.955433,0.00013648742],"about_ca_topic_score_codex":0.5116991,"about_ca_topic_score_gemma":0.5293225,"teacher_disagreement_score":0.77109635,"about_ca_system_score_codex":0.018989807,"about_ca_system_score_gemma":0.0433588,"threshold_uncertainty_score":0.98235327},"labels":[],"label_agreement":null},{"id":"W7099290542","doi":"","title":"POLISH AIR TRANSPORT AMONG STRUCTURAL CHANGES IN THE","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Competitor analysis; Air transport; European market; Market share; European union","score_opus":0.008680661576299925,"score_gpt":0.23424207375317166,"score_spread":0.22556141217687173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099290542","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.3929272,0.0058949357,0.004804243,0.0058781533,0.0014205766,0.00029557056,0.010783005,0.000342388,0.577654],"genre_scores_gemma":[0.5772747,0.0030427545,0.0018927067,0.0004934493,0.000119275406,0.0001239776,0.005678106,0.00010861755,0.4112665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995946,0.000026596115,0.000029932775,0.00010421065,0.00012367923,0.00012100527],"domain_scores_gemma":[0.9998363,0.000008401213,0.000024339479,0.000022298256,0.00007290958,0.00003564971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022696046,0.0004077999,0.00012139653,0.0012904997,0.0014360099,0.0023669673,0.00037484066,0.00058711617,0.04346132],"category_scores_gemma":[0.0005192519,0.00024654059,0.00027716657,0.0018918064,0.00044181422,0.0013988455,0.0015838441,0.0007453848,0.009137602],"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.00081766694,0.00026817183,0.07170222,0.001117823,0.00011634581,0.0033812677,0.0063565173,0.0059750294,0.010536807,0.21682839,0.16172022,0.5211795],"study_design_scores_gemma":[0.00001336236,0.000083917694,0.08147194,0.00007418399,0.000023567945,0.00049665023,0.0027773008,0.0006266407,0.0012602677,0.0022642184,0.9108921,0.00001582875],"about_ca_topic_score_codex":0.03569303,"about_ca_topic_score_gemma":0.027252633,"teacher_disagreement_score":0.04346132,"about_ca_system_score_codex":0.0034795813,"about_ca_system_score_gemma":0.0028925254,"threshold_uncertainty_score":0.1453926},"labels":[],"label_agreement":null},{"id":"W7099895388","doi":"","title":"Perceptions of the Canadian criminal justice system among Nigerians: Evidence from a local Church","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Criminal justice; Perception; Immigration; Diversity (politics); Nigerians; Population; Economic Justice; Sample (material)","score_opus":0.03816751808403968,"score_gpt":0.25673067831076773,"score_spread":0.21856316022672806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099895388","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.9949464,0.00019843788,0.000017415376,0.0007214956,0.000010923183,0.000015858634,0.000023670365,4.754961e-7,0.004065387],"genre_scores_gemma":[0.9980738,0.00053150626,0.00003244185,0.0002780423,0.000004800906,0.00001010763,0.0000185118,0.0000022287657,0.0010485604],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99810576,0.0004986727,0.00006471568,0.00017819919,0.0005509984,0.00060161046],"domain_scores_gemma":[0.99459225,0.0011015239,0.0008677067,0.00019223387,0.0018269646,0.0014193767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025459488,0.00032589285,0.00041208076,0.001496706,0.024494644,0.004364062,0.0009908751,0.0010120291,0.004684194],"category_scores_gemma":[0.007909574,0.0004315507,0.00017500628,0.0018275002,0.0068544266,0.001305023,0.0033649588,0.002438074,0.00029323384],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00009313271,0.00017991647,0.18324383,0.00007909823,0.000015853522,0.00052666996,0.8035521,0.000027476575,0.0005587272,0.0015332445,0.0014308948,0.008758976],"study_design_scores_gemma":[0.000004270171,0.00002814013,0.08402317,0.00013394366,0.000008277152,0.000075115735,0.9118195,0.00003507156,0.000069542555,0.000058505382,0.0037294212,0.00001508655],"about_ca_topic_score_codex":0.9035236,"about_ca_topic_score_gemma":0.9716052,"teacher_disagreement_score":0.096476376,"about_ca_system_score_codex":0.018758997,"about_ca_system_score_gemma":0.017725635,"threshold_uncertainty_score":0.19408906},"labels":[],"label_agreement":null},{"id":"W7100705169","doi":"","title":"In","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Inclusion (mineral); Context (archaeology); Confidentiality; Work (physics); Government (linguistics)","score_opus":0.005481206191174562,"score_gpt":0.2414179862226636,"score_spread":0.23593678003148905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100705169","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.008621945,0.009131656,0.042183552,0.016802892,0.012820451,0.00026049916,0.004204315,0.0032271193,0.9027475],"genre_scores_gemma":[0.032437157,0.0048243077,0.011407245,0.0034875404,0.0014157073,0.00018185281,0.0038670336,0.00090186944,0.9414772],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986268,0.0001740661,0.00008153033,0.00037031437,0.00059957325,0.00014759168],"domain_scores_gemma":[0.99771726,0.00030446256,0.00011168532,0.000632092,0.0009731074,0.00026137408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011683772,0.00082741305,0.000633666,0.0014925104,0.0019771482,0.0066870684,0.0013143865,0.0017860034,0.32527322],"category_scores_gemma":[0.004299784,0.00035298066,0.0006469323,0.0015514436,0.0011821954,0.0036066296,0.0033011686,0.0020529618,0.16716492],"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.00015971265,0.00010386458,0.0016309296,0.00037595368,0.000025433505,0.00025361386,0.00072800874,0.00092294405,0.0034975808,0.099018864,0.55259377,0.3406894],"study_design_scores_gemma":[0.000010366146,0.000019211879,0.0006755198,0.00010004337,0.000008802267,0.00019910329,0.00025660562,0.0004929741,0.0011628738,0.013690874,0.98337215,0.00001159484],"about_ca_topic_score_codex":0.0028554206,"about_ca_topic_score_gemma":0.005332226,"teacher_disagreement_score":0.6747268,"about_ca_system_score_codex":0.001658869,"about_ca_system_score_gemma":0.002688814,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7105897877","doi":"10.23952/jano.7.2025.3.08","title":"A line decomposition algorithm for multiobjective optimization","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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-objective optimization; Line (geometry); Decomposition; Minification; Optimization algorithm; Genetic algorithm","score_opus":0.00808009215581886,"score_gpt":0.28741063485751495,"score_spread":0.2793305427016961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105897877","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.00037644213,0.000060726117,0.9982681,0.00003144762,0.000019139527,0.000026595671,0.000036738307,0.00031668332,0.0008640925],"genre_scores_gemma":[0.01725223,0.00011347958,0.9800576,0.00006581087,0.000018210003,0.0002759418,0.00022518211,0.0002690103,0.001722575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992355,0.00024592053,0.000049995677,0.00011274955,0.00029810044,0.00005766938],"domain_scores_gemma":[0.9991585,0.00035428136,0.00006398102,0.00009333647,0.00028693507,0.000042994416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010619431,0.0015565709,0.0010813233,0.0008507886,0.00059855555,0.0012192403,0.0011659319,0.0014622785,0.009508123],"category_scores_gemma":[0.002386721,0.0005996078,0.0012437096,0.0010497691,0.0006033985,0.0008773629,0.0013857768,0.0024151315,0.0040591834],"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.0000641472,0.00008678536,0.00038011812,0.00025140576,0.00008266047,0.00010165617,0.0000940949,0.69258416,0.0061167856,0.035746083,0.011709473,0.25278267],"study_design_scores_gemma":[0.00001885818,0.000023993476,0.000052365653,0.000024304447,0.0000062451018,0.000037114965,0.0000105130575,0.98085105,0.0012503904,0.009918328,0.0077968435,0.000009953572],"about_ca_topic_score_codex":0.0027884434,"about_ca_topic_score_gemma":0.0026302263,"teacher_disagreement_score":0.009508123,"about_ca_system_score_codex":0.0007388463,"about_ca_system_score_gemma":0.0013516581,"threshold_uncertainty_score":0.0318079},"labels":[],"label_agreement":null},{"id":"W7107873549","doi":"10.18280/jesa.581002","title":"Multi-Objective Optimization of a Multi-Cylinder HCNG Engine Using an Integrated Taguchi–CRITIC–GRA Approach","year":2025,"lang":"","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Welding; Work (physics); Set (abstract data type); Process (computing)","score_opus":0.03606709627113977,"score_gpt":0.30341369447099287,"score_spread":0.26734659819985307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107873549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11659175,0.0006339038,0.87470937,0.00021399854,0.00009697192,0.00012689203,0.000051416693,0.00018660372,0.007389095],"genre_scores_gemma":[0.8856627,0.00024779775,0.10866497,0.00006952944,0.00002358171,0.00021307563,0.000048926693,0.000047245736,0.0050223116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.00010665632,0.000014148388,0.000038825394,0.0000841045,0.000037451566],"domain_scores_gemma":[0.9993975,0.000368259,0.000053136642,0.000025912937,0.00012845997,0.000026753154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012468903,0.0009423169,0.0012456955,0.00062842935,0.0006538972,0.0010274388,0.0007952528,0.0022372503,0.0013107674],"category_scores_gemma":[0.0010685623,0.000733502,0.0010215299,0.00051392143,0.0006257431,0.00045322263,0.0006620359,0.00081914413,0.00019654888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023467015,0.000015120654,0.000120328674,0.000029456723,0.000015438052,0.000026083575,0.000008531493,0.99373055,0.0020858794,0.00044067195,0.00003502402,0.003469454],"study_design_scores_gemma":[0.0000029659375,0.000017552107,0.000058470712,0.0000018169496,0.000004457817,0.0000029822409,0.000002072739,0.9993174,0.0004512802,0.00008802751,0.000050473885,0.0000026407133],"about_ca_topic_score_codex":0.007930765,"about_ca_topic_score_gemma":0.008281273,"teacher_disagreement_score":0.007930765,"about_ca_system_score_codex":0.00079323613,"about_ca_system_score_gemma":0.0013124745,"threshold_uncertainty_score":0.015769184},"labels":[],"label_agreement":null},{"id":"W7110062133","doi":"10.2139/ssrn.5886009","title":"Dynamic Constrained Multi-Objective Antenna Design Optimization Method Guided by Reference Vectors","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Wireless; Convergence (economics); Metric (unit); Microstrip antenna; Antenna (radio); Optimization problem; Entropy (arrow of time); Control theory (sociology)","score_opus":0.026066062683516276,"score_gpt":0.325345613926261,"score_spread":0.2992795512427447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110062133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019396571,0.00008084892,0.99472636,0.00005442718,0.000025859652,0.000016197146,0.0000167475,0.00007040875,0.0030694765],"genre_scores_gemma":[0.2345391,0.00046217014,0.7542506,0.00024138222,0.000073739124,0.00043005066,0.00022355694,0.00032970705,0.009449767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996939,0.00010993705,0.000009857592,0.000043181535,0.00012194539,0.000021233149],"domain_scores_gemma":[0.9996026,0.00018167908,0.000049273694,0.0000344974,0.00011333063,0.000018562874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072860287,0.0012001639,0.0010885259,0.0005407737,0.00031139536,0.0010759435,0.0011665262,0.0013475483,0.004799101],"category_scores_gemma":[0.0017248712,0.00066432985,0.00066907273,0.0010548683,0.00048571598,0.0007733488,0.0009779106,0.0009648858,0.0013190637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006201892,0.00002828843,0.00011592229,0.00011049047,0.00003223851,0.000033425058,0.00003983727,0.9418631,0.0045935297,0.016962687,0.0011323981,0.035026032],"study_design_scores_gemma":[0.000008149324,0.000024773302,0.00003091437,0.000008707767,0.0000071278823,0.000012243796,0.000006084325,0.9969619,0.00051601406,0.0016189858,0.00080011657,0.0000049927676],"about_ca_topic_score_codex":0.0011743865,"about_ca_topic_score_gemma":0.0011928538,"teacher_disagreement_score":0.004799101,"about_ca_system_score_codex":0.00048434097,"about_ca_system_score_gemma":0.0007198375,"threshold_uncertainty_score":0.01605457},"labels":[],"label_agreement":null},{"id":"W7114892518","doi":"10.1007/s00158-025-04215-4","title":"Attention mechanisms for differentiable state approximation of dynamic systems in multidisciplinary optimization","year":2025,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Context (archaeology); Multidisciplinary approach; Feature (linguistics); Multidisciplinary design optimization; State (computer science); Component (thermodynamics); Process (computing); Displacement (psychology)","score_opus":0.00722851649366306,"score_gpt":0.2677473162213929,"score_spread":0.26051879972772984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114892518","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.03223804,0.00052685285,0.96178466,0.0006066584,0.00008395796,0.000030501196,0.000045603552,0.00021982274,0.004463794],"genre_scores_gemma":[0.9335154,0.0005275415,0.06001079,0.00019300007,0.00009364774,0.0001077437,0.0000686316,0.00008885783,0.005394398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992526,0.00035197005,0.000040896834,0.00012771957,0.00011715312,0.000109675886],"domain_scores_gemma":[0.996336,0.002463105,0.00029861482,0.00032086746,0.00040618316,0.00017523466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002781368,0.00080962555,0.0013967402,0.00093069463,0.0006817771,0.0021895783,0.0021838197,0.001833053,0.0047425386],"category_scores_gemma":[0.013261541,0.00055338093,0.00084074435,0.00078177865,0.0014117191,0.003712759,0.0025722794,0.0018680843,0.00031562912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023490777,0.00009239988,0.00085114193,0.00014498633,0.00008307115,0.000107527274,0.00023006258,0.55567265,0.0020156887,0.39069006,0.0019052197,0.047972165],"study_design_scores_gemma":[0.000007469452,0.00001264034,0.00009279149,0.000007705897,0.000008894234,0.0000059601834,0.000010822368,0.96214074,0.00015488175,0.037369605,0.00018345035,0.0000050446556],"about_ca_topic_score_codex":0.004864187,"about_ca_topic_score_gemma":0.0031876008,"teacher_disagreement_score":0.004864187,"about_ca_system_score_codex":0.0018172719,"about_ca_system_score_gemma":0.000995476,"threshold_uncertainty_score":0.015865326},"labels":[],"label_agreement":null},{"id":"W7116055527","doi":"10.1051/e3sconf/202568000025","title":"Leveraging Advanced Optimization Techniques with Deep Learning for Efficient Aerospace and Industrial Design","year":2025,"lang":"fr","type":"article","venue":"E3S Web of Conferences","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Aerospace; Flexibility (engineering); Scalability; Deep learning; Artificial neural network; Multidisciplinary design optimization; Computational model; Range (aeronautics); Aerodynamics","score_opus":0.03729500399331939,"score_gpt":0.2826396962485464,"score_spread":0.245344692255227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116055527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009872106,0.0005984851,0.98501855,0.00018921742,0.000032003943,0.000020055919,0.000035452373,0.00034601986,0.0038881293],"genre_scores_gemma":[0.6263195,0.0013458617,0.3663345,0.00032467095,0.00009171447,0.00017206965,0.00026089576,0.0002455686,0.004905243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.000057873753,0.000014171758,0.00004041765,0.00009813162,0.000029194789],"domain_scores_gemma":[0.99966514,0.00015413502,0.000053580257,0.000050912407,0.00005611924,0.000020075722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054518314,0.0010014919,0.0007400827,0.00052913866,0.00021848983,0.00085678714,0.00087183533,0.0009372619,0.001761047],"category_scores_gemma":[0.0011738653,0.0005597053,0.000579123,0.00056789565,0.0006081031,0.0011123504,0.0011269093,0.0013434137,0.0005826459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014521826,0.000023722592,0.00035079068,0.00005732314,0.000022235594,0.000020564268,0.000011198366,0.9601488,0.0021124065,0.0048264647,0.0004372156,0.03197472],"study_design_scores_gemma":[0.0000011843354,0.0000059034082,0.000024564548,0.0000034925536,0.000001787127,0.0000033251858,0.0000011031358,0.9977397,0.0002722417,0.0016101947,0.00033528483,0.0000012479536],"about_ca_topic_score_codex":0.0035719122,"about_ca_topic_score_gemma":0.005921055,"teacher_disagreement_score":0.0035719122,"about_ca_system_score_codex":0.0006704521,"about_ca_system_score_gemma":0.0010202456,"threshold_uncertainty_score":0.0071021914},"labels":[],"label_agreement":null},{"id":"W7117449067","doi":"10.1109/access.2025.3649195","title":"Gradient-Boosted Decision Tree Optimizer for Antenna Optimization","year":2025,"lang":"","type":"article","venue":"IEEE Access","topic":"Advanced Multi-Objective Optimization Algorithms","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":"McMaster University","funders":"Semiconductor Research Corporation","keywords":"Bayesian optimization; Convergence (economics); Scalability; Gaussian process; Kriging; Optimization problem; Benchmark (surveying); Tree (set theory); Artificial neural network","score_opus":0.028325128027298942,"score_gpt":0.3447004932181314,"score_spread":0.3163753651908325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117449067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068256576,0.0007395172,0.9871616,0.00020980739,0.00008363114,0.00003909353,0.00011523466,0.0014578006,0.003367739],"genre_scores_gemma":[0.3648701,0.0008264255,0.62567925,0.00054120034,0.00016413155,0.00040491126,0.0009156251,0.0007462573,0.0058521675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994487,0.0002090297,0.00002544993,0.00008240486,0.00017758453,0.000056703535],"domain_scores_gemma":[0.9991406,0.0005288586,0.000063477375,0.000056294342,0.00017209616,0.00003865697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784111,0.0013863649,0.0013633047,0.0005265877,0.00028693644,0.0007887566,0.0010076727,0.0010674883,0.0038001123],"category_scores_gemma":[0.0031436877,0.00054690114,0.00083107786,0.0008349228,0.000481515,0.00067608996,0.0006800156,0.002010674,0.0013337097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058037822,0.0000478995,0.00034699752,0.00011667613,0.000040055627,0.000035809575,0.00001743732,0.9223877,0.001217209,0.0056334143,0.0053334744,0.06476537],"study_design_scores_gemma":[0.0000062696354,0.000012030107,0.000024019051,0.0000038844905,0.000002814215,0.0000048027614,0.0000013273457,0.9979977,0.00017237305,0.0013534861,0.00041964964,0.0000016351781],"about_ca_topic_score_codex":0.0035042677,"about_ca_topic_score_gemma":0.0040535177,"teacher_disagreement_score":0.0038001123,"about_ca_system_score_codex":0.0006469967,"about_ca_system_score_gemma":0.0012595064,"threshold_uncertainty_score":0.012712657},"labels":[],"label_agreement":null},{"id":"W7124314397","doi":"10.65109/xqbl5396","title":"Divide and Conquer: Provably Unveiling the Pareto Front with Multi-Objective Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Reinforcement learning; Pareto principle; Convergence (economics); Sequence (biology); Multi-objective optimization; Iterated function; Pareto optimal","score_opus":0.01111837383102077,"score_gpt":0.25791201852329326,"score_spread":0.2467936446922725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124314397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023963204,0.00046352344,0.968765,0.00045647818,0.000046849087,0.00009338073,0.000037371872,0.00035412126,0.0058200136],"genre_scores_gemma":[0.6932386,0.00036787416,0.30141655,0.00041852228,0.000078465484,0.0004493533,0.00010308301,0.00023735595,0.0036901948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986218,0.0006085801,0.000046062734,0.00017116292,0.00039555412,0.00015675637],"domain_scores_gemma":[0.9956002,0.0032001878,0.00034080428,0.00031987307,0.00033133666,0.0002074704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003870604,0.0017469041,0.0015654803,0.00080722896,0.0008267133,0.0014404195,0.0016764514,0.0018748787,0.0028168822],"category_scores_gemma":[0.009316282,0.0007372634,0.0008623362,0.0006515833,0.0025832905,0.0019683982,0.0029246828,0.0032657431,0.00042343547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108916814,0.000077808465,0.0006549718,0.0000872101,0.000057188056,0.00008528223,0.000109715074,0.92005926,0.0010508025,0.041349318,0.0012952666,0.035064206],"study_design_scores_gemma":[0.000020185535,0.000027690074,0.000029505321,0.000013744902,0.00000520783,0.000008823607,0.00000779046,0.9786541,0.0002814251,0.02057821,0.00036958006,0.0000037392228],"about_ca_topic_score_codex":0.003050225,"about_ca_topic_score_gemma":0.003069189,"teacher_disagreement_score":0.003870604,"about_ca_system_score_codex":0.0014057879,"about_ca_system_score_gemma":0.0018839148,"threshold_uncertainty_score":0.020469964},"labels":[],"label_agreement":null},{"id":"W7128996971","doi":"10.1109/iemcon67450.2025.11381191","title":"HyperSolver: A Practical Unified Framework for Large-Scale Combinatorial Optimization","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Western University","funders":"","keywords":"Hypergraph; Benchmark (surveying); Maximization; Set (abstract data type); Artificial neural network; Minification","score_opus":0.01942178109240284,"score_gpt":0.32809883500402603,"score_spread":0.3086770539116232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128996971","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.0031525416,0.00026369098,0.98653084,0.00022342292,0.00005010501,0.000099361125,0.00022290129,0.0046469998,0.0048101335],"genre_scores_gemma":[0.07697407,0.0004085063,0.91530854,0.00035824443,0.00005995507,0.0006170262,0.0012579126,0.0013189727,0.0036966798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999271,0.00024296189,0.000033406228,0.00015124251,0.00022565307,0.00007584317],"domain_scores_gemma":[0.9989806,0.00046530837,0.00006160729,0.00023741796,0.00019426487,0.000060868933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014061454,0.0018920952,0.0012497153,0.0011160802,0.00065606576,0.001808203,0.0038566424,0.0016082787,0.011119171],"category_scores_gemma":[0.004428136,0.0009233324,0.0012663135,0.0013959988,0.0010658137,0.002952627,0.0025255508,0.0029714874,0.002530684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048578455,0.000090665664,0.00038150966,0.00020758863,0.00006382036,0.000082797,0.000042309748,0.8462698,0.001207615,0.03878111,0.013579556,0.09924475],"study_design_scores_gemma":[0.000011452849,0.000011304069,0.000019909708,0.000008305793,0.0000034413672,0.000011663131,0.0000070839574,0.98502016,0.0003260792,0.012501639,0.00207504,0.000003892676],"about_ca_topic_score_codex":0.006544716,"about_ca_topic_score_gemma":0.01856998,"teacher_disagreement_score":0.011119171,"about_ca_system_score_codex":0.0012717745,"about_ca_system_score_gemma":0.0029816818,"threshold_uncertainty_score":0.03719729},"labels":[],"label_agreement":null},{"id":"W7131173001","doi":"10.1109/robio66223.2025.11376276","title":"Evolutionary Hybrid Optimization for Multi-Robot Task Allocation with LLM Guidance","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Optech (Canada)","funders":"","keywords":"Evolutionary algorithm; Task (project management); Crossover; Convergence (economics); Evolutionary programming; Evolutionary computation","score_opus":0.015562936107833656,"score_gpt":0.28111053876882264,"score_spread":0.265547602660989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131173001","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.013287864,0.00016770087,0.9833856,0.00014429969,0.000024531073,0.00002677641,0.000014984222,0.00018087986,0.0027673284],"genre_scores_gemma":[0.6255281,0.0001664442,0.36953896,0.0001886524,0.00002995971,0.00024453172,0.00008082607,0.00014578122,0.004076715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961805,0.00013678124,0.000014544818,0.00006764152,0.00011585865,0.00004716028],"domain_scores_gemma":[0.99960226,0.00023853805,0.000043963933,0.00003751476,0.00004938272,0.00002835281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008810784,0.0007813125,0.00065117574,0.0005568667,0.00042265252,0.0007048331,0.001130807,0.0010003505,0.0017832334],"category_scores_gemma":[0.0019560487,0.0003622772,0.00065664534,0.0004686226,0.0008422647,0.00085307006,0.0013234295,0.0010076022,0.0002390346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001558711,0.000019293953,0.00015037062,0.000024520423,0.000015063953,0.000033433942,0.000030618365,0.9694411,0.0010765814,0.010434835,0.0003235833,0.018435013],"study_design_scores_gemma":[0.0000031799977,0.000011036364,0.000023289236,0.0000026580117,0.0000024188066,0.0000071393865,0.000006280474,0.99579406,0.00015026977,0.0036804657,0.00031714907,0.000002077894],"about_ca_topic_score_codex":0.0025240604,"about_ca_topic_score_gemma":0.0028614618,"teacher_disagreement_score":0.0025240604,"about_ca_system_score_codex":0.00082218694,"about_ca_system_score_gemma":0.0011045103,"threshold_uncertainty_score":0.0059654713},"labels":[],"label_agreement":null},{"id":"W7132888887","doi":"","title":"Generalizable Machine Learning for Mathematical Optimizations","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Generalization; Computational learning theory; Algorithmic learning theory; Field (mathematics); Mathematical model; Exploit; Mathematical structure; Online machine learning; Black box","score_opus":0.04118100676095209,"score_gpt":0.3683460845021808,"score_spread":0.3271650777412287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132888887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002112873,0.00056117354,0.99054354,0.0006632187,0.000066548244,0.000040381725,0.000046883844,0.00016952156,0.005795854],"genre_scores_gemma":[0.2649921,0.004897939,0.7116891,0.0014814629,0.0009009591,0.00091710896,0.00046034943,0.00066171825,0.013999155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984256,0.0006252558,0.00009188947,0.00030249113,0.00045950525,0.000095227544],"domain_scores_gemma":[0.99743325,0.0016981817,0.00018678984,0.0004060577,0.00022449864,0.000051211613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030717333,0.0018971917,0.0011388883,0.0011064059,0.0005022426,0.0017666615,0.0015284895,0.0014594634,0.0042273863],"category_scores_gemma":[0.009459798,0.000615762,0.0019802123,0.0009162967,0.002960386,0.003314859,0.002968237,0.0054524313,0.0012969329],"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.000012912215,0.000025725087,0.00014850443,0.00016541906,0.00003100822,0.000037534373,0.00008706055,0.2302857,0.00077978795,0.74501944,0.0019089717,0.021497874],"study_design_scores_gemma":[0.000007931614,0.000016872595,0.000048404716,0.000030252068,0.0000068033764,0.000015207228,0.000012197974,0.49093428,0.00023771485,0.50428325,0.0043995855,0.0000075769576],"about_ca_topic_score_codex":0.0014632612,"about_ca_topic_score_gemma":0.0016166653,"teacher_disagreement_score":0.0042273863,"about_ca_system_score_codex":0.0018353637,"about_ca_system_score_gemma":0.001491535,"threshold_uncertainty_score":0.016245127},"labels":[],"label_agreement":null},{"id":"W7132918614","doi":"","title":"The Development of a Versatile and Efficient Gradient-Enhanced Bayesian Optimizer for Nonlinearly Constrained Optimization with Application to Aerodynamic Shape Optimization","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian optimization; Probabilistic logic; Aerodynamics; Bayesian probability; Constrained optimization; Nonlinear system; Optimization problem; CMA-ES; Global optimization","score_opus":0.007556436759067682,"score_gpt":0.2904343266446862,"score_spread":0.2828778898856185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132918614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071802846,0.00009618188,0.9971155,0.000091677495,0.000020440082,0.000019402434,0.000033568227,0.0006334658,0.0012717549],"genre_scores_gemma":[0.048840906,0.00034230677,0.94513094,0.00020577745,0.000045175253,0.00023760811,0.0002941521,0.0011199012,0.0037831902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907184,0.00025027234,0.000049111703,0.000100410165,0.00047288247,0.00005538696],"domain_scores_gemma":[0.99899954,0.0004608205,0.00009236388,0.00011840036,0.00026072524,0.000068135196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018635305,0.0011354467,0.0011994079,0.00048117473,0.0004560065,0.0012103128,0.0013598683,0.0017082853,0.0050617703],"category_scores_gemma":[0.004746567,0.00085313426,0.0011051696,0.000519782,0.0007243386,0.0010376306,0.0017972685,0.003223814,0.0029907622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007044687,0.000080298705,0.00049410085,0.00029369106,0.000119268894,0.0001255679,0.00012903645,0.79136705,0.01305771,0.055122185,0.008797042,0.13034362],"study_design_scores_gemma":[0.00000794979,0.000014459754,0.000050020903,0.000015639704,0.000004272665,0.000023781768,0.000004523373,0.98978806,0.00163052,0.004039567,0.0044088974,0.000012304483],"about_ca_topic_score_codex":0.004113493,"about_ca_topic_score_gemma":0.006308882,"teacher_disagreement_score":0.0050617703,"about_ca_system_score_codex":0.0007247429,"about_ca_system_score_gemma":0.0021698033,"threshold_uncertainty_score":0.016933322},"labels":[],"label_agreement":null},{"id":"W7133451701","doi":"","title":"ONE-SHOT OPTIMIZATION FOR THE INVERSE DESIGN OF A QUASI-1D DE LAVAL NOZZLE","year":2024,"lang":"en","type":"article","venue":"ORBi UMONS","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Nozzle; Inverse; Inverse problem; Work (physics); Optimal design","score_opus":0.05804233546895118,"score_gpt":0.3068157780428112,"score_spread":0.24877344257386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133451701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01971186,0.0002847,0.9718132,0.00021262412,0.00007140677,0.00006377951,0.00003190178,0.0001594674,0.0076510776],"genre_scores_gemma":[0.6291969,0.00037084465,0.35870633,0.00011892055,0.000041421754,0.00021920176,0.00009026555,0.00013135653,0.011124927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.0000673291,0.000008609646,0.000039650175,0.00011687959,0.00002412379],"domain_scores_gemma":[0.9997167,0.00014794253,0.000034715078,0.000018643324,0.00006328519,0.000018759356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801959,0.00057474343,0.0009944125,0.00036694654,0.00045310275,0.0010936606,0.000695252,0.001992706,0.0038657314],"category_scores_gemma":[0.001196437,0.0004804559,0.00056418055,0.00023330707,0.0007310891,0.00071471254,0.0010204668,0.0007870702,0.0004999302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088727626,0.000035011777,0.00024013553,0.00019077928,0.000016289941,0.00009040215,0.00009144006,0.9547644,0.011134777,0.010466762,0.00061421306,0.022267055],"study_design_scores_gemma":[0.000005718615,0.00003123391,0.000039322756,0.0000054654697,0.0000022092117,0.000015082932,0.000011608585,0.99784625,0.0007930525,0.00073368027,0.0005120444,0.0000043865257],"about_ca_topic_score_codex":0.00196402,"about_ca_topic_score_gemma":0.001609122,"teacher_disagreement_score":0.0038657314,"about_ca_system_score_codex":0.00057638314,"about_ca_system_score_gemma":0.0011896504,"threshold_uncertainty_score":0.012932122},"labels":[],"label_agreement":null},{"id":"W74931915","doi":"10.1007/978-3-642-21434-9_3","title":"Automated Algorithm Configuration and Parameter Tuning","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":false,"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; Algorithm; Set (abstract data type); Selection (genetic algorithm); Parameter space; Mathematical optimization; Data mining; Machine learning; Mathematics","score_opus":0.02456515553784827,"score_gpt":0.2496453930371361,"score_spread":0.22508023749928782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74931915","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.0029341162,0.00045401184,0.9726264,0.00007684397,0.00010971904,0.00007950512,0.00010101336,0.0062248074,0.017393608],"genre_scores_gemma":[0.08866097,0.000563064,0.88894016,0.00014637815,0.00008896523,0.000313646,0.0006137056,0.0028558965,0.017817272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991007,0.00022290043,0.000048352565,0.00017107182,0.0003931503,0.0000638855],"domain_scores_gemma":[0.9985555,0.00058030814,0.000060350492,0.00048375546,0.0002915904,0.000028511306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095872104,0.0015506978,0.0011853697,0.0011227716,0.0006607059,0.0020289295,0.0021144073,0.0010873507,0.02084068],"category_scores_gemma":[0.0045192023,0.0007698951,0.00059447286,0.001204279,0.00044720757,0.0020414684,0.0015015454,0.0016348517,0.011451964],"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.00012856096,0.00008027987,0.00028324185,0.000219964,0.000041286796,0.0000852865,0.00006714225,0.09042368,0.014519695,0.015878143,0.018687194,0.8595854],"study_design_scores_gemma":[0.00006337083,0.00007509615,0.00066161767,0.00011625286,0.00005782055,0.0003352528,0.00006222359,0.8201454,0.04261989,0.05264738,0.0831465,0.0000690814],"about_ca_topic_score_codex":0.0009380061,"about_ca_topic_score_gemma":0.0013591839,"teacher_disagreement_score":0.02084068,"about_ca_system_score_codex":0.00050236547,"about_ca_system_score_gemma":0.0008546566,"threshold_uncertainty_score":0.06971902},"labels":[],"label_agreement":null}]}