{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":73,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":73,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c1ca6edec225","filters":{"venue":"Computational Optimization and Applications"}},"results":[{"id":"W2057565823","doi":"10.1007/s10589-014-9687-3","title":"CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Modular design; Fortran; MATLAB; Computer science; Parallel computing; Programming language; Algorithm; Computational science","retraction":null,"screen_n_in":null,"score":{"opus":0.01743859568940361,"gpt":0.2496138020627257,"spread":0.232175206373322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002278315,0.0001422351,0.0001657081,0.00006739121,0.0002976016,0.0001566123,0.0001247299,0.00004314507,0.00001264515],"category_scores_gemma":[0.00007735191,0.0001227383,0.00001925744,0.0002538067,0.0001786225,0.000185251,0.00005519024,0.00005339763,0.000002043549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001493944,"about_ca_system_score_gemma":0.00004162721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.467487e-7,"about_ca_topic_score_gemma":5.634182e-8,"domain_scores_codex":[0.9990316,0.00004239786,0.0002506566,0.0003742971,0.0001535695,0.0001474848],"domain_scores_gemma":[0.9985637,0.0008856084,0.0001295842,0.0001503661,0.0001369522,0.0001338043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001973115,0.00003987648,0.00003352333,0.0000142035,0.000007490838,8.165313e-8,0.00002558884,0.7137554,0.000006847935,0.2377837,0.000004803316,0.0483265],"study_design_scores_gemma":[0.0005838379,0.0001052306,0.00008136865,0.00001527076,0.00001559477,0.00003335117,0.0000144897,0.9477512,0.000007793799,0.05085985,0.0003771581,0.0001549184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002474706,0.00002202305,0.997069,0.001342326,0.00001041315,0.0006106826,0.00001133601,0.00009477358,0.0008147079],"genre_scores_gemma":[0.01233983,0.000007141648,0.9869112,0.0003077231,0.00004826835,0.0002890716,0.0000555323,0.00001208025,0.00002916018],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2339958,"threshold_uncertainty_score":0.5005125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041781650","doi":"10.1007/s10589-007-9126-9","title":"Algorithm for cardinality-constrained quadratic optimization","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":255,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic programming; Cardinality (data modeling); Mathematical optimization; Solver; Selection (genetic algorithm); Branch and bound; Quadratic equation; Optimization problem; Integer programming; Limit (mathematics); Integer (computer science); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04823591415135936,"gpt":0.3753824978427202,"spread":0.3271465836913608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990587,0.0002012985,0.0002762295,0.0004335996,0.0006297922,0.000336089,0.0002614763,0.0001262517,0.0001200774],"category_scores_gemma":[0.0003112982,0.0001901526,0.0001128534,0.00119265,0.0001657432,0.0004233154,0.0000451614,0.00008535473,0.00002060676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004758851,"about_ca_system_score_gemma":0.000123681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005282716,"about_ca_topic_score_gemma":0.000002931895,"domain_scores_codex":[0.9974298,0.0000734539,0.0009779282,0.000586645,0.0006660718,0.0002660671],"domain_scores_gemma":[0.9963371,0.001402325,0.0004204691,0.0002986164,0.001328769,0.0002127837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008707399,0.00005032348,0.0002015766,0.000002398249,0.00001356594,2.585179e-7,0.00007260362,0.8306187,0.00000180233,0.02335734,0.0003326985,0.14534],"study_design_scores_gemma":[0.0006421173,0.000036351,0.0004363952,0.000004355396,0.00003042093,0.00001557337,0.0003195394,0.9633324,0.00001321632,0.02470819,0.01024663,0.0002148782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007344229,0.0001152636,0.9947697,0.0006580824,0.0001250182,0.001177746,0.0001028332,0.000113657,0.002864277],"genre_scores_gemma":[0.03300549,0.00008711335,0.9644405,0.0004759874,0.0002678416,0.0002277206,0.0009003656,0.00002704609,0.0005678891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1451251,"threshold_uncertainty_score":0.7754198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007103412","doi":"10.1007/s10589-005-4612-4","title":"A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematics; Trust region; Quadratic equation; Nonlinear system; Constraint (computer-aided design); Mathematical optimization; Sequential quadratic programming; Nonlinear programming; Algorithm; Type (biology); Software; Quadratic programming; Applied mathematics; Computer science; Optimization problem; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02269682176659438,"gpt":0.3136590209992671,"spread":0.2909621992326727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883023,0.0001908077,0.000193475,0.0002322733,0.000549312,0.0003230747,0.0002441031,0.00007802529,0.00001735789],"category_scores_gemma":[0.00003433726,0.0001961279,0.00006510773,0.0006579894,0.00008405258,0.0006057269,0.0001010208,0.00007190475,0.000005810039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004146508,"about_ca_system_score_gemma":0.0001015784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003914052,"about_ca_topic_score_gemma":8.24862e-7,"domain_scores_codex":[0.9984871,0.00004771197,0.0004260557,0.0005788027,0.0002700255,0.0001903214],"domain_scores_gemma":[0.9985294,0.0003438002,0.0002040061,0.0001752805,0.0005757013,0.0001717847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002282665,0.00008646874,0.0000397227,0.000006688962,0.0000185506,1.050078e-7,0.0002141726,0.7109828,6.490363e-7,0.1064991,0.00009124312,0.1820582],"study_design_scores_gemma":[0.0006589281,0.00002804771,0.000271328,0.000005504466,0.0000217433,0.00003249296,0.00004098362,0.9647809,0.000006624455,0.009333102,0.02459712,0.0002232679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001582318,0.0001094606,0.9936247,0.005200491,0.00002632914,0.0007257902,0.00003796552,0.0001683814,0.00009103909],"genre_scores_gemma":[0.003621142,0.000037449,0.9936104,0.001239926,0.0001532163,0.0006351703,0.0004796462,0.00001588677,0.0002071426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2537981,"threshold_uncertainty_score":0.7997863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2345492474","doi":"10.1007/s10589-016-9847-8","title":"On handling indicator constraints in mixed integer programming","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Integer programming; Context (archaeology); Mathematics; Mathematical optimization; Class (philosophy); Exploit; Integer (computer science); Block (permutation group theory); Linear programming; Upper and lower bounds; Nonlinear programming; IBM; Nonlinear system; Computer science; Artificial intelligence; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03306497820491706,"gpt":0.3459025252715653,"spread":0.3128375470666483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002148054,0.0001288605,0.0001462705,0.000285695,0.0001475739,0.00004686991,0.0001101839,0.00006795514,0.0002188541],"category_scores_gemma":[0.0003279097,0.000103455,0.00002622433,0.0003866524,0.0002080773,0.0001398698,0.00004415666,0.0001020824,0.00003136487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008560547,"about_ca_system_score_gemma":0.00007377089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.544719e-7,"about_ca_topic_score_gemma":0.000002051144,"domain_scores_codex":[0.9988411,0.00005596606,0.0003444257,0.0003183093,0.0002521602,0.000188039],"domain_scores_gemma":[0.9983525,0.001108402,0.0001262045,0.0001415627,0.0001639288,0.0001074302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001349128,0.0002015905,0.0002665833,0.00001827725,0.00001302839,0.000001102637,0.0000791522,0.5523328,0.00001420858,0.360581,0.0001066286,0.08637206],"study_design_scores_gemma":[0.002540103,0.00006055827,0.0005121885,0.0001596178,0.00001146962,0.0000149785,0.0001580163,0.7599111,0.00008266255,0.234542,0.001621265,0.0003860102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005907861,0.00001810055,0.9971275,0.0008571249,0.00002019636,0.00068807,0.00002041238,0.00009849873,0.000579341],"genre_scores_gemma":[0.3431274,0.00003874454,0.655776,0.0001495384,0.00004448863,0.000547043,0.00006393085,0.00003317403,0.0002197005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3425366,"threshold_uncertainty_score":0.4218774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W356322785","doi":"10.1007/s10589-015-9762-4","title":"A proximal bundle method for nonsmooth nonconvex functions with inexact information","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Subgradient method; Mathematics; Convergence (economics); Mathematical optimization; Bounded function; Bundle; Limit (mathematics); Class (philosophy); Function (biology); Applied mathematics; Point (geometry); Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01549061829371792,"gpt":0.2657578315025077,"spread":0.2502672132087898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873833,0.0001588872,0.0001627129,0.000281351,0.0003535228,0.0003505687,0.0002269304,0.00006242034,0.00002005541],"category_scores_gemma":[0.00005084899,0.0001430216,0.00004781988,0.000979007,0.00004285613,0.001438386,0.00006301043,0.00006963532,0.00002828441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006275027,"about_ca_system_score_gemma":0.0003297486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000109965,"about_ca_topic_score_gemma":0.000003084488,"domain_scores_codex":[0.9988315,0.00004589641,0.0003506853,0.0003052941,0.0003098356,0.0001567841],"domain_scores_gemma":[0.9979424,0.0001979943,0.0002236079,0.0002147782,0.001216237,0.0002049962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001232681,0.00008457743,0.00006947951,0.00000822255,0.00003413859,2.818894e-8,0.0001556109,0.8313537,4.948297e-7,0.1626314,0.0007790902,0.004870868],"study_design_scores_gemma":[0.0008500529,0.0001109821,0.0001392472,0.000004559734,0.00003938572,0.00001551222,0.00007937034,0.9613622,0.000004991946,0.005478222,0.03172737,0.0001881123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006519393,0.00002988158,0.9933828,0.003718014,0.00003891969,0.0008051996,0.00004990441,0.000194229,0.001774549],"genre_scores_gemma":[0.008941777,0.000005894637,0.9876599,0.001161264,0.00007545196,0.0008130578,0.001008505,0.00001144668,0.0003226992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1571532,"threshold_uncertainty_score":0.5832253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2780752111","doi":"10.1007/s10589-020-00220-z","title":"Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods","year":2020,"lang":"en","type":"preprint","venue":"Computational Optimization and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Iterated function; Stochastic gradient descent; Momentum (technical analysis); Mathematics; Rate of convergence; Stochastic optimization; Applied mathematics; Ball (mathematics); Stochastic approximation; Mathematical optimization; Mathematical analysis; Computer science; Finance; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.03332620874769687,"gpt":0.320718223472419,"spread":0.2873920147247221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003620624,0.0004925378,0.0004996904,0.0003805032,0.000475334,0.0005623339,0.0004602045,0.0002034921,0.00000562027],"category_scores_gemma":[0.0001580089,0.0005460698,0.00008144038,0.0004554356,0.0002414873,0.0002888184,0.001053603,0.0003058405,0.00000127569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001167825,"about_ca_system_score_gemma":0.0001922975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006048494,"about_ca_topic_score_gemma":5.745082e-7,"domain_scores_codex":[0.9972152,0.0001078194,0.0006642455,0.001344549,0.0003243297,0.0003439032],"domain_scores_gemma":[0.9975739,0.0005624979,0.0005161942,0.0004285396,0.0005126555,0.0004062199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000112693,0.00008090597,0.000005514848,0.000135982,0.00005134111,2.324287e-7,0.0004054868,0.7572226,0.00001757167,0.2392433,0.0003476399,0.002478132],"study_design_scores_gemma":[0.0006245241,0.0001027439,0.0000784949,0.00007145156,0.00008461512,0.0000216245,0.00004485656,0.8596759,0.00001999902,0.1386963,0.0001515014,0.0004279684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004345071,0.0006967129,0.9871101,0.007204269,0.0001590684,0.004181574,0.0001172377,0.0004604736,0.00002710493],"genre_scores_gemma":[0.02749291,0.00009651434,0.9682357,0.0003606078,0.0001050328,0.003052742,0.000546478,0.00005614126,0.00005382013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1024533,"threshold_uncertainty_score":0.9996991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077594413","doi":"10.1007/s10589-009-9266-1","title":"Globalization strategies for Mesh Adaptive Direct Search","year":2009,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; Class (philosophy); Process (computing); Mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02424952915862908,"gpt":0.3052450481327324,"spread":0.2809955189741033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009861613,0.00009995975,0.00009986845,0.00008639538,0.000130216,0.00009243458,0.00005995953,0.00004957028,0.00001186922],"category_scores_gemma":[0.000008766185,0.0001099598,0.00002816483,0.000268381,0.00001928874,0.0001808526,0.000004990065,0.00004243307,0.000002311472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002879144,"about_ca_system_score_gemma":0.00002531263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.512143e-7,"about_ca_topic_score_gemma":1.822682e-7,"domain_scores_codex":[0.999454,0.00001611342,0.0001707893,0.0001442355,0.0001055025,0.0001093141],"domain_scores_gemma":[0.9995566,0.0001178463,0.00001920069,0.00008017587,0.0001645358,0.00006166785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003355404,0.00001101079,0.000006293997,0.00001134084,0.0000088998,3.247294e-8,0.0000478289,0.9006236,0.00001456341,0.09586689,0.0002060588,0.003200083],"study_design_scores_gemma":[0.0002841504,0.00002376061,0.0002910166,0.000005736082,0.000008195443,0.00000111973,0.00005099551,0.9861826,0.00002248469,0.01137116,0.001642748,0.0001159806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003463943,0.0001712293,0.9939429,0.0001187433,0.00002804922,0.0004271711,0.0000295946,0.0003199798,0.004615905],"genre_scores_gemma":[0.5509487,0.00005574052,0.4484031,0.00006542789,0.00007773748,0.000108284,0.0002740475,0.00001412706,0.00005273373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5506024,"threshold_uncertainty_score":0.448403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011612932","doi":"10.1007/s10589-007-9122-0","title":"Benders, metric and cutset inequalities for multicommodity capacitated network design","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Metric (unit); Inequality; Context (archaeology); Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05912473236486449,"gpt":0.325472630503332,"spread":0.2663478981384675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740533,0.0001032888,0.0001124416,0.0001995914,0.0004882599,0.0001143012,0.0001861832,0.00004544754,0.000003500137],"category_scores_gemma":[0.00007432684,0.0001079191,0.00002159564,0.0007825475,0.0001219166,0.0002875175,0.0000852091,0.00007064681,0.000001376354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002523447,"about_ca_system_score_gemma":0.00003793839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002184271,"about_ca_topic_score_gemma":0.000001312466,"domain_scores_codex":[0.9990135,0.00006416972,0.0002344929,0.0002909417,0.0001603103,0.0002365302],"domain_scores_gemma":[0.9976827,0.001666393,0.00008915295,0.000152805,0.0002895862,0.0001193759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006007164,0.00001864842,0.00006685432,0.000006878247,0.000007513501,9.597518e-8,0.00007989999,0.5980319,0.000002156014,0.3968876,0.0001266663,0.004765736],"study_design_scores_gemma":[0.000353128,0.00002864469,0.0005659748,0.000003452153,0.00000466745,0.000004915746,0.00005425722,0.8306463,0.00001781917,0.1674563,0.0007576018,0.0001068873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000837051,0.0002335916,0.9982721,0.0003982501,0.00002492734,0.0007561215,0.00001964293,0.0001058599,0.000105765],"genre_scores_gemma":[0.1313802,0.00003307733,0.867995,0.0002261881,0.00004722508,0.0001572078,0.0001066358,0.000008962958,0.00004546383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2326144,"threshold_uncertainty_score":0.4400813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067314231","doi":"10.1007/s10589-013-9635-7","title":"The generalized trust region subproblem","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Trust region; Bounded function; Parameterized complexity; Quadratic equation; Eigenvalues and eigenvectors; Constraint (computer-aided design); Combinatorics; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009774008977502658,"gpt":0.2310685406414498,"spread":0.2212945316639472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002160661,0.00007711205,0.00006493195,0.00003837816,0.0007037568,0.0002362655,0.0003012962,0.00002791493,0.000005278581],"category_scores_gemma":[0.00001716311,0.00005894055,0.00002583043,0.0002784483,0.00007159749,0.0001646265,0.00006925828,0.00005019542,0.00001481791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009648343,"about_ca_system_score_gemma":0.00002336544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.854808e-7,"about_ca_topic_score_gemma":3.004226e-7,"domain_scores_codex":[0.9993157,0.00007284654,0.0001744927,0.000211247,0.0001198055,0.0001059003],"domain_scores_gemma":[0.9992659,0.0002399829,0.00008703781,0.0002269033,0.0001172785,0.00006287664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.111299e-7,0.000008151707,0.00001285784,0.000001489899,0.000002283523,3.76642e-8,0.00001661145,0.3700061,8.724363e-7,0.6097662,0.0001976103,0.019987],"study_design_scores_gemma":[0.0001755832,0.000008175892,0.0001061336,0.000001733841,0.000002448275,0.00001004434,0.000004490319,0.817763,0.000006406142,0.1398675,0.04198705,0.00006742018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005592054,0.00008959951,0.9937012,0.003515409,0.0000457496,0.0002122246,9.767217e-7,0.0001180491,0.002260932],"genre_scores_gemma":[0.1773278,0.0002005235,0.8185669,0.001575556,0.0002923164,0.000376208,0.0000801346,0.00001739251,0.001563246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4698988,"threshold_uncertainty_score":0.54128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964916956","doi":"10.1007/s10589-012-9480-0","title":"Strong duality and minimal representations for cone optimization","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Second-order cone programming; Strong duality; Duality (order theory); Mathematics; Complementarity (molecular biology); Mathematical optimization; Conic optimization; Interior point method; Weak duality; Duality gap; Cone (formal languages); Linear programming; Linear complementarity problem; Preprocessor; Complementarity theory; Semidefinite programming; Wolfe duality; Optimization problem; Algorithm; Discrete mathematics; Convex optimization; Computer science; Convex analysis; Nonlinear system; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08166275618822488,"gpt":0.4123049513317906,"spread":0.3306421951435657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562793,0.0001765682,0.0002004598,0.0001655286,0.000542738,0.0001009419,0.00008910635,0.00008962782,0.0001157098],"category_scores_gemma":[0.0003304138,0.0001933436,0.00004044565,0.0003665897,0.0001790415,0.0005480417,0.00007766639,0.00009693805,0.000003284146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000498548,"about_ca_system_score_gemma":0.00005420281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001979896,"about_ca_topic_score_gemma":6.578516e-7,"domain_scores_codex":[0.9985927,0.00007403491,0.0004463624,0.0003427954,0.0002582129,0.0002858674],"domain_scores_gemma":[0.9978057,0.001039947,0.000206673,0.0001922238,0.0005200482,0.000235402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001164274,0.0001299965,0.0003655537,0.00005169181,0.00001880862,3.859481e-8,0.000152161,0.776034,0.000003791635,0.2216693,0.0003308926,0.001232116],"study_design_scores_gemma":[0.000910181,0.00002397487,0.0004033731,0.000009218244,0.00004544483,0.00001330899,0.0002990612,0.9798628,0.00001785408,0.01705299,0.001144048,0.0002177219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000228979,0.0001862237,0.9960946,0.0008065303,0.00003918543,0.001498668,0.0001508072,0.0001360933,0.0008588812],"genre_scores_gemma":[0.03397584,0.00009443433,0.9634091,0.0001356558,0.0001908967,0.0009706763,0.0007519138,0.00004213939,0.0004293688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2046163,"threshold_uncertainty_score":0.7884323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061568192","doi":"10.1007/s10589-011-9432-0","title":"An exact method with variable fixing for solving the generalized assignment problem","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Mathematical optimization; Simple (philosophy); Variable (mathematics); Weapon target assignment problem; Generalized assignment problem; Sequence (biology); Branch and cut; Branch and bound; Optimization problem; Augmented Lagrangian method; Lagrangian relaxation; Linear programming","retraction":null,"screen_n_in":null,"score":{"opus":0.02552492942574305,"gpt":0.2797806794497151,"spread":0.254255750023972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390677,0.0001340604,0.0001169621,0.00006275239,0.000369091,0.0000908328,0.0001302843,0.00004866897,0.0000619299],"category_scores_gemma":[0.000009234234,0.0001076803,0.00002056484,0.0002903579,0.00003607466,0.000191518,0.00001456035,0.00007042364,0.000001183719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000338805,"about_ca_system_score_gemma":0.00003690032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004400749,"about_ca_topic_score_gemma":6.80802e-7,"domain_scores_codex":[0.9992174,0.0000539873,0.0002388914,0.0002193345,0.0001179609,0.0001524586],"domain_scores_gemma":[0.999283,0.0002175671,0.00007679855,0.0001689271,0.000178534,0.00007513295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000583642,0.00002977801,0.00006755001,0.00001961432,0.00002921499,4.047954e-8,0.0003139293,0.960906,0.00009433165,0.03564287,0.00006087504,0.00282992],"study_design_scores_gemma":[0.0003943174,0.00002879072,0.0001332388,0.000009523391,0.00003712344,0.000006802486,0.00007133238,0.9933882,0.0001657768,0.004674435,0.0009377992,0.0001526484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008342813,0.00004470912,0.9971061,0.00008314512,0.00002064777,0.0008811718,0.00001709723,0.0002613817,0.001502307],"genre_scores_gemma":[0.02354537,0.00001253173,0.9751324,0.0001508518,0.0000589451,0.0008561236,0.0001619815,0.00004131971,0.00004044857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03248217,"threshold_uncertainty_score":0.4391075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145896656","doi":"10.1007/s10589-013-9547-6","title":"A derivative-free approximate gradient sampling algorithm for finite minimax problems","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Line search; Minimax; Proximal Gradient Methods; Gradient descent; Gradient method; Stationary point; Directional derivative; Subderivative; Function (biology); Simplex; Descent direction; Mathematical optimization; Applied mathematics; Convergence (economics); Algorithm; Mathematical analysis; Convex function; Combinatorics; Convex optimization; Regular polygon; Geometry; RADIUS; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06588151631744103,"gpt":0.3432997407118499,"spread":0.2774182243944088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001838594,0.0002126698,0.0002275384,0.0002008246,0.0004880342,0.0001783803,0.0002476233,0.00008095853,0.0001511155],"category_scores_gemma":[0.0003012079,0.0002159019,0.00006159822,0.0005055596,0.0001376976,0.0003329583,0.0001257211,0.0001133126,0.00001559553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006403444,"about_ca_system_score_gemma":0.00006504853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003103951,"about_ca_topic_score_gemma":6.587551e-7,"domain_scores_codex":[0.9984316,0.00003973916,0.0004927842,0.0004465431,0.0002938352,0.0002954634],"domain_scores_gemma":[0.997183,0.001181594,0.0002277312,0.000297443,0.0009383827,0.0001718071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002272397,0.000146931,0.00001280702,0.00006767759,0.00003054473,5.87246e-8,0.000150136,0.9034006,0.000007811922,0.06301945,0.000673446,0.03248828],"study_design_scores_gemma":[0.0007338643,0.00002768086,0.00003021342,0.00001618038,0.00001307993,0.000004065199,0.00008892521,0.7446274,0.00001178186,0.2525297,0.001738565,0.0001785777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003297755,0.00007112358,0.9949391,0.0009620431,0.00002554289,0.003247157,0.0001392612,0.0001933651,0.0003894177],"genre_scores_gemma":[0.00064205,0.00005398237,0.9927946,0.0001963676,0.00009200583,0.005120901,0.0005945203,0.00005505732,0.0004504616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1895102,"threshold_uncertainty_score":0.8804225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975786171","doi":"10.1007/s10589-013-9627-7","title":"A smoothing augmented Lagrangian method for solving simple bilevel programs","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Augmented Lagrangian method; Karush–Kuhn–Tucker conditions; Mathematical optimization; Smoothing; Mathematics; Bilevel optimization; Simple (philosophy); Lagrangian relaxation; Penalty method; Optimization problem; Limit point; Bounded function; Constraint (computer-aided design); Bellman equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01853808127030524,"gpt":0.2848250680887153,"spread":0.26628698681841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043166,0.0001489928,0.0001566662,0.0001978227,0.0005121161,0.0005056267,0.0002814719,0.00006109089,0.00008706852],"category_scores_gemma":[0.00003548455,0.000147482,0.00007862408,0.0007608918,0.00003009268,0.0006501033,0.00008703266,0.00005863237,0.00002297539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003530965,"about_ca_system_score_gemma":0.00007044007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003038403,"about_ca_topic_score_gemma":0.000002461429,"domain_scores_codex":[0.9987726,0.00003605639,0.0003589894,0.0004256126,0.0002144761,0.000192228],"domain_scores_gemma":[0.9985567,0.0002751685,0.0001787461,0.0001991607,0.0006526631,0.0001375633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.927476e-7,0.00007211683,0.00006962502,0.00001078981,0.00002909126,3.125361e-8,0.00009693053,0.7628666,0.00001782865,0.1931648,0.0003588366,0.04331253],"study_design_scores_gemma":[0.0003991554,0.00001847527,0.0004268214,0.000005558653,0.00001901746,0.000003405014,0.00003402575,0.9548444,0.0000113986,0.04056626,0.003499894,0.0001715548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001745904,0.0000371153,0.9943055,0.003889741,0.00002626787,0.001125374,0.00001236668,0.0002240095,0.0003621865],"genre_scores_gemma":[0.02260544,0.00001026117,0.9739094,0.001175269,0.00006382598,0.001345203,0.0006472269,0.00001515762,0.0002282159],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1919778,"threshold_uncertainty_score":0.6014141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162835374","doi":"10.1007/s10589-009-9254-5","title":"Maximum utility product pricing models and algorithms based on reservation price","year":2009,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Reservation; Revenue management; Product (mathematics); Mathematical optimization; Key (lock); Integer programming; Yield management; Revenue; Computer science; Operations research; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0342869080749606,"gpt":0.2498093430595267,"spread":0.2155224349845661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447459,0.0001288646,0.0001052508,0.0002112908,0.0003316441,0.000218563,0.00008563999,0.00002991436,0.00004775992],"category_scores_gemma":[0.00002743617,0.0001309854,0.00002151289,0.0004560087,0.00004103017,0.0006195351,0.0000363462,0.00006524843,0.000009701975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002243192,"about_ca_system_score_gemma":0.00001600177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009095116,"about_ca_topic_score_gemma":5.952782e-7,"domain_scores_codex":[0.9990587,0.00001139173,0.0002228085,0.0003550671,0.0002264098,0.0001256145],"domain_scores_gemma":[0.9994417,0.00004509048,0.0001318508,0.0001565145,0.0002039675,0.00002091643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001027398,0.0001091762,0.0002348252,0.00003304347,0.000003670092,1.643047e-7,0.0000129311,0.8914308,0.00000211634,0.0910784,0.0008956545,0.01618898],"study_design_scores_gemma":[0.0003511419,0.00001066631,0.005749878,0.00001507418,0.00001306266,3.554042e-7,0.00002671975,0.9401863,0.000001841726,0.04329095,0.01022364,0.0001303519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007438726,0.00004635943,0.9759058,0.006486978,0.00003378451,0.0007483073,0.000003349111,0.0001354003,0.01589609],"genre_scores_gemma":[0.944758,0.00001891383,0.04507528,0.008994048,0.000373177,0.0001336929,0.0004931881,0.00001642015,0.0001373086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9440141,"threshold_uncertainty_score":0.5341431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W185892825","doi":"10.1023/a:1021806200854","title":"Portfolio Selection and Transactions Costs","year":2003,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Portfolio; Mathematics; Upper and lower bounds; Selection (genetic algorithm); Asset (computer security); Mathematical optimization; Covariance matrix; Econometrics; Finance; Statistics; Economics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03015802347876397,"gpt":0.3293895960633568,"spread":0.2992315725845928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005177751,0.0001338152,0.0001548744,0.0003107745,0.0005549037,0.0002716608,0.00009078732,0.00007911523,0.0004658746],"category_scores_gemma":[0.0001237149,0.0001263123,0.00003828398,0.001065628,0.00008793553,0.0003846638,0.000009285953,0.00009000961,0.00003125069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003138891,"about_ca_system_score_gemma":0.00008530689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005996953,"about_ca_topic_score_gemma":0.000005222949,"domain_scores_codex":[0.9984401,0.0001127244,0.0004665946,0.0004255161,0.0004176443,0.0001373902],"domain_scores_gemma":[0.9986651,0.0003658479,0.0001857472,0.0001461724,0.0004752374,0.0001619029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003125868,0.0000427044,0.001307695,0.000001005399,0.000007805085,1.291765e-7,0.00004497928,0.8722714,0.00000553307,0.1050076,0.0003470622,0.02096095],"study_design_scores_gemma":[0.000514026,0.00003027865,0.003011428,0.00000391176,0.00002913635,0.00008753952,0.0002651539,0.9035794,0.00003921272,0.03594692,0.05625942,0.0002335442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001289232,0.0001768134,0.9875532,0.000365177,0.00005152499,0.0003872238,0.00001651913,0.00007197254,0.01008834],"genre_scores_gemma":[0.8207384,0.0006500726,0.1766783,0.0003104399,0.00004752184,0.0001626762,0.00008353427,0.00001955851,0.001309464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8194492,"threshold_uncertainty_score":0.5150864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013164640","doi":"10.1007/s10589-006-6449-x","title":"Optimizing Preventive Maintenance Models","year":2006,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Preventive maintenance; Spurious relationship; Minification; Scheduling (production processes); Hazard; Failure rate; Mathematics; Computer science; Function (biology); Reliability engineering; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005576950889064011,"gpt":0.1973607928961794,"spread":0.1917838420071154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006791463,0.0001239635,0.0001088526,0.00007776875,0.000152427,0.00006592799,0.00007150565,0.00005587655,0.00002777725],"category_scores_gemma":[0.0000040769,0.0001339039,0.0000330041,0.0002610222,0.00006718,0.0003079365,0.00001847972,0.00006999719,0.00000878483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004862261,"about_ca_system_score_gemma":0.00001664843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000455273,"about_ca_topic_score_gemma":0.000001558637,"domain_scores_codex":[0.9992804,0.00001316487,0.0002505297,0.0002003911,0.0001087074,0.0001468345],"domain_scores_gemma":[0.9995936,0.00005069657,0.00004511527,0.0001091444,0.0001542422,0.00004719248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001458363,0.00002354446,0.000009623921,0.0000165352,0.000006129137,1.20455e-7,0.00002966089,0.8983948,0.000009252218,0.09955536,0.0006620222,0.001291504],"study_design_scores_gemma":[0.000227491,0.000004483083,0.0001054986,0.00001488911,0.000009407706,0.000004000011,0.00002753262,0.949009,0.00001985376,0.0486014,0.001834242,0.0001421908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001800623,0.0003098397,0.9844786,0.0001427031,0.0000377569,0.0004040862,0.00001998127,0.0003063343,0.01412066],"genre_scores_gemma":[0.4705224,0.0003185309,0.527642,0.0001040329,0.0001033054,0.0003643852,0.0004804047,0.00003656525,0.0004283723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4703423,"threshold_uncertainty_score":0.5460444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3106015846","doi":"10.1007/s10589-016-9844-y","title":"Building an iterative heuristic solver for a quantum annealer","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Quadratic unconstrained binary optimization; Solver; Quantum annealing; Heuristic; Quantum; Quadratic equation; Tabu search; Optimization problem; Quantum computer","retraction":null,"screen_n_in":null,"score":{"opus":0.01335722077858014,"gpt":0.2769790052804113,"spread":0.2636217845018311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001249633,0.000124942,0.0001112742,0.0001035494,0.0003841314,0.0001653334,0.0002555379,0.0000394808,0.000005881625],"category_scores_gemma":[0.00002127552,0.00009479954,0.00003666855,0.0002323565,0.00006273309,0.0003266815,0.0000721818,0.00004142673,0.000004237816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001882479,"about_ca_system_score_gemma":0.00005207471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.345927e-7,"about_ca_topic_score_gemma":2.502413e-7,"domain_scores_codex":[0.9990451,0.00003510978,0.0002107395,0.0004141992,0.0001294342,0.0001653848],"domain_scores_gemma":[0.9989855,0.0003608599,0.00009975904,0.000194365,0.0002445966,0.0001149691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000234213,0.00004170394,0.0000149664,0.000005426281,0.000006815571,1.739937e-7,0.00008657094,0.576525,0.00006430232,0.3772173,0.0001126532,0.04592275],"study_design_scores_gemma":[0.0003831109,0.00005642495,0.0002137923,0.00001581853,0.000004480259,0.00001059098,0.000004255435,0.9119626,0.00002391225,0.08408295,0.003097774,0.000144326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001123868,0.00004831346,0.9959854,0.002132149,0.00005895707,0.000404549,0.00003257044,0.0001739034,0.00004031411],"genre_scores_gemma":[0.2387285,0.00000625503,0.7604988,0.0003790609,0.0001327519,0.0001694165,0.00003210111,0.00001130562,0.00004181163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3354376,"threshold_uncertainty_score":0.3865813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768763745","doi":"10.1007/s10589-018-0016-0","title":"Mesh-based Nelder–Mead algorithm for inequality constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematical optimization; Simplex algorithm; Mathematics; Algorithm; Simplex; Rate of convergence; Point (geometry); Computer science; Linear programming; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.0606054398186082,"gpt":0.3863672623675488,"spread":0.3257618225489406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003960627,0.0002488856,0.0002748302,0.0002532103,0.0007006512,0.000138291,0.0001984945,0.000139108,0.0003513256],"category_scores_gemma":[0.0003248964,0.0002678097,0.00007663126,0.0007250243,0.0004326877,0.0002635425,0.0000558115,0.0001166734,0.00001152297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008321388,"about_ca_system_score_gemma":0.0002314712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001983115,"about_ca_topic_score_gemma":0.000001227076,"domain_scores_codex":[0.9980717,0.00009364635,0.0006056005,0.0005412747,0.0003842041,0.0003035858],"domain_scores_gemma":[0.996484,0.0009987592,0.0002888111,0.0002938934,0.001737407,0.000197065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001492902,0.00016957,0.00001265455,0.00003559889,0.00002582475,1.595479e-7,0.0000520856,0.9150054,0.000003410092,0.06068117,0.0004926465,0.02350657],"study_design_scores_gemma":[0.001480841,0.00009330099,0.00001066158,0.00001731965,0.00003254362,0.000005335553,0.00006089013,0.9602947,0.00006773262,0.0361138,0.001546868,0.0002760525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001400241,0.00002709878,0.9957167,0.0009825504,0.00005971393,0.00192753,0.0001955659,0.000292087,0.0007847454],"genre_scores_gemma":[0.00360456,0.00001857023,0.993031,0.0005526871,0.0002758463,0.0009951515,0.00121384,0.00005790512,0.0002504059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04528928,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133898219","doi":"10.1007/s10589-007-9124-y","title":"The piecewise linear-quadratic model for computational convex analysis","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Piecewise; Quadratic equation; Piecewise linear function; Regular polygon; Convex optimization; Convex analysis; Class (philosophy); Mathematical optimization; Convex combination; Applied mathematics; Proper convex function; Convergence (economics); Convex function; Algorithm; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05266449761261748,"gpt":0.3967341080938024,"spread":0.344069610481185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396338,0.000179832,0.0002312265,0.000269315,0.001107827,0.0001240142,0.0002113643,0.00008102654,0.00002489186],"category_scores_gemma":[0.0002297538,0.0001561486,0.0001173152,0.001159516,0.0002244298,0.0001641961,0.00005842908,0.0001257869,0.000005906531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007087106,"about_ca_system_score_gemma":0.0001336655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.338495e-7,"about_ca_topic_score_gemma":0.00000966858,"domain_scores_codex":[0.9982535,0.00003829175,0.0006191261,0.0003667377,0.0004310485,0.0002913215],"domain_scores_gemma":[0.9950738,0.003169521,0.0002554856,0.0002362549,0.001096269,0.0001686711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001634495,0.00006414932,0.00003448578,0.00001150283,0.0001089255,1.024593e-7,0.00007188494,0.7610538,5.181347e-7,0.2357579,0.0002310119,0.002649388],"study_design_scores_gemma":[0.0004790204,0.00001174491,0.00006337395,0.000002737466,0.0001075556,0.000002346933,0.00007926541,0.8186194,0.000002931598,0.1796981,0.0007910025,0.0001424938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006488705,0.0001063273,0.9968308,0.001155198,0.00002124927,0.001269709,0.00008130824,0.000122318,0.0003481609],"genre_scores_gemma":[0.03268479,0.00005244531,0.9646841,0.0002762974,0.00007672631,0.0004798501,0.0007065244,0.00003621958,0.001003021],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05756561,"threshold_uncertainty_score":0.8520619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088422447","doi":"10.1007/s10589-007-9095-z","title":"Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Line search; Interior point method; Mathematical optimization; Nonlinear system; Convergence (economics); Dual (grammatical number); Computer science; Residual; Nonlinear programming; Newton's method; Local convergence; Rate of convergence; Point (geometry); Newton's method in optimization; Algorithm; Function (biology); Linear programming; Mathematics; Iterative method; Key (lock); Path (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03415400168738806,"gpt":0.4312444473736649,"spread":0.3970904456862768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006517812,0.000103439,0.0001514099,0.0001421632,0.0001510627,0.00002752275,0.0001261204,0.00006411722,0.00002140977],"category_scores_gemma":[0.0004902114,0.000087038,0.0000498177,0.0005777759,0.0001406502,0.0001006549,0.00006384892,0.0001004238,5.05231e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004796133,"about_ca_system_score_gemma":0.00006990114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.397373e-7,"about_ca_topic_score_gemma":0.000004023738,"domain_scores_codex":[0.9989406,0.0000573136,0.0004509396,0.0002178665,0.000164115,0.0001691078],"domain_scores_gemma":[0.9975513,0.001662065,0.0001870429,0.0001636592,0.0003804084,0.00005551364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001569391,0.0001477723,0.0001991017,0.00005281636,0.00001521305,6.417882e-8,0.0001484448,0.9119959,0.0000407278,0.03506496,0.0000132538,0.05230605],"study_design_scores_gemma":[0.0004651868,0.00001357743,0.0002459132,0.00001299242,0.00001186131,0.000003281284,0.0001033875,0.9545054,0.0002033299,0.04254932,0.001793823,0.00009195933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004098189,0.00005448507,0.9976377,0.0002826572,0.00002020557,0.001445208,0.00003372681,0.00003172593,0.00008448648],"genre_scores_gemma":[0.005896505,0.00001179084,0.9934545,0.00007010569,0.00001716805,0.0002823345,0.0001219482,0.0000224406,0.0001232481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05221409,"threshold_uncertainty_score":0.3549307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3134041587","doi":"10.1007/s10589-020-00249-0","title":"Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Probabilistic logic; Martingale (probability theory); Convergence (economics); Extension (predicate logic); Stochastic optimization; Convergence of random variables; Algorithm; Random variable; Computer science; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04944740018437694,"gpt":0.3263624437658484,"spread":0.2769150435814715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003586728,0.0002318586,0.0002820675,0.0002515517,0.0006466382,0.0004753551,0.0003571106,0.00009338559,0.00009143227],"category_scores_gemma":[0.0002994646,0.0002573545,0.00007223563,0.001281012,0.0001527002,0.0004783777,0.0002254676,0.0001236582,0.000008137973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116156,"about_ca_system_score_gemma":0.000591589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003350937,"about_ca_topic_score_gemma":5.05727e-7,"domain_scores_codex":[0.9977848,0.0001283219,0.0004842939,0.0007857541,0.0004875387,0.0003293149],"domain_scores_gemma":[0.9961775,0.001013683,0.0001606209,0.0003944998,0.002027007,0.0002267079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006448512,0.0001201289,0.000009724434,0.00003315979,0.00003473893,9.848978e-7,0.00008408283,0.8970641,0.000006516256,0.101012,0.00006209787,0.001566],"study_design_scores_gemma":[0.0005891702,0.00003785143,0.00002449634,0.0000230916,0.00003708961,0.00003289234,0.00004622953,0.9940661,0.00005503266,0.004744185,0.00008232024,0.0002615388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001441419,0.0002007951,0.9969376,0.0006349619,0.00007242089,0.001350702,0.00007349008,0.0001971269,0.0005184996],"genre_scores_gemma":[0.01302692,0.00003402122,0.9855106,0.0001707916,0.00009078368,0.0004820839,0.0004610981,0.00003464966,0.0001890589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09700195,"threshold_uncertainty_score":0.9999878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2429556411","doi":"10.1007/s10589-016-9854-9","title":"Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Simon Fraser University; Shenzhen University; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Smoothing; Stationary point; Mathematical optimization; Convergence (economics); Convex function; Regular polygon; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01128787792532096,"gpt":0.2649933677149898,"spread":0.2537054897896688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009982082,0.00015271,0.0001473598,0.0001404851,0.0001865374,0.00006346151,0.00008786463,0.00008319208,0.00003128377],"category_scores_gemma":[0.00002820423,0.0001343828,0.00004085695,0.0002352958,0.00005386517,0.0001570571,0.00002003141,0.00004846553,0.00000300258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003608363,"about_ca_system_score_gemma":0.00003834187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001595297,"about_ca_topic_score_gemma":4.497983e-7,"domain_scores_codex":[0.9992142,0.0000212091,0.0002689253,0.0002439268,0.000103334,0.0001484599],"domain_scores_gemma":[0.9992017,0.0002687251,0.00006963606,0.0001328695,0.0002574195,0.00006972401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005334942,0.00001706905,0.000009440113,0.000012228,0.00002225019,1.068186e-7,0.00003710918,0.9770433,0.0008359335,0.007325144,0.0006560616,0.01403598],"study_design_scores_gemma":[0.0005664615,0.00001767527,0.00004104339,0.00003947797,0.00002211177,0.00000746646,0.00001767987,0.9928901,0.001059238,0.003165778,0.001982132,0.0001908309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009939198,0.00004434299,0.9966714,0.000448984,0.00004404568,0.0008780427,0.00004703845,0.0006338794,0.001132891],"genre_scores_gemma":[0.1061127,0.00005012302,0.8928126,0.0001556934,0.00009465987,0.0004672447,0.0002125784,0.00003773297,0.00005664223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1060133,"threshold_uncertainty_score":0.5479972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2203411556","doi":"10.1007/s10589-016-9867-4","title":"Local nonglobal minima for solving large-scale extended trust-region subproblems","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Guilan","keywords":"Trust region; Mathematics; Maxima and minima; Eigenvalues and eigenvectors; Mathematical optimization; Quadratic equation; Constraint (computer-aided design); Scale (ratio); Duality (order theory); Norm (philosophy); Optimization problem; Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03189552798021421,"gpt":0.3360019964161395,"spread":0.3041064684359253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002064357,0.000185329,0.0002046076,0.0001429896,0.0004344202,0.00006710155,0.0001661932,0.0001032069,0.0001039859],"category_scores_gemma":[0.0001436685,0.0001548593,0.0000703507,0.0003582247,0.000173618,0.0002856767,0.00007594832,0.00006540781,0.00001423929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001098037,"about_ca_system_score_gemma":0.0000961996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.154779e-7,"about_ca_topic_score_gemma":0.000003102843,"domain_scores_codex":[0.9984837,0.00003208766,0.0004318711,0.0004523616,0.0002861427,0.0003138039],"domain_scores_gemma":[0.9980355,0.0007336484,0.0001844611,0.0002218962,0.0006566087,0.0001679033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004052006,0.0003061309,0.0001189945,0.00006173633,0.00003192283,5.524333e-7,0.0001224772,0.7173851,0.00002652309,0.2528226,0.001816127,0.02726726],"study_design_scores_gemma":[0.001624569,0.000039226,0.00009452914,0.00002829992,0.00001964905,0.00001606145,0.0001349066,0.873274,0.0000511659,0.1197532,0.004753217,0.0002111913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009442306,0.00005317877,0.9961855,0.001613477,0.00003448622,0.001254628,0.0001215517,0.0001788822,0.0004638156],"genre_scores_gemma":[0.04942026,0.00007721314,0.9474257,0.0001880753,0.00012654,0.001071806,0.0002265863,0.00005583997,0.001408029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1558889,"threshold_uncertainty_score":0.6314977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046701389","doi":"10.1007/s10589-007-9024-1","title":"Clustering via minimum volume ellipsoids","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Ellipsoid; Mathematics; Correlation clustering; k-medians clustering; CURE data clustering algorithm; Mathematical optimization; Cluster (spacecraft); Canopy clustering algorithm; Algorithm; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05582170527538512,"gpt":0.387604437834041,"spread":0.3317827325586559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541968,0.0001003115,0.0001193152,0.00006796456,0.0002011202,0.00002711113,0.00006276445,0.00004925069,0.00006645166],"category_scores_gemma":[0.00006570737,0.0001036644,0.00002545116,0.0001780872,0.00006864804,0.0000831546,0.00003632742,0.00007010449,0.0000103615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002382181,"about_ca_system_score_gemma":0.00001534668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.678015e-7,"about_ca_topic_score_gemma":0.00000149187,"domain_scores_codex":[0.9991859,0.00002038217,0.0002983936,0.0002138107,0.0001364954,0.0001450364],"domain_scores_gemma":[0.9989685,0.0005680167,0.0000922286,0.0001081704,0.000150856,0.0001121597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007915129,0.00006682373,0.00002997692,0.00002509233,0.000008444161,5.945201e-7,0.00006691018,0.6869406,0.00003061307,0.2637503,0.0001714651,0.04890122],"study_design_scores_gemma":[0.0001660078,0.00001109938,0.0001195615,0.000004723024,0.00001039101,0.000006066773,0.00002715589,0.7027141,0.000006647506,0.294813,0.002027529,0.00009370849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001182519,0.00003344645,0.9970127,0.0002063929,0.00002957412,0.000313366,0.00001408695,0.00009294476,0.002179198],"genre_scores_gemma":[0.04723813,0.000009709222,0.9519793,0.0001632016,0.00008879642,0.00005144754,0.00005684419,0.00001801812,0.0003945416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04880751,"threshold_uncertainty_score":0.4227313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982566213","doi":"10.1007/s10589-015-9751-7","title":"Scenario generation for stochastic optimization problems via the sparse grid method","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Office of Naval Research; U.S. Department of Energy","keywords":"Sparse grid; Mathematics; Mathematical optimization; Discretization; Univariate; Quasi-Monte Carlo method; Grid; Applied mathematics; Monte Carlo method; Markov chain Monte Carlo; Hybrid Monte Carlo; Multivariate statistics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1593940515028658,"gpt":0.3593731173016647,"spread":0.1999790657987989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001623659,0.0001492285,0.0001705361,0.0001490799,0.0004549675,0.0002945267,0.0002820067,0.0000739708,0.00003083544],"category_scores_gemma":[0.0007014485,0.0001063106,0.0000510493,0.0006521159,0.00009217331,0.0002389068,0.00005251732,0.00007885057,0.00001882502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005501113,"about_ca_system_score_gemma":0.000158723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004209645,"about_ca_topic_score_gemma":0.000001589768,"domain_scores_codex":[0.9982371,0.0001154413,0.0005300288,0.0004337565,0.0005291789,0.0001544975],"domain_scores_gemma":[0.99721,0.0009946186,0.000226499,0.0002832249,0.001135587,0.0001501198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005832897,0.00003915796,0.000006498522,0.000003276377,0.000009743257,3.385398e-8,0.0001514753,0.9696741,0.000006489486,0.02336031,0.003364059,0.003378997],"study_design_scores_gemma":[0.0004225458,0.0000320642,0.00001488506,0.000003892756,0.00002693579,0.00001204868,0.00006153584,0.9671897,0.000002716916,0.02781232,0.004287737,0.0001335818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001039244,0.0001509507,0.9960515,0.001979769,0.0001955078,0.001363023,0.00003654644,0.00007777914,0.0001345475],"genre_scores_gemma":[0.02768743,0.000005352955,0.9697338,0.0003730221,0.0004647904,0.0008711468,0.0004928581,0.000022736,0.0003488221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02767704,"threshold_uncertainty_score":0.4335219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098024031","doi":"10.1007/s10589-014-9708-2","title":"Linear equalities in blackbox optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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":"Mathematics; Mathematical optimization; Convergence (economics); Simplex; Optimization problem; Simplex algorithm; Linear programming; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04497652738354387,"gpt":0.3669998117124803,"spread":0.3220232843289365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003890903,0.0001712916,0.0002137566,0.0003133732,0.0002175501,0.00007036413,0.000147974,0.00009331203,0.0002048326],"category_scores_gemma":[0.0003425497,0.0001866046,0.00003420588,0.000698848,0.000129837,0.0002767314,0.00006930103,0.0001495619,0.00001668013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006556077,"about_ca_system_score_gemma":0.00005788189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003154245,"about_ca_topic_score_gemma":0.000002715408,"domain_scores_codex":[0.9984565,0.0001348776,0.0004973983,0.0003663166,0.0003237328,0.0002212128],"domain_scores_gemma":[0.9983675,0.0007872804,0.000158295,0.0002154602,0.0003543519,0.000117115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004749199,0.00007514763,0.00008144636,0.00002436931,0.000005096954,1.408899e-7,0.00009941306,0.7787421,8.245657e-7,0.2193912,0.00007571145,0.001499779],"study_design_scores_gemma":[0.0006352829,0.0000191318,0.0000543395,0.00001646533,0.00000684771,0.000004392204,0.0001039854,0.9190057,0.000006677585,0.07870083,0.001266117,0.0001802148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001265658,0.00003495772,0.9951264,0.0007489552,0.00002367782,0.0006183716,0.00001491894,0.0001591746,0.003146947],"genre_scores_gemma":[0.02406354,0.00008198684,0.9742299,0.0002908795,0.0001180206,0.0003285538,0.0003173765,0.00004421889,0.000525569],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1406904,"threshold_uncertainty_score":0.7609516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072726536","doi":"10.1007/s10589-013-9585-0","title":"Mixed-logit network pricing","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sensitivity (control systems); Mixed logit; Discrete choice; Mathematical optimization; Revenue; Population; Logit; Point (geometry); Smoothing; Contrast (vision); Mathematics; Flow network; Econometrics; Computer science; Logistic regression; Operations research; Statistics; Economics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01851470715983185,"gpt":0.2650374377517137,"spread":0.2465227305918818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001433855,0.00008025068,0.00008284555,0.00004949944,0.0009025883,0.0001668644,0.0000856263,0.00006439046,0.0003685119],"category_scores_gemma":[0.00002699754,0.0000880474,0.00002292592,0.00045752,0.0001252828,0.0003081442,0.000009431505,0.00006159267,0.00006764516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002601128,"about_ca_system_score_gemma":0.00006322472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001001505,"about_ca_topic_score_gemma":0.00001924847,"domain_scores_codex":[0.9991722,0.00005627803,0.0002122546,0.0001945471,0.0001952051,0.0001695433],"domain_scores_gemma":[0.9992542,0.000169281,0.00009799433,0.00007057757,0.0002877596,0.0001202361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.015654e-7,0.00001571309,0.001631008,0.000002654861,0.000004702709,5.281577e-8,0.0003395179,0.8264235,5.615969e-7,0.164511,0.001761687,0.005309041],"study_design_scores_gemma":[0.0003377518,0.00001308399,0.02079122,0.00001784671,0.00002209548,0.000001516114,0.0009990988,0.9031336,0.000001668469,0.02705194,0.04735902,0.0002711111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009430334,0.000089368,0.9819851,0.00218773,0.00006370587,0.0005301066,0.00000495802,0.0001978439,0.01399818],"genre_scores_gemma":[0.6652833,0.000137058,0.3315382,0.0008170042,0.0003137931,0.0003688698,0.0004655225,0.00001609513,0.001060188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6643403,"threshold_uncertainty_score":0.6942071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3141233211","doi":"10.1007/s10589-021-00272-9","title":"DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Multi-objective optimization; Iterated local search; Extension (predicate logic); Context (archaeology); Set (abstract data type); Pareto principle; Mathematics; Computer science; Optimization problem; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.01898329939260502,"gpt":0.2918855368238908,"spread":0.2729022374312858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002480511,0.0003540139,0.0003618429,0.0002916678,0.0008964018,0.0003945708,0.0003709402,0.0001542204,0.0000638554],"category_scores_gemma":[0.0002929117,0.0004105741,0.0001320489,0.001317988,0.0002449136,0.001016534,0.0002102369,0.0001790778,0.00001451175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002027825,"about_ca_system_score_gemma":0.0004844683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000503799,"about_ca_topic_score_gemma":0.000004034611,"domain_scores_codex":[0.9972971,0.0001628922,0.0005871465,0.001141901,0.00041358,0.0003973758],"domain_scores_gemma":[0.995491,0.0009029333,0.0003169638,0.0004470056,0.002586412,0.000255719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001750584,0.0002497157,0.00002495046,0.0000172682,0.00006611714,0.000002098261,0.0003043489,0.9384755,0.00003518054,0.05168473,0.00008317948,0.009039408],"study_design_scores_gemma":[0.002111102,0.00006029654,0.0001665843,0.00002293165,0.00003109094,0.00003205405,0.0002337624,0.9926834,0.0002859869,0.003182872,0.0007433397,0.0004466453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001274874,0.0002236435,0.9947384,0.0007569235,0.0001352473,0.001907081,0.0001900433,0.0004104242,0.001625459],"genre_scores_gemma":[0.02046117,0.0001506446,0.9758117,0.0005021246,0.000126312,0.001395755,0.0009714896,0.00005191742,0.0005289522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05420784,"threshold_uncertainty_score":0.9998346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1636353766","doi":"10.1023/a:1011219303531","title":"A Cutting Plane Method for Solving Quasimonotone Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Applied mathematics; Cutting-plane method; Mathematical optimization; Calculus (dental); Mathematical analysis; Integer programming","retraction":null,"screen_n_in":null,"score":{"opus":0.02307509324822738,"gpt":0.3029777985616544,"spread":0.279902705313427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883821,0.0001608652,0.0001860236,0.0002517335,0.0005938934,0.0002962854,0.0002701106,0.00006875471,0.0000723268],"category_scores_gemma":[0.00009903742,0.0001724509,0.00007206984,0.000728833,0.0000294865,0.0005384209,0.00008315974,0.00006738681,0.00001053971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004337215,"about_ca_system_score_gemma":0.0001410516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001248725,"about_ca_topic_score_gemma":0.000002690746,"domain_scores_codex":[0.9985799,0.0000650436,0.0004534462,0.0004441588,0.0002699193,0.0001875016],"domain_scores_gemma":[0.9979859,0.0009283459,0.0002363502,0.0001904293,0.0005445217,0.0001144756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002915592,0.00004083653,0.00009400263,0.000005999588,0.00002180641,1.046881e-7,0.0000909454,0.5575203,0.000005315366,0.4389097,0.0001309384,0.003177103],"study_design_scores_gemma":[0.00047851,0.00001711237,0.0003488252,0.000006066845,0.00002207982,0.00001674432,0.00004618177,0.9533887,0.000008306234,0.03769168,0.007783059,0.0001927587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000132917,0.00007493731,0.9941223,0.004124647,0.00004564421,0.0004931128,0.00003746161,0.0001964714,0.0008921897],"genre_scores_gemma":[0.01263324,0.00005656013,0.9842212,0.001311404,0.000166783,0.0004826688,0.0007277515,0.00001491962,0.0003854447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4012181,"threshold_uncertainty_score":0.7032346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057635030","doi":"10.1007/s10589-013-9544-9","title":"A cutting plane algorithm for the Capacitated Connected Facility Location Problem","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Facility location problem; 1-center problem; Integer programming; Mathematical optimization; Network planning and design; Branch and cut; Set (abstract data type); Set cover problem; Integer (computer science); Mathematics; Cutting-plane method; Theory of computation; Cover (algebra); Computer science; Algorithm; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01438451474703852,"gpt":0.2430500121766642,"spread":0.2286654974296257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201763,0.0001364411,0.0001190477,0.00006991196,0.0003833637,0.0001352482,0.0001045979,0.00006578862,0.00006592296],"category_scores_gemma":[0.00004716883,0.0001225231,0.00002688155,0.0004581875,0.00007086427,0.0001791903,0.00001614864,0.00009073527,0.0000212885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000410341,"about_ca_system_score_gemma":0.00002941904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009828112,"about_ca_topic_score_gemma":6.476814e-7,"domain_scores_codex":[0.9991594,0.00003948354,0.0003207044,0.0002037174,0.0001197129,0.0001570025],"domain_scores_gemma":[0.9985257,0.0006611241,0.00007141746,0.0001356556,0.0005376098,0.00006849453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.954369e-7,0.00001358522,0.00002999234,0.00002561075,0.00002509795,1.203447e-8,0.000101293,0.9319238,0.00002152742,0.001596678,0.000464714,0.06579708],"study_design_scores_gemma":[0.0003329272,0.000008369966,0.000397966,0.000007411652,0.00002025283,0.000004781051,0.0001107499,0.9959162,0.00003373504,0.001664072,0.001363453,0.0001400435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001538603,0.000148538,0.9967517,0.0004370718,0.00003966841,0.001742417,0.00008319603,0.0003997451,0.0002437534],"genre_scores_gemma":[0.05044626,0.00003355201,0.9462709,0.0001560659,0.00006705113,0.002020869,0.0009115725,0.00002498626,0.00006878628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06565703,"threshold_uncertainty_score":0.4996346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1525133469","doi":"10.1023/a:1008787027641","title":"A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities","year":2000,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0379339446005809,"gpt":0.3393269561306401,"spread":0.3013930115300592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004163059,0.0001919683,0.0002199851,0.00005873257,0.0007881886,0.0001584851,0.0002038405,0.0000727212,0.0002400155],"category_scores_gemma":[0.00009477069,0.0001618901,0.00006091543,0.0003621512,0.0001654536,0.0002106146,0.00004343046,0.0001263447,0.000008845468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008002667,"about_ca_system_score_gemma":0.0001277966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001036724,"about_ca_topic_score_gemma":0.000001642553,"domain_scores_codex":[0.998466,0.00008855116,0.0005116804,0.0003873327,0.0002983801,0.0002481075],"domain_scores_gemma":[0.9968181,0.002224787,0.0001795041,0.0002197674,0.0004520279,0.0001058709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001661015,0.000268152,0.0000477371,0.00005212483,0.00005973436,9.698703e-8,0.0003191009,0.9321766,0.000004504298,0.00918051,0.005138058,0.05273669],"study_design_scores_gemma":[0.0009374662,0.00003399319,0.00002361109,0.000008360443,0.00003319036,0.000006335858,0.0002076241,0.9719542,0.00002128409,0.01316284,0.0134262,0.0001849047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00032205,0.0002215276,0.9947435,0.001453264,0.00001990674,0.002271612,0.0003122895,0.0002201602,0.0004356429],"genre_scores_gemma":[0.003899635,0.0001805007,0.992435,0.0002658699,0.0001038703,0.001264755,0.0004834899,0.00004101532,0.001325831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05255179,"threshold_uncertainty_score":0.6601688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081084362","doi":"10.1007/s10589-014-9654-z","title":"Solving semi-infinite programs by smoothing projected gradient method","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Smoothing; Mathematical optimization; Optimization problem; Lagrange multiplier; Applied mathematics; Function (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.01114257797363133,"gpt":0.2600618551195394,"spread":0.2489192771459081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036492,0.0001783738,0.0001814585,0.0002049677,0.000560808,0.0004234911,0.0003301938,0.00007172618,0.00003023171],"category_scores_gemma":[0.0000498255,0.0001804793,0.00006199076,0.00111269,0.00004413265,0.0004709087,0.0001163727,0.0001076599,0.00001715471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004011604,"about_ca_system_score_gemma":0.00006081411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253734,"about_ca_topic_score_gemma":0.000001395032,"domain_scores_codex":[0.9984158,0.0001313689,0.0004012779,0.0005227952,0.0003290244,0.0001997335],"domain_scores_gemma":[0.9986891,0.0002619094,0.0002287023,0.0002537172,0.0004126696,0.000153869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.941421e-7,0.00008266055,0.0001417795,0.000007677889,0.00002107338,5.361393e-8,0.0001324324,0.7509215,0.00001292494,0.226227,0.0003143369,0.02213763],"study_design_scores_gemma":[0.0003210675,0.00002279584,0.0002176347,0.000008967264,0.00001969068,0.00000681077,0.00001599632,0.9797599,0.00001691693,0.00764662,0.01175255,0.0002110624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002511811,0.00005252987,0.9947954,0.002280852,0.00003698109,0.0004238183,0.000008163273,0.0003240428,0.002053027],"genre_scores_gemma":[0.0550371,0.00002771732,0.9423826,0.001174678,0.00007028649,0.0002799871,0.0007143198,0.00001723908,0.000296119],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2288384,"threshold_uncertainty_score":0.7359734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2517321039","doi":"10.1007/s10589-018-0020-4","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Trust region; Mathematical optimization; Mathematics; Quadratic equation; Domain (mathematical analysis); Quadratic programming; Constrained optimization; Constrained optimization problem; Derivative (finance); Software; Optimization problem; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03824738742991372,"gpt":0.3552282416599088,"spread":0.3169808542299951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002146251,0.0002721982,0.0002747952,0.0002147445,0.0008168879,0.0001546114,0.0002888298,0.0001452564,0.0002776116],"category_scores_gemma":[0.0005358834,0.0002839013,0.00007491846,0.0007259966,0.0005942294,0.0003841299,0.0001220943,0.0001221862,0.000007172837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000885112,"about_ca_system_score_gemma":0.0001942818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.370119e-7,"about_ca_topic_score_gemma":5.232044e-7,"domain_scores_codex":[0.9980991,0.00007729104,0.000549841,0.0005773253,0.0003692581,0.0003271967],"domain_scores_gemma":[0.9964224,0.0006831753,0.0003403466,0.0003685965,0.001970937,0.0002145961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002877297,0.0001699202,0.00002033188,0.00003709314,0.00005951862,0.00000102334,0.0002051339,0.879721,0.000003919301,0.08901005,0.001219519,0.02952366],"study_design_scores_gemma":[0.001789348,0.0001111727,0.00001179039,0.00002374848,0.00003608469,0.00003907847,0.000152199,0.9209937,0.0000627295,0.07493804,0.001558308,0.0002837965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002714861,0.00006778137,0.9949921,0.0008142572,0.00005610909,0.002633865,0.0001867326,0.000267379,0.0009545792],"genre_scores_gemma":[0.002003002,0.00002705838,0.9942055,0.0002762072,0.0003753669,0.001787284,0.0006483751,0.00007079022,0.000606383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04127266,"threshold_uncertainty_score":0.9999613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087512052","doi":"10.1007/s10589-008-9192-7","title":"Approximation of low rank solutions for linear quadratic control of partial differential equations","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lyapunov function; Algebraic equation; Partial differential equation; Dimension (graph theory); Applied mathematics; Riccati equation; Rank (graph theory); Mathematical analysis; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.02559005437559165,"gpt":0.2592640356635096,"spread":0.2336739812879179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000579619,0.00009476851,0.0001759164,0.00007920999,0.0003052133,0.000008110082,0.00005905562,0.00003445596,0.0001036317],"category_scores_gemma":[0.000009585257,0.00009756924,0.00008435472,0.0001862292,0.0001353919,0.0001031449,0.00001376313,0.00004735641,0.00000152206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006543198,"about_ca_system_score_gemma":0.00006768836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004843785,"about_ca_topic_score_gemma":1.376572e-7,"domain_scores_codex":[0.9991633,0.00003086067,0.0004078447,0.0001601822,0.000125248,0.0001125442],"domain_scores_gemma":[0.9990535,0.0002165186,0.000253464,0.00009811972,0.0003236285,0.00005471668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001474931,0.0001706025,0.0001036973,0.0000188559,0.00002812349,5.499551e-9,0.00006308248,0.8206568,0.0001386063,0.1777375,0.00005579319,0.001012226],"study_design_scores_gemma":[0.001028447,0.00002506043,0.0001588991,0.000009801294,0.00003940352,5.500337e-7,0.00003458741,0.9951599,0.000244737,0.003114811,0.00009993092,0.00008386007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002625632,0.00003952017,0.9960465,0.0001752055,0.00003882348,0.0007520804,0.0001721928,0.00002017287,0.0001298899],"genre_scores_gemma":[0.973895,0.00001055978,0.0247234,0.00002029841,0.0001651613,0.0003733433,0.0007471992,0.00001008599,0.00005492615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9713231,"threshold_uncertainty_score":0.3978758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981143387","doi":"10.1007/s10589-019-00142-5","title":"Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Heuristics; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Integer programming; Computer science; Heuristic; Mathematics; Algorithm; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.008094846714795557,"gpt":0.2093719458273908,"spread":0.2012770991125953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008152369,0.0001096201,0.0001297534,0.00006260558,0.0001508283,0.00004907751,0.00008572318,0.00003768235,0.00004658291],"category_scores_gemma":[0.000007481377,0.00008548176,0.0000263595,0.0002616848,0.00007043713,0.00006785535,0.00001201638,0.00006311785,0.000005011369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002129274,"about_ca_system_score_gemma":0.00002453562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001335603,"about_ca_topic_score_gemma":7.946979e-7,"domain_scores_codex":[0.9993805,0.000009584806,0.0002326677,0.0001492039,0.0001252651,0.0001027872],"domain_scores_gemma":[0.9992442,0.0002162105,0.00008699811,0.0001159588,0.0002996674,0.00003702577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008918144,0.00003014621,0.0001630048,0.00005628304,0.00002695311,2.215138e-8,0.00005468345,0.986798,0.00003070898,0.01159025,0.00003596193,0.001205059],"study_design_scores_gemma":[0.0005520227,0.00003573626,0.000169116,0.00002740508,0.00002675368,0.000004804042,0.00007079914,0.9972242,0.00005595232,0.0005688651,0.001152465,0.0001118534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006673762,0.0003167134,0.9972664,0.0003217187,0.00003723436,0.0007706804,0.00006224282,0.0001159613,0.0004416971],"genre_scores_gemma":[0.3115467,0.00005105032,0.6876494,0.00005962509,0.00003346069,0.0001459034,0.0003997218,0.00002368496,0.00009052303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3108793,"threshold_uncertainty_score":0.3485845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125711631","doi":"10.1007/s10589-020-00261-4","title":"A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Iterated function; Maximum cut; Eigenvalues and eigenvectors; Semidefinite programming; Upper and lower bounds; Mathematical optimization; Vertex (graph theory); Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02182201172403229,"gpt":0.2932571728029479,"spread":0.2714351610789156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003193454,0.0001091702,0.0001328938,0.00005229286,0.0007015635,0.0001350413,0.0003568221,0.00004470417,0.000006354713],"category_scores_gemma":[0.0001109367,0.00007979215,0.00009189791,0.0007937208,0.000103138,0.0002467626,0.0001647897,0.0001134969,7.379692e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002584833,"about_ca_system_score_gemma":0.0001812407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007592219,"about_ca_topic_score_gemma":0.000005799909,"domain_scores_codex":[0.9989001,0.000104962,0.0003355214,0.0003154149,0.0002241108,0.0001198714],"domain_scores_gemma":[0.9966332,0.001878761,0.0003712893,0.0002795458,0.0007994486,0.00003774315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003442032,0.00005630167,0.00002219857,0.00001237871,0.00002905974,5.616002e-8,0.0004194885,0.5539154,0.00003199425,0.430162,0.00006866776,0.01527894],"study_design_scores_gemma":[0.0004289567,0.00001722165,0.0007280253,0.00001657823,0.00002945012,0.00001117602,0.0002306157,0.9235432,0.000336377,0.0726697,0.001898794,0.00008990119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005881394,0.0001559342,0.9916841,0.006365836,0.00006490518,0.001000892,0.0000398845,0.00003764548,0.0005919501],"genre_scores_gemma":[0.06382111,0.00002879417,0.9349108,0.0004981353,0.00006998561,0.0004566701,0.00006020268,0.00000846762,0.0001458536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3696277,"threshold_uncertainty_score":0.539593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129835959","doi":"10.1007/s10589-010-9336-4","title":"A secant method for nonlinear least-squares minimization","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Secant method; Nonlinear system; Newton's method; Minification; Mathematics; Non-linear least squares; Quasi-Newton method; Mathematical optimization; Nonlinear programming; Gauss; Applied mathematics; Algorithm; Estimation theory","retraction":null,"screen_n_in":null,"score":{"opus":0.03627713515898895,"gpt":0.4004326502422642,"spread":0.3641555150832753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002791968,0.0001770634,0.0001966588,0.0002025025,0.000438018,0.0001077381,0.0001643435,0.0001178249,0.0001881473],"category_scores_gemma":[0.000405682,0.000183639,0.00006016059,0.000460153,0.0001007022,0.000210325,0.00005553936,0.0001811749,0.000007892886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002581483,"about_ca_system_score_gemma":0.0001246737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001918197,"about_ca_topic_score_gemma":0.000007057629,"domain_scores_codex":[0.9986449,0.00004631069,0.0004127943,0.0004090751,0.0002742683,0.0002125794],"domain_scores_gemma":[0.9975022,0.001054151,0.0001905631,0.0002317691,0.0008633799,0.0001579103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001322589,0.0001266656,0.00002019396,0.0000410795,0.00001790242,1.208485e-7,0.00008784332,0.7847134,0.00006326535,0.2021165,0.0006441317,0.01215567],"study_design_scores_gemma":[0.0006898961,0.000024472,0.00002388478,0.000005814344,0.00002268861,0.00001297441,0.00007196906,0.9095058,0.0000814714,0.07415765,0.015219,0.0001844106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007612951,0.00001999979,0.9963696,0.001179969,0.00006340507,0.001448433,0.0001621379,0.0001782837,0.0005020262],"genre_scores_gemma":[0.001344508,0.00001927776,0.995818,0.0002242149,0.0002325218,0.0009571797,0.0008102824,0.00005137267,0.0005426907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1279589,"threshold_uncertainty_score":0.748858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069942923","doi":"10.1007/s10589-012-9526-3","title":"Regularized robust optimization: the optimal portfolio execution case","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Hessian matrix; Robust optimization; Regularization (linguistics); Mathematics; Optimization problem; Convex optimization; Solution set; Computer science; Portfolio optimization; Stability (learning theory); Portfolio; Set (abstract data type); Regular polygon; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04433641405925529,"gpt":0.3134835759124052,"spread":0.2691471618531499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008993314,0.0002720561,0.0002784049,0.0003498365,0.001340669,0.001061979,0.0004409871,0.0001495589,0.001949818],"category_scores_gemma":[0.0002634603,0.0001994218,0.0001136204,0.001808934,0.0003069549,0.0009921074,0.0001437777,0.000183693,0.0002021624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681075,"about_ca_system_score_gemma":0.0001304648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004793187,"about_ca_topic_score_gemma":0.000003113657,"domain_scores_codex":[0.9968785,0.0002321126,0.001032762,0.0006904001,0.0008805771,0.0002856442],"domain_scores_gemma":[0.9962549,0.000776874,0.0005488598,0.0006194719,0.001563717,0.0002362298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006154913,0.00006108316,0.0002531012,0.000001542908,0.0000178654,0.00000489563,0.0001195053,0.9645469,0.000001859056,0.02030623,0.007062632,0.00761818],"study_design_scores_gemma":[0.0004835628,0.00002296028,0.0005704417,0.000004213902,0.00003491578,0.0006601003,0.0005924552,0.9840941,0.000003760832,0.007047314,0.006242903,0.0002432172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001481986,0.0001696141,0.9879091,0.004010197,0.0001157398,0.001460672,0.00002901178,0.0001465467,0.00467709],"genre_scores_gemma":[0.2842819,0.0004318429,0.7082199,0.001464478,0.0003920673,0.001248778,0.0007180533,0.00005618403,0.003186732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2827999,"threshold_uncertainty_score":0.999975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024962211","doi":"10.1007/s10589-005-3064-1","title":"The Complexity of Self-Regular Proximity Based Infeasible IPMs","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Interior point method; Path (computing); Function (biology); Simple (philosophy); Mathematical optimization; Dual (grammatical number); Point (geometry); Current (fluid); Combinatorics; Algorithm; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05987156577406685,"gpt":0.3493560188353936,"spread":0.2894844530613268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002903695,0.0001207338,0.0001456268,0.00009082152,0.0005216419,0.00005999165,0.0001908995,0.00005203601,0.00008216714],"category_scores_gemma":[0.0001297197,0.000101477,0.00004426386,0.000473806,0.0004121849,0.000191884,0.00006072326,0.0001052096,0.000007224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570028,"about_ca_system_score_gemma":0.0001441291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000152989,"about_ca_topic_score_gemma":0.000004628093,"domain_scores_codex":[0.9987855,0.0000763253,0.0004061665,0.0002164577,0.0003573279,0.0001582267],"domain_scores_gemma":[0.9981633,0.0006179117,0.0002207025,0.0002587339,0.0006475943,0.00009170674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004680235,0.0001356611,0.00004324309,0.00001863209,0.00001267537,2.76427e-8,0.00003007552,0.6449955,0.000003316285,0.3515838,0.0001454542,0.00302688],"study_design_scores_gemma":[0.0004616775,0.0000136976,0.0001426242,0.000006563184,0.00001343054,0.000002190996,0.00002824612,0.8971881,0.00009786845,0.09728588,0.004664136,0.00009560871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001021736,0.00008051207,0.9949466,0.003024763,0.00001039512,0.0008581003,0.00003167812,0.000121178,0.0008246123],"genre_scores_gemma":[0.03903772,0.00004897149,0.960195,0.0001266734,0.0000594064,0.000260585,0.0001268887,0.0000209954,0.0001237716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2542979,"threshold_uncertainty_score":0.4138114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043363748","doi":"10.1007/s10589-011-9406-2","title":"Local path-following property of inexact interior methods in nonlinear programming","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Iterated function; Nonlinear system; Tangent; Interior point method; Newton's method; Applied mathematics; Nonlinear programming; Sequence (biology); Path (computing); Nonlinear complementarity problem; Perturbation (astronomy); Mathematical optimization; Complementarity theory; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08395092464994196,"gpt":0.4111239722028522,"spread":0.3271730475529103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003756727,0.0001276715,0.0002200208,0.0002167481,0.00008844677,0.00002081231,0.0001383014,0.00006614502,0.00007816745],"category_scores_gemma":[0.000164687,0.0001075231,0.00005088986,0.0006427502,0.0001301285,0.0001909063,0.00008143501,0.0001274707,0.000002455782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004692791,"about_ca_system_score_gemma":0.00008138154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000102977,"about_ca_topic_score_gemma":0.000002210662,"domain_scores_codex":[0.9987723,0.0001036953,0.0005103027,0.0002609594,0.000196591,0.0001561835],"domain_scores_gemma":[0.9990624,0.0002679794,0.0001711084,0.0001573902,0.0002620631,0.00007909864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003073876,0.000507073,0.0007577142,0.0001257644,0.00004558033,0.000002345516,0.001102588,0.8201851,0.00005035296,0.0341209,0.00001755711,0.1430543],"study_design_scores_gemma":[0.0004968954,0.00003786222,0.0001534423,0.0000446175,0.0000133976,0.00000516822,0.000386088,0.9873914,0.0001891948,0.01069092,0.0004538118,0.000137251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002051161,0.00004959497,0.9978945,0.00006350648,0.0000176282,0.0007730665,0.000007687961,0.00006327945,0.000925605],"genre_scores_gemma":[0.02337031,0.00001971236,0.9761026,0.00002649764,0.00001450514,0.0002827136,0.00006125747,0.00002664166,0.00009577029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1672063,"threshold_uncertainty_score":0.4384665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999418275","doi":"10.1007/s10589-013-9634-8","title":"Robust least square semidefinite programming with applications","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Robustification; Mathematics; Mathematical optimization; Semidefinite embedding; Rounding; Duality (order theory); Sequence (biology); Interior point method; Cartesian product; Duality gap; Linear programming; Feasible region; Optimization problem; Computer science; Quadratically constrained quadratic program; Discrete mathematics; Quadratic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01350602158506445,"gpt":0.2081500814156939,"spread":0.1946440598306294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004660136,0.000129996,0.0001068093,0.00009280991,0.0002091858,0.00008911582,0.00008070201,0.00004709448,0.00001271676],"category_scores_gemma":[0.000003094737,0.0001290865,0.00002005249,0.0003194223,0.00006742282,0.00009748898,0.00001815365,0.00008331373,0.00001219964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001831935,"about_ca_system_score_gemma":0.00001277829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001522182,"about_ca_topic_score_gemma":0.00000169718,"domain_scores_codex":[0.9993816,0.00001355428,0.0001661912,0.0001991996,0.0001170167,0.0001224498],"domain_scores_gemma":[0.9994943,0.00007312529,0.00004578568,0.0001596839,0.0001528539,0.00007427701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001231918,0.0000201976,0.0001222668,0.00001394609,0.00001118077,7.393793e-8,0.0000193534,0.9472618,0.00001078181,0.03088998,0.000168407,0.02148083],"study_design_scores_gemma":[0.0001721834,0.00001741285,0.0002358827,0.00002302088,0.00001811095,0.00001402589,0.00002740443,0.9564866,0.00004212715,0.002032435,0.04075527,0.0001754925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001578379,0.0001088676,0.9944226,0.0001216452,0.000008953584,0.0005078776,0.0000085747,0.000781836,0.00388177],"genre_scores_gemma":[0.4483756,0.00003947833,0.5502011,0.0001360177,0.0001009705,0.0007590847,0.0003161771,0.00003628357,0.0000353328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4482178,"threshold_uncertainty_score":0.5263994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132943005","doi":"10.1007/s10589-013-9543-x","title":"Stable local volatility function calibration using spline kernel","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Local volatility; Volatility (finance); Mathematics; Implied volatility; Mathematical optimization; Kernel method; Stochastic volatility; Support vector machine; Applied mathematics; Econometrics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02334521460479179,"gpt":0.2213314967004327,"spread":0.1979862820956409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009949245,0.0001231705,0.0001694906,0.0001142882,0.0003427177,0.0001198709,0.00008580412,0.00007900719,0.0003479501],"category_scores_gemma":[0.0000191632,0.0001489094,0.00003608716,0.0004314815,0.00009205032,0.0004212277,0.00003827972,0.0000780171,0.0001133472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005846924,"about_ca_system_score_gemma":0.00003766286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596813,"about_ca_topic_score_gemma":0.000002636069,"domain_scores_codex":[0.9989592,0.000004127452,0.0004760611,0.000362784,0.00005006883,0.0001477685],"domain_scores_gemma":[0.9992885,0.00005085041,0.0002354749,0.0001547519,0.0001755679,0.00009484027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002161582,0.00005386431,0.0004546356,0.00001046129,0.000007646797,1.541522e-8,0.00002077498,0.4235844,0.000005760288,0.574581,0.00007138638,0.001207972],"study_design_scores_gemma":[0.0001634092,0.000010116,0.002417753,0.000002727285,0.000005614002,0.000001720628,0.00002765144,0.6807022,0.000001877416,0.3155923,0.0009661615,0.0001084731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009773488,0.0003532978,0.9963179,0.0004748222,0.00004399892,0.0006456047,0.00008712197,0.00007729659,0.001022629],"genre_scores_gemma":[0.8661146,0.00001514831,0.1322351,0.0004329738,0.0001325457,0.0004926044,0.0004298146,0.00002166509,0.0001255954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8651372,"threshold_uncertainty_score":0.6072351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2924275034","doi":"10.1007/s10589-019-00088-8","title":"A parameterized Douglas–Rachford algorithm","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Parameterized complexity; Norm (philosophy); Algorithm; Operator norm; Applied mathematics; Pure mathematics; Hilbert space","retraction":null,"screen_n_in":null,"score":{"opus":0.006293102734178152,"gpt":0.2275084460021012,"spread":0.2212153432679231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001288571,0.0001381582,0.0001633353,0.0001904819,0.0002069554,0.0002597481,0.0003005594,0.00005765085,0.0002344244],"category_scores_gemma":[0.00001116719,0.0001393554,0.00006254332,0.0008157822,0.00003331118,0.0005184157,0.0001153287,0.00007503864,0.0001867019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002728112,"about_ca_system_score_gemma":0.00006951344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003725851,"about_ca_topic_score_gemma":2.168731e-7,"domain_scores_codex":[0.9988254,0.00004512038,0.0003051297,0.0004157326,0.0002648612,0.0001437015],"domain_scores_gemma":[0.999029,0.0001572782,0.0001474176,0.0002768587,0.0002782014,0.0001112002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000118159,0.00004998898,0.0001160023,0.000004346225,0.00002056874,1.282057e-7,0.00004178436,0.7904686,0.000003702656,0.1955536,0.00009533793,0.0136447],"study_design_scores_gemma":[0.0004842062,0.00001803446,0.0005319543,0.000003707122,0.00001065437,0.00000847581,0.00001420422,0.9794991,0.000005120214,0.01019854,0.009057274,0.0001687252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006888706,0.00005630471,0.9953239,0.001468498,0.00008325726,0.0004215105,0.0000131717,0.0001919068,0.00237258],"genre_scores_gemma":[0.02239282,0.00005032293,0.9748064,0.001253344,0.00006651029,0.0001551891,0.0003104004,0.00001205481,0.0009529357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1890305,"threshold_uncertainty_score":0.568275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987364022","doi":"10.1007/s10589-007-9157-2","title":"A stable primal–dual approach for linear programming under nondegeneracy assumptions","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Solver; Jacobian matrix and determinant; Interior point method; Applied mathematics; Linearization; Iterated function; Mathematical optimization; Simple (philosophy); Matrix (chemical analysis); Nonlinear system; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.07123505202571571,"gpt":0.3926121186801358,"spread":0.3213770666544201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000536125,0.0001845888,0.0001926197,0.0002388293,0.0006251376,0.00009940155,0.0001247169,0.0001044109,0.00006092775],"category_scores_gemma":[0.0001315106,0.000195923,0.0000625279,0.0006273824,0.0001241332,0.0002605131,0.00006491175,0.0001425001,0.000005011154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000958692,"about_ca_system_score_gemma":0.0001184412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001507592,"about_ca_topic_score_gemma":0.000001596385,"domain_scores_codex":[0.9983757,0.00003136014,0.0004856563,0.0004273394,0.0003430157,0.0003369185],"domain_scores_gemma":[0.9979329,0.000722986,0.0001894103,0.0002075314,0.0007624134,0.0001847646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001202328,0.0002461019,0.00002185272,0.00004812257,0.00002365842,1.231853e-7,0.00005654672,0.7811614,0.00001172931,0.213696,0.0001562779,0.004566163],"study_design_scores_gemma":[0.0008071708,0.00002939524,0.00005363468,0.000006749178,0.00002963963,0.00001265782,0.0002284841,0.9636126,0.00004849963,0.03000462,0.004941846,0.0002246863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008414064,0.00006955206,0.9962102,0.000276189,0.00002148389,0.002018863,0.00005864966,0.0002125631,0.001048391],"genre_scores_gemma":[0.006118626,0.00002192435,0.9904695,0.0001677627,0.0002046003,0.0009185309,0.001155522,0.0000546952,0.0008888884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1836914,"threshold_uncertainty_score":0.7989507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1648726702","doi":"10.1007/s10589-015-9779-8","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Semidefinite programming; Maximum cut; Eigenvalues and eigenvectors; Quadratic programming; Adjacency matrix; Graph partition; Combinatorics; Laplacian matrix; Vertex (graph theory); Quadratic equation; Mathematical optimization; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02330850243936596,"gpt":0.2572272012488267,"spread":0.2339186988094607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001377799,0.0001560054,0.0001407396,0.0001459399,0.0002094732,0.0001537973,0.00006449102,0.00008798767,0.000003873482],"category_scores_gemma":[0.00003125504,0.000170099,0.00002728208,0.0003430713,0.00006823007,0.0002250702,0.00001966765,0.00006885027,0.000003075233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004198962,"about_ca_system_score_gemma":0.00005205214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002122586,"about_ca_topic_score_gemma":0.000002390331,"domain_scores_codex":[0.9991293,0.00001965008,0.0003207537,0.0002343913,0.0001350647,0.0001608451],"domain_scores_gemma":[0.9992577,0.0001105419,0.00008615823,0.000103789,0.0002944063,0.0001474247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003580603,0.00004630533,0.0001670925,0.00008714847,0.00002231743,1.100149e-7,0.0004817412,0.9393222,0.000009079987,0.03102045,0.0008103662,0.02802957],"study_design_scores_gemma":[0.0004611123,0.00005740945,0.00003758018,0.00002427785,0.0000410676,0.00001287183,0.0002039368,0.9645697,0.00003105199,0.01119789,0.02314329,0.0002197767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002056299,0.0003723974,0.9960442,0.0001883607,0.00002255335,0.001757365,0.00002659024,0.0006107082,0.0007722166],"genre_scores_gemma":[0.09691165,0.00009280728,0.8991252,0.00007879864,0.00007337723,0.002765552,0.0008101478,0.00004517791,0.00009726897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09691896,"threshold_uncertainty_score":0.6936436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974846298","doi":"10.1007/s10589-012-9473-z","title":"Improved constraint consensus methods for seeking feasibility in nonlinear programs","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Solver; Mathematical optimization; Constraint (computer-aided design); Mathematics; Nonlinear system; Trust region; Set (abstract data type); Point (geometry); Quadratic equation; Simple (philosophy); Nonlinear programming; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1130099521493846,"gpt":0.4626816648866754,"spread":0.3496717127372908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008472591,0.0001473075,0.0002072244,0.0001427019,0.0001992156,0.00005253747,0.00009312929,0.00008611732,0.00003193068],"category_scores_gemma":[0.0004671989,0.0001544352,0.00004711861,0.0004413498,0.0001714909,0.0001315886,0.00005098895,0.0001262537,0.000001580845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009825622,"about_ca_system_score_gemma":0.00009340726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000180802,"about_ca_topic_score_gemma":0.000001848402,"domain_scores_codex":[0.9987025,0.0001205819,0.0004653291,0.0002915093,0.0001271051,0.0002929313],"domain_scores_gemma":[0.9977928,0.001285471,0.0001658916,0.0001728299,0.0004255944,0.0001574462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004128435,0.0009854097,0.002219823,0.0001627727,0.00003838821,1.33496e-7,0.0003990703,0.7278392,0.00008874415,0.1696769,0.00004728872,0.09850097],"study_design_scores_gemma":[0.0009025364,0.00002167195,0.0001318865,0.00001119958,0.00001259263,0.000009146724,0.0001683155,0.9662586,0.00002837262,0.03123105,0.001064941,0.0001596596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000271889,0.0001058767,0.9962714,0.0003990896,0.00003320447,0.002522701,0.0000344766,0.0001051889,0.0002562191],"genre_scores_gemma":[0.0157816,0.00001202334,0.982671,0.00008458867,0.00008351589,0.0009834191,0.0002795152,0.00002903855,0.00007526738],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2384194,"threshold_uncertainty_score":0.6297683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018727518","doi":"10.1007/s10589-013-9622-z","title":"Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convex conjugate; Conjugate residual method; Derivation of the conjugate gradient method; Conjugate; Piecewise; Convex function; Applied mathematics; Conjugate gradient method; Convex analysis; Regular polygon; Mathematical analysis; Convex optimization; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03456162899230268,"gpt":0.3328361232227529,"spread":0.2982744942304502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002846608,0.0001555029,0.0002141813,0.000116366,0.0004929622,0.00008274276,0.0001813446,0.00006287528,0.0003998589],"category_scores_gemma":[0.0002549022,0.0001267538,0.00005274341,0.0005980732,0.0002900303,0.0002205587,0.00009637104,0.0001577097,0.0000596052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003338121,"about_ca_system_score_gemma":0.0001140502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161721,"about_ca_topic_score_gemma":0.000001016487,"domain_scores_codex":[0.9984682,0.0001066463,0.0005682165,0.0002688069,0.0003955596,0.0001925919],"domain_scores_gemma":[0.9971254,0.00107326,0.0003000717,0.000261068,0.001128334,0.0001118786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003348095,0.00009524699,0.00006749238,0.00002758576,0.00003192766,8.607413e-8,0.000143585,0.9090293,0.00001957384,0.08740415,0.0005405613,0.002637142],"study_design_scores_gemma":[0.0004557841,0.00002157783,0.0002059246,0.00001349568,0.00002779447,0.000005027996,0.0002019112,0.9642524,0.00003624819,0.03367851,0.0009751669,0.0001262048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000830107,0.00006555042,0.9951525,0.001634134,0.00004109909,0.001252375,0.0000238326,0.0001026737,0.0008976902],"genre_scores_gemma":[0.3050472,0.00006036197,0.6930358,0.0003497936,0.0001642946,0.0005138278,0.0002128823,0.00004569525,0.0005701398],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3042171,"threshold_uncertainty_score":0.5168869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3212784844","doi":"10.1007/s10589-022-00364-0","title":"Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotone polygon; Regularization (linguistics); Stationary point; Minification; Property (philosophy); Quadratic equation; Applied mathematics; Rate of convergence; Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01663454718498633,"gpt":0.2905574431592843,"spread":0.273922895974298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005228565,0.0002097893,0.0002416106,0.0003542307,0.001418424,0.0002741908,0.0004772712,0.00005941599,0.000183557],"category_scores_gemma":[0.00005637888,0.0002395851,0.0001207523,0.001546495,0.00003563526,0.0004536021,0.0002632781,0.0001317078,0.000008289292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116113,"about_ca_system_score_gemma":0.0001946184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007538171,"about_ca_topic_score_gemma":0.000001391442,"domain_scores_codex":[0.9978499,0.0001692541,0.0005948857,0.000683255,0.0004531609,0.000249479],"domain_scores_gemma":[0.9980704,0.0004714885,0.0003882301,0.0002933905,0.0006326162,0.0001439022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000442957,0.00009676876,0.00005655328,0.00001775323,0.00003652662,9.694529e-8,0.0001871392,0.7620299,0.000009574956,0.2320284,0.0005697407,0.004963119],"study_design_scores_gemma":[0.0007187959,0.00005328545,0.0001417851,0.000003792579,0.00004107691,0.00001583555,0.0000719962,0.9517422,0.00001224242,0.01927316,0.02766252,0.0002633382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001178701,0.00009182021,0.992652,0.004840581,0.00008911147,0.001156504,0.0001034464,0.0002663555,0.0007883962],"genre_scores_gemma":[0.01253668,0.00002387202,0.9806944,0.001913449,0.0001123619,0.002262515,0.001702466,0.00002972174,0.0007245069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2127552,"threshold_uncertainty_score":0.9998816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969794772","doi":"10.1007/s10589-010-9380-0","title":"Heuristics for a project management problem with incompatibility and assignment costs","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Heuristics; Duration (music); Mathematical optimization; Tabu search; Set (abstract data type); Heuristic; Mathematics; Project management; Computer science; Operations research","retraction":null,"screen_n_in":null,"score":{"opus":0.03984032168552801,"gpt":0.3602183300798796,"spread":0.3203780083943515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007114173,0.0001213926,0.0001443112,0.0001742602,0.0003497833,0.0003013594,0.0001605815,0.00004492376,0.00001630073],"category_scores_gemma":[0.0001054091,0.00009424625,0.00002201538,0.0004356937,0.0001852567,0.0001242994,0.0000720652,0.00009611833,0.000002503679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002148715,"about_ca_system_score_gemma":0.00007485901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003138283,"about_ca_topic_score_gemma":0.000005501802,"domain_scores_codex":[0.9985495,0.00004166783,0.0003890645,0.000470073,0.0004240747,0.0001256674],"domain_scores_gemma":[0.9982709,0.0008121795,0.0001982954,0.0002155967,0.0004156791,0.00008735303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004550741,0.0001651524,0.006519174,0.00004138254,0.00003433878,4.332132e-7,0.0002869981,0.7630596,0.00002374854,0.173103,0.000433771,0.05628692],"study_design_scores_gemma":[0.0009012867,0.0000659563,0.004078362,0.00001240446,0.00002803023,0.00001904758,0.0004031566,0.9555837,0.00001221211,0.02813086,0.01057956,0.0001854489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005032935,0.00001211715,0.9894919,0.0005930385,0.00001734805,0.002127479,0.00005429497,0.00004547595,0.002625383],"genre_scores_gemma":[0.3406711,0.000004681659,0.658393,0.0001021505,0.0000319331,0.0005934407,0.00008122089,0.000008910976,0.0001135796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3356382,"threshold_uncertainty_score":0.384325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400689395","doi":"10.1007/s10589-024-00588-2","title":"Handling of constraints in multiobjective blackbox optimization","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; HEC Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Universidade Nova de Lisboa; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Multi-objective optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.00938289075054676,"gpt":0.2743808654560718,"spread":0.264997974705525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001815109,0.0001618736,0.0001855024,0.0004815898,0.0001184581,0.000143403,0.0002059219,0.00007583205,0.00003989352],"category_scores_gemma":[0.00005465812,0.0001776027,0.00004347371,0.001365329,0.0001899502,0.0007304815,0.0000867847,0.0001282083,0.000007467027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008631386,"about_ca_system_score_gemma":0.0001631142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003881094,"about_ca_topic_score_gemma":0.000001163339,"domain_scores_codex":[0.9986112,0.00005674944,0.0004533499,0.0005022061,0.0002193909,0.0001571716],"domain_scores_gemma":[0.9989195,0.0003393517,0.0001259714,0.0001812276,0.0003576821,0.00007619106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002160611,0.00006314383,0.00005241001,0.00002609847,0.00001325014,0.000001409401,0.0003483505,0.8804278,0.00001388897,0.1055948,0.000007356585,0.0134493],"study_design_scores_gemma":[0.0004477983,0.00001834538,0.000210743,0.00005908353,0.000007166189,0.00001730709,0.0000813668,0.9944283,0.00006615397,0.004377163,0.000117666,0.0001688854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004311254,0.0003536491,0.9973271,0.0003071495,0.00008479239,0.0006148139,0.00002427585,0.000205752,0.001039297],"genre_scores_gemma":[0.1854173,0.0001208673,0.8140333,0.00007942149,0.00003189167,0.0001548683,0.0001028051,0.00001698441,0.00004255158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1853742,"threshold_uncertainty_score":0.7242427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}