{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Nicholas I. M. Gould","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Philippe L. Toint","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355189,0.002584367,0.001739783,0.001334438,0.001098017,0.003032502,0.005774531,0.002454899,0.03423986],"category_scores_gemma":[0.01553816,0.002101523,0.002711503,0.001096121,0.002189339,0.004063946,0.004935823,0.004187017,0.00722292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007586296,"about_ca_system_score_gemma":0.00261027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002012941,"about_ca_topic_score_gemma":0.003603959,"domain_scores_codex":[0.9968002,0.001010776,0.0002861044,0.000412321,0.001133058,0.0003575923],"domain_scores_gemma":[0.9927291,0.004715532,0.0003144475,0.001219191,0.0007301682,0.0002915094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00254712,0.0006293716,0.0039699,0.001640475,0.0005153744,0.0008084035,0.0009418541,0.2660711,0.01414794,0.1850415,0.1102586,0.4134282],"study_design_scores_gemma":[0.0005495378,0.0001310979,0.0002747544,0.0001176549,0.000071662,0.0001628212,0.00006174093,0.8204925,0.009502192,0.1283058,0.0402349,0.00009529094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003577441,0.0001679431,0.9442099,0.0001532943,0.0001279584,0.0001094329,0.0003777125,0.04653558,0.00474081],"genre_scores_gemma":[0.124701,0.0002494872,0.8358855,0.0004187741,0.00009489687,0.0009496587,0.00161979,0.02871213,0.007368668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03423986,"threshold_uncertainty_score":0.1145437,"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","authors":[{"name":"Dimitris Bertsimas","is_ca":false},{"name":"Romy Shioda","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002291965,0.0009578409,0.001521025,0.0009416263,0.0007302803,0.001321994,0.00235376,0.002049954,0.009780379],"category_scores_gemma":[0.009713081,0.0006329124,0.0007778869,0.001461868,0.001056782,0.002156512,0.003405599,0.002459584,0.001876675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037938,"about_ca_system_score_gemma":0.002278154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002663803,"about_ca_topic_score_gemma":0.003333796,"domain_scores_codex":[0.999046,0.0003090341,0.00005259743,0.0001326771,0.000368492,0.00009112444],"domain_scores_gemma":[0.997034,0.00175211,0.0001501666,0.0003492611,0.0005922429,0.0001223089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000274926,0.0001691141,0.0006407892,0.0001969159,0.00008488174,0.00006406751,0.0001222271,0.5393988,0.002170397,0.1326758,0.01128273,0.3129194],"study_design_scores_gemma":[0.00006963903,0.00003055904,0.00007597166,0.00001465006,0.00001090991,0.00002985567,0.000009211979,0.9658535,0.0004948752,0.03152684,0.001876103,0.000007794476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001926102,0.00008295308,0.995554,0.0001506782,0.00004200952,0.0000380083,0.00004219575,0.0002263368,0.001937634],"genre_scores_gemma":[0.07663673,0.0001449988,0.9179668,0.0001961321,0.00007663976,0.0003725349,0.0002355988,0.0002398228,0.004130822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009780379,"threshold_uncertainty_score":0.0327186,"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","authors":[{"name":"Benoît Colson","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003228689,0.0008526475,0.00119854,0.000463427,0.0005109578,0.001423623,0.001403152,0.001547697,0.003434134],"category_scores_gemma":[0.01124774,0.0007378855,0.0009197876,0.0007071017,0.001186774,0.002161742,0.001612508,0.002713803,0.0009655129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006164787,"about_ca_system_score_gemma":0.001172037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005174519,"about_ca_topic_score_gemma":0.002533456,"domain_scores_codex":[0.9991367,0.0004527553,0.000040368,0.00008711233,0.0002432844,0.00003972279],"domain_scores_gemma":[0.9944183,0.003984385,0.0001544521,0.0003457071,0.0009668906,0.0001303257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003528686,0.0001772868,0.0005034915,0.000321426,0.00008291709,0.0001374196,0.0004012119,0.6736961,0.004659612,0.1191705,0.00316592,0.1973312],"study_design_scores_gemma":[0.00001253496,0.00003647487,0.00002439565,0.000009196453,0.00000684357,0.00002470851,0.000008264791,0.991352,0.00074209,0.006789902,0.0009856028,0.000008031378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002331394,0.0002038133,0.9965498,0.00006071961,0.00001873497,0.00001382729,0.000007429982,0.00008797313,0.0007261526],"genre_scores_gemma":[0.1299838,0.0006571963,0.8659523,0.00004626266,0.00005126351,0.0001095392,0.00004546575,0.0002393576,0.002914966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005174519,"threshold_uncertainty_score":0.01707518,"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","authors":[{"name":"Pietro Belotti","is_ca":false},{"name":"Pierre Bonami","is_ca":false},{"name":"Matteo Fischetti","is_ca":false},{"name":"Andrea Lodi","is_ca":true},{"name":"Michele Monaci","is_ca":false},{"name":"Amaya Nogales-Gómez","is_ca":false},{"name":"Domenico Salvagnin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01101746,0.002987708,0.002725654,0.002069606,0.00147241,0.0043484,0.003856807,0.002598825,0.007222588],"category_scores_gemma":[0.05226855,0.001581717,0.002029682,0.00464651,0.003495537,0.01059526,0.005860972,0.01060397,0.001431269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245529,"about_ca_system_score_gemma":0.001978184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001984281,"about_ca_topic_score_gemma":0.002093635,"domain_scores_codex":[0.993314,0.004189436,0.0003083127,0.0004871248,0.001299038,0.000402093],"domain_scores_gemma":[0.9734973,0.02222222,0.001209407,0.001204201,0.001298711,0.0005681677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000265784,0.0002245885,0.0008229361,0.0006635601,0.00009609291,0.000218963,0.0003303484,0.2208667,0.001546948,0.6565542,0.01119425,0.1072156],"study_design_scores_gemma":[0.0000303038,0.00004919444,0.0001000241,0.0001232679,0.00002704346,0.00004042316,0.00004053546,0.6378255,0.0005442211,0.3562378,0.004955631,0.00002596769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002521212,0.0006725392,0.9909772,0.0005279334,0.0002425363,0.00005259321,0.0000630636,0.0001007809,0.004842152],"genre_scores_gemma":[0.1101637,0.00226229,0.8764895,0.0008639575,0.0008145599,0.0004371712,0.0004549546,0.0006632346,0.007850639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01101746,"threshold_uncertainty_score":0.05826658,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Claudia Sagastizábal","is_ca":false},{"name":"M. V. Solodov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018236,0.001148863,0.002026328,0.001204818,0.000808896,0.001433257,0.001854972,0.002824822,0.007424215],"category_scores_gemma":[0.003545167,0.0009583986,0.001321396,0.001200212,0.001742956,0.002034778,0.003768977,0.00276971,0.002267773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006390714,"about_ca_system_score_gemma":0.001524982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001507556,"about_ca_topic_score_gemma":0.001937265,"domain_scores_codex":[0.999149,0.0003127148,0.00003493642,0.0001219288,0.0003345512,0.0000469396],"domain_scores_gemma":[0.9989936,0.0004360667,0.00006106992,0.0001170674,0.0002600877,0.0001321358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002275166,0.0002894699,0.0004438784,0.0006972473,0.000182403,0.0003376605,0.0003787834,0.3560691,0.01802622,0.3287474,0.01318999,0.2814105],"study_design_scores_gemma":[0.00002776641,0.0001025799,0.0000708859,0.00002693154,0.00002215364,0.000100285,0.00002566561,0.9406292,0.001608229,0.05010099,0.007261035,0.00002415081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007543585,0.00006613998,0.9984774,0.00005542965,0.00004873499,0.00001531696,0.000009587744,0.00006087983,0.0005120495],"genre_scores_gemma":[0.04198677,0.0003270238,0.949528,0.0001182712,0.000153359,0.0001582917,0.00007318059,0.0003013532,0.007353624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007424215,"threshold_uncertainty_score":0.02483642,"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","authors":[{"name":"Nicolas Loizou","is_ca":true},{"name":"Peter Richtárik","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003263012,0.001746168,0.001839419,0.001370671,0.0008950364,0.002364419,0.001639939,0.002990724,0.003983271],"category_scores_gemma":[0.01592976,0.0007475049,0.001011235,0.002890756,0.00302029,0.003639078,0.002345306,0.004955544,0.001435748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375346,"about_ca_system_score_gemma":0.002644965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004386762,"about_ca_topic_score_gemma":0.004196927,"domain_scores_codex":[0.9982734,0.0008129227,0.00009223101,0.0002154866,0.0005163687,0.00008958897],"domain_scores_gemma":[0.9974171,0.001447865,0.0002017204,0.0002720524,0.0004992285,0.0001619749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001077612,0.00009457194,0.0003872,0.0002940607,0.00007514485,0.00008530503,0.0001358386,0.1601732,0.001723599,0.7488347,0.0122076,0.07588104],"study_design_scores_gemma":[0.00001317172,0.00002685353,0.0001905938,0.00003322356,0.00001765017,0.00003627708,0.0000154061,0.7362049,0.0005806736,0.2555812,0.00727763,0.00002249134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00281172,0.002533095,0.9902812,0.0006309514,0.0004234188,0.00002820845,0.00006935365,0.0002205072,0.003001621],"genre_scores_gemma":[0.2095441,0.008262073,0.7348788,0.0007448133,0.002493819,0.0006131019,0.0006736057,0.00135728,0.04143241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004386762,"threshold_uncertainty_score":0.01725668,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"John E. Dennis","is_ca":false},{"name":"Sébastien Le Digabel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596243,0.0008734934,0.0008240321,0.0008667769,0.0004957089,0.0008996547,0.001075815,0.0009569862,0.005071982],"category_scores_gemma":[0.00484603,0.0005421098,0.0007029176,0.0006041753,0.001189786,0.001281729,0.002371235,0.001321461,0.0007448921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004268033,"about_ca_system_score_gemma":0.0005062449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00138532,"about_ca_topic_score_gemma":0.001616808,"domain_scores_codex":[0.9997389,0.0001440449,0.0000133136,0.00002827268,0.00005741761,0.00001803802],"domain_scores_gemma":[0.9990338,0.0006008825,0.00005621446,0.0001071543,0.0001378211,0.00006418533],"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.0001583017,0.0001015011,0.0008910646,0.000309645,0.0001095859,0.0001439507,0.0002580527,0.4112353,0.004701083,0.428941,0.008080374,0.1450701],"study_design_scores_gemma":[0.00002376079,0.00004168801,0.0001395968,0.00002113018,0.00001286722,0.00002677888,0.00002185155,0.9102957,0.0004159756,0.08581243,0.003177906,0.00001028749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01207239,0.0009175767,0.9754592,0.0002987618,0.00014743,0.00005725078,0.00005194229,0.0001221921,0.01087321],"genre_scores_gemma":[0.4242283,0.00160598,0.5477759,0.0004323684,0.0002200698,0.0007234686,0.0003119365,0.0005626169,0.02413945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005071982,"threshold_uncertainty_score":0.01696742,"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","authors":[{"name":"Alysson M. Costa","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Bernard Gendron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003134027,0.002457552,0.001456181,0.001595024,0.0007670219,0.002354414,0.00211906,0.00208275,0.006264797],"category_scores_gemma":[0.008454911,0.001113464,0.00122548,0.003053726,0.001358568,0.003695103,0.001537401,0.00382893,0.0007286901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002167417,"about_ca_system_score_gemma":0.001707178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003643798,"about_ca_topic_score_gemma":0.004249951,"domain_scores_codex":[0.9981518,0.0008490554,0.00008140564,0.0002455086,0.0005500381,0.0001220512],"domain_scores_gemma":[0.9971702,0.0018281,0.0002730145,0.0001732619,0.0004088213,0.0001466969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001742953,0.0001283463,0.0003642575,0.0003122517,0.00008212854,0.00008582546,0.0001129425,0.5322996,0.001886654,0.3695641,0.009133499,0.08585612],"study_design_scores_gemma":[0.00002018273,0.00006452552,0.0001665792,0.00004882278,0.00002468077,0.00004231832,0.00002777565,0.7463638,0.000677462,0.24704,0.005502448,0.0000213725],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005615289,0.001377965,0.9827088,0.0006809293,0.0001920807,0.00007368125,0.0002188467,0.00009195544,0.009040496],"genre_scores_gemma":[0.2937178,0.004729947,0.6729834,0.0007397322,0.0008199826,0.0007495534,0.0008440393,0.0002702924,0.02514522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006264797,"threshold_uncertainty_score":0.02095789,"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","authors":[{"name":"Ting Kei Pong","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637498,0.001162682,0.001812824,0.0005621869,0.0004086852,0.001875349,0.001429789,0.002229472,0.004937421],"category_scores_gemma":[0.008649843,0.0005864182,0.0007443634,0.0008686256,0.00158449,0.002250802,0.002357873,0.001957271,0.0007847086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008173223,"about_ca_system_score_gemma":0.001563982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940961,"about_ca_topic_score_gemma":0.001766498,"domain_scores_codex":[0.9985247,0.000716909,0.00004742876,0.0003308749,0.0002781897,0.0001019476],"domain_scores_gemma":[0.9968666,0.002087985,0.0002153406,0.0003082524,0.0003824247,0.000139354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002479591,0.00006852885,0.0004757812,0.0004402343,0.0001192875,0.0003377599,0.000115236,0.7781707,0.002450308,0.1326629,0.009483987,0.07542716],"study_design_scores_gemma":[0.00003065959,0.00003755269,0.00008694512,0.00001696189,0.00001434093,0.00008206911,0.00002264408,0.9405243,0.0005108548,0.0569586,0.001705294,0.000009731454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008606859,0.0003580048,0.9864319,0.0005290364,0.00007772575,0.00004590541,0.0001067007,0.00006881623,0.003775045],"genre_scores_gemma":[0.5571693,0.001319754,0.4218575,0.0004270359,0.0005111348,0.0004641726,0.0006399229,0.0003092303,0.01730198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004937421,"threshold_uncertainty_score":0.01651728,"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","authors":[{"name":"Levent Tunçel","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456891,0.001190793,0.001335972,0.001547013,0.001109262,0.003592515,0.001737743,0.001217165,0.005703254],"category_scores_gemma":[0.007820705,0.0006900596,0.001269191,0.001480911,0.003056513,0.006311529,0.003552136,0.006461962,0.0006460915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215699,"about_ca_system_score_gemma":0.00106614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007668458,"about_ca_topic_score_gemma":0.0009341261,"domain_scores_codex":[0.9988548,0.0005467509,0.0000533341,0.0001600173,0.0002893384,0.00009583253],"domain_scores_gemma":[0.9978523,0.001144154,0.0001775523,0.0002867265,0.0003065144,0.0002326463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000102601,0.00001209574,0.00003999197,0.00002031738,0.00000417194,0.000006586155,0.00003396804,0.001742113,0.000127635,0.9930503,0.0008342387,0.004118279],"study_design_scores_gemma":[0.00000354794,0.000006592025,0.00002253878,0.000007700269,0.000002625825,0.000009262132,0.00001201622,0.01363351,0.00006408509,0.9852324,0.001003021,0.000002869009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02612765,0.001128122,0.9391246,0.001900766,0.0001990879,0.00003509894,0.0002096554,0.0001511947,0.03112392],"genre_scores_gemma":[0.6925024,0.00223075,0.2724729,0.001028348,0.0009171379,0.0003296139,0.0008094119,0.0004729459,0.02923649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005703254,"threshold_uncertainty_score":0.01907927,"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","authors":[{"name":"Marius Posta","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Philippe Michelon","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191243,0.0009988811,0.001070656,0.0008365565,0.0006266721,0.0006226339,0.00188789,0.001294647,0.005755316],"category_scores_gemma":[0.003767801,0.0005821954,0.00104928,0.001324291,0.0009808864,0.001134476,0.001431684,0.00221116,0.001048362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004775499,"about_ca_system_score_gemma":0.00134992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005086162,"about_ca_topic_score_gemma":0.00510211,"domain_scores_codex":[0.9993613,0.0002571586,0.00001942773,0.00008031647,0.0002283896,0.00005345115],"domain_scores_gemma":[0.9992788,0.0004272549,0.00003689241,0.0001096413,0.0001212531,0.00002606406],"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.0000841859,0.0001039011,0.0002465185,0.0002091044,0.00007271979,0.00009156498,0.00008857618,0.6519021,0.003114994,0.1440837,0.006070166,0.1939324],"study_design_scores_gemma":[0.00002571781,0.00002822215,0.00005482292,0.00001323179,0.00001108611,0.00002453676,0.000009640657,0.9683087,0.0004199183,0.02808221,0.00301112,0.00001077976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001299335,0.00008274531,0.9968711,0.00004758978,0.00007166619,0.00002179403,0.00002180299,0.00009105119,0.001493043],"genre_scores_gemma":[0.05260975,0.0002229641,0.9421155,0.0001394997,0.0001017682,0.0002423784,0.0001032314,0.0001872032,0.004277726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005755316,"threshold_uncertainty_score":0.01925343,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Julie Nutini","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215558,0.0008860573,0.001750349,0.0008910381,0.0006018718,0.001170594,0.002223081,0.001979475,0.004699744],"category_scores_gemma":[0.007198816,0.0007432083,0.00072837,0.001020514,0.0009025404,0.001385616,0.001939241,0.002434899,0.001395855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007585536,"about_ca_system_score_gemma":0.001795429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003266435,"about_ca_topic_score_gemma":0.004773682,"domain_scores_codex":[0.9992199,0.0002298524,0.00004183764,0.00008939922,0.0003740856,0.00004485746],"domain_scores_gemma":[0.9983052,0.0009194949,0.00006389487,0.0001942339,0.0003999589,0.0001172009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005121758,0.000275443,0.0006836821,0.0002744297,0.0001247393,0.000136653,0.0001509571,0.5156437,0.009262834,0.07000054,0.007684957,0.39525],"study_design_scores_gemma":[0.00003319477,0.00003330452,0.00004848058,0.000008470792,0.000007012722,0.00002760244,0.000004468871,0.9916881,0.0006261623,0.006404208,0.001111769,0.000007224394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002560786,0.0001233071,0.9959921,0.00007161051,0.00006257487,0.00004441066,0.00002071478,0.0002093975,0.0009151393],"genre_scores_gemma":[0.07945072,0.0001616145,0.915409,0.0001469679,0.00009458398,0.0003037456,0.000163071,0.0002318719,0.004038505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004699744,"threshold_uncertainty_score":0.01572222,"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","authors":[{"name":"Mengwei Xu","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083414,0.0008243934,0.001437376,0.0006754629,0.0006190339,0.001080805,0.001316528,0.001385388,0.004046075],"category_scores_gemma":[0.003010276,0.0007409359,0.0009826182,0.001210507,0.0009844857,0.001172731,0.001726922,0.002082568,0.000916652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004140968,"about_ca_system_score_gemma":0.001429332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003167257,"about_ca_topic_score_gemma":0.005007406,"domain_scores_codex":[0.9996099,0.0001333445,0.00002285433,0.0000458608,0.0001594553,0.00002863484],"domain_scores_gemma":[0.9990433,0.0005221842,0.00006499657,0.0001314695,0.0001742453,0.00006373287],"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.0001153419,0.0001119532,0.0003990498,0.0002126519,0.00009029303,0.00009543178,0.0001190586,0.7238091,0.005515556,0.1282799,0.003696166,0.1375555],"study_design_scores_gemma":[0.00000689124,0.00001355114,0.00002600749,0.000004890309,0.000004664644,0.000007584833,0.000003625757,0.9869089,0.000245596,0.01149529,0.001277248,0.000005866406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002556305,0.00006583516,0.9960181,0.00004324188,0.0000389385,0.00001813033,0.00002204543,0.0001609931,0.001076337],"genre_scores_gemma":[0.1126675,0.0002253724,0.8794926,0.00009581935,0.00007636077,0.0002090834,0.0001696482,0.000333067,0.006730617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004046075,"threshold_uncertainty_score":0.0135355,"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","authors":[{"name":"Romy Shioda","is_ca":false},{"name":"Levent Tunçel","is_ca":true},{"name":"Tor G. J. Myklebust","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643664,0.001035954,0.001844274,0.0008883795,0.0006842669,0.002728889,0.003623305,0.001775581,0.005002424],"category_scores_gemma":[0.01103945,0.001141839,0.001188293,0.002406468,0.00140731,0.005562516,0.001410956,0.003122042,0.0007236335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514697,"about_ca_system_score_gemma":0.001374389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003347352,"about_ca_topic_score_gemma":0.002651238,"domain_scores_codex":[0.9989192,0.0006327322,0.00003173606,0.0001124163,0.000213751,0.00009011924],"domain_scores_gemma":[0.9966584,0.002467172,0.0001427904,0.0003313793,0.000309314,0.00009090042],"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.00009478657,0.00008406094,0.0001487519,0.00005986894,0.00002672286,0.00002038256,0.0000401135,0.8196425,0.0002141582,0.1460747,0.001743013,0.03185093],"study_design_scores_gemma":[0.00000564363,0.000005254224,0.0000146296,0.000003571368,0.000003101805,0.000004157338,0.000002515411,0.975646,0.00006095894,0.024041,0.0002096926,0.000003461165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01026592,0.0007416578,0.9841816,0.0003198024,0.0000976582,0.00003060709,0.00003626362,0.0002076357,0.004118791],"genre_scores_gemma":[0.6244737,0.001653501,0.3617107,0.000177364,0.0003288872,0.000194312,0.0002298398,0.0002702875,0.01096145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005002424,"threshold_uncertainty_score":0.01673472,"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","authors":[{"name":"Michael J. Best","is_ca":true},{"name":"Jaroslava Hlouskova","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002338127,0.000717167,0.001225227,0.001123067,0.0003923959,0.002965912,0.0009203689,0.001655106,0.007510432],"category_scores_gemma":[0.02282267,0.0005103788,0.0005076484,0.002011224,0.001327826,0.004125704,0.0009880004,0.00174522,0.0005455293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001254933,"about_ca_system_score_gemma":0.0007373513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001124865,"about_ca_topic_score_gemma":0.0008921794,"domain_scores_codex":[0.9986578,0.0007573768,0.00005028064,0.0001549044,0.0002906699,0.00008891101],"domain_scores_gemma":[0.9895777,0.008362175,0.0007332693,0.0004895165,0.0005716548,0.0002657803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000911208,0.00004825785,0.001561379,0.00009667142,0.00007788551,0.0001006636,0.00004728358,0.379007,0.0002679589,0.5738003,0.003631975,0.0412696],"study_design_scores_gemma":[0.00001484386,0.0000198636,0.0006079324,0.00002619148,0.00002208758,0.0000580447,0.00001991145,0.4746797,0.0001826723,0.5220705,0.002288662,0.000009564255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1483948,0.01285495,0.7920521,0.006133156,0.0004333901,0.00005532251,0.0002205297,0.0001441119,0.03971163],"genre_scores_gemma":[0.9372154,0.004136318,0.03700829,0.0001885179,0.0004306925,0.00008582493,0.0001946275,0.0000764431,0.02066382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007510432,"threshold_uncertainty_score":0.02512485,"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","authors":[{"name":"M. C. Bartholomew‐Biggs","is_ca":false},{"name":"Bruce Christianson","is_ca":false},{"name":"Ming J. Zuo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414726,0.0008421635,0.001145529,0.0006469662,0.0003145312,0.001035935,0.00131388,0.00156803,0.004006448],"category_scores_gemma":[0.002849931,0.0007231864,0.0007995482,0.0006770206,0.0005362212,0.001046401,0.0005573632,0.000947848,0.0004163643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110988,"about_ca_system_score_gemma":0.001090443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004306784,"about_ca_topic_score_gemma":0.003829928,"domain_scores_codex":[0.9997001,0.00009564007,0.000009498312,0.00007359812,0.00007572804,0.00004547886],"domain_scores_gemma":[0.9992476,0.0004619519,0.00008918956,0.00008652615,0.00008069009,0.00003415604],"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.00001338963,0.00001498191,0.00009015838,0.00001456674,0.000008049819,0.00001013207,0.000005525083,0.9877281,0.000121828,0.007453178,0.0004703978,0.004069644],"study_design_scores_gemma":[0.000003901941,0.000005503889,0.00003782073,0.000002297774,0.00000472521,0.000003868277,0.000001558079,0.9951485,0.00007209645,0.004508577,0.0002097691,0.000001398805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1135255,0.00158888,0.8543527,0.001293341,0.000202583,0.0000927812,0.0006040766,0.0007685669,0.02757158],"genre_scores_gemma":[0.927689,0.0005996082,0.05769764,0.0001191912,0.00008917328,0.0001602744,0.0004206429,0.0001543869,0.01307021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004306784,"threshold_uncertainty_score":0.01340288,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726297,0.0005863098,0.0009955093,0.0005537196,0.001132263,0.001078066,0.00149311,0.002243012,0.01142927],"category_scores_gemma":[0.002274737,0.0006315894,0.0008474297,0.0005825146,0.0008466286,0.0008751412,0.001344693,0.001290657,0.001500056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009442425,"about_ca_system_score_gemma":0.00231723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005751165,"about_ca_topic_score_gemma":0.008506894,"domain_scores_codex":[0.9997092,0.00007025264,0.00001098539,0.00004625075,0.000113086,0.00005024916],"domain_scores_gemma":[0.999477,0.00029366,0.00002795154,0.00005769487,0.0001021579,0.00004157009],"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.00007925148,0.00006945066,0.0004431642,0.00009662687,0.00004650999,0.0001487292,0.00008504129,0.9094204,0.00314687,0.04712066,0.002354149,0.03698919],"study_design_scores_gemma":[0.00002167208,0.00001414358,0.00002972826,0.000005165504,0.00000543349,0.00001177776,0.00001734856,0.9926201,0.000471016,0.0056387,0.001159553,0.000005334789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03004096,0.0001123283,0.9457898,0.0004065382,0.0001402638,0.0001861073,0.0001081232,0.0008757787,0.02234017],"genre_scores_gemma":[0.2425337,0.00008234855,0.7473279,0.0001998706,0.00004324978,0.0003338926,0.0001350598,0.0003240183,0.00901989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01142927,"threshold_uncertainty_score":0.03823477,"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)","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Christophe Tribes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296003,0.0006322321,0.0009594566,0.0007852385,0.000518603,0.0007557037,0.001581784,0.001647793,0.006006191],"category_scores_gemma":[0.00295641,0.0003761504,0.0007287762,0.00106507,0.0004713532,0.0008741436,0.001108892,0.001410301,0.001540304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005631265,"about_ca_system_score_gemma":0.001114553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005634148,"about_ca_topic_score_gemma":0.005432593,"domain_scores_codex":[0.9995725,0.0001421139,0.00002413633,0.00004205842,0.0001948832,0.00002437105],"domain_scores_gemma":[0.9993005,0.0003706073,0.00003219804,0.00007224565,0.0002016956,0.00002285292],"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.0001395852,0.00008333337,0.0004232526,0.0002916004,0.00008837091,0.00008166265,0.00009391034,0.7106813,0.007052522,0.04453481,0.007645044,0.2288846],"study_design_scores_gemma":[0.000006455401,0.000007739098,0.00004134186,0.000008076836,0.00000375874,0.000009312815,0.000003779693,0.9927449,0.0005636194,0.004373206,0.002233764,0.000004113615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001520977,0.0001680225,0.9954258,0.00005772614,0.00004346992,0.00002199445,0.000038039,0.0001478904,0.002576153],"genre_scores_gemma":[0.07949173,0.0003091709,0.9144936,0.0000967965,0.00004995408,0.0002622694,0.0002433264,0.0002230426,0.004830071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006006191,"threshold_uncertainty_score":0.02009267,"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","authors":[{"name":"Yves Lucet","is_ca":true},{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Mike Trienis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991612,0.00118358,0.001385027,0.0006307548,0.0004196081,0.0014629,0.002285108,0.001370995,0.005621838],"category_scores_gemma":[0.01022442,0.0007260155,0.0008676978,0.001744077,0.001374685,0.002496317,0.002193235,0.004270164,0.001710932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123869,"about_ca_system_score_gemma":0.0010881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003278323,"about_ca_topic_score_gemma":0.002860356,"domain_scores_codex":[0.9988536,0.0006093797,0.00004377138,0.000143881,0.0002863757,0.00006300086],"domain_scores_gemma":[0.9969968,0.001965912,0.0001577539,0.0003860769,0.0003476727,0.0001458819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006280158,0.0000331259,0.0002409596,0.0002307119,0.00005449541,0.00005874723,0.00004808941,0.5408897,0.0009033153,0.410688,0.007463351,0.03932672],"study_design_scores_gemma":[0.00000407617,0.000009424977,0.00003093748,0.000006194824,0.000004928217,0.00001067819,0.000003899582,0.910771,0.0000909357,0.08753119,0.001532541,0.000004071089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009549551,0.0004110688,0.9970216,0.0003019077,0.00004555129,0.00001006832,0.0000613826,0.00008045447,0.001113084],"genre_scores_gemma":[0.3407569,0.003720649,0.6285774,0.0006692396,0.0006029693,0.0005309352,0.0009795203,0.0006899927,0.02347242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005621838,"threshold_uncertainty_score":0.01880693,"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)","authors":[{"name":"Paul Armand","is_ca":false},{"name":"Joël Benoist","is_ca":false},{"name":"Dominique Orban","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003082763,0.001170806,0.001351665,0.0006989441,0.0006344098,0.002134266,0.001889354,0.002037267,0.004118643],"category_scores_gemma":[0.01999647,0.001075481,0.0003820726,0.0007321551,0.00165047,0.003290031,0.002450853,0.004217129,0.0009232677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000823932,"about_ca_system_score_gemma":0.001322309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369245,"about_ca_topic_score_gemma":0.001616503,"domain_scores_codex":[0.999189,0.0004773473,0.00003396827,0.00007316386,0.0001722874,0.00005438099],"domain_scores_gemma":[0.9961488,0.002623724,0.0002379961,0.0003220094,0.0005085947,0.0001589053],"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.0004733636,0.0002016575,0.0005542064,0.0003413288,0.00007049469,0.000117335,0.0002060948,0.6262041,0.004246267,0.2738016,0.005882092,0.08790141],"study_design_scores_gemma":[0.00003215302,0.00002123795,0.00003882773,0.00002046919,0.000005864968,0.00001731078,0.00001094853,0.974192,0.0005954034,0.0238189,0.001237332,0.000009536693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009731409,0.000619463,0.9860752,0.0004556632,0.0002039638,0.00003569999,0.00003253405,0.0001967454,0.002649221],"genre_scores_gemma":[0.5168874,0.0009868646,0.4721883,0.0003581087,0.0002308804,0.0003961032,0.000157672,0.000792466,0.008002249],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004118643,"threshold_uncertainty_score":0.01630342,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Kwassi Joseph Dzahini","is_ca":true},{"name":"Michael Kokkolaras","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749641,0.0009735674,0.002150409,0.001200226,0.0006363367,0.001422385,0.001717443,0.002302674,0.003990265],"category_scores_gemma":[0.01076826,0.001232644,0.0009720594,0.0009938926,0.001443508,0.00157016,0.002168152,0.001731016,0.0005215115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001230769,"about_ca_system_score_gemma":0.001601816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004248273,"about_ca_topic_score_gemma":0.004015544,"domain_scores_codex":[0.9992663,0.0003946965,0.00002584562,0.00007966555,0.0001826358,0.00005079623],"domain_scores_gemma":[0.9945628,0.004446123,0.0002991701,0.0001908554,0.0003744164,0.0001266719],"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.00004149922,0.00002135681,0.0001161734,0.00004029767,0.00002917026,0.00001627073,0.00001251649,0.9796723,0.0002472893,0.01380696,0.000333293,0.005662845],"study_design_scores_gemma":[0.000003857946,0.00000309203,0.000008462597,0.000002578627,0.000001347934,0.000001088192,8.071144e-7,0.9979366,0.00003199656,0.001951741,0.00005753211,0.000001024539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006847608,0.0002149267,0.9898731,0.0001651565,0.00005655708,0.0000401083,0.00003229367,0.0001320787,0.00263818],"genre_scores_gemma":[0.5487754,0.0004489881,0.4412422,0.0002434418,0.000141997,0.0006178655,0.0002113413,0.0003394756,0.007979165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004248273,"threshold_uncertainty_score":0.01454163,"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","authors":[{"name":"Yakui Huang","is_ca":false},{"name":"Hongwei Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001633766,0.001048523,0.001454064,0.0005662377,0.0004060814,0.001050377,0.001465505,0.001953514,0.004913718],"category_scores_gemma":[0.00451667,0.0007491462,0.0007589875,0.0008749127,0.001066729,0.0012951,0.001474448,0.001833469,0.001344634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005144954,"about_ca_system_score_gemma":0.001235174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002710526,"about_ca_topic_score_gemma":0.003466026,"domain_scores_codex":[0.9995103,0.0002159603,0.00002877088,0.0000840298,0.000134548,0.00002648509],"domain_scores_gemma":[0.998704,0.0008813677,0.0000831812,0.0001145534,0.0001711762,0.00004571854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003146395,0.00009814264,0.0005050012,0.0008008,0.0001956615,0.0001656815,0.0001978566,0.6430733,0.0151228,0.1690267,0.01117753,0.1593218],"study_design_scores_gemma":[0.00001140471,0.00001727734,0.00005198159,0.00001332524,0.000007114781,0.00001679362,0.000006019268,0.9858957,0.0007247956,0.01101707,0.002226012,0.00001257995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00167573,0.0003551036,0.9966916,0.0001084419,0.00005688218,0.00001557129,0.00003636299,0.00009673576,0.0009635913],"genre_scores_gemma":[0.09173824,0.001095204,0.8915283,0.0002219379,0.0001474023,0.0003259193,0.0003312009,0.0004443812,0.01416753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004913718,"threshold_uncertainty_score":0.01643801,"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","authors":[{"name":"Maziar Salahi","is_ca":false},{"name":"Akram Taati","is_ca":false},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003968744,0.001705224,0.002298869,0.0009075907,0.0006004511,0.001645002,0.002230806,0.002662318,0.00283859],"category_scores_gemma":[0.02190658,0.0009332479,0.0009914486,0.0007846334,0.002289315,0.00214927,0.003336198,0.002608095,0.0005847051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009451358,"about_ca_system_score_gemma":0.00122693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002779505,"about_ca_topic_score_gemma":0.002475055,"domain_scores_codex":[0.998887,0.0006381524,0.00004979185,0.0001350265,0.0002218967,0.00006823936],"domain_scores_gemma":[0.9913202,0.007002497,0.0004763064,0.0003275875,0.0005965161,0.0002768502],"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.0001078904,0.00004452156,0.0002482252,0.0001331932,0.00004171515,0.0000627499,0.00009281647,0.9685329,0.0007294826,0.01901553,0.0007267738,0.01026427],"study_design_scores_gemma":[0.00000600324,0.00001310325,0.00001369529,0.000004999351,0.000002429607,0.000004202291,0.000005035766,0.996342,0.00009110055,0.003434836,0.00008020389,0.000002411371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008288935,0.0001961629,0.9900591,0.0001298616,0.00002325046,0.0000470734,0.00002010598,0.00008417246,0.001151452],"genre_scores_gemma":[0.5606595,0.0004596822,0.4313622,0.0001848168,0.0001166197,0.0009138288,0.0002478007,0.00038221,0.005673408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003968744,"threshold_uncertainty_score":0.020989,"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","authors":[{"name":"Romy Shioda","is_ca":true},{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003603459,0.001366461,0.003326476,0.003660991,0.001357531,0.003127837,0.003738234,0.003499096,0.004096089],"category_scores_gemma":[0.01917634,0.001660776,0.001694676,0.002899618,0.002352078,0.003643081,0.004123306,0.002375381,0.001410851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001905505,"about_ca_system_score_gemma":0.001197855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003874139,"about_ca_topic_score_gemma":0.002552198,"domain_scores_codex":[0.9975013,0.001336506,0.0001034067,0.0003865081,0.0005586077,0.0001136075],"domain_scores_gemma":[0.9918478,0.005427526,0.0006202998,0.0008266784,0.0009957082,0.0002821251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001830132,0.00003499413,0.0004120633,0.0002767523,0.0001170986,0.00005684767,0.0002311774,0.7066501,0.001782009,0.2134186,0.0065514,0.07028594],"study_design_scores_gemma":[0.00001271746,0.00001137903,0.00008103969,0.00002056414,0.000007351758,0.00003061398,0.00001806664,0.8895091,0.0003593545,0.108814,0.001118353,0.00001734472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006046833,0.0004761173,0.9909157,0.0002630222,0.00004028963,0.00005724455,0.0001010988,0.0002406188,0.001858947],"genre_scores_gemma":[0.3130257,0.001115638,0.676064,0.000330536,0.000204301,0.0005007773,0.0008991394,0.0007222855,0.00713758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004096089,"threshold_uncertainty_score":0.01905715,"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","authors":[{"name":"Michael Chen","is_ca":true},{"name":"Sanjay Mehrotra","is_ca":false},{"name":"Dávid Papp","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001758257,0.0006519337,0.001225603,0.0008082603,0.0004255705,0.0008449575,0.001370025,0.001026264,0.004466115],"category_scores_gemma":[0.006727468,0.0007314751,0.0009541502,0.001115104,0.0008278121,0.001541785,0.001804383,0.001442133,0.0005561602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005974285,"about_ca_system_score_gemma":0.001050697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002891574,"about_ca_topic_score_gemma":0.002850915,"domain_scores_codex":[0.9992892,0.0004173747,0.00002493849,0.00006198752,0.0001568373,0.00004968223],"domain_scores_gemma":[0.9969338,0.002330297,0.0001768839,0.0002063094,0.0002428844,0.000109758],"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.00004236435,0.00001724415,0.0001822125,0.00003831515,0.0000222394,0.00003844068,0.00001895002,0.9465852,0.0003052856,0.04320983,0.0007642915,0.008775529],"study_design_scores_gemma":[0.000006319477,0.000004393358,0.00001487452,0.000002146779,0.000001179173,0.000004575154,0.000002119424,0.9866359,0.00003656748,0.01312874,0.0001613339,0.000001905303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004753843,0.000074793,0.9933993,0.0001161833,0.00002761001,0.00003334808,0.00007300053,0.00009389791,0.001428151],"genre_scores_gemma":[0.5494677,0.0004210835,0.4452894,0.0001801109,0.00009484157,0.0005449465,0.0006654689,0.0002443678,0.003092204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004466115,"threshold_uncertainty_score":0.01494062,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Mathilde Peyrega","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002768378,0.001121153,0.001685162,0.0008336008,0.0007647193,0.00306405,0.001686989,0.001488699,0.01811569],"category_scores_gemma":[0.01423412,0.0005937645,0.0006906202,0.001414117,0.002581897,0.00527923,0.003183997,0.002712741,0.001737036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186678,"about_ca_system_score_gemma":0.0008107839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100588,"about_ca_topic_score_gemma":0.000869986,"domain_scores_codex":[0.9982483,0.0009260058,0.0000566424,0.0002630169,0.0003679205,0.000138015],"domain_scores_gemma":[0.9965852,0.002497877,0.0001859818,0.0003328937,0.0002353027,0.0001626751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007089346,0.00004804519,0.0001043135,0.0001037557,0.00002984076,0.00003710132,0.00005437322,0.0838751,0.0003657347,0.8818545,0.00513362,0.02832264],"study_design_scores_gemma":[0.00001466754,0.00001680364,0.00003693255,0.00001881649,0.000009667776,0.00001635538,0.00001221811,0.3401576,0.0003911523,0.6570961,0.002223232,0.000006416886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01910017,0.001347072,0.9380608,0.001357077,0.0004770056,0.00004881436,0.0001086883,0.0002768649,0.0392235],"genre_scores_gemma":[0.7285581,0.001954296,0.1750681,0.0009734425,0.000888972,0.0003418268,0.0002821964,0.0009035673,0.09102947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01811569,"threshold_uncertainty_score":0.06060302,"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","authors":[{"name":"François Gilbert","is_ca":true},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590631,0.0009895142,0.001787985,0.001155678,0.0007513436,0.003136246,0.003101485,0.002493675,0.0274159],"category_scores_gemma":[0.01263375,0.0008629761,0.001294857,0.001848343,0.00113122,0.00522756,0.00177124,0.002158769,0.001632338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001975792,"about_ca_system_score_gemma":0.00135171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004893962,"about_ca_topic_score_gemma":0.007393538,"domain_scores_codex":[0.9979662,0.001327522,0.00004901161,0.0002197277,0.0002575058,0.000180047],"domain_scores_gemma":[0.9963296,0.002715153,0.0001671734,0.0003133498,0.0002853572,0.0001892343],"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.0002010446,0.0002012218,0.001002396,0.0001056813,0.00007574635,0.0001202454,0.00004802849,0.4870298,0.0001709111,0.4707979,0.009208302,0.03103876],"study_design_scores_gemma":[0.00002099752,0.00001600332,0.00009865899,0.000007328767,0.00001289423,0.00002808198,0.000015537,0.8793797,0.00005737067,0.1190911,0.001264331,0.000007958739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05772545,0.0007749365,0.8955576,0.003109819,0.0003310141,0.0002314865,0.001212267,0.0005662354,0.04049113],"genre_scores_gemma":[0.8504625,0.0006597072,0.09926032,0.0003300896,0.0002715237,0.0004377592,0.0006120731,0.0001532052,0.04781283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0274159,"threshold_uncertainty_score":0.09171534,"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","authors":[{"name":"Jean Bigeon","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Ludovic Salomon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051997,0.001210127,0.001557164,0.00101973,0.0006723057,0.001058292,0.002040064,0.002120629,0.01217685],"category_scores_gemma":[0.003311639,0.0006900596,0.0009196229,0.0009798463,0.0006140507,0.0009130752,0.002307443,0.002097788,0.002186601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006717562,"about_ca_system_score_gemma":0.001170329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317473,"about_ca_topic_score_gemma":0.004123377,"domain_scores_codex":[0.9994956,0.0001846783,0.00001752803,0.0000640241,0.0001856263,0.00005252349],"domain_scores_gemma":[0.9990749,0.0005519617,0.00005149598,0.0001176264,0.0001432232,0.00006077242],"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.0002821243,0.0001862108,0.0004559393,0.0003013968,0.0001521124,0.00008506681,0.00009064284,0.7484332,0.005149997,0.02226987,0.01132508,0.2112683],"study_design_scores_gemma":[0.00002460836,0.00001733418,0.00002819874,0.00001061274,0.00000452015,0.000009092692,0.000004732353,0.9947699,0.0006858486,0.002983791,0.00145774,0.000003663001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004938494,0.0002492152,0.9867401,0.0001268238,0.0001226978,0.00006852498,0.000132826,0.002597384,0.005023886],"genre_scores_gemma":[0.1176823,0.0001429976,0.8746829,0.0003088008,0.00005294614,0.0004766194,0.0003063876,0.0009322131,0.005414862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01217685,"threshold_uncertainty_score":0.0407356,"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","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Dingju Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001171282,0.001191941,0.00136564,0.0009108463,0.0007481648,0.001139835,0.001720853,0.001812615,0.007209078],"category_scores_gemma":[0.001752758,0.0008788339,0.001327779,0.001086193,0.0008980086,0.001118814,0.001656973,0.00308757,0.001085616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005198506,"about_ca_system_score_gemma":0.0009472399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002216709,"about_ca_topic_score_gemma":0.002825133,"domain_scores_codex":[0.9995309,0.0001237711,0.00002372446,0.00007480515,0.0002081674,0.00003860184],"domain_scores_gemma":[0.9996131,0.0002049692,0.00003138943,0.00004508497,0.00008090813,0.00002455883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002315661,0.0002522915,0.0004622063,0.0004070563,0.0001533205,0.0001583368,0.0001766329,0.3779835,0.01613699,0.2328307,0.007374563,0.3638327],"study_design_scores_gemma":[0.00002848584,0.00006882777,0.0001221611,0.00002060346,0.00002014347,0.00004498944,0.00001310743,0.9623045,0.001070296,0.03075531,0.005537325,0.00001429675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001629034,0.0001039429,0.9964092,0.00004638136,0.00005703737,0.00002965849,0.00003092609,0.0000678597,0.00162594],"genre_scores_gemma":[0.04413477,0.0002869846,0.9502739,0.0001193832,0.00007327853,0.0002568687,0.0001574739,0.0001375748,0.004559792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007209078,"threshold_uncertainty_score":0.02411681,"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","authors":[{"name":"Stefan Gollowitzer","is_ca":false},{"name":"Bernard Gendron","is_ca":true},{"name":"Ivana Ljubić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095323,0.001013161,0.001130669,0.001063857,0.0006361463,0.001133245,0.001884481,0.001987565,0.00749848],"category_scores_gemma":[0.002236864,0.0008553939,0.001021864,0.001903043,0.0005846262,0.001103626,0.001370021,0.002338004,0.001215239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007397707,"about_ca_system_score_gemma":0.001444165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005991849,"about_ca_topic_score_gemma":0.005228537,"domain_scores_codex":[0.9996644,0.00007577244,0.00001485347,0.0000600878,0.0001441327,0.0000407763],"domain_scores_gemma":[0.9993364,0.0003692556,0.00004460341,0.000053765,0.0001584834,0.00003750865],"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.0001389928,0.0002002065,0.0003961066,0.0001084125,0.00005803987,0.00008720964,0.00008518529,0.6817281,0.003052849,0.03230688,0.006277038,0.275561],"study_design_scores_gemma":[0.00003363411,0.00003599426,0.00007146879,0.00001148514,0.00001041411,0.00002621154,0.00001147841,0.9875788,0.0004921706,0.009718505,0.002002415,0.000007420315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004674876,0.00008236492,0.992348,0.00007697431,0.00004171178,0.0000496504,0.00006011092,0.0002278591,0.002438514],"genre_scores_gemma":[0.05799975,0.0001702041,0.9379981,0.00008581235,0.00003820555,0.0002530767,0.0003042814,0.0001335305,0.003017077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00749848,"threshold_uncertainty_score":0.02508491,"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","authors":[{"name":"Zhi‐Quan Luo","is_ca":true},{"name":"Jie Sun","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164132,0.00101419,0.001341889,0.001335,0.0007301989,0.001557935,0.002179387,0.001709195,0.00774025],"category_scores_gemma":[0.0051659,0.0009024724,0.001402377,0.001700952,0.001068217,0.00150904,0.002614451,0.004075406,0.001307557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024753,"about_ca_system_score_gemma":0.001612254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003284077,"about_ca_topic_score_gemma":0.003675471,"domain_scores_codex":[0.9992068,0.0001743473,0.00003935043,0.0001688846,0.0003261499,0.00008452479],"domain_scores_gemma":[0.9982573,0.00108534,0.00009559024,0.0002067228,0.000279836,0.00007515963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002588733,0.0002458827,0.0006832762,0.0002204639,0.00007424862,0.0001153558,0.0002328319,0.3169681,0.006837622,0.1394722,0.01014144,0.5247497],"study_design_scores_gemma":[0.00004813532,0.00005112683,0.0001147662,0.00001328484,0.00001166848,0.00003624225,0.00002426646,0.9644319,0.001246894,0.03116118,0.002849958,0.00001064642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003653321,0.00005106901,0.9940328,0.00008562838,0.00002408906,0.00004265445,0.00002867443,0.0002205333,0.001861193],"genre_scores_gemma":[0.07338588,0.0001037058,0.9228226,0.00007545373,0.00004097984,0.0001672772,0.0002282176,0.0002180434,0.002957768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00774025,"threshold_uncertainty_score":0.02589375,"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)","authors":[{"name":"Mengwei Xu","is_ca":false},{"name":"Soon‐Yi Wu","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242493,0.001131614,0.001905882,0.0008132217,0.0005901058,0.001425257,0.001682957,0.002075842,0.003128567],"category_scores_gemma":[0.007224151,0.001229852,0.001096647,0.0007581334,0.002133539,0.001950059,0.002876336,0.003087008,0.0005831748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007531971,"about_ca_system_score_gemma":0.00196521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002883131,"about_ca_topic_score_gemma":0.003469004,"domain_scores_codex":[0.9990866,0.000437936,0.00004078201,0.0001120769,0.0002644044,0.000058192],"domain_scores_gemma":[0.9950782,0.003804245,0.0001899532,0.0002702984,0.0004425575,0.0002147162],"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.0001045086,0.00009958063,0.0002872366,0.0002214051,0.00006678383,0.00006257358,0.00009585328,0.8686655,0.002054367,0.09449921,0.001680035,0.03216288],"study_design_scores_gemma":[0.000006353553,0.00000825925,0.00001277499,0.000004354636,0.000002284513,0.000004332408,0.000003458725,0.9846347,0.0001647217,0.01492517,0.0002306545,0.000003073503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003892238,0.0000806196,0.9946102,0.00007306185,0.00002367214,0.00001838626,0.00001754185,0.000151532,0.001132757],"genre_scores_gemma":[0.2246337,0.0002568223,0.7665942,0.0001770235,0.00008297415,0.0005424249,0.0002401958,0.0005911586,0.006881529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003128567,"threshold_uncertainty_score":0.01282436,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Andrew R. Conn","is_ca":false},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Mathilde Peyrega","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985077,0.0009312251,0.001560082,0.0005946381,0.0004616666,0.001176693,0.003149172,0.001958345,0.00442472],"category_scores_gemma":[0.007698094,0.0006729061,0.0008625162,0.0007378131,0.001038329,0.001591131,0.003069039,0.002855877,0.001815212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006714077,"about_ca_system_score_gemma":0.002149326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004068271,"about_ca_topic_score_gemma":0.003539855,"domain_scores_codex":[0.9991226,0.0002298348,0.00004520342,0.00009996751,0.0004435573,0.00005878525],"domain_scores_gemma":[0.9975392,0.001334839,0.0001189105,0.0002793967,0.0005849742,0.0001427299],"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.0003887062,0.0001472142,0.0003259709,0.000345706,0.00009060149,0.0001697314,0.0001992306,0.6945321,0.009346957,0.06797606,0.006218876,0.2202588],"study_design_scores_gemma":[0.00001805689,0.00002833096,0.00001676996,0.000006861798,0.000005464309,0.00001912072,0.000002902477,0.9949721,0.0007686798,0.00319216,0.0009636694,0.000005836687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001205782,0.00007940757,0.9977302,0.00004199068,0.00002825303,0.00002381789,0.00001437812,0.0001957561,0.0006803655],"genre_scores_gemma":[0.09496298,0.0002095941,0.8994584,0.0001094048,0.00005752724,0.0002177523,0.000129594,0.0003442579,0.004510412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00442472,"threshold_uncertainty_score":0.01480216,"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","authors":[{"name":"Kirsten Morris","is_ca":true},{"name":"Carmeliza Navasca","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238334,0.00124644,0.00150421,0.0007683526,0.000507215,0.0014815,0.0009403456,0.001489359,0.003135553],"category_scores_gemma":[0.006455157,0.0005797968,0.0005957017,0.0005826314,0.001383948,0.00131012,0.001541274,0.001940444,0.0004802224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008799902,"about_ca_system_score_gemma":0.001204445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006686537,"about_ca_topic_score_gemma":0.00554887,"domain_scores_codex":[0.9995813,0.0001955764,0.0000191455,0.00004764769,0.0001125201,0.00004385828],"domain_scores_gemma":[0.9984107,0.001052805,0.0001549052,0.00009996309,0.0002075218,0.00007400216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008322813,0.00007657857,0.0002958868,0.0001848523,0.00003153644,0.00004320537,0.0001095349,0.883674,0.001480024,0.08745959,0.001862392,0.02469926],"study_design_scores_gemma":[0.000002492304,0.000007951872,0.00001583052,0.000003000889,0.000001128982,0.000002573562,0.000004797635,0.9913219,0.00008192818,0.008425114,0.0001310141,0.000002296077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0253271,0.000467447,0.9685277,0.0004608721,0.0001063502,0.00004878327,0.00007271889,0.0001850745,0.00480399],"genre_scores_gemma":[0.8104771,0.001109429,0.1653641,0.0002848605,0.0002260395,0.0003491589,0.0004449829,0.0002956278,0.0214487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006686537,"threshold_uncertainty_score":0.01329523,"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","authors":[{"name":"Hanane Krim","is_ca":false},{"name":"Rachid Benmansour","is_ca":false},{"name":"David Duvivier","is_ca":false},{"name":"Daoud Aı̈t-Kadi","is_ca":true},{"name":"Saïd Hanafi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800241,0.00125194,0.002046868,0.001356065,0.000774379,0.001483333,0.002665959,0.001405841,0.003275048],"category_scores_gemma":[0.004880769,0.001042295,0.001056146,0.001742684,0.0007130873,0.001635569,0.0008263037,0.001728511,0.0003823841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626794,"about_ca_system_score_gemma":0.003246525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006883461,"about_ca_topic_score_gemma":0.0095104,"domain_scores_codex":[0.9988344,0.0004953858,0.00005479991,0.000181401,0.0002034098,0.0002306861],"domain_scores_gemma":[0.9960948,0.002932947,0.000312302,0.0001949671,0.0002366962,0.0002283384],"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.0002405104,0.0001858865,0.0002137146,0.0001583159,0.00005525698,0.00004843158,0.00004375562,0.9523862,0.0008232351,0.006344038,0.003043489,0.03645719],"study_design_scores_gemma":[0.00007661699,0.00007973276,0.00009354985,0.00000831632,0.00001739708,0.00001657046,0.00001685662,0.9944722,0.0002412154,0.004457197,0.0005120842,0.000008135564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08933824,0.00174556,0.8986064,0.0006699616,0.0004081824,0.0005414064,0.0003803779,0.001235687,0.007074164],"genre_scores_gemma":[0.529458,0.0006225713,0.4649845,0.0002302676,0.0001836048,0.0003881453,0.0005038446,0.0002754411,0.003353507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006883461,"threshold_uncertainty_score":0.01480925,"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","authors":[{"name":"Xinxin Li","is_ca":false},{"name":"Ting Kei Pong","is_ca":false},{"name":"Hao Sun","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407814,0.0007889945,0.0009045463,0.0006566732,0.0006475368,0.0009457029,0.001914331,0.001401669,0.005684055],"category_scores_gemma":[0.002941041,0.0004989255,0.0007698928,0.0005742544,0.0009440369,0.001231219,0.002090838,0.002779266,0.0007400073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006154056,"about_ca_system_score_gemma":0.001498288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001876904,"about_ca_topic_score_gemma":0.0026971,"domain_scores_codex":[0.999523,0.0001784063,0.00001935277,0.00007211194,0.0001601147,0.0000469672],"domain_scores_gemma":[0.9993302,0.0002935995,0.00004584674,0.00008132091,0.0001520729,0.00009698519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003319624,0.000289522,0.0006327066,0.0003437243,0.0000809846,0.0001935691,0.0003182177,0.3703667,0.01863951,0.3650306,0.009641581,0.234131],"study_design_scores_gemma":[0.00002474783,0.00004587221,0.00008150542,0.00002337148,0.000008899571,0.0000300971,0.00002313358,0.963905,0.0006364582,0.03304011,0.002170773,0.00001001007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008778701,0.0001365692,0.9858838,0.0001749793,0.00009380625,0.00006439448,0.00004664113,0.00006889366,0.00475226],"genre_scores_gemma":[0.1649166,0.0002778651,0.8246684,0.0002592956,0.0001321244,0.0003083903,0.0002644622,0.0003231732,0.008849804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005684055,"threshold_uncertainty_score":0.01901501,"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","authors":[{"name":"Wei Xu","is_ca":false},{"name":"Thomas F. Coleman","is_ca":true},{"name":"Gang Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001671123,0.001364227,0.0007075004,0.0007097783,0.0004549564,0.0008939008,0.0008297137,0.001295013,0.006327087],"category_scores_gemma":[0.003904262,0.0005207038,0.000931013,0.0008546803,0.0008861826,0.001236768,0.001182506,0.002103715,0.004565347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002096351,"about_ca_system_score_gemma":0.0006332658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005310554,"about_ca_topic_score_gemma":0.000857953,"domain_scores_codex":[0.9992593,0.0003622359,0.0000441257,0.0000710216,0.0002436993,0.00001968521],"domain_scores_gemma":[0.9986097,0.0006147401,0.00006787303,0.0002566164,0.0003938609,0.00005719735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003139022,0.00009810844,0.0007460448,0.0005864564,0.000146766,0.0005367702,0.0003057324,0.1154756,0.05288282,0.4257918,0.02903456,0.3740813],"study_design_scores_gemma":[0.00002334161,0.0001377357,0.0002602759,0.00005071479,0.00003787597,0.0005727113,0.00002711346,0.8761762,0.01376599,0.04923519,0.05966614,0.00004676144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008000761,0.0002145159,0.9971554,0.00008156632,0.0001556301,0.00001551909,0.00003809071,0.0001328251,0.001406332],"genre_scores_gemma":[0.0212549,0.0007223084,0.966345,0.0002060071,0.0001780354,0.0001126858,0.0001902433,0.0005055917,0.01048522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006327087,"threshold_uncertainty_score":0.02116621,"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","authors":[{"name":"Somayeh Moazeni","is_ca":false},{"name":"Thomas F. Coleman","is_ca":true},{"name":"Yuying Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002840575,0.0009371659,0.001377649,0.0005512344,0.00029471,0.002043544,0.001112466,0.002082916,0.003268367],"category_scores_gemma":[0.0141147,0.0006002772,0.0007270056,0.0007846155,0.001412135,0.002248157,0.001233133,0.00163598,0.0003585315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007140879,"about_ca_system_score_gemma":0.001333229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021703,"about_ca_topic_score_gemma":0.001232451,"domain_scores_codex":[0.9986419,0.0006603815,0.00006106833,0.000217357,0.0002549848,0.0001642865],"domain_scores_gemma":[0.9966066,0.002045856,0.0005421833,0.000367101,0.000256101,0.0001821101],"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.0001081178,0.00004766712,0.0002806896,0.0000415929,0.00004141458,0.0001570897,0.00001774539,0.9318933,0.0005136175,0.05919131,0.0008774858,0.006830055],"study_design_scores_gemma":[0.00001300008,0.00002053154,0.00006874656,0.000005118825,0.000007183964,0.00002260693,0.000004213081,0.9753914,0.0002409319,0.02402388,0.0001968889,0.000005581745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09742965,0.000804639,0.8812376,0.001762409,0.00009789103,0.00006874154,0.0002436718,0.0002418452,0.01811346],"genre_scores_gemma":[0.9083548,0.0003279585,0.08361012,0.0001470985,0.0000928228,0.00008216558,0.000147479,0.0001327122,0.00710483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003268367,"threshold_uncertainty_score":0.01502258,"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","authors":[{"name":"Maziar Salahi","is_ca":true},{"name":"Tamás Terlaky","is_ca":true},{"name":"Guoqing Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002903207,0.0006159616,0.001784951,0.001179315,0.001000536,0.003247801,0.002032028,0.002396064,0.01203595],"category_scores_gemma":[0.04262254,0.0008932737,0.000977471,0.001754165,0.00184571,0.005681891,0.003610372,0.00228763,0.0006971555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001406857,"about_ca_system_score_gemma":0.00129971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264809,"about_ca_topic_score_gemma":0.001154432,"domain_scores_codex":[0.9973391,0.0008810488,0.0001521587,0.0004060138,0.0009327538,0.0002889798],"domain_scores_gemma":[0.9636579,0.0301832,0.002296157,0.001965088,0.001195416,0.0007023035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004001393,0.0001188221,0.002363588,0.0003659343,0.00006543518,0.0003302937,0.0002443289,0.6822825,0.0008937793,0.2762602,0.005726,0.03094904],"study_design_scores_gemma":[0.0000336431,0.00003950005,0.0004439018,0.0000189679,0.00001352735,0.0001426195,0.00008628895,0.7846786,0.0004463672,0.2133641,0.0007159663,0.00001651493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3517093,0.0009525854,0.6092365,0.003454329,0.000145632,0.0001770159,0.001444642,0.0005480556,0.0323319],"genre_scores_gemma":[0.925869,0.0004460634,0.06571388,0.0001964985,0.0001304524,0.000181881,0.0008821312,0.0002235202,0.006356547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01203595,"threshold_uncertainty_score":0.04026419,"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","authors":[{"name":"Paul Armand","is_ca":false},{"name":"Joël Benoist","is_ca":false},{"name":"Jean‐Pierre Dussault","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002195853,0.0008898871,0.000945279,0.0009194568,0.001047882,0.001362808,0.001626122,0.001289004,0.00642962],"category_scores_gemma":[0.0120481,0.0006085621,0.0009607158,0.001037898,0.00245809,0.003556691,0.003538396,0.004238557,0.001021732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005334764,"about_ca_system_score_gemma":0.001425774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001048383,"about_ca_topic_score_gemma":0.00124944,"domain_scores_codex":[0.99907,0.0003646068,0.00003444701,0.0001537637,0.0003262729,0.00005097759],"domain_scores_gemma":[0.9957194,0.002434318,0.0003835837,0.0005211834,0.0007191666,0.000222262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002776301,0.00008797601,0.001006423,0.0005431084,0.00007282445,0.0002007582,0.000523304,0.1655803,0.008056705,0.722277,0.005548126,0.0958258],"study_design_scores_gemma":[0.00004339464,0.0002120018,0.0003913638,0.0001014382,0.00003940906,0.0002194322,0.0000869789,0.6525861,0.005370866,0.3313871,0.009526171,0.00003560807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01290252,0.0005856396,0.9774765,0.0003016047,0.00007510526,0.00003636019,0.00007415569,0.0001763447,0.008371693],"genre_scores_gemma":[0.5252901,0.002441542,0.4374537,0.0006025987,0.0002237362,0.0005794871,0.0005511119,0.001231933,0.03162568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00642962,"threshold_uncertainty_score":0.02150917,"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","authors":[{"name":"Guoyin Li","is_ca":false},{"name":"Alfred Ka Chun","is_ca":false},{"name":"Ting Kei Pong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972553,0.001994468,0.001393866,0.0007243169,0.0004017638,0.001467526,0.001134296,0.001512766,0.007816088],"category_scores_gemma":[0.008613553,0.0007786523,0.0007354887,0.001776384,0.001748301,0.001440225,0.002214342,0.00374447,0.002167373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004899842,"about_ca_system_score_gemma":0.0009762722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008948203,"about_ca_topic_score_gemma":0.0009875374,"domain_scores_codex":[0.9987819,0.0005689538,0.00005191781,0.0001850907,0.000367596,0.00004463813],"domain_scores_gemma":[0.9955871,0.002910735,0.0003074712,0.0003487675,0.0007254743,0.0001203966],"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.0001303067,0.0002632666,0.0002169568,0.0006988569,0.00008677766,0.0001880981,0.0002082994,0.357862,0.005161465,0.4102286,0.03658541,0.18837],"study_design_scores_gemma":[0.00001561118,0.00004679668,0.00004919858,0.00003367669,0.000009939017,0.00005702359,0.00002349983,0.8611103,0.001163423,0.1306721,0.006801531,0.00001687902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001315265,0.0004957387,0.9914029,0.0004944314,0.0001216572,0.00002070769,0.00008849031,0.0001794541,0.005881241],"genre_scores_gemma":[0.1630919,0.002688696,0.8077258,0.0006043378,0.0007274705,0.0004102738,0.000473477,0.0009208809,0.02335708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007816088,"threshold_uncertainty_score":0.02614737,"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","authors":[{"name":"Thomas F. Coleman","is_ca":true},{"name":"Yuying Li","is_ca":true},{"name":"Cheng Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002413272,0.0005422697,0.001131355,0.0007691493,0.0004421972,0.001206378,0.001063481,0.00149309,0.001989406],"category_scores_gemma":[0.01103697,0.0005981292,0.0009733643,0.0009251372,0.0007865851,0.002108714,0.002039215,0.001860169,0.0006174692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005695378,"about_ca_system_score_gemma":0.0008071781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001383607,"about_ca_topic_score_gemma":0.0009358382,"domain_scores_codex":[0.9992087,0.0003442166,0.00003056582,0.0001771341,0.0001730709,0.00006625347],"domain_scores_gemma":[0.9967995,0.001609818,0.000362461,0.0006909488,0.0004146116,0.0001227448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002308056,0.00007734301,0.002103297,0.00009790351,0.00009881612,0.0001082661,0.0001322264,0.8260918,0.008197947,0.0786164,0.001157336,0.08308786],"study_design_scores_gemma":[0.000006545659,0.000008201831,0.0001521185,0.000003623492,0.000004240248,0.00001253187,0.000004813191,0.9901856,0.0006390822,0.008790596,0.0001839572,0.000008727058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03387248,0.00009965885,0.9647973,0.00006504677,0.0000207526,0.000009902017,0.00002527544,0.0003567649,0.0007529025],"genre_scores_gemma":[0.8559079,0.00015837,0.1414077,0.00004187411,0.00003058931,0.00004910946,0.0001478932,0.0003952996,0.001861238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002413272,"threshold_uncertainty_score":0.01276278,"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","authors":[{"name":"Dongying Wang","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00183894,0.0009183288,0.001534694,0.001025139,0.001143303,0.001473452,0.00280494,0.002697315,0.01071477],"category_scores_gemma":[0.00564284,0.0007642679,0.00114667,0.001581506,0.001016923,0.002025155,0.002234225,0.001979685,0.003060126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001270503,"about_ca_system_score_gemma":0.002342001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003669377,"about_ca_topic_score_gemma":0.00490731,"domain_scores_codex":[0.9990127,0.0003941909,0.00004258605,0.0001884142,0.0002784472,0.00008359824],"domain_scores_gemma":[0.9984221,0.0005529987,0.00007265302,0.0005033847,0.0003438263,0.000105045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003058512,0.0002366051,0.0007011219,0.000164068,0.0001189403,0.0001082895,0.00009903182,0.4443553,0.005695408,0.2236539,0.01297002,0.3115915],"study_design_scores_gemma":[0.00004131805,0.00003314169,0.00009688289,0.00001236188,0.00001436361,0.00004203293,0.000008858622,0.9611861,0.001280907,0.03018596,0.007080598,0.00001738163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003649591,0.0001580698,0.9918092,0.0001297472,0.00008746568,0.00004841017,0.0000596769,0.0004092949,0.003648435],"genre_scores_gemma":[0.08949235,0.0002018185,0.8999718,0.0001597944,0.0001025948,0.0001984199,0.0002747724,0.0005082207,0.009090288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01071477,"threshold_uncertainty_score":0.03584445,"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","authors":[{"name":"María D. González-Lima","is_ca":false},{"name":"H. Wei","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003415881,0.001577169,0.001322478,0.00103997,0.001084226,0.002336782,0.001967487,0.001719416,0.006447724],"category_scores_gemma":[0.007605305,0.001024596,0.001132742,0.001102264,0.001966322,0.0024906,0.003795146,0.003885037,0.001465494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009086061,"about_ca_system_score_gemma":0.001407858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008933767,"about_ca_topic_score_gemma":0.001082253,"domain_scores_codex":[0.9988824,0.0005863136,0.0000394305,0.0001435705,0.0002936211,0.00005471419],"domain_scores_gemma":[0.9981532,0.001064673,0.0001176832,0.0002108191,0.0003529767,0.0001007065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001778588,0.0001122417,0.0002338753,0.0001649584,0.00007899333,0.0001400845,0.0001523049,0.1372973,0.003151686,0.8126431,0.004578123,0.04126943],"study_design_scores_gemma":[0.00002982855,0.0000408046,0.00004069562,0.00001925878,0.00001268149,0.00003618284,0.00001714292,0.712474,0.0006116622,0.2847018,0.002004712,0.00001122311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003233817,0.0001677957,0.9915001,0.0002720649,0.00007989996,0.00003749435,0.00004563434,0.00004490598,0.004618195],"genre_scores_gemma":[0.3268642,0.0009412055,0.6519526,0.0004748631,0.0004789045,0.0006312598,0.0003382014,0.0003772258,0.01794156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006447724,"threshold_uncertainty_score":0.02156979,"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","authors":[{"name":"Ting Kei Pong","is_ca":false},{"name":"Hao Sun","is_ca":true},{"name":"Ningchuan Wang","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550021,0.001477524,0.001241423,0.0009609189,0.0006782154,0.001992014,0.001353087,0.001857328,0.005823901],"category_scores_gemma":[0.007773377,0.0006978043,0.0009765066,0.001322595,0.001461541,0.002180306,0.001410272,0.003542749,0.0006836483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009921683,"about_ca_system_score_gemma":0.001299078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002163399,"about_ca_topic_score_gemma":0.002748622,"domain_scores_codex":[0.9988253,0.0005522408,0.00004219236,0.0001723928,0.0003157629,0.00009212399],"domain_scores_gemma":[0.9961003,0.00310719,0.0002038966,0.0001482318,0.0003181222,0.0001223223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000209927,0.0002910029,0.0004012538,0.0004355596,0.00006168547,0.0001836202,0.0002094213,0.6729216,0.002905358,0.2463779,0.01392568,0.06207697],"study_design_scores_gemma":[0.00002610723,0.00004628291,0.0001219862,0.00002747703,0.0000105026,0.00006886998,0.00004311438,0.9142911,0.0003418631,0.08339331,0.001615546,0.00001379659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008420896,0.0004007917,0.9815776,0.0007970717,0.00009892722,0.00004995404,0.0001208847,0.00008864557,0.008445292],"genre_scores_gemma":[0.2907649,0.001335819,0.6862729,0.0007151901,0.0004604591,0.0006143929,0.0006089662,0.0005495785,0.01867782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005823901,"threshold_uncertainty_score":0.01948291,"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","authors":[{"name":"L. Douglas Smith","is_ca":true},{"name":"John W. Chinneck","is_ca":true},{"name":"Victor Aitken","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003270058,0.001346013,0.001688473,0.00126476,0.0009395123,0.001355378,0.002422408,0.00196239,0.005680502],"category_scores_gemma":[0.01308016,0.000883045,0.0009470612,0.001542124,0.001410761,0.002540451,0.00287988,0.003039378,0.0006882134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009515433,"about_ca_system_score_gemma":0.001467398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004569889,"about_ca_topic_score_gemma":0.00485371,"domain_scores_codex":[0.9987697,0.0005015884,0.00006371748,0.0001645388,0.0004182807,0.0000821896],"domain_scores_gemma":[0.9939162,0.004231421,0.0002913141,0.0003855191,0.0009985977,0.0001768902],"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.0001141698,0.00006595071,0.0001849501,0.0001578809,0.00005617725,0.0000602698,0.0001100658,0.8681129,0.001904088,0.07398104,0.00234458,0.05290796],"study_design_scores_gemma":[0.000009319045,0.00001040353,0.0000153388,0.000004043342,0.000002953839,0.000003293854,0.000004181629,0.9921432,0.0001687777,0.007359521,0.0002750263,0.000004006301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002985151,0.0001011217,0.9949698,0.00007934027,0.00003706427,0.00003116256,0.00002079129,0.00006317931,0.001712438],"genre_scores_gemma":[0.26779,0.0004368994,0.7226077,0.0001989842,0.0001778545,0.0005807283,0.0002578386,0.000345765,0.007604344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005680502,"threshold_uncertainty_score":0.01900315,"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","authors":[{"name":"Bryan Gardiner","is_ca":true},{"name":"Khan Md. Kamall Jakee","is_ca":true},{"name":"Yves Lucet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719937,0.0007042855,0.001017615,0.0008989169,0.0003930686,0.00213303,0.000985241,0.001025278,0.005018349],"category_scores_gemma":[0.01037673,0.0005268024,0.0005259941,0.0009504039,0.001242546,0.002111471,0.001763205,0.001585046,0.0007835791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008514471,"about_ca_system_score_gemma":0.001181441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00119129,"about_ca_topic_score_gemma":0.0013705,"domain_scores_codex":[0.9994344,0.00021859,0.0000241563,0.00007259253,0.0001807153,0.00006945872],"domain_scores_gemma":[0.997741,0.001341101,0.0001446632,0.0002493518,0.0003307114,0.0001932447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004207658,0.0001166886,0.002232546,0.0001901229,0.00006067029,0.0001887544,0.0001764602,0.7141322,0.006856218,0.1639729,0.002757265,0.1088954],"study_design_scores_gemma":[0.000008030519,0.00004176042,0.0002096267,0.000009653631,0.000006780929,0.00003603655,0.00003481207,0.9723833,0.00254815,0.02417564,0.0005373275,0.000008915922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09263527,0.0001194965,0.9034584,0.000211273,0.00005442388,0.00002349576,0.00008219886,0.000262435,0.003153032],"genre_scores_gemma":[0.7865429,0.00018747,0.2079923,0.0000719118,0.00004758617,0.00004491632,0.0002923572,0.0002839939,0.004536533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005018349,"threshold_uncertainty_score":0.01678807,"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","authors":[{"name":"Xianfu Wang","is_ca":true},{"name":"Ziyuan Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023559,0.0009464519,0.001322726,0.0006374257,0.0006666391,0.0008909276,0.001422997,0.001936461,0.00392149],"category_scores_gemma":[0.001669597,0.0004993865,0.0009830733,0.0005286734,0.000955118,0.001082378,0.002063071,0.002121272,0.0009116864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006369696,"about_ca_system_score_gemma":0.002075761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003329228,"about_ca_topic_score_gemma":0.004673349,"domain_scores_codex":[0.9996456,0.0001430341,0.00002235886,0.00004452106,0.0001136415,0.0000308097],"domain_scores_gemma":[0.9995868,0.0001984084,0.00002297344,0.00004045186,0.0001166241,0.00003478214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003648403,0.0002660872,0.001141673,0.001192755,0.0002406123,0.0003534432,0.0004081161,0.5662591,0.02434241,0.220368,0.01122299,0.1738399],"study_design_scores_gemma":[0.00001973657,0.00002653547,0.00009840494,0.00002459605,0.00001355432,0.00003206006,0.00001906299,0.9843698,0.0009711261,0.01161712,0.002797443,0.0000106061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007115017,0.0006887645,0.9855006,0.0003028191,0.0001207193,0.00007324498,0.00007861539,0.0001392559,0.005980923],"genre_scores_gemma":[0.1869038,0.0009283239,0.7913823,0.0003240498,0.0001298601,0.0007438308,0.0003976463,0.0003655976,0.01882461],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00392149,"threshold_uncertainty_score":0.01311862,"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","authors":[{"name":"Nicolas Zufferey","is_ca":false},{"name":"Olivier Labarthe","is_ca":true},{"name":"David Schindl","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810475,0.0015994,0.002464761,0.00309834,0.001247261,0.002787444,0.002978051,0.003116118,0.004711969],"category_scores_gemma":[0.009884082,0.001810455,0.001767816,0.004172158,0.001580313,0.00269663,0.001730317,0.002315148,0.0003040539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00283037,"about_ca_system_score_gemma":0.003058594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00940188,"about_ca_topic_score_gemma":0.01071206,"domain_scores_codex":[0.9980125,0.001161902,0.00008394254,0.0002087568,0.0002546957,0.0002780422],"domain_scores_gemma":[0.9916319,0.007235248,0.0003865097,0.0002042344,0.0002599144,0.0002820965],"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.0001059411,0.0001249253,0.0003082558,0.0001145876,0.00005578974,0.0000739173,0.00006955347,0.9610636,0.0002855036,0.0188878,0.001253927,0.0176562],"study_design_scores_gemma":[0.0000836726,0.00005181885,0.0001463136,0.00002182239,0.00003402589,0.00002508756,0.00003652848,0.9813519,0.0001564676,0.01740305,0.0006759922,0.00001328455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09833261,0.0009908782,0.8874713,0.000823087,0.0001586922,0.0005575737,0.0003903908,0.0003901186,0.01088544],"genre_scores_gemma":[0.4393548,0.0006657909,0.5548484,0.0002244563,0.000135387,0.0007072386,0.0004599163,0.0001443168,0.003459704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00940188,"threshold_uncertainty_score":0.02053589,"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","authors":[{"name":"Jean Bigeon","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Ludovic Salomon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280084,0.0008957496,0.001476015,0.0004429767,0.0006864223,0.001558792,0.001165205,0.001429524,0.004775952],"category_scores_gemma":[0.007327109,0.0006773043,0.0005456819,0.0005744086,0.0007668702,0.001918394,0.001726897,0.001504272,0.0003770372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003878937,"about_ca_system_score_gemma":0.000645056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001029179,"about_ca_topic_score_gemma":0.0009295935,"domain_scores_codex":[0.9992354,0.0004302785,0.00002447659,0.00007921777,0.0001697496,0.00006093726],"domain_scores_gemma":[0.9980313,0.001429774,0.0001499749,0.0001335781,0.00015728,0.000097985],"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.0001040668,0.00005801749,0.0002101029,0.0001488451,0.0000474482,0.0001210214,0.00005326803,0.9245892,0.001967028,0.04168986,0.001300295,0.02971083],"study_design_scores_gemma":[0.000007794959,0.00001312808,0.00003053882,0.00001067815,0.000003890852,0.00001070443,0.000005954539,0.9858279,0.000470228,0.013177,0.0004390221,0.000003036627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01288879,0.0002937809,0.9831836,0.0001512032,0.00008014437,0.00003780185,0.00002796005,0.0001067021,0.003229921],"genre_scores_gemma":[0.6202968,0.0004431285,0.371154,0.0002406453,0.0001068058,0.0002753289,0.00009057788,0.0003265381,0.00706612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004775952,"threshold_uncertainty_score":0.01597714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}