{"meta":{"query_hash":"c1ca6edec225","filters":{"venue":"Computational Optimization and Applications"},"cohort_total":73,"direct_labels_cover":0,"predictions_cover":73,"exported":73,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c1ca6edec225","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Optimization+and+Applications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","score_opus":0.0379339446005809,"score_gpt":0.33932695613064007,"score_spread":0.30139301153005915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525133469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032205,0.00022152757,0.9947435,0.0014532636,0.00001990674,0.0022716117,0.0003122895,0.00022016017,0.00043564293],"genre_scores_gemma":[0.0038996348,0.00018050072,0.99243504,0.0002658699,0.0001038703,0.0012647548,0.00048348986,0.000041015322,0.0013258306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846596,0.00008855116,0.0005116804,0.0003873327,0.0002983801,0.00024810754],"domain_scores_gemma":[0.99681807,0.0022247867,0.00017950409,0.00021976737,0.00045202795,0.00010587085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041630593,0.00019196831,0.00021998506,0.00005873257,0.0007881886,0.00015848507,0.00020384052,0.0000727212,0.00024001552],"category_scores_gemma":[0.00009477069,0.00016189013,0.00006091543,0.00036215124,0.00016545359,0.00021061457,0.00004343046,0.00012634469,0.000008845468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016610149,0.000268152,0.000047737103,0.000052124826,0.000059734357,9.698703e-8,0.00031910086,0.93217665,0.000004504298,0.00918051,0.005138058,0.052736692],"study_design_scores_gemma":[0.00093746616,0.000033993194,0.000023611088,0.000008360443,0.00003319036,0.0000063358575,0.00020762412,0.97195417,0.00002128409,0.013162836,0.013426201,0.00018490465],"about_ca_topic_score_codex":0.000010367245,"about_ca_topic_score_gemma":0.000001642553,"teacher_disagreement_score":0.052551787,"about_ca_system_score_codex":0.00008002667,"about_ca_system_score_gemma":0.00012779662,"threshold_uncertainty_score":0.6601688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023075093248227378,"score_gpt":0.3029777985616544,"score_spread":0.27990270531342704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636353766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013291701,0.000074937314,0.99412227,0.0041246475,0.000045644214,0.0004931128,0.00003746161,0.00019647143,0.00089218974],"genre_scores_gemma":[0.012633239,0.000056560133,0.9842212,0.0013114037,0.00016678301,0.00048266884,0.00072775147,0.000014919619,0.00038544467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985799,0.0000650436,0.00045344618,0.00044415882,0.00026991928,0.00018750159],"domain_scores_gemma":[0.9979859,0.0009283459,0.00023635018,0.00019042933,0.0005445217,0.000114475646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883821,0.00016086524,0.00018602361,0.0002517335,0.0005938934,0.00029628538,0.00027011055,0.00006875471,0.0000723268],"category_scores_gemma":[0.000099037425,0.00017245095,0.00007206984,0.000728833,0.000029486499,0.00053842086,0.000083159735,0.000067386805,0.000010539711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029155917,0.000040836534,0.00009400263,0.0000059995878,0.000021806407,1.0468806e-7,0.0000909454,0.55752033,0.0000053153663,0.4389097,0.00013093838,0.0031771031],"study_design_scores_gemma":[0.00047851,0.00001711237,0.00034882518,0.0000060668453,0.000022079823,0.000016744325,0.000046181765,0.9533887,0.000008306234,0.037691675,0.007783059,0.00019275871],"about_ca_topic_score_codex":0.000012487252,"about_ca_topic_score_gemma":0.0000026907455,"teacher_disagreement_score":0.40121806,"about_ca_system_score_codex":0.000043372154,"about_ca_system_score_gemma":0.00014105161,"threshold_uncertainty_score":0.70323455},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02330850243936596,"score_gpt":0.2572272012488267,"score_spread":0.23391869880946073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648726702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020562985,0.00037239736,0.99604416,0.0001883607,0.000022553346,0.0017573648,0.00002659024,0.0006107082,0.00077221665],"genre_scores_gemma":[0.09691165,0.000092807284,0.8991252,0.00007879864,0.00007337723,0.0027655521,0.00081014785,0.000045177912,0.000097268974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991293,0.000019650084,0.00032075372,0.00023439132,0.00013506466,0.00016084513],"domain_scores_gemma":[0.9992577,0.000110541885,0.00008615823,0.00010378895,0.00029440626,0.00014742471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013777988,0.00015600541,0.00014073963,0.00014593994,0.0002094732,0.00015379731,0.00006449102,0.00008798767,0.0000038734825],"category_scores_gemma":[0.000031255036,0.000170099,0.00002728208,0.00034307133,0.00006823007,0.00022507024,0.000019667654,0.00006885027,0.000003075233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035806027,0.00004630533,0.00016709248,0.000087148466,0.000022317432,1.1001493e-7,0.0004817412,0.93932223,0.000009079987,0.031020453,0.0008103662,0.028029567],"study_design_scores_gemma":[0.0004611123,0.00005740945,0.000037580176,0.000024277851,0.000041067604,0.000012871833,0.00020393681,0.96456975,0.00003105199,0.011197895,0.023143293,0.0002197767],"about_ca_topic_score_codex":0.0000021225856,"about_ca_topic_score_gemma":0.0000023903306,"teacher_disagreement_score":0.096918955,"about_ca_system_score_codex":0.000041989617,"about_ca_system_score_gemma":0.000052052143,"threshold_uncertainty_score":0.69364357},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030158023478763972,"score_gpt":0.32938959606335677,"score_spread":0.2992315725845928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185892825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012892318,0.00017681335,0.9875532,0.00036517702,0.000051524992,0.00038722384,0.000016519132,0.00007197254,0.010088344],"genre_scores_gemma":[0.82073843,0.0006500726,0.1766783,0.0003104399,0.000047521844,0.0001626762,0.000083534265,0.000019558507,0.0013094638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844015,0.0001127244,0.00046659462,0.00042551613,0.0004176443,0.00013739016],"domain_scores_gemma":[0.9986651,0.00036584793,0.0001857472,0.00014617242,0.0004752374,0.0001619029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005177751,0.0001338152,0.00015487437,0.0003107745,0.0005549037,0.0002716608,0.00009078732,0.000079115234,0.00046587456],"category_scores_gemma":[0.0001237149,0.00012631225,0.000038283975,0.0010656284,0.00008793553,0.00038466378,0.000009285953,0.00009000961,0.000031250693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031258685,0.0000427044,0.0013076953,0.0000010053994,0.000007805085,1.2917651e-7,0.000044979282,0.87227136,0.00000553307,0.105007626,0.00034706216,0.020960953],"study_design_scores_gemma":[0.00051402603,0.00003027865,0.0030114278,0.0000039117604,0.000029136347,0.00008753952,0.00026515394,0.9035794,0.000039212722,0.035946924,0.056259423,0.00023354417],"about_ca_topic_score_codex":0.0000059969534,"about_ca_topic_score_gemma":0.000005222949,"teacher_disagreement_score":0.8194492,"about_ca_system_score_codex":0.000031388907,"about_ca_system_score_gemma":0.00008530689,"threshold_uncertainty_score":0.5150864},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08166275618822488,"score_gpt":0.4123049513317906,"score_spread":0.33064219514356574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964916956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022897904,0.00018622365,0.99609464,0.0008065303,0.000039185426,0.0014986685,0.00015080725,0.00013609332,0.0008588812],"genre_scores_gemma":[0.033975843,0.000094434334,0.96340907,0.00013565584,0.00019089665,0.0009706763,0.0007519138,0.00004213939,0.00042936884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859273,0.000074034906,0.0004463624,0.0003427954,0.00025821285,0.0002858674],"domain_scores_gemma":[0.9978057,0.0010399467,0.00020667302,0.0001922238,0.0005200482,0.00023540195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562793,0.0001765682,0.0002004598,0.00016552856,0.000542738,0.00010094187,0.00008910635,0.00008962782,0.00011570979],"category_scores_gemma":[0.00033041378,0.0001933436,0.000040445648,0.00036658972,0.00017904153,0.00054804166,0.000077666395,0.00009693805,0.0000032841456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116427445,0.00012999648,0.0003655537,0.00005169181,0.00001880862,3.8594813e-8,0.00015216095,0.776034,0.0000037916348,0.22166933,0.00033089262,0.0012321159],"study_design_scores_gemma":[0.000910181,0.00002397487,0.00040337307,0.000009218244,0.000045444835,0.00001330899,0.0002990612,0.9798628,0.000017854083,0.017052991,0.0011440483,0.0002177219],"about_ca_topic_score_codex":0.0000019798963,"about_ca_topic_score_gemma":6.578516e-7,"teacher_disagreement_score":0.20461634,"about_ca_system_score_codex":0.0000498548,"about_ca_system_score_gemma":0.000054202806,"threshold_uncertainty_score":0.7884323},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039840321685528014,"score_gpt":0.3602183300798796,"score_spread":0.32037800839435154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969794772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005032935,0.00001211715,0.98949194,0.0005930385,0.00001734805,0.0021274786,0.000054294975,0.000045475954,0.0026253825],"genre_scores_gemma":[0.34067112,0.000004681659,0.65839297,0.00010215054,0.000031933105,0.00059344067,0.00008122089,0.000008910976,0.0001135796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854946,0.000041667834,0.00038906446,0.00047007296,0.0004240747,0.00012566736],"domain_scores_gemma":[0.99827087,0.0008121795,0.00019829541,0.00021559668,0.00041567913,0.00008735303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071141735,0.000121392644,0.00014431115,0.00017426019,0.00034978325,0.00030135943,0.00016058153,0.000044923763,0.00001630073],"category_scores_gemma":[0.00010540915,0.00009424625,0.00002201538,0.0004356937,0.00018525666,0.00012429945,0.0000720652,0.00009611833,0.0000025036788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045507408,0.00016515238,0.006519174,0.000041382544,0.000034338776,4.3321316e-7,0.0002869981,0.76305956,0.000023748544,0.17310303,0.000433771,0.05628692],"study_design_scores_gemma":[0.00090128666,0.0000659563,0.0040783617,0.000012404461,0.000028030227,0.000019047578,0.00040315662,0.9555837,0.000012212112,0.028130863,0.010579563,0.00018544885],"about_ca_topic_score_codex":0.0000031382826,"about_ca_topic_score_gemma":0.0000055018018,"teacher_disagreement_score":0.3356382,"about_ca_system_score_codex":0.000021487149,"about_ca_system_score_gemma":0.00007485901,"threshold_uncertainty_score":0.38432503},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11300995214938463,"score_gpt":0.4626816648866754,"score_spread":0.34967171273729075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974846298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027188903,0.0001058767,0.9962714,0.00039908962,0.00003320447,0.0025227014,0.000034476605,0.00010518893,0.00025621912],"genre_scores_gemma":[0.015781598,0.000012023335,0.982671,0.00008458867,0.000083515886,0.0009834191,0.00027951517,0.000029038547,0.00007526738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987025,0.000120581855,0.00046532907,0.00029150926,0.00012710512,0.0002929313],"domain_scores_gemma":[0.9977928,0.0012854711,0.00016589162,0.00017282994,0.00042559436,0.00015744622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084725907,0.00014730754,0.0002072244,0.00014270193,0.00019921559,0.000052537467,0.00009312929,0.000086117325,0.000031930682],"category_scores_gemma":[0.00046719893,0.00015443517,0.00004711861,0.00044134984,0.00017149094,0.00013158863,0.000050988947,0.00012625371,0.000001580845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004128435,0.0009854097,0.0022198234,0.0001627727,0.000038388207,1.3349597e-7,0.00039907033,0.72783923,0.00008874415,0.16967689,0.00004728872,0.098500974],"study_design_scores_gemma":[0.00090253644,0.000021671945,0.00013188647,0.000011199582,0.0000125926335,0.000009146724,0.00016831553,0.96625865,0.000028372624,0.03123105,0.0010649408,0.0001596596],"about_ca_topic_score_codex":0.0000018080198,"about_ca_topic_score_gemma":0.0000018484021,"teacher_disagreement_score":0.2384194,"about_ca_system_score_codex":0.00009825622,"about_ca_system_score_gemma":0.00009340726,"threshold_uncertainty_score":0.6297683},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018538081270305245,"score_gpt":0.28482506808871527,"score_spread":0.26628698681841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975786171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001745904,0.000037115304,0.9943055,0.0038897411,0.000026267873,0.0011253735,0.000012366684,0.00022400952,0.00036218646],"genre_scores_gemma":[0.022605436,0.000010261174,0.9739094,0.0011752688,0.00006382598,0.0013452028,0.0006472269,0.000015157619,0.00022821587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987726,0.00003605639,0.0003589894,0.0004256126,0.00021447614,0.00019222799],"domain_scores_gemma":[0.9985567,0.00027516848,0.00017874611,0.00019916067,0.0006526631,0.0001375633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431659,0.0001489928,0.00015666624,0.00019782272,0.00051211606,0.00050562667,0.0002814719,0.00006109089,0.00008706852],"category_scores_gemma":[0.000035484554,0.000147482,0.00007862408,0.00076089177,0.000030092677,0.00065010326,0.00008703266,0.000058632373,0.000022975393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9274764e-7,0.00007211683,0.00006962502,0.000010789811,0.000029091263,3.125361e-8,0.000096930526,0.7628666,0.000017828654,0.19316481,0.00035883655,0.043312527],"study_design_scores_gemma":[0.0003991554,0.000018475268,0.0004268214,0.000005558653,0.000019017456,0.0000034050142,0.00003402575,0.9548444,0.000011398601,0.04056626,0.0034998942,0.00017155478],"about_ca_topic_score_codex":0.000030384028,"about_ca_topic_score_gemma":0.0000024614287,"teacher_disagreement_score":0.19197781,"about_ca_system_score_codex":0.000035309655,"about_ca_system_score_gemma":0.00007044007,"threshold_uncertainty_score":0.60141414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15939405150286576,"score_gpt":0.35937311730166466,"score_spread":0.1999790657987989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982566213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010392444,0.00015095071,0.9960515,0.0019797685,0.00019550783,0.0013630226,0.000036546444,0.00007777914,0.0001345475],"genre_scores_gemma":[0.027687432,0.0000053529548,0.96973383,0.00037302214,0.00046479044,0.0008711468,0.00049285806,0.000022735998,0.00034882213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982371,0.00011544125,0.00053002883,0.00043375653,0.00052917894,0.0001544975],"domain_scores_gemma":[0.99720997,0.0009946186,0.00022649905,0.00028322494,0.0011355872,0.0001501198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016236594,0.00014922851,0.00017053614,0.00014907987,0.00045496746,0.00029452672,0.00028200675,0.0000739708,0.000030835436],"category_scores_gemma":[0.0007014485,0.000106310574,0.0000510493,0.0006521159,0.00009217331,0.00023890681,0.000052517324,0.00007885057,0.000018825021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005832897,0.000039157956,0.0000064985215,0.0000032763771,0.000009743257,3.385398e-8,0.00015147527,0.9696741,0.0000064894857,0.02336031,0.0033640594,0.003378997],"study_design_scores_gemma":[0.00042254583,0.000032064203,0.0000148850595,0.0000038927556,0.000026935788,0.00001204868,0.000061535844,0.9671897,0.0000027169162,0.027812317,0.004287737,0.0001335818],"about_ca_topic_score_codex":0.0000042096453,"about_ca_topic_score_gemma":0.0000015897684,"teacher_disagreement_score":0.02767704,"about_ca_system_score_codex":0.000055011133,"about_ca_system_score_gemma":0.00015872298,"threshold_uncertainty_score":0.43352193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07123505202571571,"score_gpt":0.3926121186801358,"score_spread":0.32137706665442006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987364022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084140636,0.000069552065,0.99621016,0.00027618898,0.000021483895,0.0020188633,0.000058649664,0.00021256314,0.0010483909],"genre_scores_gemma":[0.0061186263,0.00002192435,0.99046946,0.00016776267,0.00020460028,0.00091853086,0.0011555216,0.000054695203,0.0008888884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983757,0.000031360138,0.00048565626,0.00042733937,0.00034301574,0.00033691854],"domain_scores_gemma":[0.9979329,0.000722986,0.00018941032,0.00020753135,0.0007624134,0.00018476458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053612504,0.00018458885,0.00019261966,0.00023882926,0.0006251376,0.00009940155,0.00012471691,0.00010441088,0.000060927752],"category_scores_gemma":[0.00013151058,0.00019592298,0.0000625279,0.00062738237,0.00012413319,0.0002605131,0.00006491175,0.00014250005,0.0000050111544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023284,0.00024610193,0.000021852724,0.00004812257,0.000023658422,1.2318527e-7,0.000056546723,0.7811614,0.000011729312,0.21369597,0.00015627786,0.0045661633],"study_design_scores_gemma":[0.00080717076,0.000029395243,0.00005363468,0.000006749178,0.000029639634,0.000012657821,0.0002284841,0.9636126,0.00004849963,0.030004617,0.0049418462,0.00022468632],"about_ca_topic_score_codex":0.0000015075921,"about_ca_topic_score_gemma":0.0000015963847,"teacher_disagreement_score":0.18369137,"about_ca_system_score_codex":0.0000958692,"about_ca_system_score_gemma":0.000118441174,"threshold_uncertainty_score":0.79895073},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013506021585064452,"score_gpt":0.20815008141569386,"score_spread":0.1946440598306294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999418275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015783792,0.00010886761,0.9944226,0.00012164517,0.000008953584,0.0005078776,0.0000085747,0.000781836,0.00388177],"genre_scores_gemma":[0.4483756,0.00003947833,0.55020106,0.00013601767,0.00010097045,0.00075908465,0.00031617712,0.00003628357,0.000035332796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993816,0.000013554281,0.00016619117,0.00019919964,0.00011701669,0.00012244981],"domain_scores_gemma":[0.99949425,0.000073125295,0.00004578568,0.00015968391,0.0001528539,0.00007427701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004660136,0.000129996,0.00010680933,0.00009280991,0.00020918579,0.00008911582,0.00008070201,0.000047094476,0.000012716755],"category_scores_gemma":[0.0000030947367,0.00012908647,0.00002005249,0.0003194223,0.00006742282,0.00009748898,0.000018153645,0.00008331373,0.000012199644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012319178,0.0000201976,0.00012226679,0.00001394609,0.000011180772,7.3937926e-8,0.0000193534,0.94726175,0.000010781805,0.03088998,0.000168407,0.02148083],"study_design_scores_gemma":[0.00017218338,0.000017412849,0.00023588273,0.000023020883,0.000018110954,0.000014025894,0.000027404427,0.95648664,0.00004212715,0.0020324346,0.040755272,0.00017549255],"about_ca_topic_score_codex":0.0000015221816,"about_ca_topic_score_gemma":0.0000016971798,"teacher_disagreement_score":0.44821778,"about_ca_system_score_codex":0.000018319352,"about_ca_system_score_gemma":0.000012778293,"threshold_uncertainty_score":0.5263994},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; 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","score_opus":0.022696821766594384,"score_gpt":0.31365902099926707,"score_spread":0.2909621992326727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007103412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015823181,0.00010946057,0.99362475,0.005200491,0.000026329137,0.0007257902,0.00003796552,0.00016838143,0.00009103909],"genre_scores_gemma":[0.003621142,0.000037448997,0.99361044,0.0012399263,0.0001532163,0.00063517026,0.00047964617,0.000015886772,0.00020714261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.000047711972,0.00042605572,0.00057880266,0.00027002554,0.00019032141],"domain_scores_gemma":[0.99852943,0.00034380017,0.00020400608,0.00017528045,0.0005757013,0.0001717847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018830234,0.00019080768,0.000193475,0.00023227329,0.00054931204,0.00032307472,0.00024410305,0.00007802529,0.000017357894],"category_scores_gemma":[0.000034337263,0.00019612788,0.00006510773,0.0006579894,0.00008405258,0.0006057269,0.000101020836,0.000071904746,0.0000058100386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002282665,0.00008646874,0.000039722698,0.000006688962,0.000018550603,1.0500785e-7,0.00021417263,0.7109828,6.4903634e-7,0.10649911,0.00009124312,0.18205822],"study_design_scores_gemma":[0.0006589281,0.000028047707,0.00027132803,0.000005504466,0.000021743304,0.000032492957,0.000040983618,0.96478087,0.000006624455,0.009333102,0.024597123,0.00022326793],"about_ca_topic_score_codex":0.0000039140523,"about_ca_topic_score_gemma":8.2486196e-7,"teacher_disagreement_score":0.25379807,"about_ca_system_score_codex":0.000041465082,"about_ca_system_score_gemma":0.000101578386,"threshold_uncertainty_score":0.79978627},"labels":[],"label_agreement":null},{"id":"W2008541170","doi":"10.1007/s10589-014-9670-z","title":"A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Deakin University","keywords":"Multileaf collimator; Computer science; Mathematical optimization; Search tree; Focus (optics); Parallel algorithm; Computation; Parallel computing; Algorithm; Mathematics; Search algorithm; Radiation treatment planning","score_opus":0.019811482105355254,"score_gpt":0.2908437563214109,"score_spread":0.27103227421605564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008541170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023339361,0.000086484484,0.9973752,0.00042600822,0.0000076123433,0.0014499425,0.000013847796,0.00006466138,0.00034286254],"genre_scores_gemma":[0.15730302,0.000024271294,0.84003437,0.00011326256,0.00010938205,0.0016319762,0.00073000585,0.000016516622,0.00003716677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999356,0.00003550275,0.00021261285,0.00022468144,0.00006938855,0.00010186378],"domain_scores_gemma":[0.9993879,0.00024166408,0.0001215562,0.000118181946,0.000100632395,0.000030027515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014028946,0.00011695314,0.00012682975,0.0000678489,0.00022459665,0.000047901925,0.00006691709,0.000035250472,0.0000113596425],"category_scores_gemma":[0.0000034031596,0.00009389663,0.00003459381,0.00016735673,0.000048311416,0.000103369326,0.0000069098774,0.000049851405,1.2471247e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019400148,0.00007946212,0.0014651112,0.0000036385732,0.000025472238,5.1333906e-9,0.00028763682,0.9480383,0.000026894015,0.02807444,0.00003342375,0.02194623],"study_design_scores_gemma":[0.00077675865,0.000037316346,0.00091303466,0.000004392649,0.00001115893,7.444789e-7,0.00006317345,0.9860406,0.000017735958,0.010201262,0.0018324562,0.00010134479],"about_ca_topic_score_codex":0.000027940741,"about_ca_topic_score_gemma":3.2736824e-7,"teacher_disagreement_score":0.1573408,"about_ca_system_score_codex":0.00006815766,"about_ca_system_score_gemma":0.00002220027,"threshold_uncertainty_score":0.38289937},"labels":[],"label_agreement":null},{"id":"W2009009651","doi":"10.1007/s10589-013-9596-x","title":"Lower bounds on the global minimum of a polynomial","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Semidefinite programming; Degree (music); Ball (mathematics); Polynomial; Computation; Discrete mathematics; Mathematical analysis; Algorithm; Mathematical optimization","score_opus":0.030582452357959092,"score_gpt":0.3310471121649883,"score_spread":0.3004646598070292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009009651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016174375,0.000021640188,0.9898209,0.0029508201,0.0000255588,0.0008788207,0.00003676819,0.00005099572,0.0045970483],"genre_scores_gemma":[0.3133492,0.000031989675,0.6839264,0.00082684023,0.00012896383,0.0008601075,0.00010783644,0.000031386797,0.0007372601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.000047343045,0.00029707953,0.00019434522,0.00028143718,0.00012827455],"domain_scores_gemma":[0.9985454,0.00061666046,0.00014523091,0.00020180483,0.00041428008,0.00007661982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001046732,0.000109271714,0.000121770245,0.000058880083,0.00021973239,0.00006706783,0.00015778713,0.00004908397,0.0005303962],"category_scores_gemma":[0.0001417036,0.00008496079,0.000039792507,0.00043818867,0.00018530223,0.00011728508,0.000054913417,0.00007847129,0.000040494324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793028,0.00016262702,0.000070982074,0.000010888645,0.000019326786,7.927158e-8,0.00004499901,0.70041734,0.000004176608,0.29344827,0.0038972422,0.0019162936],"study_design_scores_gemma":[0.00036814227,0.000041645253,0.00034426703,0.000010671771,0.000009581179,0.0000040333643,0.00010381937,0.8711882,0.0000159768,0.12637055,0.00143056,0.000112528185],"about_ca_topic_score_codex":0.0000039786714,"about_ca_topic_score_gemma":6.17763e-7,"teacher_disagreement_score":0.31173176,"about_ca_system_score_codex":0.000047370457,"about_ca_system_score_gemma":0.00006647572,"threshold_uncertainty_score":0.5807466},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059124732364864485,"score_gpt":0.325472630503332,"score_spread":0.26634789813846754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011612932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000837051,0.00023359159,0.9982721,0.00039825006,0.000024927342,0.0007561215,0.000019642926,0.0001058599,0.000105765],"genre_scores_gemma":[0.13138023,0.00003307733,0.867995,0.00022618813,0.000047225076,0.00015720776,0.00010663581,0.000008962958,0.000045463832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00006416972,0.00023449291,0.00029094168,0.00016031033,0.00023653019],"domain_scores_gemma":[0.9976827,0.001666393,0.00008915295,0.00015280502,0.00028958617,0.000119375945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740533,0.00010328878,0.00011244159,0.00019959145,0.00048825986,0.00011430119,0.0001861832,0.00004544754,0.0000035001367],"category_scores_gemma":[0.00007432684,0.00010791909,0.000021595644,0.0007825475,0.0001219166,0.00028751747,0.0000852091,0.00007064681,0.0000013763538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060071643,0.000018648425,0.00006685432,0.0000068782474,0.000007513501,9.597518e-8,0.00007989999,0.59803194,0.0000021560136,0.3968876,0.00012666635,0.004765736],"study_design_scores_gemma":[0.00035312795,0.000028644694,0.0005659748,0.0000034521534,0.00000466745,0.000004915746,0.00005425722,0.83064634,0.000017819171,0.16745628,0.00075760175,0.00010688731],"about_ca_topic_score_codex":0.000002184271,"about_ca_topic_score_gemma":0.0000013124655,"teacher_disagreement_score":0.23261443,"about_ca_system_score_codex":0.00002523447,"about_ca_system_score_gemma":0.000037938393,"threshold_uncertainty_score":0.4400813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0055769508890640114,"score_gpt":0.19736079289617944,"score_spread":0.19178384200711543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013164640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018006228,0.00030983967,0.9844786,0.00014270308,0.000037756898,0.00040408617,0.000019981271,0.0003063343,0.014120661],"genre_scores_gemma":[0.47052237,0.00031853092,0.527642,0.00010403288,0.000103305436,0.00036438523,0.00048040468,0.000036565252,0.0004283723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.000013164874,0.0002505297,0.00020039112,0.00010870743,0.00014683447],"domain_scores_gemma":[0.9995936,0.00005069657,0.000045115274,0.00010914439,0.00015424217,0.000047192483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067914625,0.0001239635,0.00010885259,0.000077768746,0.00015242696,0.00006592799,0.00007150565,0.000055876553,0.000027777252],"category_scores_gemma":[0.0000040769005,0.00013390394,0.000033004104,0.0002610222,0.00006718,0.00030793648,0.000018479725,0.000069997186,0.00000878483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014583626,0.000023544462,0.000009623921,0.000016535201,0.000006129137,1.20455e-7,0.000029660887,0.89839476,0.000009252218,0.09955536,0.00066202215,0.0012915041],"study_design_scores_gemma":[0.00022749096,0.000004483083,0.00010549864,0.000014889111,0.000009407706,0.0000040000114,0.000027532617,0.949009,0.000019853756,0.048601404,0.0018342418,0.00014219084],"about_ca_topic_score_codex":0.00000455273,"about_ca_topic_score_gemma":0.0000015586375,"teacher_disagreement_score":0.4703423,"about_ca_system_score_codex":0.000048622605,"about_ca_system_score_gemma":0.000016648426,"threshold_uncertainty_score":0.5460444},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"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","score_opus":0.03456162899230268,"score_gpt":0.33283612322275286,"score_spread":0.29827449423045016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018727518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083010696,0.00006555042,0.99515253,0.0016341342,0.000041099087,0.0012523753,0.000023832597,0.00010267372,0.00089769025],"genre_scores_gemma":[0.3050472,0.00006036197,0.6930358,0.00034979364,0.00016429457,0.00051382784,0.00021288227,0.000045695255,0.0005701398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846816,0.000106646345,0.0005682165,0.0002688069,0.0003955596,0.00019259186],"domain_scores_gemma":[0.9971254,0.0010732596,0.0003000717,0.00026106802,0.0011283343,0.00011187863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028466084,0.00015550293,0.00021418126,0.00011636605,0.0004929622,0.00008274276,0.00018134463,0.00006287528,0.00039985887],"category_scores_gemma":[0.00025490217,0.00012675377,0.00005274341,0.0005980732,0.00029003032,0.00022055866,0.00009637104,0.00015770967,0.0000596052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033480947,0.000095246985,0.00006749238,0.000027585756,0.00003192766,8.607413e-8,0.00014358498,0.9090293,0.000019573836,0.08740415,0.00054056133,0.0026371416],"study_design_scores_gemma":[0.00045578415,0.000021577835,0.00020592459,0.000013495682,0.000027794473,0.0000050279964,0.00020191119,0.96425235,0.00003624819,0.033678506,0.0009751669,0.00012620482],"about_ca_topic_score_codex":0.000011617212,"about_ca_topic_score_gemma":0.0000010164869,"teacher_disagreement_score":0.3042171,"about_ca_system_score_codex":0.000033381213,"about_ca_system_score_gemma":0.00011405021,"threshold_uncertainty_score":0.5168869},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05987156577406685,"score_gpt":0.34935601883539363,"score_spread":0.2894844530613268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024962211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010217359,0.000080512065,0.9949466,0.0030247627,0.000010395122,0.0008581003,0.00003167812,0.000121178,0.00082461233],"genre_scores_gemma":[0.039037723,0.000048971495,0.960195,0.00012667343,0.000059406404,0.000260585,0.0001268887,0.000020995403,0.00012377165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987855,0.0000763253,0.00040616645,0.00021645767,0.0003573279,0.00015822666],"domain_scores_gemma":[0.99816334,0.0006179117,0.00022070247,0.00025873393,0.00064759434,0.000091706745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029036953,0.00012073383,0.00014562682,0.000090821515,0.00052164186,0.00005999165,0.00019089953,0.000052036008,0.00008216714],"category_scores_gemma":[0.00012971973,0.00010147704,0.000044263856,0.00047380597,0.00041218495,0.00019188396,0.00006072326,0.00010520956,0.0000072240005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046802347,0.00013566109,0.00004324309,0.00001863209,0.000012675372,2.7642695e-8,0.00003007552,0.6449955,0.0000033162853,0.35158384,0.00014545424,0.0030268803],"study_design_scores_gemma":[0.0004616775,0.000013697595,0.00014262424,0.000006563184,0.000013430543,0.000002190996,0.00002824612,0.89718807,0.000097868455,0.09728588,0.0046641356,0.00009560871],"about_ca_topic_score_codex":0.00000152989,"about_ca_topic_score_gemma":0.0000046280934,"teacher_disagreement_score":0.25429794,"about_ca_system_score_codex":0.000057002802,"about_ca_system_score_gemma":0.0001441291,"threshold_uncertainty_score":0.41381136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04823591415135936,"score_gpt":0.37538249784272015,"score_spread":0.3271465836913608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041781650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007344229,0.00011526363,0.9947697,0.00065808237,0.00012501822,0.0011777455,0.00010283315,0.000113657006,0.0028642765],"genre_scores_gemma":[0.03300549,0.00008711335,0.9644405,0.00047598736,0.0002678416,0.00022772062,0.00090036565,0.00002704609,0.00056788913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742985,0.0000734539,0.0009779282,0.000586645,0.00066607184,0.00026606707],"domain_scores_gemma":[0.99633706,0.0014023246,0.00042046912,0.00029861642,0.0013287691,0.0002127837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990587,0.00020129849,0.00027622946,0.0004335996,0.0006297922,0.00033608897,0.00026147626,0.00012625167,0.000120077384],"category_scores_gemma":[0.00031129824,0.0001901526,0.000112853406,0.0011926501,0.00016574319,0.00042331545,0.000045161396,0.00008535473,0.00002060676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008707399,0.000050323484,0.00020157662,0.0000023982489,0.00001356594,2.585179e-7,0.000072603616,0.8306187,0.0000018023297,0.023357345,0.00033269852,0.14534001],"study_design_scores_gemma":[0.0006421173,0.000036351,0.00043639523,0.000004355396,0.000030420932,0.000015573365,0.0003195394,0.96333236,0.000013216322,0.024708195,0.010246634,0.00021487822],"about_ca_topic_score_codex":0.000005282716,"about_ca_topic_score_gemma":0.0000029318953,"teacher_disagreement_score":0.14512514,"about_ca_system_score_codex":0.00004758851,"about_ca_system_score_gemma":0.00012368102,"threshold_uncertainty_score":0.7754198},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08395092464994196,"score_gpt":0.41112397220285224,"score_spread":0.32717304755291027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043363748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020511608,0.00004959497,0.9978945,0.00006350648,0.000017628201,0.00077306654,0.0000076879605,0.000063279454,0.00092560495],"genre_scores_gemma":[0.023370314,0.000019712359,0.9761026,0.000026497639,0.000014505141,0.00028271356,0.000061257466,0.000026641655,0.000095770294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00010369533,0.00051030266,0.00026095938,0.00019659099,0.00015618351],"domain_scores_gemma":[0.99906236,0.0002679794,0.00017110839,0.00015739021,0.0002620631,0.00007909864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037567274,0.00012767149,0.00022002075,0.0002167481,0.00008844677,0.000020812315,0.00013830145,0.000066145025,0.000078167446],"category_scores_gemma":[0.00016468704,0.00010752311,0.000050889856,0.0006427502,0.00013012852,0.00019090631,0.00008143501,0.00012747067,0.000002455782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030738756,0.00050707295,0.00075771415,0.00012576439,0.00004558033,0.0000023455164,0.001102588,0.82018507,0.000050352963,0.034120902,0.000017557106,0.1430543],"study_design_scores_gemma":[0.0004968954,0.00003786222,0.00015344234,0.0000446175,0.000013397604,0.0000051682205,0.00038608804,0.98739135,0.00018919485,0.010690924,0.00045381175,0.00013725105],"about_ca_topic_score_codex":0.000010297701,"about_ca_topic_score_gemma":0.0000022106622,"teacher_disagreement_score":0.16720627,"about_ca_system_score_codex":0.00004692791,"about_ca_system_score_gemma":0.00008138154,"threshold_uncertainty_score":0.43846655},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Ellipsoid; Mathematics; Correlation clustering; k-medians clustering; CURE data clustering algorithm; Mathematical optimization; Cluster (spacecraft); Canopy clustering algorithm; Algorithm; Computer science; Statistics","score_opus":0.05582170527538512,"score_gpt":0.38760443783404097,"score_spread":0.33178273255865587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046701389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118251904,0.000033446446,0.99701273,0.0002063929,0.000029574125,0.000313366,0.000014086948,0.00009294476,0.0021791975],"genre_scores_gemma":[0.047238134,0.0000097092225,0.9519793,0.0001632016,0.00008879642,0.000051447536,0.000056844186,0.000018018123,0.0003945416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.000020382171,0.00029839357,0.00021381072,0.00013649541,0.00014503639],"domain_scores_gemma":[0.99896854,0.00056801667,0.0000922286,0.000108170396,0.00015085601,0.00011215965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541968,0.00010031154,0.00011931521,0.00006796456,0.00020112016,0.000027111128,0.00006276445,0.000049250688,0.000066451656],"category_scores_gemma":[0.00006570737,0.00010366443,0.000025451158,0.0001780872,0.00006864804,0.0000831546,0.00003632742,0.00007010449,0.0000103615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007915129,0.00006682373,0.00002997692,0.000025092335,0.000008444161,5.945201e-7,0.00006691018,0.6869406,0.000030613068,0.26375034,0.0001714651,0.048901223],"study_design_scores_gemma":[0.00016600777,0.000011099376,0.0001195615,0.000004723024,0.000010391007,0.0000060667726,0.00002715589,0.7027141,0.0000066475063,0.294813,0.0020275286,0.00009370849],"about_ca_topic_score_codex":8.6780153e-7,"about_ca_topic_score_gemma":0.0000014918697,"teacher_disagreement_score":0.048807513,"about_ca_system_score_codex":0.00002382181,"about_ca_system_score_gemma":0.000015346683,"threshold_uncertainty_score":0.4227313},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"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","score_opus":0.017438595689403612,"score_gpt":0.24961380206272565,"score_spread":0.23217520637332204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057565823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024747063,0.000022023049,0.997069,0.0013423259,0.000010413147,0.0006106826,0.000011336011,0.00009477358,0.0008147079],"genre_scores_gemma":[0.012339828,0.0000071416475,0.9869112,0.00030772306,0.00004826835,0.0002890716,0.000055532302,0.000012080251,0.000029160181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990316,0.000042397864,0.00025065662,0.00037429715,0.0001535695,0.00014748477],"domain_scores_gemma":[0.9985637,0.0008856084,0.00012958418,0.00015036612,0.00013695224,0.00013380434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022783152,0.00014223509,0.0001657081,0.00006739121,0.0002976016,0.00015661228,0.00012472994,0.00004314507,0.00001264515],"category_scores_gemma":[0.00007735191,0.00012273835,0.000019257435,0.0002538067,0.00017862247,0.00018525103,0.00005519024,0.000053397634,0.0000020435489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019731153,0.000039876482,0.000033523334,0.000014203498,0.0000074908376,8.165313e-8,0.000025588835,0.71375537,0.000006847935,0.23778374,0.000004803316,0.048326496],"study_design_scores_gemma":[0.0005838379,0.00010523064,0.00008136865,0.00001527076,0.000015594766,0.00003335117,0.000014489701,0.94775116,0.000007793799,0.050859846,0.00037715808,0.00015491838],"about_ca_topic_score_codex":6.4674873e-7,"about_ca_topic_score_gemma":5.6341822e-8,"teacher_disagreement_score":0.23399578,"about_ca_system_score_codex":0.000014939445,"about_ca_system_score_gemma":0.000041627212,"threshold_uncertainty_score":0.5005125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014384514747038524,"score_gpt":0.2430500121766642,"score_spread":0.22866549742962566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057635030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015386034,0.00014853796,0.9967517,0.00043707178,0.00003966841,0.0017424169,0.00008319603,0.00039974513,0.00024375344],"genre_scores_gemma":[0.05044626,0.000033552013,0.9462709,0.0001560659,0.00006705113,0.002020869,0.0009115725,0.000024986264,0.00006878628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991594,0.000039483544,0.0003207044,0.00020371735,0.00011971289,0.00015700255],"domain_scores_gemma":[0.9985257,0.0006611241,0.00007141746,0.0001356556,0.0005376098,0.00006849453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201763,0.00013644109,0.000119047654,0.00006991196,0.00038336372,0.00013524818,0.000104597915,0.00006578862,0.000065922955],"category_scores_gemma":[0.000047168833,0.00012252307,0.000026881546,0.0004581875,0.00007086427,0.00017919029,0.00001614864,0.000090735266,0.000021288499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9543686e-7,0.000013585217,0.000029992341,0.000025610745,0.000025097946,1.2034473e-8,0.000101293044,0.9319238,0.000021527421,0.0015966776,0.000464714,0.065797076],"study_design_scores_gemma":[0.00033292724,0.000008369966,0.00039796595,0.000007411652,0.000020252834,0.0000047810513,0.00011074988,0.99591625,0.000033735043,0.0016640718,0.0013634533,0.00014004348],"about_ca_topic_score_codex":0.000009828112,"about_ca_topic_score_gemma":6.4768136e-7,"teacher_disagreement_score":0.065657035,"about_ca_system_score_codex":0.0000410341,"about_ca_system_score_gemma":0.000029419043,"threshold_uncertainty_score":0.4996346},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025524929425743054,"score_gpt":0.2797806794497151,"score_spread":0.25425575002397205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061568192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008342813,0.00004470912,0.99710613,0.00008314512,0.000020647767,0.00088117184,0.00001709723,0.00026138168,0.0015023075],"genre_scores_gemma":[0.023545371,0.000012531735,0.9751324,0.00015085183,0.000058945097,0.0008561236,0.00016198147,0.000041319712,0.000040448573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.0000539873,0.00023889139,0.00021933453,0.00011796094,0.00015245864],"domain_scores_gemma":[0.999283,0.00021756707,0.000076798555,0.00016892706,0.00017853403,0.00007513295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390677,0.00013406039,0.0001169621,0.00006275239,0.000369091,0.0000908328,0.00013028429,0.000048668968,0.0000619299],"category_scores_gemma":[0.000009234234,0.00010768029,0.000020564838,0.00029035786,0.000036074664,0.00019151802,0.000014560351,0.00007042364,0.0000011837192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058364203,0.000029778013,0.000067550005,0.000019614323,0.000029214985,4.0479538e-8,0.0003139293,0.960906,0.00009433165,0.03564287,0.000060875038,0.0028299198],"study_design_scores_gemma":[0.00039431738,0.000028790717,0.0001332388,0.000009523391,0.00003712344,0.0000068024865,0.00007133238,0.99338824,0.00016577676,0.004674435,0.00093779917,0.00015264843],"about_ca_topic_score_codex":0.0000044007493,"about_ca_topic_score_gemma":6.80802e-7,"teacher_disagreement_score":0.03248217,"about_ca_system_score_codex":0.0000338805,"about_ca_system_score_gemma":0.000036900317,"threshold_uncertainty_score":0.43910748},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009774008977502658,"score_gpt":0.23106854064144983,"score_spread":0.22129453166394716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067314231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055920536,0.00008959951,0.99370116,0.0035154086,0.0000457496,0.00021222462,9.767217e-7,0.00011804906,0.0022609315],"genre_scores_gemma":[0.17732775,0.00020052353,0.81856686,0.0015755565,0.00029231643,0.00037620805,0.0000801346,0.000017392511,0.0015632459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993157,0.00007284654,0.0001744927,0.00021124701,0.00011980548,0.000105900326],"domain_scores_gemma":[0.9992659,0.00023998288,0.000087037806,0.00022690326,0.00011727849,0.00006287664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021606611,0.000077112054,0.00006493195,0.000038378163,0.0007037568,0.00023626548,0.0003012962,0.000027914932,0.0000052785813],"category_scores_gemma":[0.000017163105,0.00005894055,0.000025830428,0.00027844834,0.00007159749,0.0001646265,0.00006925828,0.00005019542,0.000014817908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.111299e-7,0.000008151707,0.000012857837,0.0000014898991,0.0000022835227,3.7664197e-8,0.000016611451,0.37000614,8.7243626e-7,0.60976624,0.00019761025,0.019987002],"study_design_scores_gemma":[0.00017558316,0.000008175892,0.00010613363,0.0000017338415,0.0000024482754,0.000010044339,0.0000044903195,0.81776303,0.000006406142,0.13986745,0.041987054,0.00006742018],"about_ca_topic_score_codex":9.854808e-7,"about_ca_topic_score_gemma":3.0042258e-7,"teacher_disagreement_score":0.4698988,"about_ca_system_score_codex":0.000009648343,"about_ca_system_score_gemma":0.000023365441,"threshold_uncertainty_score":0.54128},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; 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","score_opus":0.04433641405925529,"score_gpt":0.3134835759124052,"score_spread":0.2691471618531499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069942923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014819863,0.00016961414,0.98790914,0.0040101972,0.000115739815,0.0014606719,0.000029011782,0.00014654669,0.0046770903],"genre_scores_gemma":[0.2842819,0.00043184293,0.70821995,0.0014644783,0.00039206733,0.0012487781,0.0007180533,0.00005618403,0.0031867316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968785,0.00023211256,0.0010327625,0.0006904001,0.0008805771,0.0002856442],"domain_scores_gemma":[0.99625486,0.00077687396,0.0005488598,0.0006194719,0.0015637169,0.00023622977],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008993314,0.00027205612,0.00027840486,0.00034983645,0.0013406689,0.0010619785,0.00044098706,0.00014955891,0.001949818],"category_scores_gemma":[0.00026346033,0.00019942185,0.0001136204,0.001808934,0.00030695487,0.0009921074,0.0001437777,0.00018369299,0.00020216237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006154913,0.00006108316,0.00025310117,0.0000015429075,0.000017865395,0.0000048956304,0.00011950526,0.9645469,0.000001859056,0.020306233,0.007062632,0.0076181805],"study_design_scores_gemma":[0.00048356276,0.000022960281,0.00057044165,0.0000042139022,0.00003491578,0.00066010025,0.0005924552,0.98409414,0.0000037608322,0.0070473137,0.006242903,0.00024321725],"about_ca_topic_score_codex":0.000047931873,"about_ca_topic_score_gemma":0.0000031136572,"teacher_disagreement_score":0.28279993,"about_ca_system_score_codex":0.000046810754,"about_ca_system_score_gemma":0.00013046483,"threshold_uncertainty_score":0.999975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","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","score_opus":0.018514707159831854,"score_gpt":0.2650374377517137,"score_spread":0.24652273059188182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072726536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094303343,0.000089368004,0.9819851,0.0021877298,0.00006370587,0.0005301066,0.00000495802,0.00019784385,0.013998178],"genre_scores_gemma":[0.6652833,0.00013705801,0.33153817,0.00081700424,0.00031379308,0.0003688698,0.00046552246,0.000016095128,0.0010601878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917215,0.00005627803,0.00021225457,0.00019454712,0.0001952051,0.00016954329],"domain_scores_gemma":[0.99925417,0.00016928102,0.00009799433,0.000070577575,0.0002877596,0.00012023605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014338546,0.00008025068,0.00008284555,0.00004949944,0.0009025883,0.00016686441,0.0000856263,0.000064390464,0.00036851186],"category_scores_gemma":[0.000026997535,0.0000880474,0.000022925917,0.00045752001,0.00012528278,0.00030814417,0.000009431505,0.00006159267,0.00006764516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.015654e-7,0.000015713089,0.0016310076,0.0000026548614,0.000004702709,5.281577e-8,0.0003395179,0.82642347,5.615969e-7,0.16451101,0.0017616868,0.005309041],"study_design_scores_gemma":[0.00033775176,0.000013083987,0.02079122,0.00001784671,0.000022095477,0.0000015161136,0.0009990988,0.90313363,0.0000016684693,0.02705194,0.047359016,0.0002711111],"about_ca_topic_score_codex":0.00010015047,"about_ca_topic_score_gemma":0.000019248471,"teacher_disagreement_score":0.66434026,"about_ca_system_score_codex":0.000026011276,"about_ca_system_score_gemma":0.000063224725,"threshold_uncertainty_score":0.6942071},"labels":[],"label_agreement":null},{"id":"W2074149593","doi":"10.1007/s10589-007-9159-0","title":"Improved convergence order for augmented penalty algorithms","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Convergence (economics); Multiplier (economics); Quadratic equation; Order (exchange); Penalty method; Compact convergence; Mathematical optimization; Normal convergence; Applied mathematics; Convergence tests; Algorithm; Rate of convergence; Computer science; Key (lock)","score_opus":0.060841206311371424,"score_gpt":0.363099416639977,"score_spread":0.3022582103286056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074149593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009168485,0.000059115428,0.9970656,0.0007126335,0.00003770093,0.001489491,0.00008520923,0.00016151246,0.0002970766],"genre_scores_gemma":[0.0061936034,0.00013561775,0.9901092,0.00022434596,0.000102266895,0.0011686468,0.0005214767,0.0000390978,0.0015057428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876034,0.000033020307,0.00037987877,0.00037125548,0.00024211546,0.00021340918],"domain_scores_gemma":[0.9979121,0.00051772664,0.00016280243,0.00018450225,0.0010778294,0.00014500499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014326832,0.00016059402,0.00018071955,0.00013074845,0.00062593125,0.000035265824,0.00014394309,0.000069963375,0.0001906439],"category_scores_gemma":[0.00020684808,0.00016736724,0.000045705146,0.0005483465,0.00017048947,0.00020195785,0.00005455607,0.00009327381,0.000008753356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017893193,0.0001721074,0.00004455296,0.00003939636,0.00003251486,4.1050606e-7,0.00010839045,0.93458223,0.000021541473,0.061277114,0.0011629066,0.002540948],"study_design_scores_gemma":[0.0009883177,0.000032722037,0.00005961518,0.00000541196,0.000013589417,0.000023326638,0.000047104924,0.9748398,0.00004780329,0.020174049,0.0035844622,0.00018381322],"about_ca_topic_score_codex":0.0000026339915,"about_ca_topic_score_gemma":9.584088e-7,"teacher_disagreement_score":0.041103065,"about_ca_system_score_codex":0.000051617524,"about_ca_system_score_gemma":0.00014780703,"threshold_uncertainty_score":0.68250376},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; Class (philosophy); Process (computing); Mathematics; Computer science; Artificial intelligence","score_opus":0.024249529158629077,"score_gpt":0.3052450481327324,"score_spread":0.2809955189741033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077594413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034639426,0.00017122927,0.9939429,0.000118743264,0.00002804922,0.00042717112,0.000029594601,0.0003199798,0.0046159048],"genre_scores_gemma":[0.55094874,0.00005574052,0.44840315,0.00006542789,0.00007773748,0.00010828396,0.00027404755,0.000014127059,0.000052733725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999454,0.000016113416,0.00017078934,0.00014423551,0.00010550248,0.00010931414],"domain_scores_gemma":[0.9995566,0.00011784629,0.000019200692,0.00008017587,0.00016453581,0.00006166785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009861613,0.00009995975,0.00009986845,0.00008639538,0.00013021601,0.00009243458,0.00005995953,0.00004957028,0.000011869221],"category_scores_gemma":[0.000008766185,0.000109959794,0.000028164828,0.000268381,0.000019288744,0.00018085258,0.0000049900646,0.000042433072,0.0000023114721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033554045,0.000011010794,0.0000062939966,0.00001134084,0.0000088998,3.2472936e-8,0.0000478289,0.9006236,0.000014563411,0.09586689,0.00020605876,0.0032000828],"study_design_scores_gemma":[0.00028415036,0.000023760613,0.00029101656,0.0000057360817,0.000008195443,0.0000011197302,0.00005099551,0.98618263,0.000022484692,0.011371156,0.0016427475,0.000115980634],"about_ca_topic_score_codex":5.512143e-7,"about_ca_topic_score_gemma":1.8226821e-7,"teacher_disagreement_score":0.5506024,"about_ca_system_score_codex":0.000028791435,"about_ca_system_score_gemma":0.000025312625,"threshold_uncertainty_score":0.44840303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Smoothing; Mathematical optimization; Optimization problem; Lagrange multiplier; Applied mathematics; Function (biology)","score_opus":0.011142577973631333,"score_gpt":0.26006185511953944,"score_spread":0.2489192771459081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081084362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025118114,0.000052529867,0.99479544,0.0022808516,0.00003698109,0.00042381827,0.000008163273,0.0003240428,0.002053027],"genre_scores_gemma":[0.055037096,0.000027717319,0.9423826,0.0011746779,0.00007028649,0.00027998706,0.00071431976,0.00001723908,0.000296119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984158,0.00013136887,0.00040127794,0.00052279525,0.00032902436,0.00019973355],"domain_scores_gemma":[0.9986891,0.0002619094,0.00022870234,0.00025371724,0.0004126696,0.00015386901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036492004,0.00017837375,0.00018145851,0.00020496766,0.000560808,0.00042349115,0.0003301938,0.00007172618,0.000030231715],"category_scores_gemma":[0.0000498255,0.00018047934,0.00006199076,0.0011126903,0.00004413265,0.00047090868,0.00011637274,0.000107659886,0.00001715471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.9414215e-7,0.000082660554,0.00014177951,0.000007677889,0.000021073376,5.3613935e-8,0.00013243238,0.75092155,0.000012924945,0.22622702,0.00031433685,0.022137629],"study_design_scores_gemma":[0.00032106752,0.000022795839,0.00021763469,0.000008967264,0.000019690684,0.00000681077,0.000015996318,0.9797599,0.00001691693,0.0076466203,0.011752547,0.00021106236],"about_ca_topic_score_codex":0.000012537338,"about_ca_topic_score_gemma":0.0000013950324,"teacher_disagreement_score":0.22883837,"about_ca_system_score_codex":0.000040116043,"about_ca_system_score_gemma":0.000060814113,"threshold_uncertainty_score":0.7359734},"labels":[],"label_agreement":null},{"id":"W2086286112","doi":"10.1007/s10589-008-9175-8","title":"Efficient preprocessing for VLSI optimization problems","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Preprocessor; Solver; Very-large-scale integration; Computer science; Integer programming; Mathematical optimization; Linear programming; Constraint (computer-aided design); Algorithm; Mathematics; Programming language","score_opus":0.06567202607348327,"score_gpt":0.356399427834244,"score_spread":0.29072740176076073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086286112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018296481,0.000118642056,0.99637544,0.0004002983,0.000026399404,0.0018499875,0.00003824512,0.00022828105,0.0007797295],"genre_scores_gemma":[0.016893627,0.00007011375,0.9804755,0.0001191794,0.0001037884,0.0013381157,0.0003677828,0.000053316842,0.00057861855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984752,0.000038142058,0.00045691113,0.0004611468,0.00033455572,0.00023406342],"domain_scores_gemma":[0.9980359,0.00051677023,0.00022541077,0.00020318247,0.0008812757,0.0001374568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020296224,0.00018222858,0.00019756817,0.00019920093,0.0008888117,0.00006731071,0.0001401352,0.00008621303,0.000077278775],"category_scores_gemma":[0.00022802297,0.00019211447,0.000053541204,0.0005867439,0.00017288951,0.00013968482,0.00005709299,0.000096418175,0.000005385491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008670632,0.00016203796,0.00003512352,0.00007492244,0.000014443156,1.9313993e-7,0.0001868611,0.9753579,0.0000035378664,0.022925638,0.0002004232,0.0010302374],"study_design_scores_gemma":[0.0007877912,0.000024968944,0.000025485151,0.000019649555,0.000016080237,0.00002832625,0.000048318027,0.9837219,0.000014922075,0.014329448,0.00077813974,0.00020497748],"about_ca_topic_score_codex":7.55881e-7,"about_ca_topic_score_gemma":2.680949e-7,"teacher_disagreement_score":0.016710663,"about_ca_system_score_codex":0.000069082715,"about_ca_system_score_gemma":0.00013299032,"threshold_uncertainty_score":0.78342},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025590054375591652,"score_gpt":0.2592640356635096,"score_spread":0.23367398128791794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087512052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026256316,0.000039520168,0.9960465,0.00017520545,0.000038823477,0.0007520804,0.00017219277,0.00002017287,0.00012988986],"genre_scores_gemma":[0.973895,0.0000105597765,0.024723396,0.000020298408,0.00016516128,0.0003733433,0.00074719917,0.000010085987,0.00005492615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000030860672,0.00040784472,0.00016018222,0.00012524801,0.0001125442],"domain_scores_gemma":[0.99905354,0.00021651856,0.00025346398,0.00009811972,0.0003236285,0.00005471668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057961897,0.00009476851,0.00017591636,0.00007920999,0.00030521333,0.000008110082,0.000059055623,0.00003445596,0.00010363166],"category_scores_gemma":[0.0000095852565,0.00009756924,0.000084354724,0.00018622924,0.00013539189,0.000103144936,0.000013763128,0.00004735641,0.0000015220604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014749308,0.00017060249,0.00010369734,0.0000188559,0.000028123493,5.499551e-9,0.00006308248,0.8206568,0.00013860631,0.17773749,0.000055793185,0.0010122261],"study_design_scores_gemma":[0.0010284472,0.00002506043,0.00015889906,0.000009801294,0.000039403523,5.5003375e-7,0.00003458741,0.9951599,0.00024473696,0.0031148111,0.00009993092,0.00008386007],"about_ca_topic_score_codex":0.0000048437846,"about_ca_topic_score_gemma":1.3765722e-7,"teacher_disagreement_score":0.9713231,"about_ca_system_score_codex":0.0000065431977,"about_ca_system_score_gemma":0.00006768836,"threshold_uncertainty_score":0.3978758},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03415400168738806,"score_gpt":0.43124444737366485,"score_spread":0.39709044568627677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088422447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040981887,0.000054485074,0.9976377,0.00028265722,0.000020205573,0.0014452084,0.00003372681,0.00003172593,0.00008448648],"genre_scores_gemma":[0.0058965054,0.000011790845,0.99345446,0.00007010569,0.000017168046,0.00028233445,0.00012194819,0.0000224406,0.00012324813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.0000573136,0.00045093958,0.00021786649,0.00016411503,0.0001691078],"domain_scores_gemma":[0.9975513,0.0016620654,0.00018704287,0.00016365924,0.0003804084,0.000055513636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065178116,0.00010343898,0.00015140988,0.0001421632,0.00015106272,0.000027522754,0.00012612036,0.00006411722,0.00002140977],"category_scores_gemma":[0.00049021136,0.000087038,0.000049817696,0.00057777594,0.00014065015,0.00010065492,0.00006384892,0.000100423844,5.0523096e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015693913,0.0001477723,0.00019910173,0.00005281636,0.00001521305,6.417882e-8,0.00014844483,0.9119959,0.0000407278,0.03506496,0.000013253795,0.052306052],"study_design_scores_gemma":[0.00046518678,0.000013577433,0.0002459132,0.000012992421,0.000011861307,0.0000032812843,0.000103387545,0.9545054,0.00020332987,0.042549323,0.0017938225,0.00009195933],"about_ca_topic_score_codex":8.397373e-7,"about_ca_topic_score_gemma":0.0000040237383,"teacher_disagreement_score":0.052214094,"about_ca_system_score_codex":0.000047961326,"about_ca_system_score_gemma":0.00006990114,"threshold_uncertainty_score":0.35493067},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Simplex; Optimization problem; Simplex algorithm; Linear programming; Combinatorics","score_opus":0.044976527383543866,"score_gpt":0.3669998117124803,"score_spread":0.32202328432893645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098024031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012656584,0.00003495772,0.9951264,0.0007489552,0.000023677823,0.0006183716,0.000014918942,0.00015917457,0.003146947],"genre_scores_gemma":[0.024063542,0.00008198684,0.9742299,0.00029087954,0.000118020595,0.00032855378,0.00031737649,0.000044218894,0.00052556896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984565,0.00013487764,0.00049739826,0.00036631658,0.00032373282,0.00022121282],"domain_scores_gemma":[0.9983675,0.0007872804,0.00015829505,0.00021546024,0.0003543519,0.00011711498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003890903,0.0001712916,0.00021375658,0.00031337317,0.00021755014,0.000070364134,0.00014797399,0.00009331203,0.00020483257],"category_scores_gemma":[0.0003425497,0.00018660464,0.00003420588,0.00069884805,0.00012983696,0.00027673144,0.00006930103,0.00014956188,0.00001668013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004749199,0.00007514763,0.000081446364,0.000024369312,0.000005096954,1.4088991e-7,0.00009941306,0.7787421,8.245657e-7,0.21939123,0.00007571145,0.0014997788],"study_design_scores_gemma":[0.0006352829,0.000019131805,0.000054339496,0.000016465334,0.0000068477098,0.0000043922037,0.00010398537,0.9190057,0.000006677585,0.078700826,0.0012661171,0.00018021483],"about_ca_topic_score_codex":0.0000031542454,"about_ca_topic_score_gemma":0.0000027154083,"teacher_disagreement_score":0.1406904,"about_ca_system_score_codex":0.00006556077,"about_ca_system_score_gemma":0.000057881887,"threshold_uncertainty_score":0.76095164},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03627713515898895,"score_gpt":0.4004326502422642,"score_spread":0.36415551508327526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129835959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007612951,0.000019999787,0.9963696,0.0011799692,0.000063405074,0.0014484326,0.00016213793,0.00017828372,0.0005020262],"genre_scores_gemma":[0.0013445084,0.000019277757,0.99581796,0.00022421495,0.00023252181,0.0009571797,0.00081028236,0.00005137267,0.0005426907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.000046310688,0.00041279432,0.0004090751,0.00027426827,0.00021257943],"domain_scores_gemma":[0.9975022,0.0010541514,0.00019056306,0.00023176908,0.00086337986,0.00015791025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027919683,0.00017706344,0.0001966588,0.00020250253,0.00043801803,0.000107738124,0.00016434351,0.00011782489,0.00018814727],"category_scores_gemma":[0.000405682,0.00018363897,0.000060160586,0.000460153,0.00010070216,0.00021032502,0.000055539356,0.00018117487,0.000007892886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013225889,0.00012666556,0.00002019396,0.0000410795,0.000017902423,1.2084847e-7,0.00008784332,0.7847134,0.000063265354,0.20211652,0.00064413174,0.0121556735],"study_design_scores_gemma":[0.0006898961,0.000024471998,0.00002388478,0.0000058143437,0.000022688606,0.000012974407,0.00007196906,0.9095058,0.0000814714,0.07415765,0.015219003,0.00018441063],"about_ca_topic_score_codex":0.0000019181969,"about_ca_topic_score_gemma":0.000007057629,"teacher_disagreement_score":0.12795888,"about_ca_system_score_codex":0.000025814832,"about_ca_system_score_gemma":0.0001246737,"threshold_uncertainty_score":0.748858},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023345214604791793,"score_gpt":0.2213314967004327,"score_spread":0.1979862820956409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132943005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009773488,0.00035329783,0.99631786,0.00047482218,0.000043998924,0.00064560474,0.00008712197,0.000077296594,0.0010226286],"genre_scores_gemma":[0.86611456,0.000015148306,0.13223508,0.00043297376,0.0001325457,0.00049260445,0.0004298146,0.000021665093,0.0001255954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989592,0.0000041274516,0.00047606113,0.000362784,0.000050068833,0.00014776851],"domain_scores_gemma":[0.9992885,0.000050850405,0.00023547487,0.00015475192,0.00017556794,0.00009484027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009949245,0.00012317045,0.00016949064,0.0001142882,0.00034271769,0.00011987086,0.000085804124,0.000079007186,0.0003479501],"category_scores_gemma":[0.000019163203,0.00014890943,0.000036087164,0.0004314815,0.00009205032,0.00042122774,0.000038279723,0.0000780171,0.00011334721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021615815,0.000053864307,0.00045463562,0.000010461286,0.000007646797,1.5415225e-8,0.000020774976,0.42358437,0.0000057602883,0.57458097,0.000071386385,0.0012079723],"study_design_scores_gemma":[0.00016340918,0.000010116,0.0024177535,0.0000027272847,0.0000056140016,0.0000017206281,0.000027651437,0.6807022,0.0000018774157,0.31559226,0.0009661615,0.00010847315],"about_ca_topic_score_codex":0.0001596813,"about_ca_topic_score_gemma":0.000002636069,"teacher_disagreement_score":0.8651372,"about_ca_system_score_codex":0.00005846924,"about_ca_system_score_gemma":0.00003766286,"threshold_uncertainty_score":0.6072351},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; 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","score_opus":0.05266449761261748,"score_gpt":0.39673410809380244,"score_spread":0.34406961048118495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133898219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006488705,0.000106327316,0.9968308,0.0011551981,0.000021249267,0.001269709,0.00008130824,0.00012231803,0.00034816095],"genre_scores_gemma":[0.03268479,0.000052445306,0.9646841,0.00027629742,0.00007672631,0.00047985013,0.00070652436,0.00003621958,0.0010030209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825346,0.00003829175,0.00061912613,0.0003667377,0.00043104848,0.00029132154],"domain_scores_gemma":[0.9950738,0.0031695215,0.00025548565,0.00023625491,0.0010962685,0.00016867109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396338,0.00017983202,0.00023122647,0.00026931503,0.0011078266,0.00012401417,0.00021136428,0.00008102654,0.000024891857],"category_scores_gemma":[0.00022975376,0.00015614864,0.000117315205,0.001159516,0.00022442982,0.00016419607,0.000058429083,0.00012578693,0.0000059065314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016344946,0.00006414932,0.000034485776,0.000011502828,0.00010892552,1.0245928e-7,0.00007188494,0.7610538,5.181347e-7,0.23575787,0.00023101186,0.0026493876],"study_design_scores_gemma":[0.00047902035,0.000011744913,0.000063373955,0.0000027374656,0.000107555636,0.0000023469333,0.00007926541,0.81861943,0.0000029315984,0.1796981,0.00079100253,0.00014249384],"about_ca_topic_score_codex":8.3384947e-7,"about_ca_topic_score_gemma":0.00000966858,"teacher_disagreement_score":0.05756561,"about_ca_system_score_codex":0.000070871065,"about_ca_system_score_gemma":0.00013366545,"threshold_uncertainty_score":0.85206187},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06588151631744103,"score_gpt":0.3432997407118499,"score_spread":0.27741822439440883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145896656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003297755,0.00007112358,0.9949391,0.0009620431,0.000025542895,0.0032471574,0.00013926119,0.00019336506,0.0003894177],"genre_scores_gemma":[0.00064205,0.00005398237,0.99279463,0.00019636763,0.00009200583,0.005120901,0.0005945203,0.00005505732,0.00045046158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.00003973916,0.0004927842,0.00044654313,0.00029383524,0.0002954634],"domain_scores_gemma":[0.997183,0.001181594,0.00022773116,0.00029744304,0.0009383827,0.0001718071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018385937,0.00021266978,0.00022753836,0.0002008246,0.00048803425,0.0001783803,0.00024762333,0.00008095853,0.00015111548],"category_scores_gemma":[0.0003012079,0.00021590192,0.00006159822,0.0005055596,0.00013769757,0.0003329583,0.0001257211,0.00011331262,0.000015595535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022723968,0.00014693102,0.0000128070205,0.00006767759,0.000030544732,5.8724602e-8,0.00015013601,0.9034006,0.000007811922,0.06301945,0.000673446,0.032488275],"study_design_scores_gemma":[0.0007338643,0.000027680855,0.000030213416,0.000016180378,0.000013079927,0.000004065199,0.00008892521,0.74462736,0.000011781856,0.25252968,0.0017385648,0.00017857771],"about_ca_topic_score_codex":0.000003103951,"about_ca_topic_score_gemma":6.5875514e-7,"teacher_disagreement_score":0.18951024,"about_ca_system_score_codex":0.000064034444,"about_ca_system_score_gemma":0.00006504853,"threshold_uncertainty_score":0.8804225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0342869080749606,"score_gpt":0.24980934305952668,"score_spread":0.21552243498456608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162835374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007438726,0.000046359426,0.97590584,0.0064869784,0.000033784512,0.00074830727,0.0000033491106,0.0001354003,0.015896091],"genre_scores_gemma":[0.944758,0.000018913832,0.045075282,0.0089940475,0.000373177,0.00013369287,0.0004931881,0.000016420152,0.00013730863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990587,0.000011391735,0.00022280854,0.0003550671,0.00022640979,0.00012561449],"domain_scores_gemma":[0.9994417,0.000045090477,0.00013185077,0.0001565145,0.00020396755,0.000020916428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447459,0.00012886457,0.00010525084,0.00021129077,0.00033164409,0.00021856304,0.00008563999,0.000029914356,0.000047759917],"category_scores_gemma":[0.000027436168,0.00013098543,0.00002151289,0.00045600874,0.00004103017,0.0006195351,0.000036346202,0.00006524843,0.000009701975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010273975,0.00010917615,0.00023482517,0.000033043467,0.0000036700917,1.643047e-7,0.000012931104,0.8914308,0.0000021163396,0.0910784,0.0008956545,0.016188977],"study_design_scores_gemma":[0.00035114188,0.000010666308,0.005749878,0.000015074181,0.00001306266,3.5540424e-7,0.000026719747,0.9401863,0.0000018417261,0.043290947,0.010223638,0.00013035192],"about_ca_topic_score_codex":0.000009095116,"about_ca_topic_score_gemma":5.952782e-7,"teacher_disagreement_score":0.9440141,"about_ca_system_score_codex":0.000022431921,"about_ca_system_score_gemma":0.000016001773,"threshold_uncertainty_score":0.5341431},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03189552798021421,"score_gpt":0.3360019964161395,"score_spread":0.30410646843592526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203411556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009442306,0.000053178766,0.99618554,0.0016134769,0.00003448622,0.0012546278,0.0001215517,0.00017888218,0.00046381558],"genre_scores_gemma":[0.049420256,0.00007721314,0.94742566,0.00018807528,0.00012653996,0.0010718064,0.00022658631,0.000055839973,0.001408029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984837,0.00003208766,0.0004318711,0.00045236156,0.00028614272,0.00031380393],"domain_scores_gemma":[0.9980355,0.00073364837,0.00018446113,0.0002218962,0.00065660867,0.00016790329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020643568,0.00018532899,0.00020460755,0.0001429896,0.00043442025,0.00006710155,0.00016619317,0.000103206934,0.00010398588],"category_scores_gemma":[0.00014366854,0.00015485927,0.0000703507,0.0003582247,0.00017361798,0.00028567674,0.000075948315,0.00006540781,0.000014239288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004052006,0.00030613094,0.00011899453,0.00006173633,0.00003192283,5.524333e-7,0.00012247724,0.7173851,0.000026523088,0.2528226,0.0018161265,0.027267262],"study_design_scores_gemma":[0.0016245693,0.000039226,0.00009452914,0.000028299915,0.000019649055,0.000016061449,0.00013490664,0.873274,0.000051165902,0.11975317,0.0047532166,0.00021119135],"about_ca_topic_score_codex":6.154779e-7,"about_ca_topic_score_gemma":0.0000031028435,"teacher_disagreement_score":0.15588889,"about_ca_system_score_codex":0.00010980367,"about_ca_system_score_gemma":0.000096199605,"threshold_uncertainty_score":0.63149774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03306497820491706,"score_gpt":0.34590252527156534,"score_spread":0.3128375470666483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345492474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005907861,0.000018100545,0.9971275,0.00085712486,0.000020196356,0.00068806997,0.000020412377,0.00009849873,0.00057934097],"genre_scores_gemma":[0.34312737,0.000038744543,0.655776,0.00014953836,0.00004448863,0.000547043,0.00006393085,0.000033174034,0.00021970054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988411,0.00005596606,0.00034442567,0.0003183093,0.00025216021,0.000188039],"domain_scores_gemma":[0.99835247,0.0011084019,0.00012620454,0.00014156275,0.0001639288,0.000107430154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021480542,0.00012886047,0.00014627047,0.00028569496,0.00014757385,0.00004686991,0.0001101839,0.00006795514,0.00021885411],"category_scores_gemma":[0.00032790974,0.00010345503,0.000026224327,0.00038665236,0.00020807734,0.00013986976,0.00004415666,0.00010208243,0.000031364867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013491276,0.00020159052,0.00026658332,0.000018277246,0.000013028391,0.0000011026372,0.0000791522,0.5523328,0.00001420858,0.36058104,0.00010662858,0.086372055],"study_design_scores_gemma":[0.002540103,0.000060558268,0.00051218853,0.00015961783,0.000011469624,0.000014978505,0.0001580163,0.7599111,0.000082662555,0.234542,0.001621265,0.00038601022],"about_ca_topic_score_codex":6.544719e-7,"about_ca_topic_score_gemma":0.0000020511438,"teacher_disagreement_score":0.3425366,"about_ca_system_score_codex":0.00008560547,"about_ca_system_score_gemma":0.00007377089,"threshold_uncertainty_score":0.42187735},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011287877925320957,"score_gpt":0.26499336771498977,"score_spread":0.25370548978966884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429556411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009939198,0.00004434299,0.9966714,0.00044898404,0.00004404568,0.0008780427,0.00004703845,0.00063387945,0.0011328907],"genre_scores_gemma":[0.10611272,0.00005012302,0.8928126,0.00015569339,0.00009465987,0.0004672447,0.00021257836,0.000037732967,0.000056642235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992142,0.000021209104,0.00026892533,0.00024392678,0.000103334,0.00014845989],"domain_scores_gemma":[0.99920166,0.00026872507,0.00006963606,0.00013286948,0.0002574195,0.00006972401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009982082,0.00015271002,0.00014735977,0.00014048506,0.00018653736,0.00006346151,0.00008786463,0.000083192084,0.000031283766],"category_scores_gemma":[0.000028204227,0.0001343828,0.000040856947,0.00023529581,0.000053865173,0.00015705713,0.000020031408,0.000048465532,0.0000030025801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005334942,0.000017069051,0.000009440113,0.000012228003,0.000022250193,1.0681858e-7,0.00003710918,0.97704333,0.00083593355,0.007325144,0.0006560616,0.014035976],"study_design_scores_gemma":[0.00056646153,0.000017675271,0.00004104339,0.00003947797,0.000022111768,0.0000074664604,0.000017679868,0.9928901,0.0010592379,0.003165778,0.001982132,0.00019083094],"about_ca_topic_score_codex":0.0000015952966,"about_ca_topic_score_gemma":4.4979825e-7,"teacher_disagreement_score":0.10601333,"about_ca_system_score_codex":0.00003608363,"about_ca_system_score_gemma":0.000038341866,"threshold_uncertainty_score":0.5479972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"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","score_opus":0.038247387429913716,"score_gpt":0.3552282416599088,"score_spread":0.31698085422999506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517321039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027148611,0.000067781366,0.99499214,0.00081425725,0.00005610909,0.0026338648,0.00018673258,0.00026737896,0.00095457915],"genre_scores_gemma":[0.0020030015,0.000027058379,0.99420553,0.00027620723,0.00037536694,0.001787284,0.0006483751,0.00007079022,0.000606383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980991,0.00007729104,0.00054984103,0.0005773253,0.00036925805,0.00032719673],"domain_scores_gemma":[0.99642235,0.0006831753,0.00034034663,0.00036859652,0.0019709368,0.00021459606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021462506,0.00027219823,0.00027479517,0.00021474452,0.0008168879,0.0001546114,0.0002888298,0.00014525645,0.0002776116],"category_scores_gemma":[0.00053588336,0.00028390135,0.00007491846,0.0007259966,0.00059422944,0.00038412993,0.00012209434,0.00012218622,0.000007172837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002877297,0.00016992015,0.000020331876,0.000037093138,0.000059518617,0.0000010233401,0.00020513387,0.87972105,0.0000039193014,0.08901005,0.0012195188,0.029523661],"study_design_scores_gemma":[0.0017893475,0.0001111727,0.000011790395,0.00002374848,0.000036084686,0.000039078473,0.00015219902,0.9209937,0.0000627295,0.07493804,0.0015583085,0.00028379646],"about_ca_topic_score_codex":8.370119e-7,"about_ca_topic_score_gemma":5.2320445e-7,"teacher_disagreement_score":0.041272655,"about_ca_system_score_codex":0.0000885112,"about_ca_system_score_gemma":0.00019428185,"threshold_uncertainty_score":0.9999613},"labels":[],"label_agreement":null},{"id":"W2580510829","doi":"10.1007/s10589-017-9892-y","title":"Visualization of the $$\\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Subderivative; Mathematics; Piecewise; Piecewise linear function; Convex conjugate; Convex function; Applied mathematics; Quadratic equation; Proper convex function; Univariate; Convex analysis; Function (biology); Regular polygon; Quadratic function; Convex optimization; Mathematical analysis; Multivariate statistics; Geometry","score_opus":0.05253497987322648,"score_gpt":0.38480674944649573,"score_spread":0.33227176957326926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580510829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022529643,0.00003443886,0.99550897,0.00036757052,0.00006159848,0.0007067988,0.000060072805,0.00003485061,0.000972712],"genre_scores_gemma":[0.72533953,0.0000644713,0.27335918,0.000035374436,0.00008164064,0.0001771415,0.00015315459,0.00003533442,0.0007541714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987212,0.00006616082,0.0004979952,0.0002228184,0.0003795087,0.00011234426],"domain_scores_gemma":[0.99766874,0.0002780199,0.00069970085,0.00052114716,0.0007707185,0.00006169283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015736172,0.00012437171,0.00020268119,0.000112067355,0.0007225949,0.000049643895,0.00032058195,0.000069404334,0.00010388283],"category_scores_gemma":[0.00044726057,0.00010492373,0.00007160543,0.00027448832,0.00036907662,0.00021672716,0.00016079715,0.00008727753,0.0000026793834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011231017,0.00021494772,0.0013414836,0.000087362634,0.000032808868,5.0315155e-8,0.00010788084,0.84027743,0.00008007541,0.1556254,0.00012532047,0.0020960344],"study_design_scores_gemma":[0.00062520045,0.00002522742,0.00385495,0.000041740335,0.000052091684,0.0000024826236,0.00006358602,0.95637363,0.00041677948,0.038186423,0.00023774574,0.000120123324],"about_ca_topic_score_codex":0.000005835899,"about_ca_topic_score_gemma":0.0000041814933,"teacher_disagreement_score":0.7230866,"about_ca_system_score_codex":0.000024725912,"about_ca_system_score_gemma":0.00010092493,"threshold_uncertainty_score":0.5557689},"labels":[],"label_agreement":null},{"id":"W2593994861","doi":"10.1007/s10589-017-9905-x","title":"Two wide neighborhood interior-point methods for symmetric cone optimization","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"School of Mathematics, Institute for Research in Fundamental Sciences; Shahrekord University; York University","keywords":"Mathematics; Interior point method; Cone (formal languages); Dual cone and polar cone; Point (geometry); Optimization problem; Mathematical optimization; Geometry; Tangent cone; Second-order cone programming; Mathematical analysis; Applied mathematics; Algorithm; Convex optimization; Regular polygon","score_opus":0.06638302178571971,"score_gpt":0.45208287204924824,"score_spread":0.38569985026352854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593994861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008687277,0.00011343043,0.9927944,0.001869073,0.00008920451,0.001900548,0.00006189807,0.00017526468,0.0029874768],"genre_scores_gemma":[0.0068087606,0.00013577896,0.9905801,0.00027791876,0.00011570005,0.0011620426,0.0003891171,0.000071324575,0.0004592822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818796,0.00010762662,0.0006030231,0.0005521312,0.00025742332,0.00029184864],"domain_scores_gemma":[0.9957953,0.0017502209,0.00058773975,0.0005850035,0.0010765454,0.0002052059],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00060148386,0.00025606414,0.00033878695,0.00033329596,0.0014253696,0.0004640132,0.00042608735,0.000104261584,0.0001666804],"category_scores_gemma":[0.0019336801,0.0002722234,0.000093922674,0.00037345398,0.0002446796,0.00061645306,0.00020525618,0.00015406556,0.000007823417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016233465,0.00007560417,0.000047263835,0.000038135306,0.000035739075,1.7395145e-7,0.00004661182,0.7720528,0.000006370166,0.21067588,0.00017068961,0.016834494],"study_design_scores_gemma":[0.001485705,0.00003868008,0.000051032413,0.000021224814,0.00004384111,0.0000085260235,0.000059724473,0.87406254,0.000044571683,0.12275152,0.001180117,0.0002525142],"about_ca_topic_score_codex":0.00000323187,"about_ca_topic_score_gemma":0.0000012571593,"teacher_disagreement_score":0.102009736,"about_ca_system_score_codex":0.00010029664,"about_ca_system_score_gemma":0.00011661992,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W2755505503","doi":"10.1007/s10589-017-9952-3","title":"A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ellipse; Mathematics; Intersection (aeronautics); Polygon (computer graphics); Convex polygon; Combinatorics; Orthogonal convex hull; Regular polygon; Polygon covering; Convex set; Convex hull; Bounded function; Star-shaped polygon; Ellipsoid; Plane (geometry); Geometry; Convex body; Mathematical analysis; Convex optimization; Computer science","score_opus":0.021763194380381334,"score_gpt":0.26079097426604153,"score_spread":0.2390277798856602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755505503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018068374,0.000019081564,0.9971322,0.00013807495,0.000010138848,0.0004960943,0.000014290578,0.00002250236,0.00036081142],"genre_scores_gemma":[0.7791825,0.000013806866,0.22048491,0.000016404567,0.00001768861,0.00020690801,0.00006518206,0.0000056323347,0.000006988833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995611,0.0000103340835,0.0002103478,0.0000893529,0.000083238316,0.00004563583],"domain_scores_gemma":[0.9995012,0.00007652652,0.00016016839,0.00017453723,0.00007844778,0.000009120459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000764759,0.00005884723,0.00009143698,0.00004105124,0.00012234467,0.000019932402,0.00017456955,0.000031193515,7.254382e-7],"category_scores_gemma":[0.000019469784,0.000041880347,0.000037131667,0.000109512286,0.000086701075,0.00009840184,0.000017711254,0.000046687488,8.153072e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035164683,0.000049112263,0.00012929812,0.000037248254,0.0000073474075,6.2654224e-9,0.00009674465,0.9863307,0.00019270711,0.010666842,0.000028794586,0.002457716],"study_design_scores_gemma":[0.00016076931,0.000009580013,0.0013594656,0.000009929801,0.000012944695,0.0000037458526,0.00007187306,0.99440384,0.00035972512,0.0034401985,0.00012398217,0.00004392049],"about_ca_topic_score_codex":0.000005184946,"about_ca_topic_score_gemma":0.0000021436683,"teacher_disagreement_score":0.77737564,"about_ca_system_score_codex":0.000015246819,"about_ca_system_score_gemma":0.000006612264,"threshold_uncertainty_score":0.1707831},"labels":[],"label_agreement":null},{"id":"W2761564338","doi":"10.1007/s10589-019-00078-w","title":"A sub-additive DC approach to the complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Agence Nationale de la Recherche","keywords":"Mixed complementarity problem; Complementarity theory; Mathematics; Linear complementarity problem; Maxima and minima; Monotone polygon; Mathematical optimization; Complementarity (molecular biology); Nonlinear complementarity problem; Optimization problem; Regular polygon; Convex function; Stationary point; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.039618985544971994,"score_gpt":0.3377216631295292,"score_spread":0.2981026775845572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761564338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023929971,0.000018166102,0.98642904,0.0016484818,0.000017931565,0.002600515,0.00009871428,0.000097786266,0.008850085],"genre_scores_gemma":[0.027711008,0.000020522064,0.96886396,0.0008061781,0.00007825946,0.0011425182,0.0006435867,0.000032139844,0.00070184737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986962,0.00007174678,0.00030131688,0.00037058588,0.00036584557,0.0001943083],"domain_scores_gemma":[0.9986746,0.00041948308,0.000113548274,0.0002553245,0.00041661123,0.000120446915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024239055,0.0001427226,0.00015238514,0.00011330774,0.0003653571,0.00010330346,0.0002200204,0.000041006584,0.00016357434],"category_scores_gemma":[0.00004451081,0.00011847023,0.00003553351,0.00064596,0.00007031555,0.00014754223,0.00013575425,0.00014167599,0.00010433167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047610497,0.000111347894,0.00005034466,0.000015968382,0.000015766478,3.3879505e-8,0.00017082373,0.76378894,0.0000037084328,0.23249976,0.0017600567,0.0015784907],"study_design_scores_gemma":[0.00047888467,0.00002582973,0.00023318538,0.000008284524,0.000012882497,0.000007643568,0.00029208083,0.9403502,0.000019784837,0.04121702,0.017176697,0.00017755368],"about_ca_topic_score_codex":0.0000035161088,"about_ca_topic_score_gemma":0.0000025331897,"teacher_disagreement_score":0.19128275,"about_ca_system_score_codex":0.00006785717,"about_ca_system_score_gemma":0.00006695916,"threshold_uncertainty_score":0.48310757},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","score_opus":0.0606054398186082,"score_gpt":0.3863672623675488,"score_spread":0.3257618225489406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768763745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014002415,0.000027098778,0.9957167,0.0009825504,0.000059713926,0.0019275302,0.00019556592,0.000292087,0.00078474544],"genre_scores_gemma":[0.0036045602,0.000018570234,0.993031,0.0005526871,0.00027584634,0.0009951515,0.0012138401,0.000057905123,0.00025040592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980717,0.000093646355,0.00060560054,0.00054127467,0.0003842041,0.0003035858],"domain_scores_gemma":[0.99648404,0.0009987592,0.0002888111,0.0002938934,0.0017374072,0.00019706496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039606268,0.00024888557,0.0002748302,0.00025321025,0.0007006512,0.000138291,0.0001984945,0.00013910796,0.00035132564],"category_scores_gemma":[0.00032489642,0.0002678097,0.00007663126,0.00072502426,0.00043268767,0.00026354252,0.0000558115,0.000116673415,0.000011522966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014929016,0.00016957,0.000012654547,0.000035598885,0.000025824751,1.5954794e-7,0.000052085597,0.9150054,0.0000034100924,0.06068117,0.00049264653,0.023506574],"study_design_scores_gemma":[0.0014808411,0.000093300994,0.000010661578,0.000017319646,0.00003254362,0.0000053355534,0.00006089013,0.96029466,0.00006773262,0.036113802,0.0015468675,0.00027605254],"about_ca_topic_score_codex":0.0000019831152,"about_ca_topic_score_gemma":0.0000012270756,"teacher_disagreement_score":0.045289278,"about_ca_system_score_codex":0.000083213876,"about_ca_system_score_gemma":0.00023147122,"threshold_uncertainty_score":0.9999774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033326208747696866,"score_gpt":0.320718223472419,"score_spread":0.28739201472472214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780752111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004345071,0.0006967129,0.98711014,0.0072042686,0.00015906835,0.0041815736,0.0001172377,0.0004604736,0.00002710493],"genre_scores_gemma":[0.027492907,0.00009651434,0.96823573,0.0003606078,0.00010503281,0.0030527415,0.00054647797,0.000056141263,0.000053820128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721515,0.00010781935,0.00066424545,0.0013445485,0.00032432974,0.00034390317],"domain_scores_gemma":[0.9975739,0.00056249794,0.0005161942,0.00042853956,0.00051265553,0.00040621992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003620624,0.0004925378,0.00049969036,0.00038050316,0.000475334,0.00056233385,0.00046020452,0.0002034921,0.00000562027],"category_scores_gemma":[0.00015800887,0.0005460698,0.000081440376,0.0004554356,0.00024148733,0.00028881835,0.001053603,0.00030584045,0.0000012756902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011269296,0.00008090597,0.0000055148475,0.00013598196,0.000051341114,2.324287e-7,0.00040548676,0.7572226,0.00001757167,0.23924333,0.00034763993,0.0024781316],"study_design_scores_gemma":[0.0006245241,0.00010274387,0.0000784949,0.000071451555,0.00008461512,0.0000216245,0.00004485656,0.85967594,0.000019999019,0.13869628,0.00015150136,0.0004279684],"about_ca_topic_score_codex":0.0000060484936,"about_ca_topic_score_gemma":5.745082e-7,"teacher_disagreement_score":0.102453336,"about_ca_system_score_codex":0.000116782525,"about_ca_system_score_gemma":0.00019229748,"threshold_uncertainty_score":0.99969906},"labels":[],"label_agreement":null},{"id":"W2802936684","doi":"10.1007/s10589-018-0007-1","title":"A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Piecewise linear function; Adjacency matrix; Vertex (graph theory); Bivariate analysis; Time complexity; Graph; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.00804029159818934,"score_gpt":0.25733657941712923,"score_spread":0.2492962878189399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802936684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014475554,0.000042986696,0.9938651,0.004383076,0.00011240068,0.0005207969,0.000029155344,0.00016481917,0.00073694694],"genre_scores_gemma":[0.03114288,0.000011059092,0.96590626,0.0015638411,0.00039335192,0.00013874042,0.00011552014,0.000018300578,0.00071004836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986307,0.00009579593,0.00039206966,0.0003847782,0.00032086932,0.00017580655],"domain_scores_gemma":[0.9981975,0.00029605208,0.00019011096,0.0003651541,0.000806813,0.00014436449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033145997,0.00015962802,0.00019372994,0.00014589798,0.00057696976,0.000113154056,0.00043587846,0.000049433293,0.00006063913],"category_scores_gemma":[0.00004955407,0.00013128575,0.00005103201,0.0009866827,0.00019543954,0.00017209441,0.00019724946,0.00012665922,0.00021765368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032154355,0.00008338391,0.000022272401,0.000007075678,0.000030764888,2.5519057e-7,0.00032036996,0.93093896,0.000026603555,0.030158779,0.00075836066,0.03764995],"study_design_scores_gemma":[0.00031124504,0.00010074471,0.0003387332,0.000013157554,0.000016361448,0.000010561592,0.000015259959,0.9841659,0.00003034701,0.002251133,0.012600014,0.0001465345],"about_ca_topic_score_codex":0.000016780556,"about_ca_topic_score_gemma":0.0000010629185,"teacher_disagreement_score":0.053226937,"about_ca_system_score_codex":0.000019358464,"about_ca_system_score_gemma":0.00012613644,"threshold_uncertainty_score":0.5353677},"labels":[],"label_agreement":null},{"id":"W2889382438","doi":"10.1007/s10589-018-0032-0","title":"Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Heuristic; Bilevel optimization; Mathematics; Revenue management; Maximization; Piecewise linear function; Nonlinear system; Flow network; Function (biology); Piecewise; Integer programming; Revenue; Optimization problem; Economics","score_opus":0.016547017935155797,"score_gpt":0.29307292499669324,"score_spread":0.27652590706153746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889382438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01619542,0.000119123055,0.9811862,0.0010815621,0.00006748287,0.0006279536,0.000063911866,0.00009573011,0.0005626243],"genre_scores_gemma":[0.8682658,0.00033447356,0.12936792,0.0006164696,0.00056492444,0.00011459982,0.00056449993,0.00001956585,0.000151738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989786,0.00011494676,0.0002813886,0.00025401634,0.00020347428,0.00016756672],"domain_scores_gemma":[0.99907535,0.0003040634,0.00016523468,0.00010172397,0.00025354067,0.000100110425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003706673,0.000111816196,0.0001029948,0.00006330439,0.002067687,0.00014462663,0.0000710706,0.00008510745,0.00006057204],"category_scores_gemma":[0.00004676482,0.00010470558,0.00002360762,0.00046985442,0.00038508725,0.00026628934,0.000007109487,0.00009095037,0.0000035917278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010436517,0.000030748633,0.0034756898,0.000009997222,0.000013289018,0.0000022798886,0.0039018095,0.9601225,0.0000010687072,0.028024951,0.00030724527,0.0040999395],"study_design_scores_gemma":[0.0004980587,0.000021833475,0.0126418285,0.000021139387,0.000065821594,0.000023252316,0.0007549482,0.9574206,0.0000023425878,0.0027984178,0.02556436,0.00018739917],"about_ca_topic_score_codex":0.00021310007,"about_ca_topic_score_gemma":0.0008530274,"teacher_disagreement_score":0.8520704,"about_ca_system_score_codex":0.000024952229,"about_ca_system_score_gemma":0.00006303785,"threshold_uncertainty_score":0.99923146},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Parameterized complexity; Norm (philosophy); Algorithm; Operator norm; Applied mathematics; Pure mathematics; Hilbert space","score_opus":0.0062931027341781515,"score_gpt":0.2275084460021012,"score_spread":0.22121534326792305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924275034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068887064,0.000056304714,0.9953239,0.0014684984,0.000083257255,0.00042151046,0.000013171698,0.00019190685,0.0023725803],"genre_scores_gemma":[0.02239282,0.000050322928,0.9748064,0.0012533445,0.000066510285,0.00015518907,0.00031040036,0.000012054812,0.0009529357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882543,0.00004512038,0.00030512968,0.00041573265,0.00026486118,0.00014370153],"domain_scores_gemma":[0.99902904,0.00015727818,0.00014741761,0.00027685866,0.00027820142,0.000111200185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012885706,0.00013815824,0.00016333534,0.00019048188,0.0002069554,0.0002597481,0.00030055942,0.000057650846,0.0002344244],"category_scores_gemma":[0.000011167188,0.00013935544,0.00006254332,0.00081578223,0.00003331118,0.0005184157,0.00011532872,0.00007503864,0.0001867019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011815903,0.000049988976,0.0001160023,0.0000043462246,0.00002056874,1.2820567e-7,0.00004178436,0.79046863,0.0000037026564,0.19555363,0.000095337935,0.013644695],"study_design_scores_gemma":[0.00048420622,0.00001803446,0.00053195434,0.0000037071222,0.000010654375,0.00000847581,0.00001420422,0.9794991,0.0000051202137,0.010198543,0.009057274,0.00016872516],"about_ca_topic_score_codex":0.0000037258508,"about_ca_topic_score_gemma":2.1687306e-7,"teacher_disagreement_score":0.18903047,"about_ca_system_score_codex":0.000027281118,"about_ca_system_score_gemma":0.000069513444,"threshold_uncertainty_score":0.56827503},"labels":[],"label_agreement":null},{"id":"W2944992100","doi":"10.1007/s10589-020-00201-2","title":"A regularization method for constrained nonlinear least squares","year":2020,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"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":"Mathematics; Regularization (linguistics); Least-squares function approximation; Non-linear least squares; Applied mathematics; Nonlinear system; Mathematical optimization; Computer science; Algorithm; Statistics; Artificial intelligence; Estimation theory; Physics; Estimator","score_opus":0.04757892133108757,"score_gpt":0.3454934963193129,"score_spread":0.2979145749882254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944992100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010071975,0.00002086108,0.9930221,0.0055566947,0.000012312636,0.00070035795,0.00021690904,0.00012208299,0.00033862176],"genre_scores_gemma":[0.0023628033,0.0000050064,0.9953972,0.0011609436,0.00016560187,0.00026396723,0.00055394496,0.000018694105,0.00007184351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991981,0.000031469608,0.000275252,0.00025824003,0.0001320476,0.000104919214],"domain_scores_gemma":[0.99865514,0.0007891678,0.00010039731,0.00006285306,0.00024949975,0.00014295074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007779983,0.00010786684,0.00015941345,0.0000230336,0.00019055208,0.00004809142,0.00006846685,0.000049018447,0.00008605176],"category_scores_gemma":[0.00025682393,0.00010382878,0.000041309882,0.00026718486,0.000068486836,0.00006288112,0.000023360995,0.000052993168,0.0000063326243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021788665,0.00008707426,0.000009522325,0.000073651885,0.000024340065,1.7649671e-7,0.00011318951,0.27173498,0.000020857799,0.6984895,0.0008066925,0.028618233],"study_design_scores_gemma":[0.00045684964,0.000043760305,0.00001559608,0.0000044195717,0.000029642279,0.0000031906973,0.000042806743,0.8286819,0.000019719486,0.16620718,0.0043899347,0.00010501643],"about_ca_topic_score_codex":8.6525074e-7,"about_ca_topic_score_gemma":1.6160634e-7,"teacher_disagreement_score":0.5569469,"about_ca_system_score_codex":0.000009742046,"about_ca_system_score_gemma":0.000030818595,"threshold_uncertainty_score":0.42340147},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Heuristics; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Integer programming; Computer science; Heuristic; Mathematics; Algorithm; Schedule","score_opus":0.008094846714795557,"score_gpt":0.20937194582739083,"score_spread":0.20127709911259528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981143387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066737615,0.00031671344,0.99726635,0.00032171872,0.000037234357,0.00077068043,0.00006224282,0.00011596126,0.00044169708],"genre_scores_gemma":[0.31154668,0.000051050323,0.68764937,0.000059625094,0.00003346069,0.00014590341,0.00039972184,0.00002368496,0.00009052303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.000009584806,0.00023266766,0.00014920389,0.00012526508,0.000102787184],"domain_scores_gemma":[0.99924415,0.00021621045,0.00008699811,0.0001159588,0.00029966736,0.00003702577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081523685,0.000109620145,0.00012975345,0.00006260558,0.00015082826,0.00004907751,0.00008572318,0.00003768235,0.00004658291],"category_scores_gemma":[0.0000074813775,0.00008548176,0.000026359501,0.0002616848,0.00007043713,0.00006785535,0.000012016376,0.00006311785,0.0000050113686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008918144,0.000030146206,0.0001630048,0.00005628304,0.000026953112,2.215138e-8,0.000054683445,0.986798,0.000030708983,0.011590249,0.000035961933,0.0012050591],"study_design_scores_gemma":[0.0005520227,0.000035736255,0.00016911601,0.000027405082,0.000026753683,0.0000048040424,0.00007079914,0.9972242,0.00005595232,0.0005688651,0.0011524648,0.00011185337],"about_ca_topic_score_codex":0.0000013356027,"about_ca_topic_score_gemma":7.9469794e-7,"teacher_disagreement_score":0.31087932,"about_ca_system_score_codex":0.000021292737,"about_ca_system_score_gemma":0.000024535624,"threshold_uncertainty_score":0.3485845},"labels":[],"label_agreement":null},{"id":"W3043869225","doi":"10.1007/s10589-022-00377-9","title":"Accelerated inexact composite gradient methods for nonconvex spectral optimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Science Foundation of Sri Lanka; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Differentiable function; Composite number; Lipschitz continuity; Gradient method; Singular value; Matrix (chemical analysis); Proximal Gradient Methods; Function (biology); Convex function; Mathematical optimization; Applied mathematics; Optimization problem; Convex optimization; Regular polygon; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors; Geometry","score_opus":0.02793974280159954,"score_gpt":0.3031777671272709,"score_spread":0.27523802432567135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043869225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022814794,0.00024144458,0.99708307,0.00019002327,0.00007322384,0.0009248996,0.000046773428,0.0005387754,0.00067365065],"genre_scores_gemma":[0.12646814,0.00006141793,0.8705929,0.00019913111,0.00006293607,0.0012001472,0.001336904,0.000040178496,0.00003824081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923897,0.00004797936,0.0002554081,0.00021842476,0.00010088741,0.00013833633],"domain_scores_gemma":[0.99949414,0.00011610235,0.00007124546,0.00011529835,0.00014273063,0.000060500104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012156028,0.00013490836,0.00013923494,0.00014574084,0.00044376886,0.00007493926,0.0001113973,0.000033400524,0.00007621288],"category_scores_gemma":[0.000004639928,0.00015958455,0.000041661846,0.00037856173,0.00003315454,0.00010259078,0.00004682867,0.00010449928,9.1243584e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048101206,0.000043766337,0.000018706649,0.0000113114,0.000025520405,9.632864e-8,0.00006446164,0.9910451,0.0002367222,0.004695931,0.00050937757,0.0033442047],"study_design_scores_gemma":[0.00033184243,0.000031880445,0.000060547933,0.0000049278524,0.000021421267,0.0000128029415,0.000024880228,0.9882818,0.0002546499,0.0032869277,0.007511297,0.0001770269],"about_ca_topic_score_codex":0.0000022651852,"about_ca_topic_score_gemma":1.6024276e-7,"teacher_disagreement_score":0.12649016,"about_ca_system_score_codex":0.00007524544,"about_ca_system_score_gemma":0.000023152765,"threshold_uncertainty_score":0.65076697},"labels":[],"label_agreement":null},{"id":"W3091576739","doi":"10.1007/s10589-022-00448-x","title":"Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition","year":2023,"lang":"en","type":"preprint","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia Graduate School; Natural Sciences and Engineering Research Council of Canada","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Quasi-Newton method; Inverse; Noise (video); Applied mathematics; Mathematics; Inverse problem; Mathematical optimization; Computer science; Newton's method; Mathematical analysis; Artificial intelligence; Nonlinear system; Geometry; Physics","score_opus":0.10201284216496538,"score_gpt":0.41545003704038547,"score_spread":0.3134371948754201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091576739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000317535,0.00018767254,0.99017966,0.0049471953,0.0001606456,0.0032070577,0.00038020159,0.0005360803,0.00036970593],"genre_scores_gemma":[0.0019675894,0.00045564727,0.98608744,0.00045230056,0.0004110326,0.0034465773,0.0047493964,0.0001986978,0.0022313276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996018,0.00048980926,0.0010765959,0.0010336152,0.00095062045,0.00043137957],"domain_scores_gemma":[0.9945665,0.0023252815,0.0008482235,0.0007445497,0.0012704114,0.00024505518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001099398,0.0005258659,0.00059486675,0.00045819365,0.0010110616,0.00041963288,0.00060729665,0.00033133777,0.0003254454],"category_scores_gemma":[0.00039444116,0.0004645433,0.00019753912,0.0009667274,0.0002576577,0.00021952062,0.00076832826,0.0008432316,0.00006273002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001764223,0.0001710645,0.000008452375,0.00022689246,0.00012308151,0.000002301665,0.00038988004,0.9447253,0.000010286553,0.0504351,0.002258951,0.0016310768],"study_design_scores_gemma":[0.0006099765,0.000019950034,0.00004314448,0.000104135506,0.00011751294,0.000027740409,0.00025359067,0.8030531,0.00001718137,0.19380903,0.0015493209,0.0003953614],"about_ca_topic_score_codex":0.000050445644,"about_ca_topic_score_gemma":0.000020149266,"teacher_disagreement_score":0.14337394,"about_ca_system_score_codex":0.00026801144,"about_ca_system_score_gemma":0.00044112388,"threshold_uncertainty_score":0.99978065},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013357220778580144,"score_gpt":0.27697900528041125,"score_spread":0.2636217845018311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106015846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011238676,0.00004831346,0.9959854,0.0021321487,0.000058957066,0.00040454904,0.000032570442,0.00017390345,0.000040314113],"genre_scores_gemma":[0.23872852,0.00000625503,0.76049876,0.00037906095,0.0001327519,0.00016941654,0.00003210111,0.000011305617,0.000041811632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904513,0.000035109784,0.00021073953,0.00041419922,0.00012943416,0.00016538479],"domain_scores_gemma":[0.99898547,0.00036085994,0.00009975904,0.000194365,0.00024459662,0.00011496905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496335,0.00012494202,0.000111274196,0.000103549384,0.00038413136,0.00016533342,0.0002555379,0.000039480805,0.000005881625],"category_scores_gemma":[0.000021275517,0.00009479954,0.000036668545,0.00023235651,0.00006273309,0.0003266815,0.0000721818,0.000041426727,0.0000042378156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023421303,0.000041703937,0.000014966401,0.000005426281,0.000006815571,1.739937e-7,0.00008657094,0.576525,0.00006430232,0.37721732,0.000112653186,0.045922752],"study_design_scores_gemma":[0.00038311086,0.000056424946,0.00021379231,0.000015818528,0.000004480259,0.000010590982,0.0000042554348,0.91196257,0.000023912253,0.08408295,0.0030977735,0.00014432597],"about_ca_topic_score_codex":9.345927e-7,"about_ca_topic_score_gemma":2.502413e-7,"teacher_disagreement_score":0.33543757,"about_ca_system_score_codex":0.000018824792,"about_ca_system_score_gemma":0.000052074713,"threshold_uncertainty_score":0.38658133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021822011724032295,"score_gpt":0.2932571728029479,"score_spread":0.2714351610789156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125711631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005881394,0.00015593416,0.99168414,0.0063658357,0.00006490518,0.0010008921,0.000039884504,0.00003764548,0.00059195014],"genre_scores_gemma":[0.06382111,0.000028794175,0.9349108,0.0004981353,0.00006998561,0.00045667007,0.000060202685,0.00000846762,0.00014585364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989001,0.00010496201,0.00033552138,0.00031541495,0.00022411076,0.00011987143],"domain_scores_gemma":[0.99663323,0.0018787612,0.00037128926,0.00027954584,0.0007994486,0.00003774315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934545,0.0001091702,0.00013289375,0.000052292857,0.0007015635,0.00013504126,0.00035682213,0.000044704168,0.000006354713],"category_scores_gemma":[0.00011093671,0.00007979215,0.000091897906,0.0007937208,0.00010313799,0.00024676265,0.00016478967,0.000113496935,7.379692e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034420323,0.00005630167,0.000022198572,0.000012378708,0.000029059738,5.6160022e-8,0.00041948847,0.55391544,0.00003199425,0.430162,0.00006866776,0.01527894],"study_design_scores_gemma":[0.00042895673,0.000017221653,0.0007280253,0.000016578233,0.000029450117,0.000011176024,0.00023061567,0.9235432,0.00033637695,0.0726697,0.0018987943,0.000089901194],"about_ca_topic_score_codex":0.0000075922194,"about_ca_topic_score_gemma":0.0000057999086,"teacher_disagreement_score":0.36962774,"about_ca_system_score_codex":0.000025848329,"about_ca_system_score_gemma":0.00018124073,"threshold_uncertainty_score":0.539593},"labels":[],"label_agreement":null},{"id":"W3134041587","doi":"10.1007/s10589-020-00249-0","title":"Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Probabilistic logic; Martingale (probability theory); Convergence (economics); Extension (predicate logic); Stochastic optimization; Convergence of random variables; Algorithm; Random variable; Computer science; Applied mathematics","score_opus":0.04944740018437694,"score_gpt":0.32636244376584844,"score_spread":0.2769150435814715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134041587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014414188,0.00020079513,0.9969376,0.00063496194,0.000072420895,0.0013507021,0.00007349008,0.00019712692,0.0005184996],"genre_scores_gemma":[0.013026917,0.00003402122,0.9855106,0.0001707916,0.00009078368,0.00048208388,0.00046109813,0.000034649656,0.00018905893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977848,0.00012832192,0.00048429385,0.0007857541,0.00048753872,0.0003293149],"domain_scores_gemma":[0.9961775,0.0010136828,0.00016062094,0.00039449977,0.0020270068,0.00022670794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035867275,0.0002318586,0.00028206746,0.00025155168,0.00064663816,0.00047535513,0.00035711064,0.00009338559,0.000091432266],"category_scores_gemma":[0.00029946462,0.00025735452,0.000072235634,0.0012810118,0.00015270017,0.00047837774,0.00022546762,0.00012365816,0.000008137973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006448512,0.000120128905,0.000009724434,0.00003315979,0.000034738932,9.848978e-7,0.00008408283,0.89706415,0.000006516256,0.10101197,0.00006209787,0.0015659997],"study_design_scores_gemma":[0.0005891702,0.00003785143,0.00002449634,0.000023091605,0.000037089605,0.00003289234,0.00004622953,0.9940661,0.000055032662,0.0047441847,0.00008232024,0.00026153878],"about_ca_topic_score_codex":0.0000033509373,"about_ca_topic_score_gemma":5.05727e-7,"teacher_disagreement_score":0.097001955,"about_ca_system_score_codex":0.00011615598,"about_ca_system_score_gemma":0.000591589,"threshold_uncertainty_score":0.99998784},"labels":[],"label_agreement":null},{"id":"W3141233211","doi":"10.1007/s10589-021-00272-9","title":"DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Multi-objective optimization; Iterated local search; Extension (predicate logic); Context (archaeology); Set (abstract data type); Pareto principle; Mathematics; Computer science; Optimization problem; Metaheuristic","score_opus":0.018983299392605023,"score_gpt":0.29188553682389085,"score_spread":0.27290223743128583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141233211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012748744,0.0002236435,0.9947384,0.0007569235,0.00013524728,0.0019070811,0.00019004333,0.00041042417,0.0016254594],"genre_scores_gemma":[0.02046117,0.00015064463,0.97581166,0.0005021246,0.00012631198,0.0013957545,0.00097148964,0.000051917425,0.0005289522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972971,0.00016289225,0.0005871465,0.0011419009,0.00041357995,0.0003973758],"domain_scores_gemma":[0.99549097,0.0009029333,0.00031696376,0.00044700556,0.002586412,0.00025571897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002480511,0.0003540139,0.00036184295,0.0002916678,0.00089640176,0.0003945708,0.00037094022,0.00015422037,0.000063855405],"category_scores_gemma":[0.0002929117,0.00041057405,0.00013204887,0.0013179879,0.00024491356,0.0010165336,0.00021023693,0.0001790778,0.000014511749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750584,0.00024971567,0.00002495046,0.000017268203,0.00006611714,0.000002098261,0.00030434894,0.9384755,0.000035180536,0.05168473,0.000083179475,0.009039408],"study_design_scores_gemma":[0.0021111018,0.000060296537,0.00016658434,0.000022931652,0.00003109094,0.000032054046,0.00023376243,0.99268335,0.0002859869,0.0031828724,0.0007433397,0.00044664534],"about_ca_topic_score_codex":0.0000050379904,"about_ca_topic_score_gemma":0.000004034611,"teacher_disagreement_score":0.054207835,"about_ca_system_score_codex":0.00020278251,"about_ca_system_score_gemma":0.0004844683,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W3180164923","doi":"10.1007/s10589-022-00381-z","title":"Quantifying uncertainty with ensembles of surrogates for blackbox optimization","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Institut de Valorisation des Données","keywords":"Mathematical optimization; Computer science; Stochastic optimization; Context (archaeology); Optimization problem; Metaheuristic; Mathematics","score_opus":0.022842800052946446,"score_gpt":0.28093445588126226,"score_spread":0.25809165582831584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180164923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091616974,0.00008618096,0.9978354,0.00051452924,0.000040656792,0.0010374824,0.00008652782,0.00014165322,0.00016598076],"genre_scores_gemma":[0.112764746,0.000025607167,0.88558835,0.00014555614,0.00002162754,0.00089369074,0.0004900365,0.000021525608,0.00004888744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986576,0.00006842273,0.00035514732,0.00045147655,0.00030274622,0.000164618],"domain_scores_gemma":[0.9982921,0.00040298508,0.0003431841,0.00023413282,0.00065418874,0.0000734125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001962849,0.00015863735,0.0001922913,0.0002251148,0.0007092764,0.00007312562,0.00030490314,0.000030484925,0.000033372235],"category_scores_gemma":[0.000032454453,0.00016574125,0.00004424689,0.0009091331,0.00010092555,0.00036883567,0.00014926947,0.00008263627,6.151138e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435772,0.00010525504,0.00010037487,0.000017838001,0.000020482505,1.5369676e-7,0.00018191841,0.9042312,0.000011094843,0.09348658,0.000023814588,0.0018038559],"study_design_scores_gemma":[0.00092161074,0.00010511491,0.00006670846,0.000006795649,0.000014950005,0.000017130262,0.00022299215,0.99596715,0.00004867593,0.0017666945,0.0006701176,0.00019204446],"about_ca_topic_score_codex":0.000004061205,"about_ca_topic_score_gemma":0.0000017676771,"teacher_disagreement_score":0.11267313,"about_ca_system_score_codex":0.00007212662,"about_ca_system_score_gemma":0.00014271254,"threshold_uncertainty_score":0.6758732},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.016634547184986328,"score_gpt":0.2905574431592843,"score_spread":0.273922895974298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212784844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011787011,0.00009182021,0.992652,0.0048405807,0.00008911147,0.0011565045,0.000103446415,0.0002663555,0.0007883962],"genre_scores_gemma":[0.012536685,0.000023872019,0.9806944,0.0019134488,0.00011236193,0.0022625152,0.0017024657,0.00002972174,0.00072450686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784994,0.00016925407,0.0005948857,0.000683255,0.00045316093,0.00024947897],"domain_scores_gemma":[0.99807036,0.0004714885,0.00038823008,0.00029339053,0.0006326162,0.00014390225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005228565,0.00020978929,0.00024161057,0.00035423067,0.0014184237,0.00027419082,0.00047727124,0.00005941599,0.00018355697],"category_scores_gemma":[0.00005637888,0.00023958506,0.00012075234,0.001546495,0.00003563526,0.0004536021,0.0002632781,0.00013170783,0.000008289292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044295703,0.00009676876,0.000056553283,0.000017753235,0.000036526624,9.6945286e-8,0.00018713922,0.76202995,0.0000095749565,0.23202835,0.00056974066,0.0049631186],"study_design_scores_gemma":[0.00071879587,0.000053285446,0.00014178512,0.0000037925786,0.000041076913,0.000015835554,0.000071996204,0.9517422,0.000012242424,0.019273164,0.027662523,0.0002633382],"about_ca_topic_score_codex":0.0000075381713,"about_ca_topic_score_gemma":0.0000013914417,"teacher_disagreement_score":0.21275517,"about_ca_system_score_codex":0.00011611298,"about_ca_system_score_gemma":0.00019461838,"threshold_uncertainty_score":0.99988157},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.015490618293717917,"score_gpt":0.2657578315025077,"score_spread":0.2502672132087898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W356322785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006519393,0.00002988158,0.9933828,0.003718014,0.000038919694,0.0008051996,0.000049904407,0.00019422898,0.0017745495],"genre_scores_gemma":[0.008941777,0.0000058946366,0.98765993,0.0011612644,0.000075451964,0.0008130578,0.0010085047,0.000011446677,0.00032269917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988315,0.000045896413,0.00035068527,0.00030529415,0.00030983562,0.00015678411],"domain_scores_gemma":[0.9979424,0.00019799432,0.00022360787,0.0002147782,0.001216237,0.00020499616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028738333,0.00015888715,0.00016271294,0.000281351,0.0003535228,0.00035056873,0.00022693035,0.00006242034,0.000020055408],"category_scores_gemma":[0.000050848987,0.00014302162,0.00004781988,0.000979007,0.00004285613,0.0014383863,0.00006301043,0.000069635316,0.000028284412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012326811,0.00008457743,0.00006947951,0.00000822255,0.000034138593,2.818894e-8,0.00015561092,0.8313537,4.9482975e-7,0.16263144,0.0007790902,0.004870868],"study_design_scores_gemma":[0.00085005286,0.0001109821,0.00013924725,0.0000045597344,0.000039385715,0.000015512223,0.000079370344,0.9613622,0.000004991946,0.005478222,0.03172737,0.00018811235],"about_ca_topic_score_codex":0.0000109965,"about_ca_topic_score_gemma":0.0000030844883,"teacher_disagreement_score":0.1571532,"about_ca_system_score_codex":0.000062750274,"about_ca_system_score_gemma":0.00032974864,"threshold_uncertainty_score":0.58322525},"labels":[],"label_agreement":null},{"id":"W4393046351","doi":"10.1007/s10589-024-00567-7","title":"Inexact direct-search methods for bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Università degli Studi di Padova","keywords":"Bilevel optimization; Mathematics; Mathematical optimization; Trust region; Optimization problem; Computer science","score_opus":0.09613370230575952,"score_gpt":0.4657332647181794,"score_spread":0.36959956241241987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393046351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019978147,0.00070478686,0.9931093,0.0010742669,0.00007817457,0.0022270815,0.00010699575,0.00048864674,0.002208749],"genre_scores_gemma":[0.0010627849,0.00028741398,0.9942879,0.000102523954,0.00017121596,0.0018616007,0.0007694223,0.0000892675,0.0013678491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981679,0.00013118255,0.00051992555,0.0006007068,0.0002941606,0.0002861713],"domain_scores_gemma":[0.9966093,0.0021816697,0.00009009514,0.00023231706,0.0007197191,0.00016691604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173479,0.00022811088,0.00024782043,0.0004288906,0.00042602938,0.00032177885,0.0001832755,0.00012015865,0.00021709748],"category_scores_gemma":[0.0002919556,0.00022508018,0.00008464535,0.0011053924,0.00013322159,0.00040131068,0.000083752464,0.0001711625,0.000012360211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005868288,0.000075389034,0.0000031212605,0.0001904371,0.00004145428,1.7911759e-7,0.00010419391,0.83716136,0.00001075128,0.13287732,0.0005157046,0.029014237],"study_design_scores_gemma":[0.00035441964,0.000034685712,0.0000034905952,0.000044828048,0.000034161978,0.000009787709,0.000031552765,0.91949314,0.000034031986,0.064604945,0.015127691,0.00022725367],"about_ca_topic_score_codex":0.0000017383295,"about_ca_topic_score_gemma":3.599103e-7,"teacher_disagreement_score":0.08233181,"about_ca_system_score_codex":0.00011406504,"about_ca_system_score_gemma":0.00020461793,"threshold_uncertainty_score":0.9178503},"labels":[],"label_agreement":null},{"id":"W4399858594","doi":"10.1007/s10589-024-00590-8","title":"Q-fully quadratic modeling and its application in a random subspace derivative-free method","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Subspace topology; Derivative (finance); Quadratic equation; Applied mathematics; Quadratic model; Mathematical optimization; Combinatorics; Mathematical analysis; Statistics; Geometry","score_opus":0.01475561811600928,"score_gpt":0.30298641349624533,"score_spread":0.28823079538023605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399858594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009534386,0.0012893043,0.9946753,0.0021858292,0.000039684306,0.0010867633,0.00001422325,0.0003030688,0.00031048935],"genre_scores_gemma":[0.10955469,0.00021970677,0.88898915,0.00022945885,0.000045924065,0.0007782655,0.00008337042,0.00002579474,0.00007363355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998356,0.00010341164,0.00040631587,0.0007100413,0.00023583884,0.00018843383],"domain_scores_gemma":[0.99878347,0.00045738672,0.00009118685,0.0002704905,0.00028176032,0.000115699935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032031382,0.00020650125,0.00020896165,0.00038153146,0.0002319907,0.00027929235,0.00029940324,0.000079552985,0.0000066413845],"category_scores_gemma":[0.000085777036,0.00021997395,0.00003317209,0.0012930289,0.000042707878,0.0009080983,0.0001859568,0.0001633728,0.000010213377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003683585,0.00003169775,0.000010906803,0.000028169045,0.000009700486,8.495909e-7,0.00032594777,0.7675979,0.000032482527,0.2228129,0.000007846319,0.009137893],"study_design_scores_gemma":[0.00085069315,0.00001320022,0.000054,0.00003205295,0.000010021791,0.00002783178,0.000058013797,0.9654317,0.000023660226,0.032983866,0.00029319784,0.00022176452],"about_ca_topic_score_codex":0.000008170547,"about_ca_topic_score_gemma":0.0000065410463,"teacher_disagreement_score":0.19783379,"about_ca_system_score_codex":0.00008113783,"about_ca_system_score_gemma":0.00013548293,"threshold_uncertainty_score":0.89702773},"labels":[],"label_agreement":null},{"id":"W4400689395","doi":"10.1007/s10589-024-00588-2","title":"Handling of constraints in multiobjective blackbox optimization","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Universidade Nova de Lisboa; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Multi-objective optimization","score_opus":0.00938289075054676,"score_gpt":0.27438086545607177,"score_spread":0.264997974705525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400689395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043112545,0.00035364905,0.99732715,0.0003071495,0.00008479239,0.0006148139,0.000024275849,0.00020575205,0.0010392967],"genre_scores_gemma":[0.18541734,0.00012086731,0.81403327,0.00007942149,0.000031891672,0.00015486829,0.00010280512,0.000016984406,0.000042551583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861115,0.00005674944,0.0004533499,0.0005022061,0.0002193909,0.00015717161],"domain_scores_gemma":[0.99891955,0.0003393517,0.00012597138,0.00018122765,0.0003576821,0.000076191056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001815109,0.00016187363,0.00018550243,0.00048158976,0.00011845809,0.00014340301,0.0002059219,0.000075832046,0.00003989352],"category_scores_gemma":[0.00005465812,0.00017760269,0.00004347371,0.0013653289,0.00018995024,0.00073048146,0.0000867847,0.00012820834,0.0000074670265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021606113,0.00006314383,0.000052410007,0.000026098465,0.000013250139,0.0000014094013,0.0003483505,0.88042784,0.0000138889745,0.10559481,0.000007356585,0.013449304],"study_design_scores_gemma":[0.00044779826,0.000018345376,0.00021074298,0.00005908353,0.0000071661893,0.000017307091,0.0000813668,0.99442834,0.00006615397,0.0043771625,0.000117666015,0.00016888541],"about_ca_topic_score_codex":0.0000038810945,"about_ca_topic_score_gemma":0.0000011633388,"teacher_disagreement_score":0.18537422,"about_ca_system_score_codex":0.00008631386,"about_ca_system_score_gemma":0.00016311418,"threshold_uncertainty_score":0.72424275},"labels":[],"label_agreement":null},{"id":"W4403191597","doi":"10.1007/s10589-024-00604-5","title":"The indefinite proximal gradient method","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Proximal Gradient Methods; Applied mathematics; Mathematical optimization; Geometry; Regular polygon; Convex function","score_opus":0.05465722513684081,"score_gpt":0.3806338186845009,"score_spread":0.3259765935476601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403191597","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001495104,0.00038949036,0.9937689,0.0018105825,0.00008577815,0.00047264845,0.000011518166,0.00019655147,0.003249625],"genre_scores_gemma":[0.0030958885,0.00007559654,0.9955849,0.00017710285,0.0000892621,0.00052134244,0.000025819116,0.000021659123,0.00040842575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.000096625816,0.00025970637,0.0002348636,0.00017457813,0.00012096365],"domain_scores_gemma":[0.997274,0.0023615828,0.0000585284,0.00013549293,0.000107291526,0.00006314338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048273522,0.000097901604,0.00008901109,0.00006278897,0.00039015026,0.00019948602,0.00010867106,0.00004051261,0.000035166813],"category_scores_gemma":[0.00011852888,0.0000710904,0.000040548828,0.00042385285,0.000103227154,0.00008068524,0.000053582582,0.00012935359,0.00002245818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015905066,0.000020968502,0.000005802116,0.00002818296,0.000021321703,2.2727856e-7,0.0000861651,0.13162923,0.0000035892672,0.8408008,0.00088822,0.026513882],"study_design_scores_gemma":[0.000047873247,0.0000064955348,0.000008250005,0.00000933184,0.000014919055,0.000009475678,0.000027006467,0.5213632,0.000008416958,0.44344568,0.035003867,0.000055488104],"about_ca_topic_score_codex":0.0000010733057,"about_ca_topic_score_gemma":3.0420998e-7,"teacher_disagreement_score":0.39735514,"about_ca_system_score_codex":0.000031776068,"about_ca_system_score_gemma":0.000047933856,"threshold_uncertainty_score":0.300076},"labels":[],"label_agreement":null},{"id":"W4406214684","doi":"10.1007/s10589-024-00645-w","title":"Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Hydro-Québec; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Solver; Computer science; Fidelity; Mathematical optimization; Bridging (networking); Point (geometry); Algorithm; Mathematics","score_opus":0.019205981593508156,"score_gpt":0.3145895859890645,"score_spread":0.29538360439555633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406214684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020372868,0.000105926265,0.9953042,0.00096806063,0.00016957916,0.0025578977,0.0001048833,0.00037017115,0.00041721447],"genre_scores_gemma":[0.00414364,0.00006583999,0.99189115,0.0013259931,0.000058911755,0.0015402336,0.00062691496,0.000025701107,0.0003216192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979564,0.000082263155,0.00063596235,0.0008307491,0.00020270473,0.00029193514],"domain_scores_gemma":[0.99705404,0.0005215888,0.0003148945,0.00038144167,0.0015780751,0.00014997616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022954479,0.00029624574,0.00029934145,0.00037660758,0.00065669004,0.00031755533,0.00042295104,0.00012883825,0.000022710185],"category_scores_gemma":[0.00017554006,0.000338612,0.00009282232,0.0010397051,0.0002120291,0.00073961145,0.00021048976,0.00014259727,0.0000060580537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004381675,0.00013669439,0.000019487963,0.000015536243,0.00003495126,3.7114924e-7,0.000116978146,0.86968434,0.000006487864,0.037789926,0.00012883381,0.09206204],"study_design_scores_gemma":[0.0019281186,0.00002506028,0.000095923046,0.000037745125,0.000024921586,0.000009996732,0.00015081119,0.99263,0.000036985515,0.0031143597,0.0016363234,0.00030975937],"about_ca_topic_score_codex":0.0000043328732,"about_ca_topic_score_gemma":0.0000017599234,"teacher_disagreement_score":0.12294568,"about_ca_system_score_codex":0.00017315568,"about_ca_system_score_gemma":0.00025827234,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W4408247203","doi":"10.1007/s10589-025-00669-w","title":"The $$\\omega $$-condition number: applications to preconditioning and low rank generalized Jacobian updating","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Omega; Jacobian matrix and determinant; Rank (graph theory); Applied mathematics; Combinatorics","score_opus":0.006169767764634903,"score_gpt":0.26954499492120315,"score_spread":0.26337522715656825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408247203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048359812,0.000119077435,0.9912602,0.0040582623,0.00005489405,0.0009118418,0.000022892486,0.00015533288,0.0029339383],"genre_scores_gemma":[0.29508576,0.00016750547,0.69588536,0.0031780233,0.00020676466,0.0035568457,0.00048486236,0.000022239125,0.0014126186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988981,0.00007579776,0.00032857154,0.0003952526,0.0001374167,0.00016486138],"domain_scores_gemma":[0.9988868,0.00041343065,0.00011916247,0.00026415437,0.000209712,0.00010673018],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00027384836,0.00013372686,0.000118068594,0.00011769196,0.0016950939,0.0005272777,0.0003086649,0.000048733018,0.00001964911],"category_scores_gemma":[0.000026919643,0.00012485603,0.0000315407,0.00077656977,0.00010322952,0.00032016943,0.00014960648,0.000092236325,0.000026331849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000199172,0.000022015685,0.000049951013,0.000011992255,0.000012965205,5.162778e-8,0.000052046766,0.28524646,0.000013630818,0.6875561,0.00035961738,0.026673224],"study_design_scores_gemma":[0.00048823885,0.000009360228,0.00088891585,0.000025809975,0.000016128179,0.000012349976,0.00007357212,0.8353905,0.000068681744,0.14317366,0.019658854,0.00019394427],"about_ca_topic_score_codex":0.0000028609836,"about_ca_topic_score_gemma":0.0000019809254,"teacher_disagreement_score":0.550144,"about_ca_system_score_codex":0.000031026568,"about_ca_system_score_gemma":0.000073164956,"threshold_uncertainty_score":0.9996046},"labels":[],"label_agreement":null},{"id":"W4408959881","doi":"10.1007/s10589-025-00676-x","title":"A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Rounding; Regularization (linguistics); Round-off error; Mathematical optimization; Quadratic equation; Error analysis; Algorithm; Applied mathematics; Computer science","score_opus":0.021428376056036993,"score_gpt":0.3476668886019623,"score_spread":0.32623851254592534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408959881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046087903,0.000057644873,0.9969939,0.0015372734,0.00004781026,0.0010112184,0.000017340455,0.00016199939,0.00016823296],"genre_scores_gemma":[0.0028459355,0.000009421236,0.99548095,0.000416445,0.00002674271,0.0005360595,0.00033459516,0.0000117379805,0.00033809245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984965,0.00012851224,0.00041343714,0.0005878256,0.00020064616,0.00017310157],"domain_scores_gemma":[0.99821794,0.0006594771,0.00022095778,0.0002866842,0.00052174204,0.000093225986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040627952,0.0001819965,0.00027711433,0.0005110439,0.0005227134,0.00032763844,0.00027144866,0.0000787926,0.000010114156],"category_scores_gemma":[0.00008483888,0.00016466287,0.000084235486,0.0030816386,0.00006184631,0.00039545543,0.00007143578,0.000072584466,7.736603e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007642001,0.0000769409,0.000065669636,0.000015953212,0.00011062558,1.0665471e-7,0.000048888487,0.85532314,0.000016080361,0.12094837,0.000013045303,0.023373542],"study_design_scores_gemma":[0.0007943056,0.00003807831,0.00024504523,0.000019500458,0.00019719302,0.0000027184317,0.000038716866,0.9876861,0.00002574848,0.010481607,0.00028622642,0.00018474064],"about_ca_topic_score_codex":0.000004868599,"about_ca_topic_score_gemma":0.0000021488884,"teacher_disagreement_score":0.13236298,"about_ca_system_score_codex":0.00005769699,"about_ca_system_score_gemma":0.00013065612,"threshold_uncertainty_score":0.6714757},"labels":[],"label_agreement":null},{"id":"W4411090176","doi":"10.1007/s10589-025-00701-z","title":"The cosine measure relative to a subspace","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University; University of British Columbia, Okanagan Campus; University of British Columbia; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Measure (data warehouse); Subspace topology; Trigonometric functions; Statistics; Mathematical analysis; Geometry; Data mining; Computer science","score_opus":0.027199923112818897,"score_gpt":0.3709157982805363,"score_spread":0.3437158751677174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411090176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019308074,0.00014533712,0.981249,0.0116929645,0.00002350736,0.0010355416,0.000012956157,0.00010386119,0.005717575],"genre_scores_gemma":[0.010717491,0.000082847924,0.9797144,0.0007811609,0.00005059532,0.00095376413,0.00006803491,0.000025352878,0.0076063354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.00006542348,0.0002624691,0.00025104685,0.00024913865,0.00015516065],"domain_scores_gemma":[0.99772817,0.0012042134,0.00007802512,0.00021196154,0.0006843163,0.000093299146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020014873,0.000112878355,0.00011130051,0.00013726279,0.000820845,0.00011715859,0.00016648881,0.000047404807,0.000024258843],"category_scores_gemma":[0.000462286,0.00009332445,0.000028153583,0.0010575616,0.0001132711,0.00012045686,0.000089309025,0.00012043032,0.000016546583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212404,0.000027011642,0.000014375308,0.0000056618055,0.000016539363,6.6364194e-8,0.000047779715,0.5010219,0.000002002713,0.4929234,0.0020640627,0.0038679428],"study_design_scores_gemma":[0.00039462015,0.000016437254,0.00013937503,0.00002956582,0.000016214837,0.0000023101468,0.00013833016,0.73203313,0.000014301753,0.24220367,0.024889171,0.00012289653],"about_ca_topic_score_codex":9.971554e-7,"about_ca_topic_score_gemma":0.0000042871393,"teacher_disagreement_score":0.25071973,"about_ca_system_score_codex":0.0000700848,"about_ca_system_score_gemma":0.00011160266,"threshold_uncertainty_score":0.6313359},"labels":[],"label_agreement":null},{"id":"W4413237434","doi":"10.1007/s10589-025-00704-w","title":"Risk-averse constrained blackbox optimization under mixed aleatory/epistemic uncertainties","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Uncertainty quantification; Mathematics; Mathematical optimization; Robust optimization; Mathematical economics; Epistemology; Applied mathematics; Statistics; Philosophy","score_opus":0.027412392189510863,"score_gpt":0.3305064136275489,"score_spread":0.30309402143803804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010238102,0.0002159226,0.9862269,0.0023154153,0.00020381465,0.0007750368,0.000099761,0.00017257313,0.008966748],"genre_scores_gemma":[0.68227243,0.0013918851,0.3088034,0.0015268512,0.00014825455,0.0003442786,0.0011394514,0.00004105518,0.0043323906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997117,0.0002678462,0.0009899585,0.0007228367,0.0006621619,0.00024022802],"domain_scores_gemma":[0.9964994,0.0011472184,0.00057082676,0.00044984714,0.0011775797,0.00015511499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008555712,0.00026698867,0.00033223955,0.000682969,0.0008522761,0.00046434256,0.0003733029,0.00017233862,0.00034823],"category_scores_gemma":[0.0004287807,0.00025260652,0.00011266664,0.0019464502,0.00038748473,0.000446734,0.00010442412,0.0001727554,0.000068426816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016517071,0.00006276186,0.0019099985,0.0000043340387,0.00003518331,2.4836257e-7,0.00007856993,0.8625524,0.0000021012281,0.12686676,0.0025090277,0.0059620827],"study_design_scores_gemma":[0.0007663913,0.000017450962,0.0020081452,0.000014622333,0.00006267434,0.0000056193485,0.00092381804,0.9353393,0.000009761966,0.0531181,0.0075000613,0.0002340886],"about_ca_topic_score_codex":0.000016982074,"about_ca_topic_score_gemma":0.000007836011,"teacher_disagreement_score":0.6812486,"about_ca_system_score_codex":0.000088107045,"about_ca_system_score_gemma":0.00030762912,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W61549919","doi":"10.1023/a:1011220302800","title":"On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Extrapolation; Convergence (economics); Rate of convergence; Context (archaeology); Asymptotically optimal algorithm; Applied mathematics; Mathematical optimization; Nonlinear system; Penalty method; Newton's method; Interior point method; Algorithm; Mathematical analysis; Computer science; Key (lock)","score_opus":0.029885781864656596,"score_gpt":0.3180605713322898,"score_spread":0.2881747894676332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61549919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004492096,0.000030606563,0.99533546,0.0022436043,0.00003552957,0.00079076405,0.000040144965,0.000040373634,0.0010343],"genre_scores_gemma":[0.051789153,0.00020447915,0.94337183,0.0012357659,0.00011370196,0.00050675287,0.00009212105,0.00005175623,0.002634411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.000089657995,0.00030767207,0.00021882971,0.00037727845,0.00013579203],"domain_scores_gemma":[0.998102,0.0007885687,0.00014133434,0.0003037801,0.0006043305,0.000059995808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019610183,0.00012080626,0.00012062537,0.00006800245,0.0004230406,0.000034628956,0.0002660573,0.00005321073,0.0005737224],"category_scores_gemma":[0.00030967916,0.00007847996,0.000045086395,0.0008130074,0.0002747745,0.000084957974,0.00008394657,0.0001537165,0.0000142226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034656096,0.000069704605,0.00006159457,0.0000056871477,0.000013320028,1.3181557e-7,0.000058151825,0.76864076,0.0000049982987,0.22849533,0.00042258287,0.0022242488],"study_design_scores_gemma":[0.00025589092,0.000013312409,0.00011150666,0.000010732436,0.000010366692,0.000009338147,0.00008066492,0.91457015,0.000045189674,0.08263823,0.002168614,0.00008598459],"about_ca_topic_score_codex":0.0000023069051,"about_ca_topic_score_gemma":0.0000010279359,"teacher_disagreement_score":0.1459294,"about_ca_system_score_codex":0.000028866043,"about_ca_system_score_gemma":0.00009458441,"threshold_uncertainty_score":0.6281858},"labels":[],"label_agreement":null}]}