{"meta":{"query_hash":"b128c1e2c194","filters":{"venue":"Optimization and Engineering"},"cohort_total":78,"direct_labels_cover":0,"predictions_cover":78,"exported":78,"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/b128c1e2c194","api":"https://metacan.xera.ac/api/v1/cohort?venue=Optimization+and+Engineering"},"results":[{"id":"W1028453535","doi":"10.1007/s11081-015-9282-1","title":"Constrained problem formulations for power optimization of aircraft electro-thermal anti-icing systems","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Icing and De-icing Technologies","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis; McGill University","funders":"","keywords":"Icing; Mathematical optimization; Computer science; Convergence (economics); Optimization problem; Power (physics); Mathematics","score_opus":0.00951036878113416,"score_gpt":0.196660483267986,"score_spread":0.18715011448685184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1028453535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084838765,0.0012404785,0.9671496,0.0006173674,0.00015689808,0.00013635885,0.00050079345,0.000100144214,0.021614451],"genre_scores_gemma":[0.6624578,0.0032438366,0.29654935,0.00069694925,0.0004115858,0.0014135727,0.0016006149,0.0004551145,0.033171088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939215,0.0002733031,0.000028320477,0.00008370947,0.00016429173,0.00005814233],"domain_scores_gemma":[0.9981589,0.0013458196,0.0001110288,0.000055812816,0.0002821512,0.00004631027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001513661,0.0017061854,0.00155743,0.0008293438,0.0004677831,0.0022250747,0.0013702465,0.0019740195,0.008581988],"category_scores_gemma":[0.0048076464,0.00087207503,0.0009781165,0.0013149118,0.0008304327,0.0013430306,0.0012283752,0.0017760524,0.0006191694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014082944,0.000018710143,0.000059785452,0.000074787706,0.000018588584,0.000019860476,0.000012365448,0.9836232,0.0001700135,0.010812819,0.0008440819,0.0043317485],"study_design_scores_gemma":[0.000006718838,0.000009123765,0.000049838327,0.000010506418,0.0000049566606,0.000003942722,0.000007763299,0.99433666,0.000074149415,0.0048631895,0.00063035113,0.0000027836847],"about_ca_topic_score_codex":0.009116975,"about_ca_topic_score_gemma":0.0072619766,"teacher_disagreement_score":0.009116975,"about_ca_system_score_codex":0.0012702643,"about_ca_system_score_gemma":0.0014649057,"threshold_uncertainty_score":0.02870965},"labels":[],"label_agreement":null},{"id":"W1518867187","doi":"10.1023/a:1016086220943","title":"An Introduction to the Space Mapping Technique","year":2001,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":false,"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; McMaster University","keywords":"Computer science; Space mapping; Preprocessor; Mathematical optimization; Space (punctuation); Algorithm; Function (biology); Mathematics; Artificial intelligence","score_opus":0.006047019999597958,"score_gpt":0.2198307084523365,"score_spread":0.21378368845273854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518867187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008066356,0.009532376,0.95922416,0.00096217915,0.001861589,0.000027983939,0.00011250854,0.00029235,0.027180267],"genre_scores_gemma":[0.04391447,0.031082386,0.86983943,0.0019139331,0.004632136,0.00024448885,0.00036674793,0.0007701188,0.04723618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.00019344741,0.00004763492,0.00010593182,0.00023144543,0.000039327322],"domain_scores_gemma":[0.9994017,0.0003501003,0.000034727644,0.0000821528,0.00010507834,0.000026268506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007971787,0.0010621086,0.0009010732,0.0016328947,0.0006662189,0.002058297,0.0011434855,0.0013188801,0.009784855],"category_scores_gemma":[0.001984162,0.0005190666,0.0013909348,0.0022049104,0.002196703,0.0030575187,0.0018612702,0.0041010645,0.005144517],"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.000020676958,0.00002795608,0.00013875957,0.00025194354,0.000024256024,0.00011222216,0.00014679208,0.006918738,0.002381888,0.8455971,0.016010452,0.1283693],"study_design_scores_gemma":[0.00000890601,0.00004232562,0.00019271276,0.00010540268,0.00001547533,0.0004800732,0.00004538928,0.02637672,0.0014115042,0.72690594,0.24437523,0.000040407576],"about_ca_topic_score_codex":0.0008374945,"about_ca_topic_score_gemma":0.00073853903,"teacher_disagreement_score":0.009784855,"about_ca_system_score_codex":0.0005128652,"about_ca_system_score_gemma":0.00061118504,"threshold_uncertainty_score":0.03273356},"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":"W1560742679","doi":"10.1023/a:1010000106286","title":"Review of the Space Mapping Approach to Engineering Optimization and Modeling","year":2000,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":false,"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":"Space mapping; Computer science; Iterated function; Space (punctuation); Mathematical optimization; Optimization problem; Uniqueness; Algorithm; Mathematics","score_opus":0.010403090540044223,"score_gpt":0.1725521408456413,"score_spread":0.16214905030559706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560742679","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.0011173001,0.5809048,0.3822854,0.0032211002,0.0025414734,0.000035952802,0.000108678796,0.00021373988,0.029571583],"genre_scores_gemma":[0.025180943,0.8139786,0.13906251,0.0016685267,0.005226989,0.000102008664,0.00025127214,0.00017974846,0.014349363],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991412,0.00025404725,0.000074664546,0.0001205255,0.00037471703,0.000034817538],"domain_scores_gemma":[0.99890053,0.0006299874,0.000052169224,0.00008514545,0.00030204622,0.000030052322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013154265,0.0011140858,0.0016418502,0.0019096506,0.0004121556,0.0020546038,0.0017057818,0.0016941926,0.004333637],"category_scores_gemma":[0.0026510665,0.00065543514,0.0007230131,0.0034703838,0.0010704722,0.0023182374,0.00092907815,0.0017272984,0.0029611827],"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.000048299713,0.000085506275,0.0003106847,0.003617373,0.0001154627,0.00011600408,0.00009790879,0.052906044,0.002669443,0.26212475,0.053299814,0.6246087],"study_design_scores_gemma":[0.000018476248,0.000105326966,0.00040600367,0.0010743592,0.00007061237,0.00046327122,0.000076630145,0.047371663,0.0016829332,0.17345212,0.77521473,0.00006389549],"about_ca_topic_score_codex":0.0016350478,"about_ca_topic_score_gemma":0.0023129983,"teacher_disagreement_score":0.004333637,"about_ca_system_score_codex":0.0008363038,"about_ca_system_score_gemma":0.0011638486,"threshold_uncertainty_score":0.014497459},"labels":[],"label_agreement":null},{"id":"W158002236","doi":"10.1023/a:1023985013315","title":"A Global Optimization Approach to Laser Design","year":2003,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Solid State Laser Technologies","field":"Engineering","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":"National Research Council Canada; Dalhousie University","funders":"","keywords":"Flatness (cosmology); Extrapolation; Computer science; Laser; Range (aeronautics); Field (mathematics); Mathematical optimization; Mathematics; Optics; Physics; Engineering","score_opus":0.010979905762078409,"score_gpt":0.185961991662973,"score_spread":0.1749820859008946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158002236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014765548,0.00039681155,0.993616,0.0001337013,0.00004874253,0.000018050481,0.000023707436,0.000109056185,0.0041773943],"genre_scores_gemma":[0.19585374,0.0016896798,0.7869813,0.0002861037,0.00028496332,0.0004713352,0.000255086,0.0006191518,0.013558688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937767,0.00026432562,0.000019171455,0.00007018669,0.00022669573,0.000041946252],"domain_scores_gemma":[0.99927,0.00046499533,0.000043835047,0.00005967311,0.00013573295,0.000025818073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722309,0.0016436254,0.0019618073,0.0012179688,0.0007736072,0.0013880044,0.0014149211,0.001772563,0.004719771],"category_scores_gemma":[0.0025180732,0.0013489409,0.001573862,0.0016215537,0.0012973537,0.0014124473,0.0012820417,0.0015483747,0.0007263508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012426689,0.000013157596,0.00004251863,0.000041847943,0.00002737549,0.000009435523,0.000015393927,0.9624593,0.00032540606,0.019872764,0.001082467,0.016097913],"study_design_scores_gemma":[0.000007655977,0.000015770844,0.00003250597,0.000007465742,0.000008764855,0.0000050708377,0.00000502164,0.98076457,0.0001355117,0.017488554,0.0015243469,0.0000048150814],"about_ca_topic_score_codex":0.0035941424,"about_ca_topic_score_gemma":0.0041713794,"teacher_disagreement_score":0.004719771,"about_ca_system_score_codex":0.0010723241,"about_ca_system_score_gemma":0.0012364951,"threshold_uncertainty_score":0.01578921},"labels":[],"label_agreement":null},{"id":"W1863391138","doi":"10.1007/s11081-015-9285-y","title":"Announcement: Inaugural Howard Rosenbrock Prize","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Matrix Theory and 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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Financial engineering; Computer science; Mathematical economics; Applied mathematics; Mathematics; Economics; Financial economics","score_opus":0.012194430913530322,"score_gpt":0.19757900221927605,"score_spread":0.18538457130574573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863391138","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.003063891,0.017107503,0.0031912734,0.3737829,0.45175233,0.00008409689,0.0018095761,0.00044905627,0.14875934],"genre_scores_gemma":[0.027783893,0.0065858946,0.0017605942,0.028854216,0.101993956,0.00008275188,0.0008739612,0.0003866421,0.83167815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835,0.00017027976,0.0000474543,0.00025063875,0.0007876202,0.00039396694],"domain_scores_gemma":[0.9962722,0.00034161273,0.00012966343,0.00017187429,0.0009390903,0.0021455018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025635667,0.001308324,0.0013536331,0.0012366005,0.001955036,0.0043916483,0.00111098,0.004657059,0.05916597],"category_scores_gemma":[0.006756986,0.000359497,0.00062435394,0.0005463218,0.0009587127,0.0024853034,0.0025696836,0.0056929234,0.040716864],"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.00007039367,0.000021206435,0.000070224094,0.000023802822,0.0000063582424,0.00002269008,0.000005017529,0.00007142219,0.00013307547,0.0053607635,0.9842907,0.009924325],"study_design_scores_gemma":[0.000046645306,0.00006782426,0.0012087235,0.000056891742,0.000011989654,0.00005658591,0.00003895585,0.00060233293,0.00047301938,0.014284698,0.98312885,0.000023539751],"about_ca_topic_score_codex":0.0014157196,"about_ca_topic_score_gemma":0.004018226,"teacher_disagreement_score":0.05916597,"about_ca_system_score_codex":0.0029036729,"about_ca_system_score_gemma":0.0025026165,"threshold_uncertainty_score":0.19792986},"labels":[],"label_agreement":null},{"id":"W1925813256","doi":"10.1007/s11081-015-9283-0","title":"Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Convergence (economics); Algorithm; Benchmark (surveying); Mathematical optimization; Adaptive mesh refinement; Scale (ratio); Computational science; Mathematics","score_opus":0.047452642848286604,"score_gpt":0.323116341158649,"score_spread":0.2756636983103624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925813256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02906694,0.0005586063,0.95790106,0.00044568072,0.00021882137,0.000046888716,0.000033468077,0.00029183793,0.011436705],"genre_scores_gemma":[0.7047071,0.0005126468,0.28235197,0.0003352046,0.00014853512,0.00029545612,0.000078297366,0.000359266,0.011211459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.00013538363,0.000010755011,0.00003358716,0.000107051215,0.00002393068],"domain_scores_gemma":[0.99899703,0.0006466068,0.000052911706,0.000098845485,0.00015507363,0.000049534407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096903567,0.00048514517,0.00081574987,0.0004209075,0.00045284326,0.00094678154,0.00085646525,0.00088659563,0.0048820176],"category_scores_gemma":[0.005904667,0.00036884026,0.00030444257,0.00042806496,0.0008925501,0.0013066404,0.0013953429,0.0011587363,0.00061315944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020006411,0.0000829978,0.00059835974,0.0001278803,0.000036892554,0.00007332778,0.000086779364,0.8236041,0.0037650976,0.10028327,0.0031986027,0.06794259],"study_design_scores_gemma":[0.00000739855,0.000010261207,0.000023140665,0.000004497198,0.0000018799193,0.0000056952144,0.0000029041134,0.9931132,0.00020451532,0.0062005525,0.0004238266,0.0000021404564],"about_ca_topic_score_codex":0.0013263917,"about_ca_topic_score_gemma":0.001284904,"teacher_disagreement_score":0.0048820176,"about_ca_system_score_codex":0.0004219657,"about_ca_system_score_gemma":0.00062635535,"threshold_uncertainty_score":0.01633197},"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":"W1972320167","doi":"10.1007/s11081-008-9036-4","title":"Multi-objective aerodynamic shape optimization for unsteady viscous flows","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":17,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aerodynamics; Shape optimization; Mach number; Computer science; Flow (mathematics); Rotor (electric); Mathematical optimization; Domain (mathematical analysis); Helicopter rotor; Control theory (sociology); Mathematics; Applied mathematics; Mechanics; Mechanical engineering; Mathematical analysis; Physics; Geometry; Engineering; Structural engineering; Finite element method","score_opus":0.007895143781932337,"score_gpt":0.1958947832367592,"score_spread":0.18799963945482687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972320167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04070587,0.000398541,0.9540433,0.00019839415,0.00007658644,0.0000664361,0.00006825043,0.00023105608,0.0042115967],"genre_scores_gemma":[0.63174933,0.00035715025,0.35900196,0.00021287425,0.00014683287,0.0003985451,0.00031885735,0.0004128017,0.0074015926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00023595456,0.00002505356,0.00006508751,0.00017771065,0.00006506249],"domain_scores_gemma":[0.99880385,0.00065488124,0.00013782136,0.00009072208,0.00022172577,0.000090943926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018392473,0.0014859127,0.0016175399,0.0011408275,0.00063200976,0.001096959,0.0013924907,0.0019770223,0.002169922],"category_scores_gemma":[0.0031951596,0.0011448795,0.0013246842,0.00077398657,0.00090647716,0.0011260611,0.0016985679,0.0011606407,0.00037378955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003262549,0.000025143912,0.00012733355,0.000026857733,0.000020965934,0.000014758355,0.000012830294,0.9888814,0.0005776984,0.0015376777,0.000222015,0.008520666],"study_design_scores_gemma":[0.0000044376993,0.000009434527,0.00002802659,0.0000017479122,0.0000021035423,0.0000028111403,0.0000024049314,0.9992042,0.00013096315,0.0005344073,0.000077821875,0.0000016488109],"about_ca_topic_score_codex":0.0024363385,"about_ca_topic_score_gemma":0.00263544,"teacher_disagreement_score":0.0024363385,"about_ca_system_score_codex":0.0008481345,"about_ca_system_score_gemma":0.00094734825,"threshold_uncertainty_score":0.009727001},"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":"W1979973936","doi":"10.1023/b:opte.0000042036.04931.49","title":"Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Resampling; Piecewise; Mathematics; Algorithm; Mathematical optimization; Bessel function; Kernel (algebra); Iterative reconstruction; Norm (philosophy); Applied mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.02212336073985096,"score_gpt":0.2911690377505036,"score_spread":0.2690456770106527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979973936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008782345,0.00001736913,0.9988632,0.000012071113,0.000006961583,0.0000070104975,0.0000043671876,0.000097853954,0.000112880945],"genre_scores_gemma":[0.04414826,0.00009664275,0.953152,0.000035248195,0.00002421977,0.0000932188,0.00005026212,0.00018584974,0.0022143307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994504,0.00020051542,0.000028094275,0.000067240646,0.00022875394,0.000024935003],"domain_scores_gemma":[0.9986792,0.0006555149,0.0001148345,0.00016095521,0.00033669372,0.000052748986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214751,0.0009925762,0.0006212031,0.00053212227,0.00018210874,0.00054672395,0.0008275557,0.0009778296,0.003248436],"category_scores_gemma":[0.0036061807,0.00057146215,0.0006404665,0.000271339,0.00048476332,0.0008205973,0.00081280293,0.0012954953,0.0011805131],"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.00040758404,0.00013994491,0.00040974177,0.00035288834,0.000096511576,0.0001380437,0.00020968367,0.3687345,0.14028871,0.050982933,0.0041484106,0.434091],"study_design_scores_gemma":[0.000019768679,0.0000844793,0.00006546795,0.000008469529,0.000011669563,0.00008196086,0.000006543984,0.9791758,0.01405443,0.0031670302,0.0033094313,0.000014923662],"about_ca_topic_score_codex":0.00079236197,"about_ca_topic_score_gemma":0.0015711818,"teacher_disagreement_score":0.003248436,"about_ca_system_score_codex":0.00045890108,"about_ca_system_score_gemma":0.00061457994,"threshold_uncertainty_score":0.010867059},"labels":[],"label_agreement":null},{"id":"W1983035488","doi":"10.1007/s11081-008-9068-9","title":"The hybrid-adjoint method: a semi-analytic gradient evaluation technique applied to composite cure cycle optimization","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Epoxy Resin Curing Processes","field":"Engineering","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 Toronto","funders":"","keywords":"Finite element method; Thermosetting polymer; Sensitivity (control systems); Temperature gradient; Composite number; Residual stress; Autoclave; Beam (structure); Optimal design; Mathematical optimization; Gradient method; Materials science; Computer science; Structural engineering; Mathematics; Composite material; Engineering; Physics","score_opus":0.01135768420048941,"score_gpt":0.23446428023617283,"score_spread":0.22310659603568342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983035488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003228206,0.000061594976,0.99533963,0.000042656393,0.0000318024,0.000017233082,0.000018901368,0.00025090482,0.0010091927],"genre_scores_gemma":[0.24376613,0.00018601559,0.7492845,0.00011801192,0.000067297624,0.000184017,0.00009710934,0.0004572563,0.0058397055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997408,0.000118472504,0.00000769479,0.000020914413,0.000096332995,0.000015734478],"domain_scores_gemma":[0.99959236,0.00022085154,0.000024913681,0.000036589216,0.00010275733,0.000022575998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087940803,0.0004606083,0.00061878713,0.000379901,0.00032457258,0.00056204497,0.0007294575,0.00086378475,0.0020749953],"category_scores_gemma":[0.0012421701,0.00035746957,0.00043732752,0.00034794022,0.00051000726,0.0006482824,0.0008053837,0.00099113,0.0004283256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012359087,0.00012160401,0.00050398125,0.00019919573,0.00007016281,0.00010121961,0.00009408711,0.7874863,0.023850726,0.045503505,0.003455002,0.1384907],"study_design_scores_gemma":[0.0000058546984,0.000013065262,0.000046527795,0.0000035527446,0.0000027891742,0.000011186293,0.0000024523931,0.9948572,0.0013137028,0.002768109,0.0009697226,0.000005798532],"about_ca_topic_score_codex":0.0015235251,"about_ca_topic_score_gemma":0.0021041078,"teacher_disagreement_score":0.0020749953,"about_ca_system_score_codex":0.00018826374,"about_ca_system_score_gemma":0.0006587451,"threshold_uncertainty_score":0.0069414973},"labels":[],"label_agreement":null},{"id":"W1985059812","doi":"10.1023/b:opte.0000038891.11414.04","title":"An Integrated Optimization Model for Inventory and Quality Control Problems","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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 New Brunswick","funders":"","keywords":"Computer science; Control chart; Statistical process control; Process (computing); Variance (accounting); Common cause and special cause; Quality (philosophy); Work in process; False alarm; Schedule; Sampling (signal processing); Production (economics); Process control; State (computer science); Control (management); Reliability engineering; Mathematical optimization; Statistics; Mathematics; Algorithm; Operations management; Engineering; Artificial intelligence; Detector","score_opus":0.08435243216666226,"score_gpt":0.3656640375634263,"score_spread":0.28131160539676403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985059812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015484811,0.00042745596,0.97686553,0.00035975841,0.000068513524,0.000051323852,0.00018593807,0.00018582659,0.0063709104],"genre_scores_gemma":[0.85527307,0.0008004447,0.12273963,0.00021937976,0.00014052576,0.00042917527,0.0005136279,0.0001614689,0.019722644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.0003224474,0.00005142996,0.00022906499,0.00037459598,0.00016303231],"domain_scores_gemma":[0.99908674,0.0004640027,0.0001225071,0.00004611971,0.00021738764,0.0000632581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017839225,0.0013588928,0.002154069,0.0008239029,0.0005213532,0.0025048542,0.0023839988,0.0025948787,0.003943071],"category_scores_gemma":[0.0028905978,0.0010814664,0.0013913475,0.0013001387,0.0010777937,0.0025142292,0.0016868174,0.00208217,0.00055029604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017876191,0.000021884685,0.00006714209,0.00001374259,0.0000142225035,0.000014019373,0.000008321991,0.9882861,0.00018698988,0.008757896,0.00018737138,0.0024243968],"study_design_scores_gemma":[0.0000053011727,0.000008014279,0.000028714583,0.000001378083,0.0000052802343,0.0000022600461,0.0000010845143,0.99778867,0.000035314453,0.001985707,0.00013575253,0.0000023801877],"about_ca_topic_score_codex":0.014476451,"about_ca_topic_score_gemma":0.009195627,"teacher_disagreement_score":0.014476451,"about_ca_system_score_codex":0.0018822559,"about_ca_system_score_gemma":0.0024699597,"threshold_uncertainty_score":0.028784394},"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":"W2007267362","doi":"10.1007/s11081-008-9046-2","title":"An asymmetric suboptimization approach to aerostructural optimization","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":66,"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":"Multidisciplinary design optimization; Aerodynamics; Solver; Computer science; Sensitivity (control systems); Mathematical optimization; Multidisciplinary approach; Optimization problem; Mathematics; Algorithm; Engineering; Aerospace engineering","score_opus":0.04735350519812372,"score_gpt":0.26526903577634636,"score_spread":0.21791553057822263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007267362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047727935,0.00017570134,0.9873942,0.0002558542,0.00006787949,0.000021477865,0.000026181558,0.000062126994,0.00722374],"genre_scores_gemma":[0.60506076,0.0009152595,0.37422705,0.00063030934,0.0005917237,0.00034024275,0.00019749581,0.0005364813,0.017500672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999089,0.00035907424,0.000030553183,0.00007951814,0.0003703153,0.00007156991],"domain_scores_gemma":[0.99914956,0.00041616577,0.00007694769,0.00015004101,0.00016430278,0.000043028074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013556075,0.0011859648,0.0016458734,0.0008333494,0.00057519006,0.0011462616,0.001781294,0.0008892514,0.003838669],"category_scores_gemma":[0.0030934496,0.0005781681,0.00094873563,0.00093070266,0.0010124611,0.0014240784,0.0018752337,0.0019726944,0.0005518813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082484614,0.000057907575,0.00014414825,0.00006578517,0.00005447981,0.00006526688,0.000033841417,0.769961,0.0029935748,0.18466121,0.0021067443,0.039773505],"study_design_scores_gemma":[0.0000050045187,0.000009353552,0.000024402418,0.0000021891644,0.0000058120513,0.000007491359,0.0000024942601,0.9649846,0.00028379622,0.03410783,0.0005642428,0.0000027832966],"about_ca_topic_score_codex":0.0012291376,"about_ca_topic_score_gemma":0.0012777129,"teacher_disagreement_score":0.003838669,"about_ca_system_score_codex":0.00078213075,"about_ca_system_score_gemma":0.0009837886,"threshold_uncertainty_score":0.012841582},"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":"W2009394266","doi":"10.1007/s11081-008-9072-0","title":"Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Euclidean distance; Mathematical optimization; Euclidean distance matrix; Relaxation (psychology); Euclidean geometry; Graph; Matrix (chemical analysis); Realization (probability); Stability (learning theory); Quadratic equation; Low-rank approximation; Approximation algorithm; Algorithm; Computer science; Combinatorics; Tensor (intrinsic definition); Geometry","score_opus":0.008924183446798219,"score_gpt":0.19450713792148394,"score_spread":0.18558295447468573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009394266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059676897,0.00057688204,0.99114007,0.0004214679,0.000048257425,0.0000123113305,0.00009130007,0.00012044176,0.0016215598],"genre_scores_gemma":[0.5919951,0.004993901,0.38964555,0.00042145766,0.00062606286,0.00024509773,0.0010251584,0.00020406276,0.010843599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990706,0.00036750396,0.000028935745,0.00022228935,0.00025552354,0.000055276712],"domain_scores_gemma":[0.99735487,0.0015525318,0.00040458675,0.0003245429,0.0002853334,0.000078082245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010256877,0.0009001001,0.0011058421,0.0010673084,0.0004444587,0.0009973034,0.0011728951,0.0010212965,0.0019465728],"category_scores_gemma":[0.0067691323,0.00048875523,0.0004999314,0.0020586213,0.0020810072,0.0026529864,0.0013402228,0.0020925037,0.00047963383],"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.00012703746,0.000050859755,0.0005664255,0.00020452373,0.000055128665,0.000080345715,0.000120085,0.42527416,0.002285291,0.48723042,0.0056317775,0.078373924],"study_design_scores_gemma":[0.000015127828,0.000027655473,0.000280118,0.000018450597,0.0000094646575,0.00006840084,0.000039169205,0.6934846,0.00052952213,0.3034165,0.0020922525,0.000018843662],"about_ca_topic_score_codex":0.0041011227,"about_ca_topic_score_gemma":0.003394973,"teacher_disagreement_score":0.0041011227,"about_ca_system_score_codex":0.0006716045,"about_ca_system_score_gemma":0.00086597237,"threshold_uncertainty_score":0.008154511},"labels":[],"label_agreement":null},{"id":"W2013789196","doi":"10.1007/s11081-011-9174-y","title":"Dynamic vaccination games and hybrid dynamical systems","year":2011,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","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 Guelph","funders":"","keywords":"Dynamical systems theory; Hybrid system; Interval (graph theory); Track (disk drive); Computer science; Set (abstract data type); Population; Mathematical optimization; Class (philosophy); Dynamical system (definition); Mathematics; Artificial intelligence; Physics; Machine learning","score_opus":0.011683882119262207,"score_gpt":0.22286874368244153,"score_spread":0.2111848615631793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013789196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19467446,0.007769113,0.73018605,0.00791402,0.00046294104,0.00007662718,0.00032876155,0.00010378084,0.058484275],"genre_scores_gemma":[0.9761548,0.0015079372,0.010661438,0.00026750195,0.00018379424,0.00007968434,0.0000794057,0.000013308197,0.011052107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.00037701792,0.000019231646,0.00007808503,0.0000824063,0.00007151784],"domain_scores_gemma":[0.99826896,0.001255645,0.00021369007,0.000051356245,0.0000874652,0.00012285357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496472,0.0007140858,0.0009211698,0.0005777868,0.0004219132,0.0020081191,0.00087990885,0.0016037907,0.0034501888],"category_scores_gemma":[0.003422385,0.00032026225,0.0005155899,0.0004900834,0.0020659831,0.0019265347,0.00092797587,0.0010566999,0.00016860839],"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.000039207145,0.000036064313,0.00059305987,0.0000630078,0.00006229441,0.00009075737,0.000089509536,0.24215473,0.0004809208,0.7500925,0.0014037574,0.0048941327],"study_design_scores_gemma":[0.000026373198,0.000027516946,0.00033219845,0.000012662159,0.00001079868,0.000038591206,0.000056880494,0.4156487,0.000056629728,0.5820774,0.0016973455,0.000014876123],"about_ca_topic_score_codex":0.004057603,"about_ca_topic_score_gemma":0.0024360905,"teacher_disagreement_score":0.004057603,"about_ca_system_score_codex":0.0016007882,"about_ca_system_score_gemma":0.0006621772,"threshold_uncertainty_score":0.011614561},"labels":[],"label_agreement":null},{"id":"W2027515466","doi":"10.1007/s11081-009-9095-1","title":"A two-stage stochastic mixed-integer programming approach to the index tracking problem","year":2009,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Portfolio; Index (typography); Stochastic programming; Computer science; Mathematical optimization; Integer programming; Set (abstract data type); Integer (computer science); Tracking (education); Dynamic programming; Mathematics; Finance","score_opus":0.031243170206080174,"score_gpt":0.2926003849621429,"score_spread":0.2613572147560627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027515466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003934494,0.00027106304,0.9921589,0.00033359072,0.000052748856,0.000054870277,0.00007520182,0.000058818783,0.003060296],"genre_scores_gemma":[0.40731236,0.0009053545,0.5686744,0.00038274899,0.0003303527,0.000686901,0.00036343836,0.00018117798,0.021163303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802446,0.0010797139,0.00007520705,0.00028286214,0.0003504673,0.00018732739],"domain_scores_gemma":[0.99626005,0.0028516634,0.00026471558,0.00012038637,0.0003298151,0.00017336135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005080242,0.0015063796,0.0024233852,0.0010147435,0.0006174183,0.0027303526,0.0033344815,0.0034360099,0.006601926],"category_scores_gemma":[0.007701632,0.0017593371,0.0017070433,0.0014325879,0.001326465,0.002795905,0.0023814938,0.0027819064,0.0005620182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080672275,0.0000885661,0.00030508236,0.00010478249,0.000067217596,0.00011431929,0.00004679406,0.91805166,0.0006272355,0.06748429,0.0010514642,0.011977864],"study_design_scores_gemma":[0.000013250292,0.000022369115,0.000036152618,0.0000053329586,0.000009195153,0.000008899457,0.0000029104974,0.99220204,0.000091398244,0.007319842,0.00028200258,0.000006661172],"about_ca_topic_score_codex":0.0039715907,"about_ca_topic_score_gemma":0.004061065,"teacher_disagreement_score":0.006601926,"about_ca_system_score_codex":0.001570588,"about_ca_system_score_gemma":0.002528379,"threshold_uncertainty_score":0.02686721},"labels":[],"label_agreement":null},{"id":"W2028262885","doi":"10.1007/s11081-008-9035-5","title":"The optimal control of unsteady flows with a discrete adjoint method","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":61,"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; Canada Research Chairs","keywords":"Adjoint equation; Minification; Laminar flow; Flow (mathematics); Optimal control; Mathematical optimization; Mathematics; Applied mathematics; Drag; Cylinder; Set (abstract data type); Computer science; Control theory (sociology); Control (management); Mathematical analysis; Mechanics; Partial differential equation; Geometry; Physics","score_opus":0.002950179326890712,"score_gpt":0.17353561290098812,"score_spread":0.17058543357409742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028262885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023773208,0.00030952334,0.97245795,0.00026645686,0.0001733719,0.000021756026,0.000014700241,0.00008615876,0.0028969154],"genre_scores_gemma":[0.83185774,0.00033277762,0.16173726,0.00011756248,0.00018448141,0.00010221559,0.000039371178,0.00007683263,0.0055517447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00019760763,0.000015311529,0.000043000604,0.00012394555,0.000031924785],"domain_scores_gemma":[0.9993067,0.00042736263,0.00006237728,0.00004084448,0.00010643509,0.00005626382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012716497,0.0005819607,0.0008410472,0.000520824,0.00043290565,0.0011842038,0.0007313347,0.0009412621,0.001092523],"category_scores_gemma":[0.0021698507,0.00048114706,0.0004952099,0.00034381342,0.0019510104,0.0010136855,0.0013914707,0.001494214,0.00008700693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022706726,0.00012837941,0.00022296968,0.00010887669,0.00003767296,0.000047576323,0.0000929094,0.8597151,0.008037997,0.10224315,0.00085345097,0.028284913],"study_design_scores_gemma":[0.000010458943,0.000013773518,0.00002027051,0.0000015437241,0.0000017852369,0.000002488112,0.0000017596223,0.9952455,0.00025969298,0.004250022,0.00018969273,0.0000029285966],"about_ca_topic_score_codex":0.0027734875,"about_ca_topic_score_gemma":0.0016393571,"teacher_disagreement_score":0.0027734875,"about_ca_system_score_codex":0.00052125234,"about_ca_system_score_gemma":0.0009723706,"threshold_uncertainty_score":0.006725192},"labels":[],"label_agreement":null},{"id":"W2029387956","doi":"10.1007/s11081-011-9147-1","title":"Filter allocation and replacement strategies in fluid power system under uncertainty: a fuzzy robust nonlinear programming approach","year":2011,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Water resources management and optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Fuzzy logic; Mathematical optimization; Nonlinear programming; Computer science; Robust optimization; Nonlinear system; Linearization; Filter (signal processing); Control theory (sociology); Mathematics; Artificial intelligence","score_opus":0.014510710739055686,"score_gpt":0.17531413852241653,"score_spread":0.16080342778336085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029387956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043959297,0.000373067,0.9509523,0.0003568508,0.00004658428,0.000051147697,0.00004155389,0.00009062131,0.0041285143],"genre_scores_gemma":[0.93269587,0.00028910034,0.06341514,0.00007914689,0.00005882791,0.00010786152,0.000045355235,0.000041348983,0.0032673636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951375,0.00019637727,0.000025529496,0.00008658207,0.000105342486,0.000072511175],"domain_scores_gemma":[0.9990722,0.00057921803,0.00012856006,0.000025808973,0.00016173265,0.00003254679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017062179,0.0009083209,0.0016979794,0.0007842219,0.00058529334,0.0018271087,0.0014334966,0.0016801034,0.0015919821],"category_scores_gemma":[0.0026764811,0.0006881846,0.0008168397,0.00065349194,0.0008917357,0.0016628499,0.00062292296,0.000760783,0.00013342612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034948593,0.000014283291,0.00007213959,0.00002563569,0.000020887315,0.00002491789,0.00002015812,0.9897982,0.00038972902,0.00401448,0.00017738224,0.005407274],"study_design_scores_gemma":[0.0000042887204,0.000008979721,0.000029087083,0.000002568722,0.000006161251,0.0000029700725,0.0000040139194,0.99843043,0.00010045859,0.0013524145,0.00005579069,0.0000028149811],"about_ca_topic_score_codex":0.008187724,"about_ca_topic_score_gemma":0.004402633,"teacher_disagreement_score":0.008187724,"about_ca_system_score_codex":0.0013376119,"about_ca_system_score_gemma":0.0009688317,"threshold_uncertainty_score":0.016280115},"labels":[],"label_agreement":null},{"id":"W2037983258","doi":"10.1007/s11081-007-9024-0","title":"Neuro-space mapping technique for semiconductor device modeling","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Semiconductor Quantum Structures and Devices","field":"Physics and Astronomy","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":"Carleton University","funders":"","keywords":"Space mapping; Computer science; MESFET; Artificial neural network; Semiconductor device; Representation (politics); Electronic engineering; Sensitivity (control systems); Voltage; Simulation; Transistor; Artificial intelligence; Field-effect transistor; Algorithm; Electrical engineering; Engineering","score_opus":0.015695362114316398,"score_gpt":0.23487795646068133,"score_spread":0.21918259434636492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037983258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005284181,0.00021109868,0.99163204,0.000081331644,0.000037056976,0.00001641166,0.00003267392,0.00022165508,0.002483524],"genre_scores_gemma":[0.543908,0.00057942275,0.4446762,0.00014645261,0.000059418187,0.00032334315,0.0001377285,0.00010623607,0.010063284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999404,0.000019264951,0.000003068326,0.000008348979,0.000023544626,0.0000053177855],"domain_scores_gemma":[0.99988544,0.000054170556,0.000009635074,0.000011334781,0.00003488157,0.000004430154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024885024,0.0004389399,0.0004262371,0.00029188162,0.00034695232,0.00042131296,0.0006431472,0.00070003537,0.001655059],"category_scores_gemma":[0.0006115186,0.00025135544,0.000509652,0.00042631026,0.00024298597,0.00043656927,0.00033421774,0.0006416081,0.00038498934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016606804,0.000015416115,0.00011630665,0.000030171317,0.000029749308,0.000029330911,0.000021996517,0.93211687,0.0020976078,0.010125623,0.0009034716,0.054496985],"study_design_scores_gemma":[7.5254286e-7,0.0000029782275,0.00001933234,0.0000011680727,0.0000018569534,0.0000049631085,0.0000012574293,0.9980868,0.00025686956,0.0013607333,0.0002622893,0.0000010716292],"about_ca_topic_score_codex":0.0053564627,"about_ca_topic_score_gemma":0.004901992,"teacher_disagreement_score":0.0053564627,"about_ca_system_score_codex":0.0003026587,"about_ca_system_score_gemma":0.00060799654,"threshold_uncertainty_score":0.010650575},"labels":[],"label_agreement":null},{"id":"W2047959283","doi":"10.1007/s11081-013-9227-5","title":"A surrogate-based multiobjective metaheuristic and network degradation simulation model for robust toll pricing","year":2013,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Computer science; Pareto principle; Metaheuristic; Multi-objective optimization; Toll; Network planning and design; Heuristic; Mathematics","score_opus":0.020200121759238288,"score_gpt":0.24345002852494832,"score_spread":0.22324990676571002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047959283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15167809,0.00048544354,0.82477146,0.00062198105,0.00015624057,0.00013442985,0.00035389798,0.0003854225,0.02141303],"genre_scores_gemma":[0.9529345,0.00015631184,0.04282822,0.00007648883,0.000023211023,0.00014160207,0.00019900786,0.0000596562,0.0035811393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996007,0.00018842137,0.000015486006,0.000042252268,0.00009319194,0.00006001983],"domain_scores_gemma":[0.99876463,0.00075823214,0.00013339413,0.000063940184,0.00020428102,0.00007556792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011680335,0.0006958917,0.0010713454,0.0008719425,0.0005188472,0.0012043614,0.0012461228,0.002233424,0.0024101795],"category_scores_gemma":[0.002914069,0.0005475946,0.0011188798,0.00086389546,0.00071198953,0.0009948935,0.0009692993,0.0013593166,0.00025760577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010170985,0.000010379376,0.00005868065,0.0000042148768,0.0000042649513,0.000009233192,0.0000033380409,0.9982926,0.00007838916,0.00094084133,0.000047082747,0.00054075004],"study_design_scores_gemma":[0.0000017341079,0.0000042885013,0.00001488204,7.7127265e-7,9.896786e-7,0.0000013411258,9.277559e-7,0.99970263,0.000024750956,0.00021444683,0.000032432657,8.221375e-7],"about_ca_topic_score_codex":0.008460631,"about_ca_topic_score_gemma":0.0039500776,"teacher_disagreement_score":0.008460631,"about_ca_system_score_codex":0.0011980919,"about_ca_system_score_gemma":0.0011772274,"threshold_uncertainty_score":0.016822815},"labels":[],"label_agreement":null},{"id":"W2052379828","doi":"10.1007/s11081-006-6590-5","title":"Hydro energy management optimization in a deregulated electricity market","year":2006,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Water resources management and optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inflow; Mathematical optimization; Electricity market; Discretization; Moment (physics); Computer science; Optimization problem; State variable; Electricity; Mathematics","score_opus":0.001848695843473466,"score_gpt":0.13405906730831485,"score_spread":0.13221037146484138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052379828","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.8193774,0.0008415947,0.13301364,0.0044851503,0.00021347833,0.00017622406,0.000794919,0.0002615015,0.040836122],"genre_scores_gemma":[0.98860264,0.00014703804,0.004368767,0.00007774548,0.00004850844,0.000033409036,0.00008477378,0.000039006332,0.0065979376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00031935167,0.000017263608,0.00007281196,0.00004492241,0.000091336595],"domain_scores_gemma":[0.99792933,0.0015357075,0.00017773341,0.000048967384,0.00015984471,0.00014842692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018835416,0.0007311901,0.0021762156,0.0005504796,0.0005724156,0.0026289406,0.0010452853,0.00246309,0.0053708255],"category_scores_gemma":[0.0039571547,0.0011111626,0.00072998146,0.0006640868,0.0012904813,0.0024898187,0.0008714222,0.0013906792,0.00024231484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013447372,0.000054160173,0.00019155268,0.000019238172,0.000023055554,0.00012946846,0.000009681802,0.9882808,0.00038429917,0.009234979,0.0004938927,0.0010444631],"study_design_scores_gemma":[0.00002415716,0.00002112256,0.00009843783,0.0000011285294,0.0000057012935,0.000006594621,0.000008972405,0.9975885,0.00005235807,0.0021162715,0.000072860006,0.000003888134],"about_ca_topic_score_codex":0.007878227,"about_ca_topic_score_gemma":0.006035982,"teacher_disagreement_score":0.007878227,"about_ca_system_score_codex":0.0020023258,"about_ca_system_score_gemma":0.001488683,"threshold_uncertainty_score":0.017967224},"labels":[],"label_agreement":null},{"id":"W2054148923","doi":"10.1023/b:opte.0000048536.47956.62","title":"A Coupled-Adjoint Sensitivity Analysis Method for High-Fidelity Aero-Structural Design","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":256,"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":"Air Force Office of Scientific Research; Fundação para a Ciência e a Tecnologia","keywords":"Sensitivity (control systems); Aerodynamics; Parameterized complexity; Mathematical optimization; Computer science; Mathematics; Applied mathematics; Topology (electrical circuits); Algorithm; Aerospace engineering; Engineering","score_opus":0.04790198100555463,"score_gpt":0.309288998847244,"score_spread":0.26138701784168933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054148923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017465553,0.000033080025,0.9970336,0.00002509073,0.000014759846,0.000019841269,0.000015878146,0.00017709004,0.00093408977],"genre_scores_gemma":[0.32126647,0.0001535097,0.67317635,0.00015406615,0.00007389024,0.00038543108,0.00012641835,0.00036633655,0.004297572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.00027188877,0.000023568537,0.000080870144,0.0002632732,0.000034549343],"domain_scores_gemma":[0.9988028,0.000770967,0.000074800075,0.000089140005,0.0002172761,0.000045014833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216259,0.0009100179,0.0010668996,0.0006920993,0.00053884136,0.0008697066,0.0013933723,0.0015691201,0.0040555317],"category_scores_gemma":[0.0030159685,0.000908381,0.001235019,0.00045396204,0.0008298924,0.00091347797,0.0019395356,0.0014143129,0.0006719547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003973238,0.0000534576,0.00015186174,0.00008429075,0.000054849716,0.000042405314,0.000036384823,0.9564904,0.0063951085,0.009959289,0.00044808656,0.02624408],"study_design_scores_gemma":[0.000003893778,0.000008395125,0.000023715824,0.0000027851204,0.0000044757653,0.0000061764554,0.0000011991364,0.9980034,0.00041897123,0.0012247964,0.0002981275,0.000004113359],"about_ca_topic_score_codex":0.0027231886,"about_ca_topic_score_gemma":0.0024708633,"teacher_disagreement_score":0.0040555317,"about_ca_system_score_codex":0.0004895075,"about_ca_system_score_gemma":0.0011179046,"threshold_uncertainty_score":0.01356709},"labels":[],"label_agreement":null},{"id":"W2054928060","doi":"10.1007/s11081-007-9031-1","title":"Aerodynamic optimization of turbomachinery blades using evolutionary methods and ANN-based surrogate models","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Turbomachinery Performance and Optimization","field":"Engineering","cited_by":84,"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":"Surrogate model; Turbomachinery; Computer science; Aerodynamics; Transonic; Computational fluid dynamics; Artificial neural network; Mathematical optimization; Airfoil; Genetic algorithm; Control theory (sociology); Mathematics; Engineering; Artificial intelligence; Mechanical engineering; Aerospace engineering; Machine learning","score_opus":0.009775469113704088,"score_gpt":0.24418924786043228,"score_spread":0.2344137787467282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054928060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26183006,0.0009849066,0.721644,0.00034846747,0.00014271567,0.00011440152,0.00014782704,0.0002696145,0.014518133],"genre_scores_gemma":[0.9400733,0.00029458155,0.05668834,0.000040008505,0.000023759434,0.00013176336,0.00015065266,0.0000492653,0.0025484075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995758,0.00022320176,0.000020031226,0.000033707776,0.00011400172,0.00003326672],"domain_scores_gemma":[0.9989561,0.0005995279,0.00011273027,0.000065256536,0.00022348775,0.000042768494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213188,0.0007866271,0.001231556,0.0006700631,0.0005106501,0.0009809101,0.0005789679,0.0015021261,0.0010027298],"category_scores_gemma":[0.002493418,0.00063812686,0.00075025496,0.0006360302,0.00064174505,0.0008054118,0.0005514262,0.0007218038,0.0002101873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012521744,0.000008216207,0.00009915841,0.000009944436,0.000005395997,0.000009342405,0.0000036212089,0.9974457,0.00020694117,0.00037348922,0.00003331212,0.0017922577],"study_design_scores_gemma":[0.0000020641598,0.0000069428215,0.00004124294,0.0000017518764,0.0000010545401,0.0000019571366,0.0000012314863,0.9996517,0.000094540635,0.00016319384,0.000033335302,0.0000010244364],"about_ca_topic_score_codex":0.0022387763,"about_ca_topic_score_gemma":0.002098925,"teacher_disagreement_score":0.0022387763,"about_ca_system_score_codex":0.0006584868,"about_ca_system_score_gemma":0.00062646007,"threshold_uncertainty_score":0.0064160824},"labels":[],"label_agreement":null},{"id":"W2055133561","doi":"10.1007/s11081-007-9030-2","title":"Spent potliner treatment process optimization using a MADS algorithm","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Mathematical optimization; Computer science; Algorithm; Set (abstract data type); Nonlinear system; Process (computing); Function (biology); Reduction (mathematics); Differentiable function; Mathematics","score_opus":0.03924008691482914,"score_gpt":0.3460628235775633,"score_spread":0.30682273666273413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055133561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025639404,0.00018044123,0.96440405,0.00015406925,0.00007807091,0.000060942406,0.000102861646,0.0005272745,0.008852881],"genre_scores_gemma":[0.4860172,0.00021994057,0.49220687,0.00012403661,0.00005649958,0.0003240753,0.0002697455,0.0003664135,0.020415204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976903,0.00005210341,0.000012137945,0.00004446155,0.00009849308,0.000023846285],"domain_scores_gemma":[0.999826,0.00006891384,0.000022203174,0.000034276378,0.000042013202,0.0000066771127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694282,0.0005377265,0.0011535266,0.00051456725,0.0005675258,0.0008561409,0.00085808424,0.00079316506,0.005492079],"category_scores_gemma":[0.00084475067,0.0003861589,0.00079961447,0.0007294467,0.00035175352,0.00087430264,0.0006048797,0.0008450622,0.0005654818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017411052,0.000074383504,0.0003299377,0.00011773798,0.00004711696,0.0000430456,0.000037864593,0.89766014,0.009984197,0.022536838,0.0012846699,0.06771001],"study_design_scores_gemma":[0.000009523197,0.000026808728,0.00007594955,0.0000033130464,0.0000067997385,0.0000067048218,0.0000046280857,0.99371606,0.002862136,0.0018144831,0.0014702396,0.000003456637],"about_ca_topic_score_codex":0.0022827673,"about_ca_topic_score_gemma":0.002934695,"teacher_disagreement_score":0.005492079,"about_ca_system_score_codex":0.0008370222,"about_ca_system_score_gemma":0.0010683119,"threshold_uncertainty_score":0.018372893},"labels":[],"label_agreement":null},{"id":"W2057817947","doi":"10.1007/s11081-013-9213-y","title":"An adaptive geometry parametrization for aerodynamic shape optimization","year":2013,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Mitacs; Canada Research Chairs","keywords":"Parametrization (atmospheric modeling); Mathematics; Airfoil; Shape optimization; Aerodynamics; Geometry; Mathematical optimization; Computer science; Applied mathematics; Physics; Finite element method","score_opus":0.00527573231310666,"score_gpt":0.20509726660380206,"score_spread":0.1998215342906954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057817947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003572566,0.000059089627,0.9939036,0.000045577086,0.000028086675,0.00002260022,0.000043269458,0.00040777074,0.0019173874],"genre_scores_gemma":[0.20586185,0.00027026786,0.7849457,0.00013840487,0.00005072912,0.00021979226,0.00030662626,0.0008444237,0.0073621892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997056,0.00009247324,0.00001435309,0.00004741896,0.00012319205,0.000016948108],"domain_scores_gemma":[0.9997483,0.000068731344,0.000020405745,0.00009647733,0.000055085424,0.0000109998455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793918,0.0006190136,0.0005674227,0.000502257,0.00031312977,0.00059641665,0.001023863,0.0006914147,0.004092965],"category_scores_gemma":[0.0014356094,0.00046007606,0.0007350676,0.000863298,0.000504414,0.00072526035,0.0011052723,0.0013530802,0.0014527418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010383197,0.000056099056,0.0005165979,0.000068536385,0.000034742094,0.00006444277,0.00007420607,0.6697635,0.02903645,0.034588784,0.0035728158,0.26211998],"study_design_scores_gemma":[0.0000097896045,0.000024416768,0.00014554324,0.000005731591,0.000006609017,0.000033146116,0.000006256838,0.98739326,0.0022320224,0.0043146955,0.005819989,0.000008513707],"about_ca_topic_score_codex":0.0015302933,"about_ca_topic_score_gemma":0.00261227,"teacher_disagreement_score":0.004092965,"about_ca_system_score_codex":0.0003384505,"about_ca_system_score_gemma":0.00040212032,"threshold_uncertainty_score":0.013692319},"labels":[],"label_agreement":null},{"id":"W2060517976","doi":"10.1007/s11081-011-9148-0","title":"An interactive multi-objective algorithm for decentralized decision making in product design","year":2011,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"Polytechnique Montréal; Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Process (computing); Product (mathematics); New product development; Multi-objective optimization; Order (exchange); Autonomy; Mathematical optimization; Algorithm; Industrial engineering; Operations research; Machine learning; Marketing; Mathematics","score_opus":0.022758667370807388,"score_gpt":0.23510372655545694,"score_spread":0.21234505918464955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060517976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011274225,0.00010691363,0.98489803,0.00012038438,0.000036440004,0.00008189468,0.000040850704,0.00050589116,0.0029354098],"genre_scores_gemma":[0.3604231,0.00008923038,0.63609433,0.00016791519,0.000053928834,0.00053493597,0.00012900941,0.00014474159,0.0023627626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904007,0.00041665803,0.000040016836,0.00013677399,0.00025144618,0.00011505021],"domain_scores_gemma":[0.99771416,0.0017557614,0.000111772126,0.000100484314,0.00021942561,0.00009839137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002620273,0.0012019961,0.0016429848,0.00082329474,0.0009217998,0.0011573755,0.002217458,0.0022679241,0.0054298216],"category_scores_gemma":[0.0047579943,0.0009598337,0.00092297175,0.00088291086,0.0010527034,0.0013985138,0.00242061,0.0014897501,0.00054352096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602953,0.0000817913,0.00019730652,0.000048815647,0.000035025285,0.00003452669,0.00004890628,0.95155424,0.00060399115,0.0049294983,0.00077106204,0.041534606],"study_design_scores_gemma":[0.000029293085,0.00001812629,0.00001921857,0.0000021860092,0.0000034818145,0.0000029109272,0.0000023015343,0.99871624,0.00009101386,0.0009873607,0.0001260163,0.0000018806641],"about_ca_topic_score_codex":0.0069336887,"about_ca_topic_score_gemma":0.006787032,"teacher_disagreement_score":0.0069336887,"about_ca_system_score_codex":0.0012000381,"about_ca_system_score_gemma":0.0017805727,"threshold_uncertainty_score":0.018164575},"labels":[],"label_agreement":null},{"id":"W2063927119","doi":"10.1023/b:opte.0000013632.20417.13","title":"Simultaneous Solution Strategies for Inclusion of Input Saturation in the Optimal Design of Dynamically Operable Plants","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Mathematical optimization; Bilinear interpolation; Saturation (graph theory); Computer science; Complementarity (molecular biology); Optimization problem; Mathematics","score_opus":0.03238951122103703,"score_gpt":0.27441901317422435,"score_spread":0.24202950195318731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063927119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03221655,0.000143365,0.9624395,0.0001106325,0.0000250192,0.000055330995,0.000016132257,0.00011810826,0.004875287],"genre_scores_gemma":[0.94537616,0.00013777275,0.052069385,0.000060656865,0.00002189791,0.00020424406,0.000022109261,0.000044850334,0.0020628911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994236,0.00021038599,0.0000339292,0.000079503734,0.00016511211,0.00008745687],"domain_scores_gemma":[0.99855846,0.0009759333,0.00015572697,0.000058017482,0.0002012355,0.000050597373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492143,0.0014795003,0.0010214113,0.0005508694,0.0005175568,0.0010956033,0.00105671,0.0010859122,0.0020527293],"category_scores_gemma":[0.0035408037,0.0011261936,0.0006712407,0.0005012259,0.0009119983,0.0014612991,0.0020294935,0.0010652661,0.00029413207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023865975,0.00010623966,0.00023978882,0.00021972238,0.00007828647,0.00015019561,0.0002402386,0.9021296,0.012627882,0.03936929,0.0004565219,0.044143558],"study_design_scores_gemma":[0.000034509707,0.00017220002,0.00006979674,0.0000138713085,0.000022038595,0.000017494822,0.000024143566,0.9869266,0.002567555,0.009678002,0.00046508928,0.0000086323225],"about_ca_topic_score_codex":0.0012529775,"about_ca_topic_score_gemma":0.0017514962,"teacher_disagreement_score":0.0020527293,"about_ca_system_score_codex":0.0004969195,"about_ca_system_score_gemma":0.00077843346,"threshold_uncertainty_score":0.007891297},"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":"W2070922270","doi":"10.1023/b:opte.0000033370.66768.a9","title":"Convergence Results for Generalized Pattern Search Algorithms are Tight","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Differentiable function; Limit (mathematics); Mathematics; Convergence (economics); Limit point; Stationary point; Zero (linguistics); Mathematical optimization; Algorithm; Mathematical proof; Function (biology); Applied mathematics; Mathematical analysis","score_opus":0.04541959430167648,"score_gpt":0.31634148635927795,"score_spread":0.2709218920576015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070922270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010854382,0.0021796795,0.9647374,0.0015219009,0.00042633884,0.00014465416,0.00023112229,0.0005931906,0.019311212],"genre_scores_gemma":[0.4591739,0.008337473,0.47285646,0.0052585267,0.0014038914,0.002252852,0.0018911152,0.00393573,0.044890035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368864,0.0023982562,0.00034678043,0.0013127457,0.0016010432,0.0006526492],"domain_scores_gemma":[0.9589997,0.027937576,0.0015864463,0.00487879,0.005592323,0.0010052688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011474984,0.004311215,0.0041155443,0.0036495952,0.0021193104,0.0038938147,0.0048651174,0.0044889236,0.016581558],"category_scores_gemma":[0.093004815,0.0019335165,0.0029835282,0.004660276,0.0055086077,0.011778753,0.008526991,0.009889324,0.0049862377],"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.0004900065,0.00017703611,0.0011706266,0.0012956809,0.0003216106,0.00020340114,0.00052899454,0.27057716,0.0031564883,0.60740966,0.020335155,0.094334155],"study_design_scores_gemma":[0.00006715931,0.00011987534,0.00035997652,0.00016897412,0.00007634251,0.00015740599,0.00011322164,0.4315772,0.001465055,0.5602399,0.0056140097,0.00004087575],"about_ca_topic_score_codex":0.0023560894,"about_ca_topic_score_gemma":0.00254243,"teacher_disagreement_score":0.016581558,"about_ca_system_score_codex":0.0019043512,"about_ca_system_score_gemma":0.0028175884,"threshold_uncertainty_score":0.06068623},"labels":[],"label_agreement":null},{"id":"W2071646657","doi":"10.1007/s11081-007-9009-z","title":"Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"McMaster University","funders":"","keywords":"Sequence (biology); Pulse sequence; Contrast (vision); Computer science; Mathematical optimization; Pulse (music); Algorithm; Noise (video); Nonlinear system; Mathematics; Physics; Nuclear magnetic resonance; Artificial intelligence; Chemistry; Image (mathematics)","score_opus":0.04154157018541573,"score_gpt":0.31113985743365025,"score_spread":0.26959828724823454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071646657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035478144,0.000059207945,0.99593264,0.000039142942,0.00000629004,0.000026755508,0.0000104971205,0.00010930388,0.00026842827],"genre_scores_gemma":[0.08026135,0.00016258941,0.91838956,0.00005142734,0.000013751853,0.00021928598,0.00007144181,0.00014776077,0.00068286306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995128,0.00021059466,0.000033042223,0.000058435257,0.00014981841,0.000035352605],"domain_scores_gemma":[0.9988839,0.00047704138,0.00011902594,0.00005234328,0.00042325075,0.000044497403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013081764,0.0013076601,0.00083422975,0.0008409475,0.000401858,0.00084608834,0.0005446598,0.0010657832,0.0013775364],"category_scores_gemma":[0.0034899702,0.00087002007,0.00051372114,0.00056823675,0.00057177054,0.0010660422,0.00064226513,0.0006544517,0.00069062144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000667884,0.0002192968,0.001045611,0.00047712855,0.0001419786,0.00013866481,0.00018144056,0.49667522,0.17252706,0.013799226,0.0017293427,0.31239715],"study_design_scores_gemma":[0.000031829895,0.00012877886,0.00030917113,0.00001735821,0.000044913555,0.00012604428,0.000016040847,0.9403317,0.053413667,0.0035715136,0.0019819604,0.000027022932],"about_ca_topic_score_codex":0.0011305021,"about_ca_topic_score_gemma":0.0017643035,"teacher_disagreement_score":0.0013775364,"about_ca_system_score_codex":0.0005733925,"about_ca_system_score_gemma":0.0017153192,"threshold_uncertainty_score":0.0069183707},"labels":[],"label_agreement":null},{"id":"W2077800636","doi":"10.1007/s11081-006-0348-y","title":"Non-linear game models for large-scale network bandwidth management","year":2006,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Bandwidth (computing); Computer network; Path (computing); Context (archaeology); Game theory; Bandwidth allocation; Mathematical optimization; Distributed computing; Quality of service; Mathematics","score_opus":0.00488879095109895,"score_gpt":0.1856045410795135,"score_spread":0.18071575012841454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077800636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034932755,0.0015773795,0.9368149,0.0028970009,0.00026944894,0.00017155676,0.00064375746,0.00024775215,0.02244543],"genre_scores_gemma":[0.8999066,0.0019379563,0.04705187,0.00053990236,0.00029970513,0.0006001039,0.0003928958,0.00012303336,0.04914788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986986,0.00070675387,0.00003503709,0.00016310245,0.0001885949,0.00020796825],"domain_scores_gemma":[0.99434185,0.004506242,0.000403024,0.00013086139,0.00033946586,0.00027856033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024247158,0.0020848021,0.002792622,0.0007978798,0.0009883521,0.0032875892,0.0035902713,0.0033431565,0.010590825],"category_scores_gemma":[0.008651324,0.0012208074,0.0009434453,0.0015216636,0.0024839775,0.0041217012,0.0016811986,0.0033932808,0.0007739275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045763252,0.00006852212,0.0001480915,0.00007436445,0.000035118803,0.000071471746,0.00005417362,0.8201987,0.0002353776,0.17380154,0.0027513695,0.002515381],"study_design_scores_gemma":[0.000017079985,0.000009309015,0.000041514555,0.0000034796924,0.000005859118,0.0000063476155,0.0000142182735,0.94869596,0.000020532663,0.050771073,0.0004077866,0.0000068359072],"about_ca_topic_score_codex":0.014053158,"about_ca_topic_score_gemma":0.014111357,"teacher_disagreement_score":0.014053158,"about_ca_system_score_codex":0.0037984666,"about_ca_system_score_gemma":0.0020261623,"threshold_uncertainty_score":0.035429835},"labels":[],"label_agreement":null},{"id":"W2080638133","doi":"10.1007/s11081-011-9155-1","title":"Planned tournament selection","year":2011,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Evolutionary Algorithms and Applications","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 Guelph","funders":"","keywords":"Tournament; Tournament selection; Selection (genetic algorithm); Mathematical optimization; Computer science; Population; Variety (cybernetics); Fitness proportionate selection; Fitness function; Mathematics; Artificial intelligence; Genetic algorithm","score_opus":0.010765354826782527,"score_gpt":0.18214762195242906,"score_spread":0.17138226712564653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080638133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06257347,0.00075689063,0.81833315,0.00056148163,0.0010797608,0.00044759363,0.0003636302,0.0022686978,0.11361522],"genre_scores_gemma":[0.6727484,0.0002997651,0.2557137,0.00043150038,0.00031753522,0.0004149026,0.00070854893,0.00035631406,0.0690093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.00028229563,0.000023244967,0.00019389205,0.00029231046,0.000107830565],"domain_scores_gemma":[0.9989697,0.00038927002,0.000055147288,0.00029481575,0.00019217115,0.000098907745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087515,0.00047236204,0.0005202866,0.000600983,0.0007835041,0.0014185612,0.0013140123,0.00072485337,0.022878299],"category_scores_gemma":[0.0026389381,0.00023413627,0.000557061,0.00059642346,0.00049715996,0.0005430738,0.00065744406,0.00093501253,0.0023520433],"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.0006299209,0.0002803647,0.0031836543,0.00025419256,0.00021395875,0.00030995565,0.00016484784,0.12711066,0.014767969,0.16707918,0.040724386,0.6452809],"study_design_scores_gemma":[0.0004139135,0.0012079295,0.0040734997,0.00005841134,0.00014887706,0.000795525,0.00009143238,0.76946676,0.01470835,0.11715054,0.0918034,0.00008125188],"about_ca_topic_score_codex":0.0007188233,"about_ca_topic_score_gemma":0.0018563902,"teacher_disagreement_score":0.022878299,"about_ca_system_score_codex":0.00041391427,"about_ca_system_score_gemma":0.0008154767,"threshold_uncertainty_score":0.07653552},"labels":[],"label_agreement":null},{"id":"W2097546193","doi":"10.1007/s11081-007-9004-4","title":"Modeling leakage power reduction in VLSI as optimization problems","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Low-power high-performance VLSI design","field":"Engineering","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 Waterloo; University of Guelph","funders":"","keywords":"Subthreshold conduction; Very-large-scale integration; Computer science; CMOS; Leakage (economics); Reduction (mathematics); Power optimization; Electronic engineering; Dissipation; Transistor; Cluster analysis; Sizing; Power (physics); Computer engineering; Electrical engineering; Embedded system; Engineering; Voltage; Mathematics","score_opus":0.005268158353263225,"score_gpt":0.18004443015768595,"score_spread":0.17477627180442273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097546193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040453617,0.0013309643,0.9430309,0.00077267026,0.00006417732,0.000055217624,0.00007431087,0.00018915454,0.014029018],"genre_scores_gemma":[0.7692343,0.0020831858,0.20981711,0.00035051524,0.00013418944,0.00022273796,0.0001302785,0.00028778755,0.017739862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997409,0.00009769869,0.000009182245,0.00003464666,0.0000837136,0.00003390823],"domain_scores_gemma":[0.9996376,0.0002612919,0.000036155263,0.000023095914,0.00003449068,0.0000074673817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617563,0.0007407791,0.0005766208,0.0004262241,0.00021374281,0.00085043884,0.0009951361,0.0010417149,0.0023313311],"category_scores_gemma":[0.0021290823,0.0005520599,0.00057554845,0.00081566087,0.00062271906,0.0013487996,0.0004711607,0.00073959236,0.00031321068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000949821,0.000012226653,0.000074754826,0.00003758385,0.0000089188725,0.000014927584,0.000011419243,0.9766937,0.0005928507,0.01598459,0.00027741378,0.0062821177],"study_design_scores_gemma":[0.0000035428113,0.00000518437,0.000021489599,0.0000029548441,0.000004437498,0.0000048266716,0.0000027928024,0.9916453,0.00034870853,0.00755308,0.00040653974,0.000001222067],"about_ca_topic_score_codex":0.0018173954,"about_ca_topic_score_gemma":0.0024475863,"teacher_disagreement_score":0.0023313311,"about_ca_system_score_codex":0.000697316,"about_ca_system_score_gemma":0.00054297777,"threshold_uncertainty_score":0.0077990294},"labels":[],"label_agreement":null},{"id":"W2139604219","doi":"10.1007/s11081-007-9003-5","title":"Application of a sensitivity equation method to the k–ε model of turbulence","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"Air Force Office of Scientific Research","keywords":"Sensitivity (control systems); Turbulence; Closure (psychology); K-epsilon turbulence model; Turbulence modeling; K-omega turbulence model; Flow (mathematics); Applied mathematics; Mathematics; Mathematical optimization; Mechanics; Physics; Engineering","score_opus":0.057841064846744845,"score_gpt":0.3137366843848266,"score_spread":0.25589561953808176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139604219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009074331,0.00014720752,0.98822,0.00014912341,0.000051101662,0.000030571377,0.00001871332,0.000102840655,0.0022060587],"genre_scores_gemma":[0.76915115,0.00064556877,0.22096492,0.00016866392,0.00015308127,0.00020565731,0.00010040502,0.000218862,0.0083916355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996101,0.00019605111,0.00001859191,0.000052348623,0.00009902931,0.000023865085],"domain_scores_gemma":[0.99864405,0.0010215379,0.00008688839,0.00007163388,0.00013617545,0.00003967152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010813794,0.00067015406,0.001004948,0.00068022945,0.00052732206,0.0008729031,0.0008423011,0.0012956088,0.00158566],"category_scores_gemma":[0.003451109,0.0006054239,0.0013781531,0.0004607464,0.0011195873,0.0008930269,0.001506957,0.0013781998,0.00022331542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023684725,0.000045935147,0.00030364623,0.000051392548,0.000060546503,0.000071703544,0.00004978202,0.9452223,0.004382203,0.035890706,0.00033632986,0.013561742],"study_design_scores_gemma":[0.0000018257717,0.0000044858566,0.000032473225,0.0000015688425,0.0000026639689,0.0000067995893,0.0000013171025,0.9973437,0.00022648888,0.0022121707,0.0001625795,0.000004056025],"about_ca_topic_score_codex":0.005933412,"about_ca_topic_score_gemma":0.0025473733,"teacher_disagreement_score":0.005933412,"about_ca_system_score_codex":0.00060895603,"about_ca_system_score_gemma":0.0010676307,"threshold_uncertainty_score":0.011797726},"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":"W2298933805","doi":"10.1007/s11081-016-9311-8","title":"Chaos oscillator differential search combined with Pontryagin’s minimum principle for simultaneous power management and component sizing of PHEVs","year":2016,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Electric and Hybrid Vehicle Technologies","field":"Engineering","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 Waterloo","funders":"","keywords":"Powertrain; Component (thermodynamics); Sizing; Computer science; Automotive engineering; Automotive industry; Optimal control; Mathematical optimization; Controller (irrigation); Control engineering; Control theory (sociology); Torque; Engineering; Control (management); Mathematics","score_opus":0.004620744560633036,"score_gpt":0.18227258428980594,"score_spread":0.17765183972917292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298933805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08389366,0.00027159374,0.9102087,0.00020228747,0.00004961581,0.000031392014,0.000016924356,0.00011067538,0.005215115],"genre_scores_gemma":[0.9112493,0.000093134935,0.086312786,0.000028696595,0.00001579943,0.00007100809,0.0000146061475,0.00002989833,0.002184885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999299,0.000025640822,0.0000030095155,0.000010962496,0.000023619674,0.0000069466287],"domain_scores_gemma":[0.99991333,0.0000602294,0.00000780407,0.000005363638,0.000010011855,0.0000033261624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023734204,0.0002513214,0.00036220485,0.00019642297,0.0002504789,0.0002703513,0.00033081466,0.00027813728,0.00077288947],"category_scores_gemma":[0.00044386764,0.0002503767,0.00031693687,0.00023998963,0.00027654495,0.0003681096,0.0003750644,0.00032733704,0.000068276546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015444386,0.00004993205,0.0006769821,0.0001080446,0.00007224107,0.00008443018,0.00014088475,0.77172875,0.05113743,0.08312931,0.0006991169,0.09201841],"study_design_scores_gemma":[0.0000144617825,0.000042710868,0.0001410788,0.000002472393,0.000006001321,0.0000134586435,0.000004474074,0.9898797,0.002587237,0.0067780726,0.00052469905,0.0000055777155],"about_ca_topic_score_codex":0.000636435,"about_ca_topic_score_gemma":0.0008592399,"teacher_disagreement_score":0.00077288947,"about_ca_system_score_codex":0.000301689,"about_ca_system_score_gemma":0.00029351693,"threshold_uncertainty_score":0.00258559},"labels":[],"label_agreement":null},{"id":"W2315126152","doi":"10.1007/s11081-016-9314-5","title":"Factor-based robust index tracking","year":2016,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Tracking error; Benchmark (surveying); Computer science; Conic section; Tracking (education); Portfolio; Efficient frontier; Portfolio optimization; Mathematical optimization; Robust optimization; Sharpe ratio; Mathematics; Artificial intelligence; Finance; Control (management)","score_opus":0.0582568812469636,"score_gpt":0.28799536107110624,"score_spread":0.22973847982414264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315126152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003861411,0.00019959985,0.9948384,0.000031906537,0.00003781847,0.000012609409,0.000029387847,0.0003305411,0.00065825845],"genre_scores_gemma":[0.49510682,0.00048579153,0.49882635,0.00014408614,0.00013568118,0.00008720633,0.00040162494,0.0003165782,0.004495977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988412,0.00028004963,0.00008418933,0.00034647682,0.00034629068,0.00010182238],"domain_scores_gemma":[0.9961145,0.0019374595,0.0004938345,0.0005729695,0.00078406447,0.000097071665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034274096,0.0012110636,0.0021498697,0.0013716448,0.0004645362,0.0018126586,0.0015442815,0.0017294406,0.0026972701],"category_scores_gemma":[0.012377174,0.0007364093,0.0011055935,0.0016888693,0.000740789,0.0023821546,0.0016331457,0.0012523261,0.0011566833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036724674,0.000074527285,0.0011452441,0.00012232905,0.00016786368,0.00006376091,0.00004776023,0.7129623,0.008382002,0.015529589,0.0022076315,0.2589297],"study_design_scores_gemma":[0.0000046214195,0.000019977837,0.000120682664,0.0000045043957,0.000008345699,0.000013225943,0.0000011486915,0.99586064,0.0013383384,0.0022997945,0.00032157009,0.000007114864],"about_ca_topic_score_codex":0.002503968,"about_ca_topic_score_gemma":0.001646606,"teacher_disagreement_score":0.0034274096,"about_ca_system_score_codex":0.00076478557,"about_ca_system_score_gemma":0.00093385734,"threshold_uncertainty_score":0.01812613},"labels":[],"label_agreement":null},{"id":"W2339991536","doi":"10.1007/s11081-012-9191-5","title":"Computing the lowest equilibrium pose of a cable-suspended rigid body","year":2012,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Rigid body; Robotics; Upper and lower bounds; Rigid body dynamics; Computer science; Towing; Robot; Euler's formula; Space (punctuation); MATLAB; Mathematical optimization; Mathematics; Mathematical analysis; Artificial intelligence; Classical mechanics; Physics; Structural engineering; Engineering","score_opus":0.005450412846199315,"score_gpt":0.18068853438855953,"score_spread":0.1752381215423602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339991536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25449008,0.00007071054,0.73735976,0.0001788425,0.000047008147,0.000049151917,0.00028697908,0.00095495075,0.0065625077],"genre_scores_gemma":[0.86714435,0.000051221698,0.12844582,0.000031099906,0.000016193737,0.000056946745,0.00040657524,0.00024759714,0.0036001902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998379,0.000029578041,0.000005661776,0.000045720582,0.000052559266,0.000028524244],"domain_scores_gemma":[0.99968946,0.00014847447,0.00003611389,0.000028760422,0.000060066046,0.000037146558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003118273,0.00080864364,0.0005955106,0.00074788503,0.0005400986,0.0008406995,0.00078679953,0.001163495,0.0057184463],"category_scores_gemma":[0.0016021172,0.00051939394,0.00053441286,0.00041302032,0.00075642887,0.0008916512,0.001086054,0.00070638506,0.0012151361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018861594,0.00008130077,0.0025895361,0.00009334861,0.000044787357,0.00019181674,0.0001313557,0.9365546,0.008358563,0.007855742,0.0010107768,0.042899612],"study_design_scores_gemma":[0.000023135493,0.00007726635,0.0006795245,0.000012167434,0.000010346437,0.000032907607,0.000103023616,0.98868364,0.0031864091,0.0067430427,0.00043643647,0.0000121590365],"about_ca_topic_score_codex":0.0047807842,"about_ca_topic_score_gemma":0.008418739,"teacher_disagreement_score":0.0057184463,"about_ca_system_score_codex":0.00048270272,"about_ca_system_score_gemma":0.0008630546,"threshold_uncertainty_score":0.01913011},"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":"W2594545404","doi":"10.1007/s11081-017-9347-4","title":"Dynamic portfolio choice: a simulation-and-regression approach","year":2017,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Portfolio; State variable; Mathematical optimization; Context (archaeology); Discrete choice; Representation (politics); Econometrics; Regression; Variable (mathematics); Mathematics; Economics; Finance; Machine learning","score_opus":0.020087521378608177,"score_gpt":0.2320731528265739,"score_spread":0.21198563144796573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594545404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09109991,0.0008114734,0.89626455,0.0013513701,0.00009387235,0.0000737887,0.00027082785,0.00032020043,0.009713884],"genre_scores_gemma":[0.89359283,0.0008265504,0.09785908,0.00018712196,0.0001523162,0.00017152063,0.0003420604,0.00012560416,0.0067428825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901116,0.0006593523,0.00003345693,0.000118285716,0.0001029711,0.00007475036],"domain_scores_gemma":[0.9914175,0.0071126954,0.0004859284,0.0004327146,0.00036260075,0.0001884202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026586584,0.00075598934,0.0018309646,0.001108274,0.00045543746,0.0014734961,0.001777014,0.0019899218,0.0050003147],"category_scores_gemma":[0.012495917,0.0007554412,0.0012093759,0.0014711188,0.00088151963,0.0018044482,0.0010038553,0.0015552294,0.00042825253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024340978,0.000035564095,0.00049762137,0.000012672184,0.000042273983,0.000025474264,0.000010515372,0.9771658,0.00006678075,0.0188924,0.00022274499,0.0030037758],"study_design_scores_gemma":[0.00000684783,0.0000047358135,0.000045995268,0.0000017429978,0.000004779904,0.0000053318386,0.0000018355818,0.9953426,0.000021411626,0.004470468,0.00009185532,0.0000024062408],"about_ca_topic_score_codex":0.011027219,"about_ca_topic_score_gemma":0.0042764414,"teacher_disagreement_score":0.011027219,"about_ca_system_score_codex":0.0008189584,"about_ca_system_score_gemma":0.001243705,"threshold_uncertainty_score":0.021926045},"labels":[],"label_agreement":null},{"id":"W2735702858","doi":"10.1007/s11081-017-9361-6","title":"A stochastic optimization formulation for the transition from open pit to underground mining","year":2017,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"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","funders":"Natural Sciences and Engineering Research Council of Canada; AngloGold Ashanti; Newmont Corporation; Barrick Gold Corporation","keywords":"Open-pit mining; Cash flow; Net present value; Computer science; Financial engineering; Set (abstract data type); Mathematical optimization; Production (economics); Mining engineering; Present value; Underground mining (soft rock); Operations research; Geology; Mathematics; Engineering; Economics","score_opus":0.02405759604799163,"score_gpt":0.236973812695526,"score_spread":0.21291621664753438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735702858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033271603,0.00043930914,0.95007735,0.00093250547,0.00008930683,0.000118765645,0.0005690222,0.000103576895,0.014398686],"genre_scores_gemma":[0.8328389,0.00090169674,0.1467023,0.00021428464,0.000107928645,0.0004821213,0.00053070206,0.00010643234,0.018115632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.00029789715,0.000028862953,0.00015249423,0.0001603359,0.00013088906],"domain_scores_gemma":[0.9990101,0.00061311683,0.00015174561,0.000027671455,0.00012222989,0.000075149335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016947992,0.001132487,0.0011386313,0.00063864,0.0005023415,0.0017410832,0.0013112181,0.001576149,0.0054487837],"category_scores_gemma":[0.0022759659,0.0008655706,0.0011094898,0.00091173936,0.000947657,0.0011894454,0.0009264364,0.0018298572,0.00033754538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001561842,0.000016114172,0.00015065358,0.00002714718,0.000010959439,0.00003543433,0.000012100455,0.98482054,0.00022075565,0.012828761,0.00029155536,0.0015702588],"study_design_scores_gemma":[0.000007864279,0.000023557463,0.00012008916,0.000007206291,0.000007874523,0.000009306416,0.000012344871,0.99326223,0.000096075084,0.0060023027,0.00044553287,0.000005614433],"about_ca_topic_score_codex":0.011369478,"about_ca_topic_score_gemma":0.008910882,"teacher_disagreement_score":0.011369478,"about_ca_system_score_codex":0.0021692035,"about_ca_system_score_gemma":0.0033607746,"threshold_uncertainty_score":0.022606552},"labels":[],"label_agreement":null},{"id":"W2754127623","doi":"10.1007/s11081-017-9366-1","title":"Best practices for comparing optimization algorithms","year":2017,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":189,"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":"Benchmarking; Best practice; Process (computing); Task (project management); Financial engineering; Optimization algorithm","score_opus":0.056139760934673856,"score_gpt":0.2990190674639251,"score_spread":0.24287930652925124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754127623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008789917,0.02655277,0.9354294,0.0024879125,0.00243838,0.0011815717,0.0032035487,0.0048785293,0.015037997],"genre_scores_gemma":[0.04490902,0.0047778464,0.94167876,0.0005962531,0.0003395788,0.002161136,0.0024796727,0.0017180115,0.0013397877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.84799904,0.08755508,0.021060636,0.0069585694,0.034819815,0.0016068551],"domain_scores_gemma":[0.74593717,0.16251005,0.006432149,0.052348163,0.03153537,0.0012371374],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06312083,0.0041969237,0.0052491515,0.016978584,0.003126682,0.011783266,0.008567775,0.0066499165,0.012215897],"category_scores_gemma":[0.3444492,0.002109722,0.0047917413,0.020270074,0.003392062,0.0075117364,0.0054726214,0.00835472,0.0043787365],"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.0016703617,0.0009985302,0.00490206,0.011794826,0.005309477,0.0003583316,0.0010480477,0.049261827,0.003988111,0.14491642,0.061806146,0.7139459],"study_design_scores_gemma":[0.0020103098,0.0019354647,0.0070456383,0.014379255,0.00476137,0.0016335476,0.0020430137,0.17886019,0.036904328,0.53781456,0.21173732,0.00087500986],"about_ca_topic_score_codex":0.0049622194,"about_ca_topic_score_gemma":0.0056540025,"teacher_disagreement_score":0.93687916,"about_ca_system_score_codex":0.0030399922,"about_ca_system_score_gemma":0.0044102096,"threshold_uncertainty_score":0.33381885},"labels":[],"label_agreement":null},{"id":"W2756195360","doi":"10.1007/s11081-017-9365-2","title":"Optimization methods for petroleum fields development and production systems: a review","year":2017,"lang":"en","type":"review","venue":"Optimization and Engineering","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Heuristics; Nonlinear programming; Stochastic programming; Nonlinear system; Financial engineering; Continuous optimization; Linear programming; Discrete optimization; Integer programming; Optimization problem; Algorithm; Multi-swarm optimization; Mathematics","score_opus":0.08199887581398814,"score_gpt":0.3773771439904614,"score_spread":0.2953782681764733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756195360","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.00027401213,0.9918065,0.0060393387,0.00019506864,0.00020123871,0.00000964588,0.000050214003,0.0000339706,0.0013900065],"genre_scores_gemma":[0.002513737,0.9909877,0.0051680407,0.00010262234,0.00032795646,0.000016799288,0.00008230428,0.000018186707,0.00078255904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953246,0.00008651567,0.0000745083,0.00009232603,0.00019036689,0.0000238814],"domain_scores_gemma":[0.9988832,0.0007382735,0.00010775469,0.000038117978,0.00020350178,0.000029139263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010129393,0.0015793842,0.0024311973,0.0027349123,0.0002943478,0.001442554,0.0013839863,0.0013178512,0.0051644766],"category_scores_gemma":[0.0022614412,0.0006426996,0.0012054221,0.0051100478,0.00054501084,0.0019622124,0.0010278691,0.0012715032,0.0016526128],"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.00004911056,0.00011063785,0.00027159828,0.026747016,0.00024060345,0.00006889619,0.000041070838,0.009733383,0.0010562772,0.009310588,0.016430045,0.9359407],"study_design_scores_gemma":[0.000058511756,0.0001995654,0.0014917381,0.011054924,0.00079629844,0.0007941427,0.00012510906,0.016725717,0.00246618,0.023189845,0.9429529,0.00014500703],"about_ca_topic_score_codex":0.0019878678,"about_ca_topic_score_gemma":0.0026655495,"teacher_disagreement_score":0.0051644766,"about_ca_system_score_codex":0.00045627242,"about_ca_system_score_gemma":0.0014938661,"threshold_uncertainty_score":0.017276883},"labels":[],"label_agreement":null},{"id":"W2922013388","doi":"10.1007/s11081-019-09426-5","title":"Multistage stochastic capacity planning of partially upgraded bitumen production with hybrid solution method","year":2019,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Energy, Environment, and Transportation Policies","field":"Energy","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 Alberta","funders":"Natural Resources Canada","keywords":"Variable (mathematics); Mathematical optimization; Asphalt; Computer science; Set (abstract data type); Production (economics); Production planning; Random variable; Stochastic modelling; Mathematics; Statistics","score_opus":0.01025784337057726,"score_gpt":0.20626731908464382,"score_spread":0.19600947571406657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922013388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11651231,0.00075682363,0.87077945,0.00036642232,0.0001334293,0.00022526816,0.00040529558,0.00032037983,0.010500588],"genre_scores_gemma":[0.95016587,0.0002833942,0.04355371,0.00006516203,0.00003646874,0.00034737823,0.00025094196,0.00005751225,0.0052394425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998946,0.00041254426,0.0000403322,0.00013160784,0.00021366583,0.00025580765],"domain_scores_gemma":[0.9983248,0.0011007327,0.00014773106,0.000050656647,0.0002575608,0.0001185151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020450922,0.0013028707,0.0029640135,0.0013780101,0.00074966927,0.0018322085,0.0017755192,0.0017627219,0.004285444],"category_scores_gemma":[0.002219719,0.0018848188,0.0017997349,0.0018761765,0.00106786,0.0011503493,0.0012966724,0.0012638102,0.00025832368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016057696,0.000005452638,0.00004741287,0.000012059448,0.000008179261,0.000014617729,0.0000037783766,0.9984806,0.000096011376,0.0005659426,0.00004213647,0.0007077674],"study_design_scores_gemma":[0.0000037550174,0.000009285314,0.000033198125,0.0000019212362,0.0000032080102,0.0000013938674,0.0000025849088,0.9994954,0.000053084455,0.00035578417,0.000037848564,0.0000024729886],"about_ca_topic_score_codex":0.024129124,"about_ca_topic_score_gemma":0.0163457,"teacher_disagreement_score":0.024129124,"about_ca_system_score_codex":0.0019447004,"about_ca_system_score_gemma":0.0025300186,"threshold_uncertainty_score":0.04797733},"labels":[],"label_agreement":null},{"id":"W2968737012","doi":"10.1007/s11081-019-09461-2","title":"Adjustable Robust Optimization for multi-tasking scheduling with reprocessing due to imperfect tasks","year":2019,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Process Optimization and Integration","field":"Engineering","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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Mathematical optimization; Dynamic priority scheduling; Distributed computing; Schedule; Mathematics","score_opus":0.011496370735835053,"score_gpt":0.2112320773505336,"score_spread":0.19973570661469853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968737012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036531735,0.00036596067,0.9586964,0.00021615722,0.00009241003,0.00003919217,0.00006188303,0.00018505313,0.003811182],"genre_scores_gemma":[0.9539427,0.0002113054,0.04268149,0.000047587055,0.00004261598,0.00008465127,0.00009410178,0.00009685806,0.002798644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.0002438471,0.000028581475,0.00017312304,0.00021348342,0.000121072204],"domain_scores_gemma":[0.9984805,0.0008301793,0.0002903141,0.000131774,0.00019820163,0.00006905423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017637601,0.0012023762,0.0014517849,0.00056213385,0.00043347856,0.0011267521,0.0011374761,0.0009543511,0.001352729],"category_scores_gemma":[0.004678104,0.000645576,0.0007958626,0.00065118476,0.0009479107,0.0009875026,0.0012166187,0.0013971865,0.0001603902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003926154,0.000010228836,0.00007041963,0.000025592255,0.000011789352,0.00001826312,0.000008344084,0.99440295,0.0008646156,0.0022981262,0.00010741664,0.002143066],"study_design_scores_gemma":[0.0000027213707,0.000008880162,0.000056073844,0.0000012283658,0.0000020276368,0.0000018749768,0.00000156387,0.9989003,0.00018954456,0.0007793737,0.000054217504,0.0000022764139],"about_ca_topic_score_codex":0.006130133,"about_ca_topic_score_gemma":0.0027436332,"teacher_disagreement_score":0.006130133,"about_ca_system_score_codex":0.001087852,"about_ca_system_score_gemma":0.0013115498,"threshold_uncertainty_score":0.012188911},"labels":[],"label_agreement":null},{"id":"W2978807476","doi":"10.1007/s11081-020-09507-w","title":"How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Noise (video); Function (biology); Reliability (semiconductor); Software; Financial engineering; Optimization problem; Quadratic equation","score_opus":0.030665663267915158,"score_gpt":0.2170810003309102,"score_spread":0.18641533706299507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978807476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057739813,0.0007221466,0.92285085,0.0026772008,0.0001661296,0.00010854101,0.000113429145,0.00051298214,0.015108936],"genre_scores_gemma":[0.5403009,0.0006072518,0.44562808,0.00074862933,0.00004823492,0.00016710011,0.00023946464,0.0005022902,0.011757943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999616,0.00017754837,0.000010777745,0.00007194822,0.000057415262,0.0000663291],"domain_scores_gemma":[0.9986706,0.0009941135,0.00006288428,0.00009801457,0.00010744866,0.00006690391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172394,0.00068441656,0.0006528178,0.0004084428,0.0006894486,0.0007414243,0.0010573062,0.0017882455,0.0046951133],"category_scores_gemma":[0.0055564553,0.00040039708,0.0006580612,0.00045741905,0.0015529157,0.0012014987,0.0018816503,0.001058501,0.00047165272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014897017,0.000054454013,0.0009201199,0.00020778642,0.00004779579,0.00023189028,0.00041298836,0.7358921,0.0026253357,0.13355295,0.009262599,0.116642945],"study_design_scores_gemma":[0.00006684247,0.000062600106,0.00014254003,0.000053978245,0.000028110493,0.00008126497,0.00020124862,0.84417,0.0015354771,0.14659621,0.007048438,0.0000133234],"about_ca_topic_score_codex":0.0059983563,"about_ca_topic_score_gemma":0.005840243,"teacher_disagreement_score":0.0059983563,"about_ca_system_score_codex":0.00055226544,"about_ca_system_score_gemma":0.0011803551,"threshold_uncertainty_score":0.015706718},"labels":[],"label_agreement":null},{"id":"W2990689883","doi":"10.1007/s11081-019-09476-9","title":"Robust principal component analysis using facial reduction","year":2019,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 Waterloo","funders":"University of California, Davis; Natural Sciences and Engineering Research Council of Canada; Kungliga Tekniska Högskolan","keywords":"Robust principal component analysis; Outlier; Sparse PCA; Principal component analysis; Computer science; Norm (philosophy); Heuristic; Mathematical optimization; Matrix (chemical analysis); Algorithm; Matrix norm; Reduction (mathematics); Mathematics; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.01743263055725297,"score_gpt":0.20196143938077804,"score_spread":0.18452880882352507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990689883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023898378,0.00013656622,0.99567384,0.00011244778,0.00003760327,0.000036841437,0.00007595142,0.00044943436,0.0010874196],"genre_scores_gemma":[0.11467608,0.00057896896,0.8779515,0.00014184133,0.00013069317,0.00023729702,0.0006376299,0.00031789072,0.0053281127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988668,0.00023853856,0.00004165675,0.0002833553,0.000475986,0.00009369819],"domain_scores_gemma":[0.99961436,0.000074951226,0.000043778487,0.00010502264,0.00014469992,0.000017191252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006963541,0.0013868377,0.0012361724,0.001280876,0.0005015683,0.0011907847,0.001157385,0.0008629527,0.0033037567],"category_scores_gemma":[0.0015844188,0.0005711945,0.0020547514,0.001497428,0.0008893412,0.00094128546,0.0015604204,0.0017603684,0.0019346654],"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.00014723763,0.00010289719,0.0005341172,0.00018846928,0.00017555412,0.00015016325,0.000117374184,0.32828012,0.049571298,0.044330947,0.010433411,0.56596845],"study_design_scores_gemma":[0.000007248407,0.000026162528,0.00028450976,0.000009566237,0.00002087132,0.000050369126,0.0000142875115,0.9786509,0.006362095,0.0090834405,0.0054719043,0.000018504972],"about_ca_topic_score_codex":0.003799748,"about_ca_topic_score_gemma":0.00341744,"teacher_disagreement_score":0.003799748,"about_ca_system_score_codex":0.00062389206,"about_ca_system_score_gemma":0.0014048804,"threshold_uncertainty_score":0.011052191},"labels":[],"label_agreement":null},{"id":"W3009274308","doi":"10.1007/s11081-020-09493-z","title":"Convex optimization techniques in compliant assembly simulation","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"Mathematical optimization; Hessian matrix; Active set method; Interior point method; Quadratic programming; Computer science; Convex optimization; Optimization problem; Linear programming; Matrix (chemical analysis); Algorithm; Mathematics; Regular polygon; Nonlinear programming; Applied mathematics","score_opus":0.01283247509068126,"score_gpt":0.20982433295061034,"score_spread":0.1969918578599291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009274308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051145162,0.00023388978,0.9907013,0.00013444705,0.000021387872,0.000033916695,0.000029676396,0.00014481718,0.003586113],"genre_scores_gemma":[0.5332542,0.0009549475,0.457764,0.00022623122,0.00011203477,0.0004635449,0.0002673336,0.00047764886,0.0064800577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.00055752875,0.000030704876,0.00007287676,0.00024623438,0.000055959157],"domain_scores_gemma":[0.9978498,0.0016026828,0.000121157595,0.000101722,0.0002657871,0.000058829966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717311,0.0010863479,0.0014592084,0.0006927741,0.00054095924,0.0010590194,0.0010180174,0.001128252,0.0024885375],"category_scores_gemma":[0.004011541,0.0006671116,0.0009652214,0.00080019265,0.001195983,0.00075985666,0.0016227283,0.0013896987,0.0004895325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000943932,0.000010988278,0.000054047836,0.000024097253,0.000009254151,0.000023966068,0.000011951232,0.9879225,0.00029811994,0.007013925,0.00021656216,0.0044052447],"study_design_scores_gemma":[0.0000014459272,0.000003385655,0.00001303375,0.0000021954345,7.7481974e-7,0.0000020049724,0.0000015834248,0.9982091,0.00006982977,0.0015553732,0.00014022388,0.000001024528],"about_ca_topic_score_codex":0.006798507,"about_ca_topic_score_gemma":0.0032818364,"teacher_disagreement_score":0.006798507,"about_ca_system_score_codex":0.00083394244,"about_ca_system_score_gemma":0.0009891989,"threshold_uncertainty_score":0.013517857},"labels":[],"label_agreement":null},{"id":"W3009526543","doi":"10.1007/s11081-020-09492-0","title":"Optimization of covered calls under uncertainty","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"IHS Markit (Canada); University of Toronto","funders":"","keywords":"Expected utility hypothesis; Portfolio; Mathematical optimization; Portfolio optimization; Computer science; Quadratic equation; Convex optimization; Optimization problem; Financial engineering; Matching (statistics); Econometrics; Regular polygon; Mathematics; Mathematical economics; Economics; Finance; Statistics","score_opus":0.018676566790180187,"score_gpt":0.18383828315075001,"score_spread":0.16516171636056984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009526543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3112243,0.002062634,0.6574434,0.0041569374,0.0003719785,0.00009537068,0.0007567072,0.00046945602,0.023419209],"genre_scores_gemma":[0.9700238,0.00047387142,0.016622843,0.00015000913,0.00018749887,0.00007768237,0.00032817383,0.0002121468,0.011923895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984742,0.00067343254,0.00004720822,0.00021953539,0.0002749038,0.00031067256],"domain_scores_gemma":[0.9927233,0.0058470126,0.00043299905,0.00016507143,0.0004225582,0.00040902858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019721687,0.0011558826,0.0024237344,0.00082838617,0.0005153465,0.003223405,0.0014622625,0.003085701,0.0040734946],"category_scores_gemma":[0.0121142045,0.0013156683,0.00089020253,0.0012116993,0.0016608561,0.0021542194,0.0015602093,0.0017904516,0.00039650453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098408345,0.000023878361,0.00020191965,0.00003810758,0.00002392956,0.00007629942,0.000029536894,0.98010683,0.00053243455,0.01530883,0.0008809459,0.002678875],"study_design_scores_gemma":[0.000008415988,0.000010291041,0.00011057519,0.00000377604,0.0000037143193,0.000008555731,0.000008618205,0.99313897,0.000090974274,0.006479776,0.00013118924,0.0000051465777],"about_ca_topic_score_codex":0.0072771558,"about_ca_topic_score_gemma":0.0031290313,"teacher_disagreement_score":0.0072771558,"about_ca_system_score_codex":0.0023736877,"about_ca_system_score_gemma":0.0015604277,"threshold_uncertainty_score":0.017222345},"labels":[],"label_agreement":null},{"id":"W3012349450","doi":"10.1007/s11081-020-09495-x","title":"Joint stochastic short-term production scheduling and fleet management optimization for mining complexes","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"AngloGold Ashanti; Natural Sciences and Engineering Research Council of Canada; Newmont Corporation; IAMGOLD; Canada Research Chairs; McGill University; Barrick Gold Corporation","keywords":"Haulage; Relocation; Shovel; Truck; Computer science; Fleet management; Scheduling (production processes); Schedule; Open-pit mining; Metaheuristic; Time horizon; Operations research; Production schedule; Production (economics); Mathematical optimization; Engineering; Rope; Automotive engineering; Algorithm; Mathematics; Mining engineering","score_opus":0.025318823114117706,"score_gpt":0.20661812831851026,"score_spread":0.18129930520439255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012349450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11814119,0.0002510215,0.87667495,0.00028676417,0.000040608516,0.00007127778,0.00019759902,0.00014472185,0.004191845],"genre_scores_gemma":[0.96238613,0.00013353303,0.0340422,0.000035036875,0.000022201279,0.0001311755,0.00014460082,0.000047358975,0.0030576296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00021773233,0.00002494913,0.00012871066,0.0001375058,0.00011916648],"domain_scores_gemma":[0.99926466,0.000396382,0.00015139683,0.000035276244,0.00008361789,0.00006860401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947671,0.00090480404,0.0013691109,0.00051586743,0.00047719383,0.0012533189,0.0011179093,0.0011565969,0.0014531866],"category_scores_gemma":[0.001589545,0.00078956725,0.0009992399,0.0008208471,0.0006967677,0.0008244959,0.00080215087,0.0009199765,0.0001497767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072500034,0.000005682095,0.00005838932,0.0000038560697,0.0000058046007,0.000011834273,0.000002327204,0.9986204,0.00016041154,0.00050025334,0.00003973824,0.00058416533],"study_design_scores_gemma":[0.0000019024568,0.0000072875227,0.000050200968,5.0233285e-7,0.0000015140682,0.000002088193,0.0000017308361,0.999566,0.00005126667,0.0002760095,0.00004038915,0.0000010963801],"about_ca_topic_score_codex":0.012193742,"about_ca_topic_score_gemma":0.0081581045,"teacher_disagreement_score":0.012193742,"about_ca_system_score_codex":0.0013995351,"about_ca_system_score_gemma":0.0018209742,"threshold_uncertainty_score":0.0242455},"labels":[],"label_agreement":null},{"id":"W3081977267","doi":"10.1007/s11081-020-09554-3","title":"Aerodynamic optimisation of a high-speed train head shape using an advanced hybrid surrogate-based nonlinear model representation method","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Aerodynamics and Fluid Dynamics Research","field":"Engineering","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":"Ministry of Education and Child Care","funders":"","keywords":"Surrogate model; Latin hypercube sampling; Computational fluid dynamics; Computer science; Aerodynamics; Radial basis function; Particle swarm optimization; Nonlinear system; Mathematical optimization; Polynomial chaos; Algorithm; Mathematics; Artificial intelligence; Engineering; Monte Carlo method; Artificial neural network; Machine learning","score_opus":0.03310849930653781,"score_gpt":0.2877674344126649,"score_spread":0.2546589351061271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081977267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052191544,0.00013760553,0.9341899,0.00020149576,0.00008660036,0.00007136832,0.00012159266,0.0002884593,0.012711434],"genre_scores_gemma":[0.8871095,0.0001868674,0.10013521,0.000114986535,0.00006004062,0.00020382617,0.00034664955,0.00020669663,0.011636159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998294,0.00006046957,0.000005844967,0.000018762206,0.00006181808,0.00002361703],"domain_scores_gemma":[0.9996668,0.00015810938,0.00003277785,0.000031976928,0.000082661834,0.000027630109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053422345,0.00055770756,0.00077327876,0.00033946373,0.0003820908,0.00078154774,0.0005651717,0.001601976,0.0029457172],"category_scores_gemma":[0.00095659966,0.0003849517,0.000828456,0.00032102063,0.00048952684,0.000579875,0.00077038456,0.0008112237,0.0005145072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021732276,0.00001645504,0.000115654875,0.00002323194,0.000008525087,0.0000264227,0.00001142237,0.99346924,0.0015738884,0.0012310194,0.00019919402,0.0033032694],"study_design_scores_gemma":[0.000002810516,0.0000096994945,0.00004077448,0.0000018002403,0.000001234469,0.0000055197997,0.0000030470994,0.99946636,0.00019248264,0.00013336266,0.00014113376,0.0000017352927],"about_ca_topic_score_codex":0.0023692697,"about_ca_topic_score_gemma":0.0020731823,"teacher_disagreement_score":0.0029457172,"about_ca_system_score_codex":0.00030633275,"about_ca_system_score_gemma":0.00092175894,"threshold_uncertainty_score":0.009854436},"labels":[],"label_agreement":null},{"id":"W3099707780","doi":"10.1007/s11081-020-09578-9","title":"A decomposition method for a class of convex generalized Nash equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Variational Analysis","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 Guelph","funders":"","keywords":"Nash equilibrium; Convexity; Mathematical optimization; Class (philosophy); Decomposition; Extension (predicate logic); Convergence (economics); Computer science; Constraint (computer-aided design); Set (abstract data type); Regular polygon; Decomposition method (queueing theory); Mathematics; Applied mathematics; Discrete mathematics","score_opus":0.015587014739055402,"score_gpt":0.24932601145714306,"score_spread":0.23373899671808765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099707780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019485853,0.00016004476,0.9950655,0.00009114719,0.000052292035,0.000025868889,0.000032749027,0.000029647033,0.002594182],"genre_scores_gemma":[0.116518326,0.00090052263,0.8692087,0.00019083466,0.0001785733,0.00040183688,0.0002607341,0.00021711686,0.012123377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994778,0.00025541912,0.000020549365,0.00007207925,0.00012488788,0.00004935727],"domain_scores_gemma":[0.9993073,0.00035882334,0.00004244808,0.00005061494,0.0001678974,0.00007299981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394416,0.00135274,0.0011516743,0.0009594973,0.0005405724,0.0011575685,0.0011365326,0.0011517083,0.004660639],"category_scores_gemma":[0.0030448444,0.0005771349,0.0013163477,0.0008972141,0.0008970517,0.0013633987,0.0019863388,0.0025808404,0.0009776773],"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.00010948345,0.00016024782,0.0004256449,0.00030437257,0.00012479197,0.00014274134,0.00016488948,0.29337817,0.0074102688,0.5716353,0.009958633,0.1161854],"study_design_scores_gemma":[0.000015004508,0.000024982355,0.000064865395,0.000023696124,0.0000148737645,0.000034340916,0.000019012208,0.9158112,0.00031989708,0.080700085,0.0029627716,0.000009221839],"about_ca_topic_score_codex":0.0021185805,"about_ca_topic_score_gemma":0.0027453483,"teacher_disagreement_score":0.004660639,"about_ca_system_score_codex":0.0007653127,"about_ca_system_score_gemma":0.0012537536,"threshold_uncertainty_score":0.015591383},"labels":[],"label_agreement":null},{"id":"W3118562502","doi":"10.1007/s11081-020-09575-y","title":"Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Water Systems and Optimization","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Integer programming; Branch and bound; Mathematical optimization; Linear programming relaxation; Scheduling (production processes); Computer science; Regular polygon; Heuristic; Relaxation (psychology); Linear programming; Integer (computer science); Upper and lower bounds; Branch and cut; Mathematics","score_opus":0.004095670486794863,"score_gpt":0.1627631810331442,"score_spread":0.15866751054634934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118562502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04199507,0.00058306317,0.95024467,0.00040903487,0.00010171289,0.000091348484,0.00016084763,0.0003708662,0.006043429],"genre_scores_gemma":[0.8089339,0.00045846833,0.18387875,0.00016947452,0.00013601696,0.00021879404,0.00022978892,0.00018050036,0.005794458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00031767233,0.000020686804,0.000093689705,0.00009562927,0.00011857356],"domain_scores_gemma":[0.99866295,0.0010315363,0.000071323506,0.000036176927,0.00012876205,0.00006924729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037716,0.0007752133,0.0018159093,0.0005778689,0.0006676163,0.0014895266,0.0010085193,0.0009733758,0.003761209],"category_scores_gemma":[0.0028158512,0.0007086367,0.00052621297,0.00095458754,0.0006728477,0.0012113502,0.00084204035,0.0012396601,0.00043658944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012220386,0.000048990067,0.00013326142,0.000054133074,0.000015336196,0.000011515543,0.000015465046,0.9807649,0.00050469727,0.002894254,0.00087766326,0.014557643],"study_design_scores_gemma":[0.0000037073878,0.000006804203,0.000014074108,0.0000011777262,0.0000022243,6.2668704e-7,0.0000017024367,0.9992786,0.00008149193,0.00054058275,0.00006820742,8.3593454e-7],"about_ca_topic_score_codex":0.0134553695,"about_ca_topic_score_gemma":0.010556827,"teacher_disagreement_score":0.0134553695,"about_ca_system_score_codex":0.0014399552,"about_ca_system_score_gemma":0.0022079875,"threshold_uncertainty_score":0.026754081},"labels":[],"label_agreement":null},{"id":"W3138160650","doi":"10.1007/s11081-021-09612-4","title":"State of the art methods for combined water and energy systems optimisation in Kraft pulp mills","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Process Optimization and Integration","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Resources Canada","funders":"","keywords":"Kraft process; Energy consumption; Environmental science; Greenhouse gas; Kraft paper; Process engineering; Computer science; Biofuel; Waste management; Engineering; Pulp and paper industry","score_opus":0.0067033822572543774,"score_gpt":0.21759502228322103,"score_spread":0.21089164002596666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138160650","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.017118625,0.031407196,0.93325436,0.0005485034,0.00025540663,0.00006563283,0.0002038609,0.0007016911,0.016444726],"genre_scores_gemma":[0.44912815,0.02704493,0.49969935,0.00031764648,0.0008075058,0.00045305846,0.0008204138,0.0011286678,0.020600216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839824,0.00054185576,0.000095435396,0.00016684245,0.00069804286,0.00009958856],"domain_scores_gemma":[0.99869496,0.0008376599,0.00007230937,0.00012051729,0.00024384617,0.000030813742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018326847,0.0015030819,0.0021430117,0.0011366768,0.0005602636,0.0027788484,0.002197625,0.0019926329,0.0033327106],"category_scores_gemma":[0.003337343,0.0010122842,0.001756671,0.0018333251,0.0010201879,0.0016457574,0.0015380527,0.0024531763,0.0013824096],"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.00016547991,0.00011622453,0.00029317432,0.0011279618,0.00021409977,0.00003278567,0.00009604499,0.72437835,0.0025617643,0.018554948,0.0023974092,0.25006172],"study_design_scores_gemma":[0.000013713663,0.000030322375,0.00018657937,0.00007072528,0.00002066659,0.000010775049,0.000015789283,0.98730206,0.001246169,0.006937189,0.0041531418,0.000012811672],"about_ca_topic_score_codex":0.0037017125,"about_ca_topic_score_gemma":0.0037583995,"teacher_disagreement_score":0.0037017125,"about_ca_system_score_codex":0.00073777966,"about_ca_system_score_gemma":0.0012219802,"threshold_uncertainty_score":0.011148989},"labels":[],"label_agreement":null},{"id":"W3154921582","doi":"10.1007/s11081-021-09630-2","title":"The use of intensity-dependent weight functions to “Weberize” $$L^2$$-based methods of signal and image approximation","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Image and Signal Denoising Methods","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 Waterloo","funders":"","keywords":"Intensity (physics); Weight function; Mathematics; Metric (unit); Exponent; Uniqueness; Function (biology); Approximations of π; Image (mathematics); Mathematical analysis; Physics; Computer science; Optics; Artificial intelligence","score_opus":0.024158060434771818,"score_gpt":0.25533874253697947,"score_spread":0.23118068210220766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154921582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003709417,0.00016871675,0.9936772,0.00010977414,0.00011800792,0.000018390978,0.000011104562,0.00011124919,0.0020761422],"genre_scores_gemma":[0.14765738,0.0009280138,0.83536637,0.00034353448,0.0001922025,0.00012544471,0.000083888845,0.0006198845,0.014683353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00012785725,0.000025855412,0.000066711975,0.0001281925,0.0000388622],"domain_scores_gemma":[0.99927896,0.00026448155,0.00007726616,0.0001592293,0.0001747143,0.00004526839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020718,0.0009579915,0.00048034007,0.0012990587,0.0004982867,0.0014476673,0.0012669861,0.0011863868,0.002823562],"category_scores_gemma":[0.0038889328,0.00049049093,0.0007532911,0.00091266766,0.0015192182,0.0020129355,0.0019021544,0.00198958,0.0009026444],"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.00014057176,0.00009624561,0.00044662107,0.0002095388,0.00007732033,0.00010898435,0.00025558769,0.07436721,0.0669836,0.6649088,0.003419347,0.18898615],"study_design_scores_gemma":[0.000011092331,0.000044281147,0.00021938042,0.00003230293,0.000021220367,0.00012012311,0.00002524084,0.8883863,0.027998168,0.07137558,0.011709907,0.000056451703],"about_ca_topic_score_codex":0.001298692,"about_ca_topic_score_gemma":0.0018408325,"teacher_disagreement_score":0.002823562,"about_ca_system_score_codex":0.0007314776,"about_ca_system_score_gemma":0.00080319645,"threshold_uncertainty_score":0.009445727},"labels":[],"label_agreement":null},{"id":"W3158339412","doi":"10.1007/s11081-021-09629-9","title":"A matheuristic approach for optimizing mineral value chains under uncertainty","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","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":"Université du Québec à Trois-Rivières; McGill University","funders":"","keywords":"Heuristics; Computer science; Reinforcement learning; Mathematical optimization; Artificial neural network; Value (mathematics); Relaxation (psychology); Decomposition; Artificial intelligence; Machine learning; Mathematics","score_opus":0.012057757233954832,"score_gpt":0.1945331721275355,"score_spread":0.18247541489358066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158339412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008210373,0.00041904039,0.97482014,0.001243653,0.00011243825,0.00006612816,0.00016838881,0.0000645423,0.014895378],"genre_scores_gemma":[0.57172513,0.0011755271,0.39899513,0.00085402216,0.0004772222,0.0005847949,0.000343986,0.00025855048,0.02558561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894613,0.00046477746,0.000043732707,0.00014377676,0.00030867543,0.00009300355],"domain_scores_gemma":[0.9967109,0.0025163726,0.00022903115,0.00011188913,0.00029920618,0.00013261705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160228,0.001458459,0.001828728,0.0015053806,0.0009917917,0.00265754,0.0023802887,0.0031552913,0.0057301],"category_scores_gemma":[0.008338164,0.0015032508,0.0017955977,0.0016545344,0.0026454863,0.002607046,0.0026265762,0.0024877517,0.0004647273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001187982,0.00001802428,0.00011488008,0.000042397096,0.000033129603,0.000028832841,0.000022228847,0.9397834,0.00013647317,0.056638088,0.00043375266,0.002736912],"study_design_scores_gemma":[0.0000062298004,0.00000944077,0.000034289496,0.000009218689,0.0000063663547,0.000006628869,0.000006738115,0.9546725,0.000045810615,0.04469039,0.00050673407,0.0000057081625],"about_ca_topic_score_codex":0.01136675,"about_ca_topic_score_gemma":0.009032888,"teacher_disagreement_score":0.01136675,"about_ca_system_score_codex":0.003321689,"about_ca_system_score_gemma":0.003195018,"threshold_uncertainty_score":0.024100661},"labels":[],"label_agreement":null},{"id":"W3183136893","doi":"10.1007/s11081-021-09659-3","title":"Norm induced polyhedral uncertainty sets for robust linear optimization","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Robust optimization; Intersection (aeronautics); Uncertain data; Mathematical optimization; Uncertainty theory; Constraint (computer-aided design); Mathematics; Set (abstract data type); Norm (philosophy); Uncertainty quantification; Uncertainty analysis; Computer science; Data mining","score_opus":0.06890294975717556,"score_gpt":0.3245371272210113,"score_spread":0.25563417746383577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183136893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037523618,0.0006164342,0.99052775,0.0002704572,0.000105405416,0.00003917655,0.00012875974,0.00004732756,0.004512351],"genre_scores_gemma":[0.52214015,0.0043197237,0.44290864,0.00085595937,0.00085666653,0.0012085544,0.0016931162,0.0006707542,0.025346464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961857,0.0017924253,0.0001781764,0.0004580188,0.0012381466,0.00014753224],"domain_scores_gemma":[0.99081856,0.006498299,0.000701178,0.00048138623,0.0011521059,0.00034855425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005232578,0.0022883965,0.0028479374,0.0022428338,0.0006813893,0.0033503424,0.0022337076,0.0021728405,0.0031153478],"category_scores_gemma":[0.015438708,0.0013980484,0.0019470869,0.001892578,0.003363539,0.0035433925,0.0045912326,0.006252543,0.00067159877],"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.000070380884,0.000072170544,0.00018367701,0.000264007,0.000090564274,0.00004842437,0.000099758465,0.45085138,0.0011954344,0.5213144,0.0021592304,0.023650669],"study_design_scores_gemma":[0.000006868187,0.000042546526,0.00006774741,0.000038652808,0.000010378014,0.000014561823,0.000015924667,0.6737315,0.00031969996,0.3241686,0.0015630075,0.000020535754],"about_ca_topic_score_codex":0.0023471753,"about_ca_topic_score_gemma":0.0013446022,"teacher_disagreement_score":0.005232578,"about_ca_system_score_codex":0.0022847697,"about_ca_system_score_gemma":0.0012439935,"threshold_uncertainty_score":0.027672827},"labels":[],"label_agreement":null},{"id":"W3198051614","doi":"10.1007/s11081-021-09673-5","title":"A data-driven approach for mixed-case palletization with support","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Packing Problems","field":"Engineering","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 Waterloo","funders":"","keywords":"Pallet; Bin packing problem; Packing problems; Computer science; Bin; Mathematical optimization; Layering; Layer (electronics); Algorithm; Computational science; Mathematics; Mechanical engineering; Materials science; Engineering","score_opus":0.020149346295971614,"score_gpt":0.21080464655756295,"score_spread":0.19065530026159133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198051614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004279212,0.000032956537,0.9923035,0.00010627965,0.00002560861,0.00013475737,0.00021220213,0.001248339,0.0016571472],"genre_scores_gemma":[0.172187,0.00008731348,0.82231385,0.00016975043,0.00004219346,0.00050882774,0.0013184049,0.0005919896,0.0027806498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787474,0.000502467,0.00013286677,0.00027682463,0.0010188372,0.00019430295],"domain_scores_gemma":[0.9957724,0.0021993024,0.00020851482,0.0006568074,0.0009768704,0.00018612665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025067173,0.0013145631,0.0015244408,0.0015094135,0.0007785162,0.0029398536,0.0043458077,0.0016544926,0.012229852],"category_scores_gemma":[0.008983815,0.0013888426,0.0020024553,0.0013830846,0.00083821017,0.0024508692,0.0030912152,0.0022621718,0.0024940618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003673832,0.0005500572,0.001361049,0.00031487006,0.00011411105,0.00032690854,0.0001654625,0.783989,0.0056263017,0.04187156,0.0052574975,0.1600558],"study_design_scores_gemma":[0.000010186403,0.00001562506,0.000030920688,0.0000072965063,0.000005818325,0.000016577886,0.000012004761,0.9903392,0.0010830081,0.007548076,0.00092585484,0.0000055085693],"about_ca_topic_score_codex":0.0034313696,"about_ca_topic_score_gemma":0.004612181,"teacher_disagreement_score":0.012229852,"about_ca_system_score_codex":0.00093522365,"about_ca_system_score_gemma":0.0020200144,"threshold_uncertainty_score":0.040912986},"labels":[],"label_agreement":null},{"id":"W4206075549","doi":"10.1007/s11081-021-09701-4","title":"Short-term open-pit production scheduling optimizing multiple objectives accounting for shovel allocation in stockpiles","year":2022,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Shovel; Computer science; Maximization; Scheduling (production processes); Open-pit mining; Production (economics); Relocation; Term (time); Operations research; Operations management; Mathematical optimization; Engineering; Mining engineering; Mathematics","score_opus":0.017901291763007605,"score_gpt":0.2275146174433093,"score_spread":0.2096133256803017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206075549","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.5610749,0.0005936355,0.4285757,0.00040712344,0.0001460236,0.00018048678,0.0003615432,0.000357536,0.008303053],"genre_scores_gemma":[0.97819394,0.00008829906,0.01910534,0.000014709283,0.000013856904,0.000036974303,0.00010045896,0.0000315516,0.0024148372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00008803394,0.000013290427,0.00006482406,0.00007564635,0.00011520497],"domain_scores_gemma":[0.9994,0.00026541343,0.00008142741,0.000038324448,0.00012409769,0.000090779264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086749,0.00058905105,0.0011949838,0.0005018112,0.0006809575,0.0014834222,0.0009752686,0.0010332493,0.002470433],"category_scores_gemma":[0.0016493363,0.0006430102,0.000598543,0.00074941677,0.00049802836,0.0012066874,0.0006856321,0.00081248616,0.00019841413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085592495,0.000038199065,0.0004578811,0.000028242588,0.0000149762545,0.000038703896,0.000013166857,0.988946,0.0011775055,0.0008174587,0.00023695178,0.008145319],"study_design_scores_gemma":[0.0000033357144,0.000025970086,0.00026449122,0.0000017238943,0.000004570482,0.0000030061467,0.000010806271,0.9990382,0.00021300679,0.00036200896,0.000070557195,0.0000023330542],"about_ca_topic_score_codex":0.013753092,"about_ca_topic_score_gemma":0.017682042,"teacher_disagreement_score":0.013753092,"about_ca_system_score_codex":0.0013018084,"about_ca_system_score_gemma":0.002121723,"threshold_uncertainty_score":0.027346075},"labels":[],"label_agreement":null},{"id":"W4322775628","doi":"10.1007/s11081-022-09780-x","title":"An optimization model for the real-time truck dispatching problem in open-pit mining operations","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","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 Alberta","funders":"","keywords":"Shovel; Truck; Computer science; Heuristic; Open-pit mining; Mathematical optimization; Operations research; Engineering; Automotive engineering; Mathematics","score_opus":0.01629608742879384,"score_gpt":0.23524395990695787,"score_spread":0.21894787247816402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322775628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069075294,0.00096011127,0.9083159,0.0017347003,0.00023305762,0.00016600644,0.0008107829,0.00031149166,0.01839267],"genre_scores_gemma":[0.91070235,0.00085105636,0.060131893,0.00020217204,0.00012596018,0.00029042255,0.00057655224,0.00014484109,0.02697473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993125,0.00025596938,0.000028782828,0.00015346662,0.00011230685,0.00013687981],"domain_scores_gemma":[0.9987307,0.00089778664,0.00011071683,0.000024920377,0.00014203557,0.00009386089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015525778,0.001206257,0.0022198756,0.0007385394,0.0007227482,0.0024380984,0.0024974903,0.0034146397,0.0068173977],"category_scores_gemma":[0.0030414246,0.0010696154,0.001132931,0.0012689794,0.0011240295,0.0021016852,0.0010891847,0.0022691998,0.00058823527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017913144,0.00001827185,0.000065020155,0.000019082903,0.000006428272,0.00002695706,0.0000098916435,0.9943974,0.000100558835,0.0039509865,0.00032530454,0.00106214],"study_design_scores_gemma":[0.000005105678,0.0000059531394,0.00002798475,0.0000017359122,0.0000024820472,0.0000028211673,0.0000043554846,0.99859303,0.000015514572,0.0012167403,0.000121758254,0.0000024045153],"about_ca_topic_score_codex":0.027708644,"about_ca_topic_score_gemma":0.018242372,"teacher_disagreement_score":0.027708644,"about_ca_system_score_codex":0.0023766896,"about_ca_system_score_gemma":0.002687712,"threshold_uncertainty_score":0.05509472},"labels":[],"label_agreement":null},{"id":"W4378374288","doi":"10.1007/s11081-023-09809-9","title":"Topology optimized infill compliant mechanisms for improved output displacements","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Topology optimization; Compliant mechanism; Topology (electrical circuits); Stiffness; Displacement (psychology); Constraint (computer-aided design); Infill; Volume (thermodynamics); Computer science; Mathematical optimization; Maximization; Control theory (sociology); Mathematics; Structural engineering; Finite element method; Engineering; Geometry","score_opus":0.010769760703897343,"score_gpt":0.22124517242312805,"score_spread":0.2104754117192307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378374288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2876969,0.00033209723,0.6760379,0.0001956404,0.0001768268,0.000056992187,0.00011898044,0.0009299949,0.034454737],"genre_scores_gemma":[0.9179707,0.000082908635,0.07585716,0.000044549106,0.000020600151,0.000053724896,0.00006633734,0.0002230142,0.00568097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987483,0.000022955262,0.0000061041333,0.00001970585,0.000056859324,0.000019515444],"domain_scores_gemma":[0.9997969,0.000057887308,0.00004390876,0.000049556154,0.000037529728,0.000014253524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525091,0.00062401366,0.0004809636,0.00042066284,0.00020539765,0.00063727656,0.00053766544,0.0007266056,0.0060694967],"category_scores_gemma":[0.0007840665,0.0001956327,0.00031848953,0.000275208,0.00036336292,0.00066850416,0.0007836829,0.00043464004,0.00087976345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016728196,0.00019307008,0.0006379242,0.00020475846,0.000046838373,0.00027878053,0.00007590868,0.7219239,0.1560886,0.03861474,0.0013410031,0.08042731],"study_design_scores_gemma":[0.000030073556,0.00024396351,0.0004274078,0.000027403916,0.000020236079,0.00011628868,0.000037069505,0.9625835,0.028229741,0.005693349,0.0025735192,0.000017422843],"about_ca_topic_score_codex":0.00009031414,"about_ca_topic_score_gemma":0.00037882364,"teacher_disagreement_score":0.0060694967,"about_ca_system_score_codex":0.00014839464,"about_ca_system_score_gemma":0.0002647899,"threshold_uncertainty_score":0.02030456},"labels":[],"label_agreement":null},{"id":"W4386579208","doi":"10.1007/s11081-023-09839-3","title":"A taxonomy of constraints in black-box simulation-based optimization","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; American Institute of Mathematics; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Computer science; Taxonomy (biology); Mathematical optimization; Black box; Context (archaeology); Dialog box; Nonlinear programming; Theoretical computer science; Nonlinear system; Artificial intelligence; Mathematics","score_opus":0.07016011307618368,"score_gpt":0.3312541449984584,"score_spread":0.2610940319222747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386579208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001757172,0.0019478058,0.9887107,0.0006564651,0.00007815162,0.0001160497,0.00013464066,0.00015011102,0.0064489213],"genre_scores_gemma":[0.12156752,0.0076746857,0.865186,0.00056018366,0.0002904549,0.0008490097,0.00051217806,0.00026198954,0.0030980126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910836,0.0033597152,0.0009545579,0.0007250123,0.0035298811,0.00034733227],"domain_scores_gemma":[0.98624635,0.009412748,0.00075632863,0.0016684876,0.0015435624,0.00037256908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009375201,0.0022691654,0.0030659502,0.0037763498,0.0018406108,0.0076545333,0.004540953,0.0035490422,0.005108293],"category_scores_gemma":[0.022183266,0.0018750678,0.002476313,0.008156693,0.0049284585,0.009772319,0.0038708725,0.0057029566,0.0010273429],"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.000035481782,0.00006732212,0.00054992957,0.00034736533,0.000048602946,0.00010559617,0.00018115624,0.1088521,0.0005962075,0.8484181,0.0019946364,0.03880344],"study_design_scores_gemma":[0.000018996105,0.000040690964,0.00012011795,0.00029465897,0.000027324562,0.000068697744,0.00006880711,0.4342774,0.00073077827,0.5517504,0.012561517,0.00004065311],"about_ca_topic_score_codex":0.005842694,"about_ca_topic_score_gemma":0.0046198247,"teacher_disagreement_score":0.009375201,"about_ca_system_score_codex":0.0022628382,"about_ca_system_score_gemma":0.0033365027,"threshold_uncertainty_score":0.04958141},"labels":[],"label_agreement":null},{"id":"W4386988712","doi":"10.1007/s11081-023-09836-6","title":"A fast non-monotone line search for stochastic gradient descent","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Stochastic Gradient Optimization Techniques","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 Lethbridge","funders":"","keywords":"Stochastic gradient descent; Monotone polygon; Line search; Descent direction; Convergence (economics); Mathematical optimization; Descent (aeronautics); Mathematics; Line (geometry); Interpolation (computer graphics); Gradient descent; Computer science; Regular polygon; Applied mathematics; Algorithm; Artificial intelligence; Path (computing)","score_opus":0.017242471805317332,"score_gpt":0.2414483519281693,"score_spread":0.22420588012285197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988712","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011739804,0.00013675768,0.99663526,0.00006945786,0.00009985111,0.00006245073,0.000036755948,0.000658,0.0011274845],"genre_scores_gemma":[0.055215374,0.00023028924,0.93668604,0.00016795205,0.00015398205,0.00044823834,0.0002650585,0.00057546404,0.0062576523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.00039599944,0.00005383376,0.00012403882,0.0004839866,0.00006760049],"domain_scores_gemma":[0.9983321,0.00080264633,0.000066725974,0.0001554024,0.0005266748,0.00011650374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001852464,0.0016410775,0.00210767,0.0011439697,0.0006599061,0.001238503,0.0021438287,0.002486402,0.010686087],"category_scores_gemma":[0.004934362,0.0010404092,0.0010633786,0.0011467066,0.00075339194,0.0014745776,0.0020720698,0.002627061,0.004732334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052799075,0.00035191223,0.0004436445,0.0005789629,0.00022352973,0.0002472338,0.000111669666,0.46726987,0.016360488,0.066582926,0.020537453,0.42676437],"study_design_scores_gemma":[0.000029298419,0.000042475756,0.00003798812,0.000008320573,0.000005583351,0.000025420048,0.0000025457566,0.9945427,0.00060773944,0.003082739,0.0016076962,0.000007496894],"about_ca_topic_score_codex":0.0030325297,"about_ca_topic_score_gemma":0.0037799734,"teacher_disagreement_score":0.010686087,"about_ca_system_score_codex":0.00071936054,"about_ca_system_score_gemma":0.0018987057,"threshold_uncertainty_score":0.03574854},"labels":[],"label_agreement":null},{"id":"W4387020807","doi":"10.1007/s11081-023-09846-4","title":"A multi-vendor multi-buyer integrated production-inventory model with greenhouse gas emissions","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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é de Moncton","funders":"","keywords":"Greenhouse gas; Supply chain; Solver; Simulated annealing; Mathematical optimization; Computer science; Integer programming; Vendor; Production (economics); Linear programming; Metaheuristic; Total cost; Supply chain optimization; Nonlinear programming; Operations research; Supply chain management; Nonlinear system; Algorithm; Mathematics; Economics; Business; Microeconomics","score_opus":0.025362698491343216,"score_gpt":0.20997448738862431,"score_spread":0.1846117888972811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387020807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35781306,0.0029966002,0.54974705,0.0038677668,0.0005198322,0.00058641966,0.003607712,0.0010112874,0.07985029],"genre_scores_gemma":[0.9542621,0.00062842213,0.014360959,0.00012330942,0.000054436696,0.00019790177,0.0004466862,0.00009400661,0.029832147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987778,0.0004977646,0.000044163953,0.00026762547,0.0001327759,0.00027988927],"domain_scores_gemma":[0.9979832,0.0012243905,0.00020270934,0.000083914456,0.0002753888,0.00023034032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002203457,0.0019085074,0.0034974674,0.0013129477,0.0013739838,0.0038997666,0.005265021,0.0057949694,0.010373183],"category_scores_gemma":[0.0029465675,0.0026087328,0.0021236704,0.0022462779,0.0019204482,0.0037536123,0.0020439823,0.0024910672,0.0010957927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009419406,0.00006357026,0.00024384825,0.000042049764,0.000027798738,0.00018015326,0.000019638816,0.99319273,0.00021992782,0.0045847916,0.00031172193,0.0010196337],"study_design_scores_gemma":[0.000043551026,0.000047264366,0.00013286855,0.0000073517313,0.00002269303,0.000019315923,0.000020221572,0.9978405,0.00006928792,0.0015843867,0.00019651068,0.000016075632],"about_ca_topic_score_codex":0.028396636,"about_ca_topic_score_gemma":0.017555792,"teacher_disagreement_score":0.028396636,"about_ca_system_score_codex":0.003650776,"about_ca_system_score_gemma":0.0026902424,"threshold_uncertainty_score":0.056462705},"labels":[],"label_agreement":null},{"id":"W4387639549","doi":"10.1007/s11081-023-09856-2","title":"Distributionally robust optimization using optimal transport for Gaussian mixture models","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ambiguity; Robust optimization; Mathematical optimization; Mixture model; Gaussian; Probability distribution; Mathematics; Set (abstract data type); Portfolio; Computer science; Portfolio optimization; Optimization problem; Statistics","score_opus":0.06790315755395122,"score_gpt":0.301513552620018,"score_spread":0.2336103950660668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387639549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005407372,0.0001735162,0.99329466,0.00025765473,0.000033485492,0.000022211598,0.0000382086,0.00013147574,0.00064143445],"genre_scores_gemma":[0.43081897,0.00093571487,0.55601406,0.00036732777,0.00025965765,0.00038223958,0.00071537244,0.0011389365,0.009367716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983302,0.0009215621,0.00008823685,0.00025990405,0.00027697027,0.00012319996],"domain_scores_gemma":[0.9945669,0.0038316494,0.00045495192,0.0003689895,0.00057010254,0.00020743342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059643215,0.0015938164,0.0026250952,0.0020352702,0.0009380793,0.0026039393,0.0019790358,0.0033399628,0.0019564796],"category_scores_gemma":[0.017492428,0.001774839,0.0024993108,0.0014138004,0.0028596828,0.0043045455,0.003915145,0.0031363126,0.00046544216],"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.00009190302,0.000035118443,0.00026973803,0.00007308675,0.00007996019,0.000027907721,0.000040057366,0.89775825,0.00095137913,0.08985037,0.00063943485,0.0101828715],"study_design_scores_gemma":[0.0000038356475,0.000006318958,0.00002474956,0.0000049266328,0.000004251404,0.0000035990436,0.0000026190341,0.97958344,0.00015627964,0.020063547,0.00014033353,0.000006025005],"about_ca_topic_score_codex":0.010451327,"about_ca_topic_score_gemma":0.0059343795,"teacher_disagreement_score":0.010451327,"about_ca_system_score_codex":0.0033374988,"about_ca_system_score_gemma":0.0033406056,"threshold_uncertainty_score":0.03154272},"labels":[],"label_agreement":null},{"id":"W4389674129","doi":"10.1007/s11081-026-10097-2","title":"A multistage stochastic programming approach for short-term scheduling of batch processes under type II endogenous uncertainty","year":2023,"lang":"en","type":"preprint","venue":"Optimization and Engineering","topic":"Process Optimization and Integration","field":"Engineering","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":"Mitacs; Ontario Centre of Innovation","keywords":"Binary number; Computer science; Novelty; Mathematical optimization; Scheduling (production processes); Term (time); Stochastic programming; Mathematics","score_opus":0.04588306683244978,"score_gpt":0.25143629583510346,"score_spread":0.2055532290026537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389674129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015673209,0.00010987959,0.9827346,0.00007764348,0.00001866296,0.000035455345,0.0000362017,0.00004782974,0.0012664269],"genre_scores_gemma":[0.81513673,0.0003188798,0.18090834,0.00006622477,0.000050766506,0.00018021202,0.0001236423,0.00006016835,0.0031550338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.00030110704,0.000027457489,0.0001075838,0.00017952867,0.00009081315],"domain_scores_gemma":[0.9991973,0.00052398856,0.000090916525,0.000029559851,0.00011190604,0.00004643619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015965854,0.00076912285,0.0009547435,0.0004006036,0.00033809541,0.0009570892,0.0010801696,0.00089213136,0.001953509],"category_scores_gemma":[0.0014576343,0.0006357651,0.0012139763,0.0005500585,0.0005436266,0.00069367053,0.0008303481,0.001263543,0.00016994677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018562358,0.000011399862,0.00009894304,0.00002357693,0.000011067581,0.000019964895,0.000010192317,0.9932112,0.0007094968,0.0031189977,0.000055065626,0.0027115939],"study_design_scores_gemma":[0.0000016893204,0.000013696218,0.000026647891,0.0000017444268,0.0000024894425,0.0000021686276,0.000001992327,0.9988965,0.0001716272,0.0007989886,0.00008099614,0.0000015064683],"about_ca_topic_score_codex":0.0055846474,"about_ca_topic_score_gemma":0.0042636325,"teacher_disagreement_score":0.0055846474,"about_ca_system_score_codex":0.00089918036,"about_ca_system_score_gemma":0.0016495498,"threshold_uncertainty_score":0.011104286},"labels":[],"label_agreement":null},{"id":"W4408074130","doi":"10.1007/s11081-024-09952-x","title":"Solar: a solar thermal power plant simulator for blackbox optimization benchmarking","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Photovoltaic System Optimization Techniques","field":"Energy","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":"Hydro-Québec; Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Benchmarking; Computer science; Simulation; Solar simulator; Environmental science; Solar cell; Electrical engineering; Engineering","score_opus":0.005335356697971348,"score_gpt":0.20680359988806385,"score_spread":0.2014682431900925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408074130","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45706972,0.0011208812,0.28008944,0.0012442927,0.00085981353,0.0006092004,0.026198257,0.052138533,0.18066981],"genre_scores_gemma":[0.8773037,0.00032456813,0.09023375,0.0002876949,0.000050944047,0.0004439956,0.008765417,0.006000644,0.016589237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997315,0.00008254649,0.000011874701,0.000033406486,0.00010773796,0.0000329239],"domain_scores_gemma":[0.9993451,0.0003148847,0.000025242733,0.00010554481,0.00017061342,0.000038577225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511763,0.0010416647,0.0007290533,0.00048580693,0.0005127904,0.0006409758,0.0013821431,0.000820525,0.018733023],"category_scores_gemma":[0.0015287829,0.00058011466,0.0005942168,0.00066268194,0.00025990777,0.00095581467,0.00045635767,0.0014401692,0.0020519304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004062565,0.0004480087,0.0020158584,0.00046909982,0.00023175655,0.00013759526,0.000098924465,0.88648874,0.012179963,0.007414703,0.046860397,0.043248694],"study_design_scores_gemma":[0.00012389939,0.000083085,0.00063806324,0.000011509227,0.000019151366,0.000020718586,0.000021736136,0.9821162,0.007307692,0.0016193521,0.008021739,0.000016785143],"about_ca_topic_score_codex":0.0059972536,"about_ca_topic_score_gemma":0.009362238,"teacher_disagreement_score":0.018733023,"about_ca_system_score_codex":0.0005630999,"about_ca_system_score_gemma":0.0010352974,"threshold_uncertainty_score":0.062668204},"labels":[],"label_agreement":null},{"id":"W4410332066","doi":"10.1007/s11081-025-09971-2","title":"Concurrent print orientation and topology optimization for fiber reinforced additive manufacturing considering mass minimization and compliance minimization problems statements","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Additive Manufacturing and 3D Printing Technologies","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Topology optimization; Compliance (psychology); Orientation (vector space); Computer science; Mathematical optimization; Topology (electrical circuits); Mathematics; Engineering; Structural engineering; Finite element method; Geometry; Psychology; Combinatorics","score_opus":0.018194335023465263,"score_gpt":0.2593193543400766,"score_spread":0.24112501931661132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410332066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12101221,0.00013221963,0.8712905,0.0001360152,0.000024940136,0.00007498439,0.000024559284,0.00015207504,0.007152478],"genre_scores_gemma":[0.56359804,0.00009749509,0.43225685,0.00004820331,0.000018425488,0.00014407329,0.000053075048,0.000107083135,0.0036768394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978346,0.000044973254,0.000007701005,0.000038610564,0.000101947786,0.000023340677],"domain_scores_gemma":[0.9996383,0.00018541924,0.00006689265,0.000027215656,0.0000659647,0.00001612085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065615546,0.0006090602,0.0005033161,0.00037814336,0.00033634494,0.0007494603,0.00047406348,0.0007579344,0.0013130952],"category_scores_gemma":[0.0009756283,0.0003799923,0.0005678212,0.00031340393,0.0005190782,0.0004648143,0.00059381005,0.00046328007,0.00019892064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031407555,0.00005699341,0.00072141207,0.00004979737,0.000015018879,0.000056192384,0.000037072878,0.9588449,0.01174179,0.0043053227,0.00019900814,0.023941083],"study_design_scores_gemma":[0.000006633341,0.00003428169,0.000114708826,0.0000028699571,0.0000047386866,0.000013524557,0.000007972392,0.9966515,0.0019953623,0.00082930404,0.0003361723,0.0000030785714],"about_ca_topic_score_codex":0.0018282058,"about_ca_topic_score_gemma":0.0032677972,"teacher_disagreement_score":0.0018282058,"about_ca_system_score_codex":0.00052678527,"about_ca_system_score_gemma":0.0011014888,"threshold_uncertainty_score":0.004392743},"labels":[],"label_agreement":null},{"id":"W4411012885","doi":"10.1007/s11081-025-09982-z","title":"Optimal dynamic commodity liquidation by joint spot and forward contracts","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Western University","funders":"","keywords":"Commodity; Spot contract; Financial engineering; Joint (building); Computer science; Economics; Finance; Futures contract","score_opus":0.007125457320398345,"score_gpt":0.17815357961069817,"score_spread":0.17102812229029982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411012885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44301102,0.0013812851,0.5042546,0.005453716,0.00037071825,0.00014491973,0.00038581813,0.00039737654,0.04460056],"genre_scores_gemma":[0.9660913,0.000320522,0.018852305,0.00010533789,0.00007132774,0.00006621553,0.00009836134,0.00008543524,0.014309281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987374,0.0006170691,0.00006609823,0.0002089981,0.00016242426,0.00020806698],"domain_scores_gemma":[0.9940049,0.004490192,0.0005323003,0.00025081815,0.00032505183,0.00039676137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875206,0.0009979397,0.0023710488,0.000770628,0.0007169706,0.0036916516,0.0011902824,0.003200245,0.006751196],"category_scores_gemma":[0.012351267,0.0017314259,0.0009828714,0.0010269402,0.00272866,0.005253155,0.0019166826,0.00211027,0.00044681513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005367553,0.000102887425,0.00042734182,0.000080029604,0.000040263334,0.00014273408,0.00007905168,0.84588367,0.0015091869,0.14156285,0.0015831324,0.008052068],"study_design_scores_gemma":[0.00010070991,0.00006737926,0.00018706075,0.0000120448085,0.000015984013,0.000021636928,0.00003876867,0.9218785,0.0005222146,0.07644543,0.00069078564,0.000019536079],"about_ca_topic_score_codex":0.0037835122,"about_ca_topic_score_gemma":0.001984503,"teacher_disagreement_score":0.006751196,"about_ca_system_score_codex":0.0023972166,"about_ca_system_score_gemma":0.0029452469,"threshold_uncertainty_score":0.022585034},"labels":[],"label_agreement":null},{"id":"W4413202532","doi":"10.1007/s11081-025-10008-x","title":"Proximal methods for equilibrium problems over the set of fixed points of enriched nonexpansive mappings","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Variational Analysis","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":"Science North","funders":"","keywords":"Set (abstract data type); Fixed point; Mathematics; Computer science; Applied mathematics; Financial engineering; Mathematical optimization; Mathematical analysis; Economics; Finance","score_opus":0.011741232856187132,"score_gpt":0.2752185028452058,"score_spread":0.2634772699890187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413202532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013440823,0.0006952144,0.9817485,0.00032285904,0.000055382043,0.000052436164,0.000039196468,0.000047581398,0.0035978993],"genre_scores_gemma":[0.47412097,0.003295408,0.4828104,0.00032264154,0.0003019656,0.0006642623,0.00032536793,0.00035081393,0.037808184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.0006937994,0.000040034327,0.00013565026,0.00026316935,0.000099453144],"domain_scores_gemma":[0.9964851,0.0025575284,0.00018253764,0.00009649553,0.00044805763,0.00023019114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003872491,0.0015799047,0.0019498438,0.0022322116,0.00075450126,0.0019122945,0.0019378177,0.0017485615,0.0033735007],"category_scores_gemma":[0.010162053,0.000997215,0.0013390948,0.0010969578,0.0023388434,0.0024231179,0.0046540257,0.0033919022,0.00042103007],"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.000117620795,0.00010346939,0.0003283052,0.0002664761,0.000108361695,0.00008637247,0.00022525001,0.22685772,0.0018981117,0.7482419,0.0013361534,0.020430345],"study_design_scores_gemma":[0.000033720014,0.000067070105,0.000115033174,0.000053538777,0.000030536565,0.000029138026,0.000077639765,0.66634166,0.0004599673,0.33069375,0.0020787332,0.00001924437],"about_ca_topic_score_codex":0.0029241072,"about_ca_topic_score_gemma":0.0035100337,"teacher_disagreement_score":0.003872491,"about_ca_system_score_codex":0.001731345,"about_ca_system_score_gemma":0.0022283047,"threshold_uncertainty_score":0.020479918},"labels":[],"label_agreement":null},{"id":"W4414183174","doi":"10.1007/s11081-025-10032-x","title":"Green hydrogen viability in the transition to a fully-renewable energy grid","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Hybrid Renewable Energy Systems","field":"Energy","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":"Group for Research in Decision Analysis","funders":"","keywords":"Renewable energy; Profitability index; Hydrogen; Grid energy storage; Wind power; Investment (military); Grid; Electricity; Electricity generation; Intermittent energy source","score_opus":0.004463893678310726,"score_gpt":0.18560341331613422,"score_spread":0.1811395196378235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414183174","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.8004957,0.0006424784,0.17521349,0.0032948002,0.00012789223,0.000071976785,0.00068931386,0.00014915543,0.0193153],"genre_scores_gemma":[0.9976866,0.0000629392,0.0013685306,0.00004645495,0.0000056887643,0.000008582507,0.0000337221,0.0000066383495,0.00078085397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997346,0.0001263103,0.0000075644584,0.00003997803,0.000036309608,0.00005527706],"domain_scores_gemma":[0.9989473,0.00067135476,0.00013221096,0.000051992218,0.00009333481,0.00010383098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007358869,0.00029459796,0.00043270265,0.0001221323,0.0002317233,0.0012961909,0.00043375077,0.0006788067,0.0029261184],"category_scores_gemma":[0.002119493,0.0001756397,0.00035396937,0.00015567137,0.0005707439,0.0014270432,0.0009177969,0.0009902805,0.00013177081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016077663,0.000041548246,0.0018821915,0.000045980505,0.000031109947,0.00039759523,0.000034452754,0.9374748,0.0010894437,0.052633483,0.0009762022,0.005232403],"study_design_scores_gemma":[0.00002028674,0.000058269365,0.0006491738,0.000010902717,0.000008468716,0.000029667875,0.00008428684,0.9674675,0.00036972552,0.03042545,0.0008670878,0.000009111559],"about_ca_topic_score_codex":0.0033941001,"about_ca_topic_score_gemma":0.0026475277,"teacher_disagreement_score":0.0033941001,"about_ca_system_score_codex":0.0008243898,"about_ca_system_score_gemma":0.0006367684,"threshold_uncertainty_score":0.009788811},"labels":[],"label_agreement":null},{"id":"W4415517558","doi":"10.1007/s11081-025-10044-7","title":"Inverse problems and machine learning","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"","score_opus":0.008059836759119058,"score_gpt":0.18338180466018514,"score_spread":0.17532196790106608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415517558","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010719646,0.15701526,0.6741314,0.018313158,0.0051654894,0.000042979962,0.00019396999,0.0002875979,0.13413045],"genre_scores_gemma":[0.47565335,0.12494443,0.2197362,0.005520701,0.017946241,0.00031254685,0.0005820552,0.00042830317,0.15487628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991679,0.0003398121,0.00004474584,0.000117603144,0.0002982082,0.000031637333],"domain_scores_gemma":[0.9985253,0.0010127316,0.00010257258,0.000166642,0.00015634278,0.000036457066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010865275,0.00086565147,0.0018120016,0.0012591076,0.0005810626,0.0026478563,0.0008157052,0.0022317413,0.007023246],"category_scores_gemma":[0.004741094,0.0004092394,0.0007353678,0.0014914059,0.00432346,0.0031755194,0.0016573683,0.0034139582,0.0017390224],"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.000009653941,0.000018756731,0.00014232965,0.00036961152,0.000033013595,0.000048478043,0.00011928003,0.00979601,0.00034055632,0.93490064,0.009434474,0.044787277],"study_design_scores_gemma":[0.0000037045118,0.0000075831936,0.00008449598,0.000051586765,0.000006493714,0.00007346628,0.000027043958,0.0097976485,0.00010640339,0.9694177,0.02041744,0.000006403118],"about_ca_topic_score_codex":0.0008915102,"about_ca_topic_score_gemma":0.0006224378,"teacher_disagreement_score":0.007023246,"about_ca_system_score_codex":0.0006951867,"about_ca_system_score_gemma":0.0006094992,"threshold_uncertainty_score":0.023495078},"labels":[],"label_agreement":null},{"id":"W4416933128","doi":"10.1007/s11081-025-10031-y","title":"Scheduling of Drilling Machines in Open-Pit Mines: Stochastic and Non-Probabilistic CP Approaches","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Drill; Constraint programming; Drilling; Constraint (computer-aided design); Stochastic programming; Representation (politics); Job shop scheduling","score_opus":0.014852991557567348,"score_gpt":0.2066839415045628,"score_spread":0.19183094994699545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416933128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043938655,0.00083299016,0.9499535,0.00085368456,0.00014034995,0.00013496229,0.00039399223,0.00019175533,0.003560172],"genre_scores_gemma":[0.8154035,0.0011963642,0.1765474,0.00022872501,0.00038164938,0.00032167815,0.00065626745,0.00025236362,0.0050121243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764365,0.0010914175,0.00013797526,0.00040381256,0.00038207567,0.00034100586],"domain_scores_gemma":[0.9830193,0.0139569165,0.0011633182,0.00043825505,0.0008198207,0.0006024054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006096155,0.0010979469,0.0028968265,0.0014039677,0.00089586567,0.0024514182,0.004253367,0.0023525916,0.00403639],"category_scores_gemma":[0.016349282,0.0019872151,0.0022384205,0.0024906867,0.0013701532,0.0035603398,0.0016727973,0.0021486445,0.00027860756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062884705,0.000033890283,0.00024860044,0.00008027879,0.000030985906,0.000020732703,0.000020899777,0.98527235,0.00011189624,0.008693239,0.00037231136,0.005051979],"study_design_scores_gemma":[0.0000057011976,0.000010969033,0.00008650767,0.000003486515,0.0000059700587,0.0000036699075,0.000007388058,0.9939839,0.000032515145,0.0057573942,0.000100006335,0.0000026082948],"about_ca_topic_score_codex":0.018225675,"about_ca_topic_score_gemma":0.015788754,"teacher_disagreement_score":0.018225675,"about_ca_system_score_codex":0.00223638,"about_ca_system_score_gemma":0.0036665173,"threshold_uncertainty_score":0.036239147},"labels":[],"label_agreement":null},{"id":"W79965191","doi":"10.1023/a:1015354615402","title":"Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization","year":2001,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Nuclear reactor physics and engineering","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematical optimization; Integer (computer science); Heuristic; Nonlinear system; Nonlinear programming; Extension (predicate logic); Computer science; Optimization problem; Power (physics); Algorithm; Mathematics; Physics","score_opus":0.008267538046388766,"score_gpt":0.18145525879331498,"score_spread":0.1731877207469262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79965191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065367386,0.00066242827,0.9236395,0.00024133953,0.00012747668,0.00009001273,0.000073730866,0.0004960956,0.009302109],"genre_scores_gemma":[0.7504321,0.00033985465,0.23995256,0.00012655239,0.000058445705,0.00020723668,0.00012791636,0.00024660732,0.008508789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998004,0.00007567716,0.000008203009,0.000035699974,0.00004614939,0.000033875338],"domain_scores_gemma":[0.9994979,0.0003325209,0.000060851045,0.000029922685,0.000056596273,0.000022156846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075144996,0.0009912787,0.0010397789,0.0004873205,0.00047997275,0.0009184452,0.0008524123,0.0009137165,0.0031309356],"category_scores_gemma":[0.0016335191,0.0006768291,0.000632333,0.0005396118,0.0005515921,0.0012645448,0.00084302906,0.0009031145,0.00030884793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049914743,0.000017253085,0.00007183399,0.000028224647,0.000009033355,0.000016817277,0.000009832058,0.9880728,0.0006877011,0.0014583318,0.00020725087,0.009370939],"study_design_scores_gemma":[0.0000074842087,0.000020688698,0.000012408466,0.0000026692742,0.0000033681988,0.0000031329414,0.0000054222487,0.9984811,0.0004100087,0.0008573285,0.00019448501,0.0000018956368],"about_ca_topic_score_codex":0.0035966707,"about_ca_topic_score_gemma":0.0036460524,"teacher_disagreement_score":0.0035966707,"about_ca_system_score_codex":0.00062524836,"about_ca_system_score_gemma":0.0006781297,"threshold_uncertainty_score":0.010474026},"labels":[],"label_agreement":null},{"id":"W809203089","doi":"10.1007/s11081-015-9305-y","title":"Creating annual delivery programs of liquefied natural gas","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Liquefied natural gas; Integer programming; Revenue; Operations research; Fleet management; Schedule; Linear programming; Computer science; Time horizon; Scheduling (production processes); Port (circuit theory); Procurement; Supply chain; Natural gas; Business; Operations management; Finance; Engineering; Waste management; Marketing","score_opus":0.005837351310503501,"score_gpt":0.17980604582758322,"score_spread":0.17396869451707972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W809203089","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.8423155,0.00008357141,0.11766319,0.00077455404,0.00013510084,0.0014208956,0.00066846836,0.0044075535,0.032531217],"genre_scores_gemma":[0.8459503,0.00015046058,0.13988526,0.00010440443,0.000023950213,0.0004866041,0.0011484481,0.00026027096,0.011990433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922466,0.00023301406,0.000030905503,0.000110060595,0.0001745879,0.00022674145],"domain_scores_gemma":[0.9978278,0.00057784125,0.00028211463,0.00020682075,0.00067087036,0.00043444053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023739336,0.0003205619,0.00019699015,0.0010056731,0.00094135775,0.0012884598,0.0008981905,0.0005141319,0.007560515],"category_scores_gemma":[0.0052522225,0.000411612,0.00029152568,0.000696096,0.00021140851,0.0012799486,0.0011171023,0.0006769432,0.0007935816],"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.0006924105,0.00522726,0.032240633,0.00026659924,0.0000691065,0.00033968897,0.0010528625,0.3607515,0.017115016,0.018594464,0.024626976,0.53902346],"study_design_scores_gemma":[0.00032845803,0.0024739534,0.02450955,0.00007270122,0.00011220651,0.00012710434,0.0041673738,0.8755154,0.028559549,0.006544758,0.05751098,0.00007795746],"about_ca_topic_score_codex":0.01183234,"about_ca_topic_score_gemma":0.02133389,"teacher_disagreement_score":0.01183234,"about_ca_system_score_codex":0.003083635,"about_ca_system_score_gemma":0.006568315,"threshold_uncertainty_score":0.025292456},"labels":[],"label_agreement":null}]}