{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":43,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":43,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0f9774884d15","filters":{"venue":"SIAM Journal on Optimization"}},"results":[{"id":"W2166798101","doi":"10.1137/050623802","title":"Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":462,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Semidefinite programming; Mathematics; Explained sum of squares; Polynomial; Graph; Constraint (computer-aided design); Mathematical optimization; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02864254912039413,"gpt":0.3143879728623788,"spread":0.2857454237419847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494784,0.0002402592,0.0003332198,0.0003873615,0.0003896499,0.0001533778,0.0001436272,0.0001516016,0.00006354244],"category_scores_gemma":[0.0004502451,0.0002007855,0.00007282021,0.0005159615,0.0001360099,0.0004721509,0.00003043688,0.0002663988,4.124326e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251003,"about_ca_system_score_gemma":0.0001303554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007377095,"about_ca_topic_score_gemma":0.00001615433,"domain_scores_codex":[0.9981179,0.0001105865,0.0006494523,0.0002880708,0.0005134164,0.00032056],"domain_scores_gemma":[0.9975785,0.0003320273,0.00080496,0.0002163777,0.0009509992,0.0001171285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002741349,0.000196544,0.0003426814,0.00009307396,0.00004095961,0.000001588798,0.0001123535,0.9942642,0.0000563715,0.002772247,0.0005000164,0.001345772],"study_design_scores_gemma":[0.002934299,0.001063088,0.0001859411,0.0001756123,0.00007929809,0.00007252345,0.00009641839,0.9884124,0.0006645985,0.00574602,0.0002819985,0.0002878333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0049658,0.00006505015,0.99243,0.0002915305,0.00008784881,0.001555155,0.00005083159,0.0001052066,0.00044855],"genre_scores_gemma":[0.04071095,0.0001508193,0.9582954,0.00001908062,0.0001641935,0.00008418834,0.0001740874,0.00007462774,0.0003266751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03574515,"threshold_uncertainty_score":0.8187795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986219860","doi":"10.1137/050641983","title":"Approximating K‐means‐type Clustering via Semidefinite Programming","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Semidefinite programming; Cluster analysis; Mathematics; Biclustering; Mathematical optimization; Linear programming; Matrix (chemical analysis); Spectral clustering; Algorithm; Computer science; Correlation clustering; CURE data clustering algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01519857273548734,"gpt":0.2395324510064849,"spread":0.2243338782709975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000451649,0.0001578438,0.0001465534,0.0002126315,0.0001581243,0.0001287788,0.0001066934,0.00009127104,0.00002257175],"category_scores_gemma":[0.00004959308,0.0001557181,0.00005218574,0.0002827838,0.00001423225,0.0002017152,0.00001984573,0.0003481169,0.000008584013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015322,"about_ca_system_score_gemma":0.000008465349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000127603,"about_ca_topic_score_gemma":0.000001389147,"domain_scores_codex":[0.9989832,0.00002205412,0.0003755782,0.0001123401,0.0002079164,0.0002989077],"domain_scores_gemma":[0.9994925,0.00004906758,0.0001140806,0.000133374,0.0001209998,0.00008995809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001872174,0.0000132891,0.00004865573,0.00001155426,0.00001917669,0.0000277191,0.0001301902,0.9432331,0.001666826,0.00003857821,0.0001223523,0.05466989],"study_design_scores_gemma":[0.0001810203,0.00009566195,0.00003316327,0.000225455,0.00001251227,0.0002154108,0.00005308174,0.9901484,0.007182414,0.0001208802,0.001532976,0.0001990745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007537108,0.0001550155,0.9857324,0.00002041536,0.0004978512,0.0001155086,2.222047e-7,0.0006031387,0.005338382],"genre_scores_gemma":[0.5719867,0.0001162651,0.4274237,0.00007948034,0.0003034257,0.000001503969,0.000006753017,0.00005699031,0.0000252047],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5644496,"threshold_uncertainty_score":0.6350001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973823738","doi":"10.1137/070687542","title":"The Proximal Average: Basic Theory","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Regular polygon; Convex function; Effective domain; Convex analysis; Proper convex function; Proximal Gradient Methods; Domain (mathematical analysis); Pure mathematics; Function (biology); Convex set; Convex optimization; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01126816164200364,"gpt":0.2191056682143998,"spread":0.2078375065723962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00071301,0.0001168801,0.000103553,0.0001441824,0.001409479,0.0003336977,0.0005611258,0.00004660578,0.0001522603],"category_scores_gemma":[0.0002108388,0.00007534911,0.000108263,0.0005742218,0.00004573633,0.0006381135,0.00005253672,0.0002264616,0.00006462239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000699767,"about_ca_system_score_gemma":0.0001455151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.000627e-7,"about_ca_topic_score_gemma":2.643147e-7,"domain_scores_codex":[0.998568,0.000264659,0.0003047583,0.0001819624,0.0004838953,0.0001967156],"domain_scores_gemma":[0.9988509,0.0002093728,0.0002325935,0.0002789836,0.0003247106,0.0001034537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001830764,0.0000424296,0.00007013089,5.678222e-7,0.00002596571,0.00001027919,0.0001590616,0.8541345,0.000003117745,0.142393,0.000911219,0.002231406],"study_design_scores_gemma":[0.0003558687,0.00008065048,0.0005250308,0.000007118873,0.000007649112,0.0001963605,0.00001231303,0.9913231,0.00005041585,0.004005594,0.003317249,0.0001186699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002570087,0.00008321491,0.9896805,0.004382179,0.0003750639,0.00008221142,6.171443e-7,0.00006338313,0.00507581],"genre_scores_gemma":[0.642036,0.002975788,0.335101,0.00463794,0.0009284628,0.00002514131,0.00002094964,0.00004621637,0.01422853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6545795,"threshold_uncertainty_score":0.9998906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092554297","doi":"10.1137/060675320","title":"Exact Regularization of Convex Programs","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Mathematics; Regularization perspectives on support vector machines; Regular polygon; Proximal gradient methods for learning; Lagrange multiplier; Applied mathematics; Exact solutions in general relativity; Degenerate energy levels; Convex optimization; Backus–Gilbert method; Semidefinite programming; Mathematical optimization; Mathematical analysis; Subderivative; Tikhonov regularization; Inverse problem; Computer science; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01231304077871429,"gpt":0.2311079300959838,"spread":0.2187948893172695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002179773,0.00008249065,0.0001071161,0.0001488743,0.00004037283,0.00002999952,0.00006563265,0.0000710387,0.0000285957],"category_scores_gemma":[0.00001968103,0.00007753208,0.00004046722,0.0001815518,0.00001838435,0.0001186221,0.000005409198,0.0001295549,0.000001934084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004140993,"about_ca_system_score_gemma":0.000008470281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.298547e-7,"about_ca_topic_score_gemma":2.911968e-7,"domain_scores_codex":[0.9993866,0.00001606165,0.0002478927,0.00005844207,0.000166495,0.0001244997],"domain_scores_gemma":[0.9996029,0.00001725387,0.00009627968,0.0001017343,0.0001348901,0.00004695342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002308282,0.00003253029,0.0001493882,0.000007696621,0.00002112748,0.000008444511,0.00007060546,0.974991,0.003180542,0.0007542276,0.0003424071,0.02041892],"study_design_scores_gemma":[0.0005184269,0.0003543324,0.0006726972,0.0003399606,0.00002877171,0.0001099702,0.00006602918,0.8152846,0.1791931,0.001202585,0.001969301,0.0002603038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01723918,0.0000913164,0.9747015,0.00002243684,0.0002558441,0.00009953331,3.415959e-7,0.0002133809,0.007376505],"genre_scores_gemma":[0.9547403,0.0001577445,0.0448682,0.00002616675,0.0001173725,7.047186e-7,0.00001155815,0.00002486918,0.00005301491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9375012,"threshold_uncertainty_score":0.3161666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059707428","doi":"10.1137/s1052623497321432","title":"Approximating the Single-Sink Link-Installation Problem in Network Design","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sink (geography); Mathematical optimization; Network planning and design; Graph; Mathematics; Topology (electrical circuits); Upper and lower bounds; Computer science; Combinatorics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02689754769041781,"gpt":0.2163742663813543,"spread":0.1894767186909365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552705,0.000177994,0.000156121,0.0001642603,0.0002368787,0.00026619,0.0001457494,0.0001173794,0.000108775],"category_scores_gemma":[0.00005763827,0.0001421485,0.00004833905,0.0007235782,0.00002084375,0.0003370268,0.0000120199,0.0004260608,0.00001452664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001652593,"about_ca_system_score_gemma":0.00002474312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.141297e-7,"about_ca_topic_score_gemma":0.000002824114,"domain_scores_codex":[0.998611,0.0001598531,0.0005379122,0.0001305774,0.0002443804,0.0003162343],"domain_scores_gemma":[0.9994121,0.0001172009,0.0001720193,0.0001415572,0.0000909243,0.00006624076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002204613,0.00002281213,0.0001774058,0.00001092887,0.00001302138,0.000005573883,0.0003461366,0.9860526,0.00002766216,0.0004286741,0.0004277659,0.01246541],"study_design_scores_gemma":[0.000450929,0.0000774353,0.00006138006,0.0001894593,0.000008287107,0.00007112037,0.00003442772,0.9962603,0.00002601663,0.001005959,0.001645834,0.0001688509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002558805,0.00019978,0.9793468,0.0006800603,0.0003992034,0.0003561811,3.975141e-7,0.0001804233,0.01858124],"genre_scores_gemma":[0.3276054,0.001325988,0.6691473,0.0004166732,0.001025405,0.00002709664,0.0000340889,0.0001264237,0.0002916052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3273495,"threshold_uncertainty_score":0.5796648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073044751","doi":"10.1137/s1052623499360616","title":"Erratum: Weak Sharp Solutions of Variational Inequalities","year":2000,"lang":"en","type":"erratum","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.02456082120706668,"gpt":0.251635378998436,"spread":0.2270745577913693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009810932,0.0004246877,0.0006218113,0.001255266,0.0005749611,0.000530473,0.001157379,0.0005165956,0.002547544],"category_scores_gemma":[0.0003012588,0.0004035301,0.0004265484,0.001364224,0.00006145763,0.001090083,0.0001311448,0.001035375,0.0000749523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002556171,"about_ca_system_score_gemma":0.001242368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001579931,"about_ca_topic_score_gemma":0.000004467906,"domain_scores_codex":[0.9958643,0.0004872991,0.001303916,0.0005048802,0.001427544,0.0004120943],"domain_scores_gemma":[0.9964255,0.0001963238,0.001432599,0.0005702755,0.00116614,0.0002091412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001195289,0.0001296217,0.000002447502,0.00001715342,0.0001330557,0.000002394625,0.000125735,0.573627,6.126519e-7,0.09200415,0.3335494,0.0003964244],"study_design_scores_gemma":[0.0004513603,0.0001491114,0.00008159994,0.0002200622,0.0001007541,0.00004849894,0.00002367695,0.9279479,0.000001611843,0.006447991,0.06410864,0.0004187811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[3.06179e-7,0.0004316881,0.8913356,0.003383105,0.007744553,0.0001400675,0.000100595,0.00008897868,0.09677508],"genre_scores_gemma":[0.001180371,0.009602811,0.4714819,0.0025493,0.00636116,0.00005611187,0.004856449,0.0001818862,0.50373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4198537,"threshold_uncertainty_score":0.9998416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067796483","doi":"10.1137/130915315","title":"Distributionally Robust Stochastic Knapsack Problem","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Knapsack problem; Mathematical optimization; Continuous knapsack problem; Mathematics; Change-making problem; Relaxation (psychology); Stochastic programming; Robust optimization; Constraint (computer-aided design); Semidefinite programming; Independence (probability theory); Random variable; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.04645706831941011,"gpt":0.3180986947574208,"spread":0.2716416264380107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003129191,0.0002135813,0.0002870335,0.0004305409,0.0005480477,0.0007539784,0.0005339297,0.000134125,0.001066693],"category_scores_gemma":[0.00249231,0.0001581816,0.000153856,0.0009412663,0.00006726675,0.0007223834,0.00004533429,0.0003351236,0.0003846904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001121335,"about_ca_system_score_gemma":0.0001366822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000153458,"about_ca_topic_score_gemma":0.000001434915,"domain_scores_codex":[0.9961897,0.000389691,0.0009683623,0.0003899901,0.001731409,0.000330842],"domain_scores_gemma":[0.9969562,0.000534832,0.0007681528,0.0003750653,0.001094118,0.000271681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006154431,0.00007119734,0.0002583289,7.611853e-7,0.00001025432,0.000002270337,0.0000546944,0.9705887,0.00000439395,0.007444116,0.009427862,0.01207586],"study_design_scores_gemma":[0.0007096659,0.0002795774,0.0007405311,0.00003633146,0.00001950853,0.0001072549,0.00004634722,0.9707626,0.00001638292,0.01397477,0.01307112,0.0002359388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001231616,0.00003958255,0.9853478,0.001694116,0.0006996354,0.0001824907,0.0000138299,0.00005093123,0.01074],"genre_scores_gemma":[0.8299525,0.0003704112,0.1617853,0.001022518,0.001509852,0.00001849696,0.0002057627,0.00006732047,0.00506789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8287209,"threshold_uncertainty_score":0.9998465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093590551","doi":"10.1137/040621600","title":"SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Semidefinite programming; Scalability; Relaxation (psychology); Algorithm; Mathematics; Set (abstract data type); Mathematical optimization; Sequence (biology); Selection (genetic algorithm); Computer science; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.008219891805363337,"gpt":0.2042610587520436,"spread":0.1960411669466803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620547,0.0002388067,0.0002305269,0.0002036771,0.0003777875,0.0001688837,0.0001548265,0.0002298006,0.00005594828],"category_scores_gemma":[0.00001673472,0.0002319722,0.00007814368,0.0004820149,0.00004189254,0.0004403277,0.00001105143,0.0002150673,0.000009678574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001946158,"about_ca_system_score_gemma":0.00003098178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006431399,"about_ca_topic_score_gemma":0.00000785526,"domain_scores_codex":[0.9986408,0.00004887234,0.0004493452,0.0002043213,0.0002444894,0.0004121677],"domain_scores_gemma":[0.9992335,0.0000459415,0.0001405908,0.0001709532,0.0003299324,0.00007903064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002971228,0.00004210118,0.00006226861,0.0000137084,0.00001992073,0.00000457796,0.00002146261,0.9768921,0.00002486524,0.002667282,0.003637087,0.01658495],"study_design_scores_gemma":[0.0007072595,0.0002727442,0.00002312017,0.00006416572,0.00002600358,0.00002891987,0.0000868146,0.9922435,0.002619853,0.001704531,0.001938665,0.00028445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006437052,0.000138152,0.9966916,0.00005504311,0.0006040695,0.0003545883,0.00002064256,0.0006312092,0.0008609839],"genre_scores_gemma":[0.3331802,0.0006621116,0.6617524,0.0002755651,0.002479002,0.00009526338,0.0006795688,0.0002847845,0.0005911755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3349392,"threshold_uncertainty_score":0.945955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006905759","doi":"10.1137/s1052623401398120","title":"A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Quadratic growth; Mathematics; Quadratically constrained quadratic program; Quadratic programming; Second-order cone programming; Mathematical optimization; Rate of convergence; Quadratic equation; Differentiable function; Convex optimization; Interior point method; Sequential quadratic programming; Quadratic function; Function (biology); Convergence (economics); Regular polygon; Algorithm; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06237039632763324,"gpt":0.3968067002934668,"spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00140771,0.0003585924,0.0005197202,0.0003975611,0.0006028433,0.0004288937,0.0002302231,0.0002218416,0.0009127372],"category_scores_gemma":[0.005221777,0.0003272874,0.0002069382,0.0005739118,0.0001017493,0.0004902036,0.00002307723,0.0004290356,0.000009784073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002533767,"about_ca_system_score_gemma":0.0003810527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.427288e-7,"about_ca_topic_score_gemma":0.000001519907,"domain_scores_codex":[0.996449,0.0006982617,0.00102506,0.0004339788,0.0007558551,0.0006378402],"domain_scores_gemma":[0.9964651,0.001168602,0.0006197946,0.0003141898,0.001115785,0.0003165027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000205572,0.0005395979,0.00001323107,0.0001542093,0.0001568802,0.00001206493,0.0003526223,0.805012,0.0002486906,0.1878788,0.0008337981,0.004592501],"study_design_scores_gemma":[0.003225451,0.0005456461,0.000001004851,0.0001231875,0.0001110717,0.0001584041,0.000370603,0.9454376,0.001824562,0.04564778,0.002148906,0.0004058471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009010021,0.00003252706,0.9955232,0.0005175121,0.0003368575,0.001498899,0.00001315121,0.0001357726,0.001852054],"genre_scores_gemma":[0.003791364,0.00004196803,0.9939225,0.0001954715,0.0001684344,0.0001554123,0.00007259583,0.0001133743,0.001538836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.142231,"threshold_uncertainty_score":0.9999179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001096515","doi":"10.1137/130940670","title":"Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Non-negative matrix factorization; Separable space; Hyperspectral imaging; Mathematics; Semidefinite programming; Matrix (chemical analysis); Matrix decomposition; Algorithm; Factorization; Mathematical optimization; Artificial intelligence; Computer science; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.04063804245902447,"gpt":0.2752400860279042,"spread":0.2346020435688798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178702,0.0002135757,0.0001944682,0.0002082518,0.0002803063,0.0004790753,0.0001031829,0.0001380328,0.00002489642],"category_scores_gemma":[0.0004859581,0.0002222696,0.00008069944,0.0003815117,0.00004034942,0.0007104121,0.00000630953,0.0002598906,0.00001633254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004758892,"about_ca_system_score_gemma":0.000128104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001273954,"about_ca_topic_score_gemma":7.764053e-7,"domain_scores_codex":[0.9987054,0.00006400799,0.0004288389,0.0001991826,0.0003129535,0.0002896417],"domain_scores_gemma":[0.9986882,0.000132999,0.0002462885,0.0001702883,0.0005865144,0.0001757157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004327897,0.00002855819,0.0000759923,0.00003452487,0.00002485224,0.000001805944,0.000348468,0.9955392,0.0002680506,0.00004791603,0.0009367322,0.002650565],"study_design_scores_gemma":[0.0009685795,0.0001369429,0.0001189425,0.0001487675,0.00003403673,0.00001953598,0.0001430383,0.9945212,0.001948507,0.0001022732,0.001624366,0.0002337816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004095199,0.00006515122,0.9933334,0.0002171333,0.0007346343,0.0005022137,0.00001492633,0.0003007806,0.0007365667],"genre_scores_gemma":[0.3253233,0.0000267145,0.6733204,0.00006122113,0.0003617922,0.00003173513,0.0004952397,0.0001260905,0.0002535481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3212281,"threshold_uncertainty_score":0.9063889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534354577","doi":"10.1137/s1052623402419789","title":"A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"MINOS; Augmented Lagrangian method; Mathematics; Mathematical optimization; Robustness (evolution); Nonlinear system; Nonlinear programming; Lagrangian; Constrained optimization; MATLAB; Constrained optimization problem; Optimization problem; Applied mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03817071064495997,"gpt":0.3823096065973887,"spread":0.3441388959524287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001458012,0.0003674176,0.0004534555,0.0004272049,0.0004735456,0.0003025683,0.0003983861,0.0002486264,0.00122103],"category_scores_gemma":[0.001949716,0.0003450447,0.0002534076,0.0006278929,0.00007530944,0.0006626554,0.00004994162,0.0004495064,0.00002988707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004252509,"about_ca_system_score_gemma":0.0003052189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001220202,"about_ca_topic_score_gemma":0.000003425027,"domain_scores_codex":[0.9968241,0.0002744314,0.000994049,0.0004331776,0.0008829021,0.0005912732],"domain_scores_gemma":[0.9964668,0.0006262345,0.0006280412,0.0003420919,0.001558478,0.0003784154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002650596,0.0003052612,0.000004187848,0.00003388568,0.00009026309,0.0000062491,0.0001584493,0.9815894,0.0000299564,0.004790443,0.001985398,0.01074139],"study_design_scores_gemma":[0.003238788,0.0003688309,0.000001126543,0.00008042084,0.00006544492,0.0001217771,0.0001111003,0.9860988,0.0004230883,0.001152385,0.007982412,0.0003557855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003703859,0.00006900683,0.9931399,0.003463595,0.0003549448,0.001091046,0.00009532941,0.0001820152,0.001567095],"genre_scores_gemma":[0.0002302627,0.000327859,0.9958361,0.0007422197,0.0009431684,0.00005291733,0.0001675489,0.0001168961,0.001582964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01038561,"threshold_uncertainty_score":0.9999002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004793002","doi":"10.1137/s1052623401400324","title":"Probability Distributions of Assets Inferred from Option Prices via the Principle of Maximum Entropy","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Mathematical optimization; Principle of maximum entropy; Entropy (arrow of time); Computation; Regular polygon; Bellman equation; Constraint (computer-aided design); Exploit; Probability distribution; Applied mathematics; Convex function; Maximum entropy probability distribution; Mathematical economics; Algorithm; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03093109542292634,"gpt":0.2283890821485748,"spread":0.1974579867256485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064155,0.00009962699,0.0002646283,0.00007669563,0.0001222472,0.0000405595,0.0001533596,0.0000730788,0.0004032841],"category_scores_gemma":[0.000241866,0.00008566426,0.0001157213,0.000131039,0.00006525389,0.0003014439,0.00001938992,0.0001387567,0.000009964708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001241595,"about_ca_system_score_gemma":0.00003734572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001836537,"about_ca_topic_score_gemma":0.000002371786,"domain_scores_codex":[0.9988298,0.0000476201,0.0007807895,0.0001627311,0.00004102612,0.0001380426],"domain_scores_gemma":[0.9984952,0.00007630249,0.001028276,0.0002539732,0.00009799431,0.00004824453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000299321,0.0001264869,0.005351928,0.00000694285,0.00004015728,1.402178e-7,0.00010746,0.3537904,0.00003312401,0.640415,0.00001086402,0.00008749877],"study_design_scores_gemma":[0.001364558,0.0003058405,0.01477865,0.00004675366,0.00003169678,0.00001024409,0.00006878855,0.098157,0.001842989,0.8746563,0.00846561,0.0002716029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3791642,0.0002108881,0.618336,0.0001810902,0.0003051248,0.0001812069,0.0001813339,0.000006317906,0.001433912],"genre_scores_gemma":[0.9853658,0.0003435441,0.01413313,0.00001745245,0.00004508249,0.000006854811,0.00004616773,0.00001001468,0.00003196653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6062016,"threshold_uncertainty_score":0.4415678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972729079","doi":"10.1137/s1052623401386794","title":"A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conic section; Dual (grammatical number); Algorithm; Mathematical optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009995191754433275,"gpt":0.2235696083847121,"spread":0.2135744166302788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001582163,0.0002044295,0.0002802846,0.0002214093,0.0001593117,0.0001281305,0.0001123871,0.0000832814,0.0001029611],"category_scores_gemma":[0.00006541245,0.0001593958,0.00009047552,0.0003152669,0.00002055829,0.0003474535,0.00001232457,0.0002773648,0.000007547787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001876819,"about_ca_system_score_gemma":0.000007641876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001560708,"about_ca_topic_score_gemma":4.543412e-7,"domain_scores_codex":[0.9988651,0.00002800013,0.0003813673,0.000167076,0.0002840334,0.0002744554],"domain_scores_gemma":[0.9992963,0.0001475771,0.000151028,0.0001450996,0.000144957,0.0001150365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002131006,0.00003733292,0.000009382905,0.0000132619,0.00005147821,0.00001028448,0.00004325105,0.9669372,0.00009385966,0.00003579207,0.0002503063,0.0324965],"study_design_scores_gemma":[0.0006233511,0.0004276408,0.000003637547,0.0001287544,0.00004140412,0.0001080618,0.00002018418,0.997153,0.0003895606,0.00004831663,0.0008465598,0.0002095358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003181126,0.0008536833,0.997673,0.00006851398,0.0001432846,0.0002689482,0.00001401291,0.0002895558,0.0003708632],"genre_scores_gemma":[0.3304239,0.000933635,0.667767,0.00007341646,0.0003199952,0.00005263838,0.00003536389,0.000103452,0.0002905931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3301058,"threshold_uncertainty_score":0.6499972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969129923","doi":"10.1137/s1052623499358586","title":"Robust Filtering via Semidefinite Programming with Applications to Target Tracking","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Bounded function; Interior point method; Mathematical optimization; Upper and lower bounds; Robustness (evolution); Mathematics; Norm (philosophy); Robust optimization; Semidefinite embedding; Computer science; Algorithm; Quadratically constrained quadratic program","retraction":null,"screen_n_in":null,"score":{"opus":0.09482905424110503,"gpt":0.326649580935868,"spread":0.2318205266947629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000370152,0.0002338427,0.0002396503,0.0004150564,0.0005055925,0.000296885,0.0002539381,0.0000849497,0.0007902941],"category_scores_gemma":[0.0002835185,0.0002057064,0.00006226778,0.0009617695,0.0000364012,0.0005086901,0.00004387708,0.0004700983,0.00006349534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002182309,"about_ca_system_score_gemma":0.00002605664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.138826e-7,"about_ca_topic_score_gemma":0.000001077486,"domain_scores_codex":[0.9980206,0.0000880849,0.0004822528,0.0003143803,0.0006407418,0.0004539077],"domain_scores_gemma":[0.9983833,0.000196216,0.0002908955,0.000309115,0.0005203909,0.0003000805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002720322,0.0001656515,0.00002658234,0.00002619159,0.00002682431,0.0000248184,0.0003387669,0.9747135,0.00003561764,0.0007093732,0.0002268807,0.0236786],"study_design_scores_gemma":[0.0008079245,0.0003575435,0.00000718263,0.0002022861,0.00002465919,0.000475428,0.0001840504,0.9880283,0.000316123,0.001167592,0.008028626,0.0004002626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001011399,0.0000544501,0.9961119,0.0006092348,0.00005717965,0.0007668628,0.000004647491,0.000164452,0.002130132],"genre_scores_gemma":[0.004969536,0.0001006038,0.9932923,0.0001666839,0.0002342674,0.0001473151,0.00001445572,0.0001002939,0.0009745925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02327833,"threshold_uncertainty_score":0.8653167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592535213","doi":"10.1137/15m1016989","title":"The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Iterated function; Linear subspace; Monotone polygon; Affine transformation; Sequence (biology); Regular polygon; Convergence (economics); Algorithm; Cone (formal languages); Conic optimization; Pure mathematics; Convex optimization; Subderivative; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01318462294776567,"gpt":0.264885286470722,"spread":0.2517006635229563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893414,0.0001683421,0.000164015,0.0002049683,0.0008614857,0.0007324054,0.0006687472,0.00005470396,0.00007887847],"category_scores_gemma":[0.0003016648,0.00009120685,0.0001704586,0.0004741368,0.00003750686,0.0009488934,0.00007464571,0.0001296585,0.00002004794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001234594,"about_ca_system_score_gemma":0.00009686388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003629302,"about_ca_topic_score_gemma":0.000007133217,"domain_scores_codex":[0.998463,0.0001312467,0.0004339633,0.0002728286,0.0004149039,0.0002840665],"domain_scores_gemma":[0.9979326,0.0006133413,0.0004592057,0.0002835905,0.0005939364,0.0001173275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006112196,0.00007617923,0.00004527214,0.000002109844,0.0001143742,0.000002370149,0.0001996186,0.7031754,0.00006337049,0.03841453,0.002403138,0.2554425],"study_design_scores_gemma":[0.001202559,0.0001759264,0.00004465492,0.00003167562,0.0000208376,0.00002856504,0.00004112326,0.9874426,0.0003001813,0.001245072,0.009307173,0.0001596235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000699514,0.00004512457,0.9795811,0.01821169,0.001231723,0.0001547283,0.000005723074,0.00007306489,0.0006269203],"genre_scores_gemma":[0.06159885,0.0007793157,0.9264348,0.001872786,0.001667844,0.00004919404,0.00001717909,0.0000458983,0.00753419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2842672,"threshold_uncertainty_score":0.7062603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071468246","doi":"10.1137/060650003","title":"Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Robust optimization; Mathematics; Mathematical optimization; Optimization problem; Convex optimization; Class (philosophy); Set (abstract data type); Range (aeronautics); Regular polygon; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1160645763283125,"gpt":0.3408199939781923,"spread":0.2247554176498799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001464413,0.0003355165,0.0004167262,0.0007824421,0.001446657,0.0004465596,0.000477324,0.0001968928,0.0003165092],"category_scores_gemma":[0.0007059148,0.0002301508,0.0001885073,0.001466774,0.00008010177,0.001481438,0.00003286706,0.0002832907,0.00002494295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002189463,"about_ca_system_score_gemma":0.0003113946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001062382,"about_ca_topic_score_gemma":0.000009622572,"domain_scores_codex":[0.9960045,0.0002173143,0.001207497,0.0005780178,0.001529943,0.0004627442],"domain_scores_gemma":[0.9957398,0.0003277769,0.001091824,0.0005215126,0.002030214,0.0002888591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000259938,0.0001159807,0.001274189,0.000002463957,0.00002900333,0.000007625497,0.0003952392,0.9916198,0.000005144786,0.0007015368,0.003272098,0.002316932],"study_design_scores_gemma":[0.001684082,0.000605323,0.0003322987,0.00004005813,0.00003152746,0.0003129183,0.0001445964,0.9923385,0.00003118993,0.0006478141,0.00350131,0.0003303796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008534913,0.00005903648,0.9861524,0.001056533,0.0004592144,0.0008346168,0.00003218841,0.00009073305,0.002780407],"genre_scores_gemma":[0.1323671,0.002054511,0.8592669,0.0006335674,0.0007167732,0.0001245896,0.0004688295,0.0001118041,0.004255928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1268855,"threshold_uncertainty_score":0.9998533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069314331","doi":"10.1137/s1052623400374148","title":"The Analytic Center Cutting Plane Method with Semidefinite Cuts","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cutting-plane method; Mathematics; Semidefinite embedding; Semidefinite programming; Center (category theory); Plane (geometry); Mathematical analysis; Combinatorics; Quadratically constrained quadratic program; Geometry; Applied mathematics; Mathematical optimization; Quadratic equation; Integer programming","retraction":null,"screen_n_in":null,"score":{"opus":0.0106025474577415,"gpt":0.2515268811390499,"spread":0.2409243336813084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339806,0.000114469,0.00009581023,0.0001484416,0.0005981113,0.0004891935,0.0002381358,0.0000332219,0.00001909704],"category_scores_gemma":[0.0001324644,0.0000728079,0.00004396054,0.0005784424,0.00001351526,0.0004023933,0.00001894685,0.000205399,0.00001309702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005806382,"about_ca_system_score_gemma":0.0001060739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.600721e-7,"about_ca_topic_score_gemma":0.000001019369,"domain_scores_codex":[0.998695,0.0002809016,0.0002535418,0.0001872851,0.0003819719,0.0002013524],"domain_scores_gemma":[0.9989924,0.0002942479,0.00022459,0.0001867257,0.0002136738,0.00008834378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001686287,0.0000273032,0.0001050089,0.000001558177,0.00002186158,0.00001043793,0.00008719731,0.9709951,0.00001270326,0.02130749,0.0005225397,0.006891897],"study_design_scores_gemma":[0.0006068134,0.0002531455,0.0001140654,0.00004056416,0.00001155005,0.0007704473,0.00003500929,0.9829317,0.0004702782,0.001531253,0.0130857,0.0001494923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005932708,0.000100637,0.9930543,0.0008733779,0.000368785,0.00007863,6.468129e-7,0.00003162365,0.004898763],"genre_scores_gemma":[0.1033528,0.0002131964,0.8942329,0.000979771,0.0002021786,0.000005512084,0.00001338018,0.00001678788,0.0009834641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1027595,"threshold_uncertainty_score":0.4717304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898428916","doi":"10.1137/17m114741x","title":"Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Mathematics; Manifold (fluid mechanics); Piecewise; Iterated function; Subgradient method; Piecewise linear function; Sampling (signal processing); Sequence (biology); Differentiable function; Function (biology); Stationary point; Combinatorics; Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05067573183409192,"gpt":0.26990745417083,"spread":0.219231722336738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001187169,0.0001434539,0.0002346254,0.0002657652,0.0001706628,0.00002873134,0.0001143232,0.00009433278,0.00006125798],"category_scores_gemma":[0.00002559838,0.0001457734,0.000104212,0.0001891638,0.00004580364,0.0001847575,0.00001519377,0.0001295707,0.000001898818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005737764,"about_ca_system_score_gemma":0.00001572553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002799028,"about_ca_topic_score_gemma":0.000001194436,"domain_scores_codex":[0.9991394,0.00002961092,0.0003828976,0.0001132222,0.0001852589,0.0001496694],"domain_scores_gemma":[0.9988953,0.00006932451,0.0003065941,0.0001729541,0.0004964579,0.00005933347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006199536,0.00007284935,0.0001338209,0.00002405643,0.00006088068,5.771807e-7,0.0000627114,0.9950028,0.003642957,0.0001091459,0.0006141916,0.0002140327],"study_design_scores_gemma":[0.0005072699,0.0002491975,0.0002889219,0.0003946881,0.00006931998,0.0000152422,0.00005791279,0.9776284,0.02025384,0.00008550464,0.0003142878,0.0001353911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200712,0.00006731472,0.9862903,0.00005759003,0.0004815974,0.0002301891,0.00004388077,0.000135754,0.0006862674],"genre_scores_gemma":[0.7666891,0.0001359717,0.2327989,0.00003324186,0.0002093969,0.000005768638,0.00007331293,0.00003796998,0.00001638308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7546819,"threshold_uncertainty_score":0.5944466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128286686","doi":"10.1137/s105262340343470x","title":"Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Nuffield Foundation; City University of Hong Kong","keywords":"Mathematics; Conic section; Combinatorics; Moment (physics); Distribution (mathematics); Gaussian; Upper and lower bounds; Second moment of area; Mathematical analysis; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03820894580035558,"gpt":0.3607572078413906,"spread":0.322548262041035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610087,0.0001186397,0.00029405,0.00007594231,0.0001142076,0.00004714362,0.00004947684,0.00007694912,0.00004044524],"category_scores_gemma":[0.0002651068,0.00009503379,0.00007107047,0.00005799598,0.00003098342,0.000126772,0.00001003887,0.00009263307,1.171273e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006566478,"about_ca_system_score_gemma":0.00003230736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.483772e-7,"about_ca_topic_score_gemma":7.439146e-7,"domain_scores_codex":[0.9990301,0.00010205,0.0004506441,0.0001084069,0.0001732136,0.0001355901],"domain_scores_gemma":[0.9986474,0.0005214234,0.0003930924,0.00009734524,0.0002644861,0.0000762491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009493953,0.0003415995,0.0002090942,0.0005898419,0.0002250945,0.000004460465,0.0007950236,0.9318952,0.0007290735,0.0540025,0.003817955,0.006440747],"study_design_scores_gemma":[0.005869648,0.0002950324,0.000003764943,0.0003759598,0.0001379296,0.0001410272,0.0002059804,0.984844,0.003232085,0.001353484,0.003364315,0.0001767179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0235213,0.0002522911,0.9740499,0.0002356078,0.0002178252,0.0004928559,0.00001726784,0.0000199528,0.001193041],"genre_scores_gemma":[0.2723313,0.0006326198,0.7255515,0.00007808129,0.0004507093,0.0000599014,0.00002838564,0.00004783112,0.0008197291],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.24881,"threshold_uncertainty_score":0.3875365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089331999","doi":"10.1137/130933691","title":"Numerical Analysis of $\\mathcal{V}\\mathcal{U}$-Decomposition, $\\mathcal{U}$-Gradient, and $\\mathcal{U}$-Hessian Approximations","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Hessian matrix; Mathematics; Combinatorics; Function (biology); Approximations of π; Mathematical analysis; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02905703108396227,"gpt":0.3622389667632777,"spread":0.3331819356793154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001662684,0.0005747926,0.001244113,0.002010171,0.000731634,0.0003204054,0.0005441701,0.0003510582,0.0005792532],"category_scores_gemma":[0.001900063,0.0005238174,0.000463662,0.00310534,0.00029675,0.0007879171,0.0001286794,0.0008630906,0.00002489541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002777397,"about_ca_system_score_gemma":0.000118562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006324701,"about_ca_topic_score_gemma":0.000004241617,"domain_scores_codex":[0.9944841,0.0007919204,0.001824127,0.0007286139,0.001420349,0.0007508532],"domain_scores_gemma":[0.9949551,0.001182142,0.001301065,0.000808412,0.001098263,0.0006550628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001418512,0.0008218546,0.0006573749,0.0001467391,0.0007867957,0.00001223526,0.0007412837,0.9105509,0.0001026797,0.0801693,0.0004898967,0.005379099],"study_design_scores_gemma":[0.001407302,0.0004059064,0.0008646314,0.0001813787,0.0006333967,0.0001210414,0.0001810385,0.9781839,0.0002643039,0.01667535,0.0005488375,0.000532863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006008653,0.0001135438,0.988077,0.001456749,0.0002370638,0.000593524,0.00006451565,0.0001908159,0.003258066],"genre_scores_gemma":[0.2788321,0.0005848656,0.7188894,0.0003332109,0.0003194747,0.00007876391,0.0002782223,0.0001843533,0.00049956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2728235,"threshold_uncertainty_score":0.9997213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966597656","doi":"10.1137/19m127879x","title":"A Privacy-Preserving Method to Optimize Distributed Resource Allocation","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Operator (biology); Computer science; Resource allocation; Convergence (economics); Dimension (graph theory); Computation; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02199265047430246,"gpt":0.2669085174709549,"spread":0.2449158669966524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067655,0.0002020295,0.0002322559,0.000158432,0.000397226,0.0007502817,0.0009945835,0.00008763422,0.00004358398],"category_scores_gemma":[0.0007996539,0.0001921732,0.00009895301,0.0009810188,0.00001169982,0.0005369839,0.0003174889,0.0003773977,0.00003612702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001234685,"about_ca_system_score_gemma":0.00008616848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002797819,"about_ca_topic_score_gemma":1.48881e-7,"domain_scores_codex":[0.9979025,0.0003631913,0.000447032,0.0004435215,0.0005011166,0.0003426596],"domain_scores_gemma":[0.9983788,0.0001564753,0.0002620752,0.0004743659,0.0002560736,0.000472183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004466891,0.00002793534,0.00001115114,0.000008070843,0.0000159939,0.00001853688,0.001143841,0.9805327,0.0007099218,0.0007811199,0.006501581,0.01020449],"study_design_scores_gemma":[0.000442676,0.0002315482,0.00004136141,0.00008942252,0.00001133601,0.00007693041,0.00009272438,0.9826657,0.002064129,0.0001142287,0.01394848,0.0002214927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006079112,0.00003486821,0.9693013,0.02861512,0.0001538087,0.000201593,0.000002457949,0.000219062,0.0008639146],"genre_scores_gemma":[0.08809045,0.00001291653,0.9069399,0.004471767,0.000355556,0.000006958473,0.00001746871,0.00002941033,0.00007559022],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08748253,"threshold_uncertainty_score":0.7836594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091859835","doi":"10.1137/060658357","title":"Asplund Decomposition of Monotone Operators","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Remainder; Mathematics; Indecomposable module; Monotone polygon; Subderivative; Monotonic function; Operator (biology); Strongly monotone; Pure mathematics; Nonlinear system; Discrete mathematics; Algebra over a field; Mathematical analysis; Regular polygon; Arithmetic; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.008174040744057377,"gpt":0.2733736201165596,"spread":0.2651995793725022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712196,0.0001027135,0.0001453951,0.0004223858,0.0001803496,0.0001340511,0.0003008358,0.0000619667,0.0001334371],"category_scores_gemma":[0.00005530229,0.00009162569,0.0000914526,0.0007495683,0.00001670492,0.0006591472,0.00003248739,0.0001261071,0.00001348457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008287049,"about_ca_system_score_gemma":0.00006202279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002440824,"about_ca_topic_score_gemma":8.748035e-7,"domain_scores_codex":[0.9987545,0.00006791914,0.0004646514,0.0001621907,0.0003985918,0.0001521247],"domain_scores_gemma":[0.998872,0.00006932508,0.0003220297,0.0001776288,0.0004405194,0.0001184934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001993888,0.00009924737,0.0001466518,0.000002103402,0.00002826253,0.000004220617,0.0001051535,0.9589229,0.0001464364,0.0387204,0.0001275323,0.00167712],"study_design_scores_gemma":[0.0004265731,0.000138048,0.0007545285,0.00002099028,0.00001396567,0.00003292054,0.00001591732,0.9957033,0.001892611,0.0006613674,0.0002273002,0.0001125277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002181515,0.0000268841,0.9942979,0.0006984764,0.0004341403,0.00006709505,0.000001042841,0.00003421601,0.002258797],"genre_scores_gemma":[0.4106765,0.00006125954,0.5885304,0.0004172957,0.0001647678,9.628225e-7,0.00001257955,0.000008589976,0.0001276556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.408495,"threshold_uncertainty_score":0.3736387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014632088","doi":"10.1137/s1052623499352632","title":"A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Overdetermined system; Symmetrization; Mathematics; Semidefinite programming; Interior point method; Linearization; Gauss; Mathematical optimization; Optimization problem; Applied mathematics; Combinatorics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.07053505632736073,"gpt":0.3794270903251682,"spread":0.3088920339978075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00154215,0.0004074328,0.0004716639,0.0008352011,0.0008708586,0.0003884221,0.0002832364,0.000293302,0.000991335],"category_scores_gemma":[0.002047561,0.0003885828,0.0002301789,0.001238798,0.00009409701,0.001001221,0.0000678826,0.0006679682,0.00002986102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006394419,"about_ca_system_score_gemma":0.0002252394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002551154,"about_ca_topic_score_gemma":0.000002207837,"domain_scores_codex":[0.9961624,0.0003712041,0.000987593,0.0005531907,0.00116124,0.0007643995],"domain_scores_gemma":[0.9962125,0.0008346906,0.0005327869,0.0004168359,0.001639858,0.0003633078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006759123,0.000348872,0.00007845336,0.00004893238,0.00006691424,0.00002006695,0.0001899514,0.9897994,0.00008155754,0.002475539,0.002081186,0.004133173],"study_design_scores_gemma":[0.003072081,0.0005898671,0.00002063,0.0001565943,0.0000554486,0.0003486741,0.0001748027,0.9892978,0.0005640031,0.002786503,0.002506592,0.0004269803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001182285,0.00007681404,0.9911462,0.001758333,0.0005053211,0.001274442,0.00002337618,0.0002640402,0.003769198],"genre_scores_gemma":[0.004993619,0.002225057,0.9832737,0.0002769424,0.0009815402,0.0001482046,0.0002355654,0.0002348474,0.00763054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007872508,"threshold_uncertainty_score":0.9999219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088059505","doi":"10.1137/19m1281538","title":"On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematical optimization; Subject (documents); Function (biology); Convex function; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02735944498284499,"gpt":0.2516408519365125,"spread":0.2242814069536676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000435789,0.0001377154,0.0001763233,0.0001158188,0.0004251972,0.0001629874,0.0004886907,0.00005713376,0.0001037862],"category_scores_gemma":[0.0003664068,0.00008259677,0.0002115317,0.0007815359,0.00003140304,0.0002082263,0.00006051902,0.0001981037,0.00000920295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005133621,"about_ca_system_score_gemma":0.0001104116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001755825,"about_ca_topic_score_gemma":7.257055e-7,"domain_scores_codex":[0.9986134,0.0001502105,0.000416637,0.0002226366,0.0004423186,0.0001547639],"domain_scores_gemma":[0.998549,0.0002857814,0.0003758185,0.0002209576,0.0004528889,0.0001155793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005388132,0.00007980177,0.00003968714,0.000003362467,0.00004689675,7.250347e-7,0.0003590041,0.9694771,0.00004947119,0.02054681,0.0006064938,0.008736808],"study_design_scores_gemma":[0.0005154744,0.0004516445,0.0001448593,0.00002828638,0.00005633913,0.000008370933,0.00008587279,0.9970782,0.0004203099,0.0001491821,0.0009596859,0.0001018026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005219783,0.000008792655,0.9841247,0.01406501,0.0004786988,0.0005519317,0.00001444342,0.00002852019,0.0002059425],"genre_scores_gemma":[0.3257936,0.00003707072,0.6573502,0.01577486,0.0006475955,0.000149072,0.00002236347,0.00003558376,0.0001896388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3267745,"threshold_uncertainty_score":0.3368199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083147274","doi":"10.1137/21m1420915","title":"Escaping Unknown Discontinuous Regions in Blackbox Optimization","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Classification of discontinuities; Mathematical optimization; Optimization problem; Constraint (computer-aided design); Variable (mathematics); Nonlinear system; Computer science; Convergence (economics); Space (punctuation); Key (lock); Mathematics; Penalty method; Series (stratigraphy); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006177420138452229,"gpt":0.2001085071382088,"spread":0.1939310869997566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004569579,0.0002574132,0.0003052826,0.0006403257,0.000411232,0.0001300449,0.0002512076,0.00008021518,0.000304286],"category_scores_gemma":[0.00009966509,0.000290072,0.00009490928,0.0008868197,0.00002118331,0.0006515058,0.00004713696,0.0006508559,0.00000699179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008624382,"about_ca_system_score_gemma":0.00004867301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002516548,"about_ca_topic_score_gemma":0.000004136614,"domain_scores_codex":[0.9979687,0.0002357679,0.0006997445,0.0002547463,0.0004448105,0.0003962254],"domain_scores_gemma":[0.9992163,0.000072873,0.0002452175,0.0002518606,0.000100694,0.000113125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004519329,0.00005311744,0.00005688154,0.00001146905,0.0000235977,0.00002876834,0.0003007076,0.9971453,0.00005604152,0.0009051501,0.0003688268,0.001004973],"study_design_scores_gemma":[0.001299766,0.000112828,0.00002570339,0.00006864348,0.00001523478,0.0001303905,0.0003267673,0.9960092,0.00001945185,0.0001509314,0.001540815,0.0003002256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00140365,0.000445422,0.9916716,0.0003121695,0.001125372,0.0004389764,0.000008762979,0.0002818621,0.004312231],"genre_scores_gemma":[0.9289287,0.0008163258,0.0685121,0.0002067174,0.0004563514,0.0001760832,0.0001598243,0.0002053041,0.000538572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.927525,"threshold_uncertainty_score":0.9999551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380609297","doi":"10.1137/22m1483165","title":"The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear subspace; Intersection (aeronautics); Convexity; Monotone polygon; Convergence (economics); Projection (relational algebra); Monotonic function; Operator (biology); Algorithm; Mathematical optimization; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.007490345301454423,"gpt":0.237609898501728,"spread":0.2301195532002736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256217,0.000153543,0.0001494364,0.000116356,0.0009860218,0.0004446191,0.0004302535,0.00005687721,0.00001729985],"category_scores_gemma":[0.000118063,0.00008666051,0.00006004057,0.001138375,0.00003938417,0.0003332706,0.0001087685,0.000200608,0.00001344093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008415698,"about_ca_system_score_gemma":0.00005129853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008258871,"about_ca_topic_score_gemma":0.00002736339,"domain_scores_codex":[0.998392,0.0001985502,0.0004265946,0.0002557721,0.000496996,0.0002300811],"domain_scores_gemma":[0.9988038,0.0002338905,0.0003437457,0.0002152031,0.0003031444,0.0001002058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008328049,0.00004048665,0.00022942,0.000004990463,0.00007757141,2.519672e-7,0.002012818,0.9625424,0.0004838188,0.002480451,0.02855523,0.003489255],"study_design_scores_gemma":[0.0003083988,0.0001998952,0.0002634781,0.00001600112,0.00002304702,0.000008671835,0.001309834,0.9888325,0.0008802263,0.00002868525,0.008003573,0.0001257148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008937228,0.00006393618,0.9731783,0.01666451,0.0004388988,0.0004175501,0.00002392869,0.00005744202,0.0002181945],"genre_scores_gemma":[0.9556527,0.0009099991,0.03527198,0.0023145,0.0006068079,0.0001477561,0.0001797458,0.00005791863,0.004858579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467155,"threshold_uncertainty_score":0.7583782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981781020","doi":"10.1137/18m1193657","title":"Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Mathematics; Combinatorics; Semidefinite programming; Vertex (graph theory); Conic optimization; Regular polygon; Convex optimization; Discrete mathematics; Graph; Convex set; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.07053607418130879,"gpt":0.3557477996365117,"spread":0.2852117254552028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001524663,0.0002883752,0.0003443941,0.0004894066,0.0004087828,0.0002749359,0.000415887,0.0001061839,0.001473133],"category_scores_gemma":[0.0004762591,0.0001998721,0.00007054893,0.001157474,0.000066715,0.0007043073,0.0001141749,0.0008063614,0.00003346884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004862335,"about_ca_system_score_gemma":0.0001487118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318346,"about_ca_topic_score_gemma":0.00002062637,"domain_scores_codex":[0.9970167,0.0004824254,0.0007144207,0.0003408745,0.0009675487,0.0004780799],"domain_scores_gemma":[0.9976565,0.000853895,0.0005282712,0.0004051073,0.000431999,0.0001241891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002128019,0.0001487686,0.00169683,0.00002515876,0.0000366203,0.00001516113,0.0002958519,0.9937108,0.000006679132,0.002900442,0.0002582469,0.0006927013],"study_design_scores_gemma":[0.002108012,0.0003242978,0.0001164362,0.0002000146,0.00002159863,0.00008895338,0.0005740313,0.993611,0.0001067883,0.001751775,0.0008149921,0.0002821116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004224428,0.0000513637,0.9885278,0.001511125,0.0002000919,0.0009932983,0.00001151742,0.00007156643,0.004408778],"genre_scores_gemma":[0.05195436,0.0007709603,0.9453644,0.0004763826,0.000188469,0.0000378105,0.00008819137,0.0001215589,0.0009979366],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04772993,"threshold_uncertainty_score":0.9994397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203691100","doi":"10.1137/21m1455127","title":"Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Imperial College London; Pacific Institute for the Mathematical Sciences","keywords":"Pointwise; Mathematics; Infimum and supremum; Nabla symbol; Combinatorics; Upper and lower bounds; Convex function; Relaxation (psychology); Omega; Regular polygon; Applied mathematics; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04715189319642251,"gpt":0.3360420978468465,"spread":0.288890204650424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263278,0.0002408008,0.0004039756,0.001072048,0.0002787329,0.00007909064,0.0001698164,0.0002000209,0.0004028164],"category_scores_gemma":[0.003928548,0.0002268265,0.0001064797,0.001505587,0.0001651415,0.0007735386,0.00007513136,0.0004119156,0.000008222443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513391,"about_ca_system_score_gemma":0.0002014544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004996376,"about_ca_topic_score_gemma":0.000002799481,"domain_scores_codex":[0.9969477,0.000328247,0.001174848,0.0003001366,0.0009489371,0.0003001428],"domain_scores_gemma":[0.9958292,0.0009148798,0.00134201,0.0002646527,0.001496801,0.0001524274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001003225,0.0001595252,0.0003335192,0.0001092721,0.00006569241,0.000003754061,0.0008551307,0.9693903,0.0000912892,0.0275913,0.0004178687,0.0008820019],"study_design_scores_gemma":[0.001422711,0.0003594219,0.000500139,0.0002868201,0.00004476466,0.00004880203,0.0004297364,0.9793111,0.0002969903,0.01704166,0.00005016857,0.0002076615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004130444,0.00005383595,0.9931789,0.0008615846,0.0002175383,0.0006171935,0.00005101407,0.0001272672,0.000762189],"genre_scores_gemma":[0.1060182,0.001378937,0.890836,0.00004866634,0.0002018687,0.00005798276,0.0004347692,0.0001231858,0.0009003356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1023429,"threshold_uncertainty_score":0.9249718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400787272","doi":"10.1137/23m1561968","title":"Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Concordia University; Institut de Valorisation des Données; Centre de Recherches Mathématiques","keywords":"Mathematics; Lipschitz continuity; Lasso (programming language); Stability (learning theory); Square root; Square (algebra); Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04309997475809929,"gpt":0.2949766768933983,"spread":0.2518767021352991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004650245,0.0001723537,0.0002518048,0.0002284828,0.0003871397,0.001268157,0.0003806355,0.00009498731,0.0004523642],"category_scores_gemma":[0.002003013,0.00009179885,0.0001232231,0.0006527968,0.0001602835,0.0004243194,0.00005731578,0.0005026895,0.00004441783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007610309,"about_ca_system_score_gemma":0.0001224261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001252732,"about_ca_topic_score_gemma":0.000002024056,"domain_scores_codex":[0.9975203,0.0004099637,0.0005939961,0.0003265336,0.0009251948,0.0002240539],"domain_scores_gemma":[0.9973031,0.002006906,0.0001358887,0.0002909878,0.0001268566,0.0001362857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008885355,0.00002666571,0.0001291625,0.00001498391,0.00002349467,0.00002087698,0.0007744081,0.9727197,0.0000138181,0.01434657,0.003153607,0.008687842],"study_design_scores_gemma":[0.0006051108,0.0001049579,0.0002694812,0.0001424872,0.00003168912,0.0001517615,0.000348924,0.9769048,0.00002613994,0.01072192,0.01054804,0.0001446611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006185045,0.003236034,0.9753018,0.008865106,0.001870485,0.0002787213,0.000006750307,0.0001144394,0.004141597],"genre_scores_gemma":[0.9929461,0.0003638303,0.005554229,0.0001526834,0.0003929545,0.000006352127,0.000003073537,0.00002742472,0.0005533005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9867611,"threshold_uncertainty_score":0.9997686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912745458","doi":"10.1137/19m130858x","title":"Dual Space Preconditioning for Gradient Descent","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Laboratory; Army Research Office; Engineering and Physical Sciences Research Council; Ministry of Defence; Natural Sciences and Engineering Research Council of Canada; European Commission; Institute for Advanced Studies in the Humanities, University of Edinburgh; DeepMind; Seventh Framework Programme","keywords":"Convexity; Lipschitz continuity; Mathematics; Smoothness; Stochastic gradient descent; Gradient descent; Applied mathematics; Convex function; Gradient method; Nonlinear conjugate gradient method; Bregman divergence; Norm (philosophy); Proximal Gradient Methods; Mathematical analysis; Mathematical optimization; Regular polygon; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02090318359265479,"gpt":0.2435101790497992,"spread":0.2226069954571444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001535194,0.0002526944,0.0002715463,0.0002006573,0.0001505658,0.0003726045,0.0001168963,0.0002231735,0.00006988662],"category_scores_gemma":[0.0000537666,0.0002705171,0.0001892719,0.00007567165,0.00001417799,0.000115736,0.00006134237,0.0006377304,0.000001782361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000275879,"about_ca_system_score_gemma":0.00006255465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001343762,"about_ca_topic_score_gemma":0.000001455653,"domain_scores_codex":[0.9989542,0.00004687488,0.0003401634,0.0002230153,0.0001997514,0.0002360035],"domain_scores_gemma":[0.9991845,0.0000446232,0.0001839709,0.0002284832,0.0002626692,0.00009575567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001285496,0.00003069582,0.000006109976,0.00004755582,0.0000935091,0.00001663523,0.0001462938,0.9932303,0.0001590676,0.0001420425,0.00481707,0.001297794],"study_design_scores_gemma":[0.0003284377,0.0001028331,0.00006787229,0.00141148,0.00008118134,0.000138714,0.00007257696,0.9808723,0.01454628,0.0008823182,0.001102409,0.000393625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01690576,0.0006677106,0.977912,0.0001734928,0.002423841,0.0003712787,0.00001693067,0.0003881127,0.001140862],"genre_scores_gemma":[0.692149,0.002389484,0.3033514,0.0001201647,0.001236959,0.0000662666,0.0004104995,0.0001490607,0.0001272058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6752432,"threshold_uncertainty_score":0.9999747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963803091","doi":"10.1137/16m1082172","title":"The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Resolvent; Regular polygon; Quotient; Convex function; Binary relation; Convex set; Connection (principal bundle); Pure mathematics; Bijection; Order (exchange); Combinatorics; Discrete mathematics; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.006123639609745902,"gpt":0.2292755975042869,"spread":0.223151957894541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005457529,0.0001223274,0.0001257959,0.00005037043,0.001582707,0.0006937506,0.000929357,0.000061737,0.00001918805],"category_scores_gemma":[0.0002527603,0.00007240938,0.0000648562,0.0002701693,0.0001279787,0.0005109535,0.00009704738,0.0001657757,0.000002000963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004501564,"about_ca_system_score_gemma":0.00007404421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004184159,"about_ca_topic_score_gemma":0.000004838136,"domain_scores_codex":[0.99868,0.0001537005,0.0003538879,0.0002039981,0.0004569475,0.0001514525],"domain_scores_gemma":[0.9981046,0.00008897091,0.0008048952,0.0005539281,0.0003712917,0.00007635442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006128811,0.0002784155,0.0008186886,0.000009101497,0.0001549415,6.582888e-7,0.0003917936,0.8310421,0.001208118,0.0391082,0.1152918,0.01163487],"study_design_scores_gemma":[0.0005603001,0.00006205747,0.0003608941,0.00002286686,0.00002657109,0.000007998578,0.00003328121,0.9822543,0.0006295678,0.0005443578,0.01537679,0.000120997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006334734,0.0004980213,0.9703787,0.02705865,0.0002516169,0.000150589,0.00001358892,0.00001644613,0.0009989017],"genre_scores_gemma":[0.9205207,0.01580917,0.05166693,0.002171567,0.0001612574,0.00002714971,0.0001131378,0.00005643658,0.009473608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198872,"threshold_uncertainty_score":0.9997171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3195078226","doi":"10.1137/21m1442474","title":"The Bregman Proximal Average","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bregman divergence; Combinatorics; Mathematical optimization; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007751141731016588,"gpt":0.2169832816624985,"spread":0.2092321399314819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007301557,0.00009159684,0.00008250379,0.0001529328,0.00234357,0.0005354651,0.0007122645,0.0000183692,0.0004051017],"category_scores_gemma":[0.00006553643,0.00006665463,0.00009458613,0.0007050246,0.0000153466,0.0004052757,0.0001598493,0.000294246,0.00001792439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001428681,"about_ca_system_score_gemma":0.0001119116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.139204e-7,"about_ca_topic_score_gemma":3.643775e-7,"domain_scores_codex":[0.9984696,0.0002649445,0.0002727987,0.0001724725,0.0006421737,0.0001780171],"domain_scores_gemma":[0.9991703,0.0000959676,0.0002477637,0.0002421819,0.0001655263,0.00007827534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001202346,0.00004905654,0.00003693294,4.118941e-7,0.00001968803,0.000005525254,0.0001122572,0.9165041,0.000002810877,0.07953309,0.001729379,0.001994692],"study_design_scores_gemma":[0.0002767289,0.0001198251,0.0001093789,0.000001854497,0.000005520718,0.00008434011,0.00003013773,0.9791336,0.00001001065,0.001395398,0.01874245,0.00009074111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000878918,0.00006011657,0.9837889,0.01176107,0.0005443255,0.00009026497,0.000001813433,0.00005521296,0.003610396],"genre_scores_gemma":[0.6887997,0.0006706328,0.2860886,0.008340023,0.0008005497,0.0001042418,0.00006364578,0.00005697394,0.01507559],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6977003,"threshold_uncertainty_score":0.9989552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401550494","doi":"10.1137/23m1552140","title":"MGProx: A Nonsmooth Multigrid Proximal Gradient Method with Adaptive Restriction for Strongly Convex Optimization","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Multigrid method; Regular polygon; Mathematical optimization; Convex optimization; Proximal Gradient Methods; Applied mathematics; Mathematical analysis; Geometry; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01679189818565932,"gpt":0.2575591347630491,"spread":0.2407672365773898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000230589,0.0002344757,0.0002040201,0.0003585905,0.0001652874,0.0002376786,0.00009425406,0.0001129569,0.00002280395],"category_scores_gemma":[0.00002843132,0.0001929298,0.00008702344,0.0003483346,0.00002306712,0.0004010428,0.000009507666,0.0003307754,0.000002235801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002302788,"about_ca_system_score_gemma":0.00006272407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000307485,"about_ca_topic_score_gemma":0.000001186453,"domain_scores_codex":[0.998886,0.00006508936,0.0003008946,0.0002454029,0.0002455059,0.0002570787],"domain_scores_gemma":[0.9993314,0.00009698338,0.00009212726,0.0001398131,0.0002459197,0.00009377351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001876635,0.00003314132,0.000005300551,0.00002388374,0.0001003457,0.00001818663,0.0001278666,0.9939216,0.0002141666,0.001124803,0.001287747,0.002955327],"study_design_scores_gemma":[0.000489418,0.0007944941,0.00001338783,0.0003865708,0.00008130715,0.0001067251,0.00007179094,0.992211,0.004516396,0.0001029889,0.0009915839,0.0002343281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007166707,0.0002832568,0.9961801,0.0001057528,0.0005783506,0.0006212334,0.00001528344,0.000709052,0.0007903389],"genre_scores_gemma":[0.1703626,0.0004019972,0.8285296,0.00003026305,0.0003864481,0.00007428873,0.00005065354,0.0001000506,0.00006407144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.169646,"threshold_uncertainty_score":0.7867447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971969277","doi":"10.1137/120869390","title":"On the Average Condition of Random Linear Programs","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Logarithm; Upper and lower bounds; Combinatorics; Basis (linear algebra); Condition number; Linear programming; Dual (grammatical number); Discrete mathematics; Applied mathematics; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0346690006164164,"gpt":0.2906724988904961,"spread":0.2560034982740797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000572743,0.0001237413,0.0001885655,0.00008938826,0.000142589,0.00009544082,0.0001213607,0.00007281182,0.003930435],"category_scores_gemma":[0.001070413,0.00006800912,0.0001072974,0.0001556565,0.00004409548,0.0002155568,0.000008348424,0.0002437648,0.0001226177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003881544,"about_ca_system_score_gemma":0.00002023335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.91361e-7,"about_ca_topic_score_gemma":2.336028e-7,"domain_scores_codex":[0.9987035,0.000171146,0.0005067375,0.00009240554,0.0004044221,0.0001217247],"domain_scores_gemma":[0.9984698,0.0005249909,0.0004282352,0.0001726724,0.0003452688,0.00005898125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009953133,0.0006050287,0.000004350141,0.00006769893,0.00004575797,8.301599e-7,0.0005758148,0.02901863,0.0001490579,0.9588095,0.007935545,0.002688242],"study_design_scores_gemma":[0.001080743,0.0004057549,0.00000746576,0.0002545387,0.00001935534,0.00001611533,0.0001565047,0.5814353,0.002116217,0.4142472,0.00015464,0.0001061397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06104711,0.000005564235,0.9141226,0.002621,0.0001624149,0.001116505,0.000002557957,0.00005813788,0.02086413],"genre_scores_gemma":[0.875065,0.00004875952,0.1218335,0.0008379811,0.0002172574,0.0001252936,0.00004494128,0.00004703124,0.00178022],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8140179,"threshold_uncertainty_score":0.9969801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413992645","doi":"10.1137/23m1587919","title":"On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convergence (economics); Applied mathematics; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.009435308930310997,"gpt":0.2415025215910931,"spread":0.2320672126607821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383542,0.0001335467,0.0001171357,0.0001595065,0.0006219915,0.0002183121,0.0004125149,0.00006377519,0.0001468955],"category_scores_gemma":[0.0001760102,0.00009369077,0.00005406063,0.0004533866,0.00006363403,0.0003896791,0.00008577302,0.0003780852,0.00002222426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005324386,"about_ca_system_score_gemma":0.00009521725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001192754,"about_ca_topic_score_gemma":2.261343e-7,"domain_scores_codex":[0.9989001,0.0001857272,0.0002684529,0.0002176649,0.0002462413,0.0001818123],"domain_scores_gemma":[0.9989992,0.0003626449,0.0001536528,0.0002659193,0.0001434708,0.00007509057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001343095,0.00004686344,0.00003376424,0.000003978653,0.00003277165,0.00000782826,0.0002335267,0.5219141,0.000007454423,0.4606696,0.001700581,0.01533609],"study_design_scores_gemma":[0.0002858789,0.000109542,0.0001046989,0.00007897468,0.00001168019,0.00002443164,0.00005870595,0.9761121,0.0002213068,0.02186641,0.001023001,0.0001032891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006878769,0.0001601496,0.989072,0.005665007,0.0007760975,0.0001217416,0.000003097653,0.0000483112,0.003465686],"genre_scores_gemma":[0.3452522,0.001419788,0.6384022,0.004852085,0.0008737598,0.00003697862,0.00001779148,0.00004105766,0.009104078],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.454198,"threshold_uncertainty_score":0.4783919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387693852","doi":"10.1137/22m1469651","title":"Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Mathematics; Quadratic equation; Optimization problem; Nonlinear system; Power flow; Sequence (biology); Quadratic programming; Robust optimization; Set (abstract data type); Nonlinear programming; Ellipsoid; Feasible region; Electric power system; Power (physics); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01188711727066198,"gpt":0.2350073656440852,"spread":0.2231202483734232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004176897,0.0003029548,0.0002497114,0.0004293853,0.0002584235,0.0002720986,0.0001486091,0.000114201,0.0001523192],"category_scores_gemma":[0.00008554808,0.0002898478,0.00004585863,0.0009283953,0.00002479433,0.000709904,0.00003385866,0.0002877828,0.0001049399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002341214,"about_ca_system_score_gemma":0.000041649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001516654,"about_ca_topic_score_gemma":0.000002350897,"domain_scores_codex":[0.9983274,0.00006996104,0.0004451304,0.0002934832,0.0004469802,0.0004170829],"domain_scores_gemma":[0.9990922,0.00006407707,0.0001200687,0.0002062157,0.000263138,0.0002543137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008831485,0.00002518485,0.00001803291,0.00003908308,0.00003826228,0.0000107551,0.0004728204,0.997609,0.0002377672,0.0007438359,0.0004502136,0.0002667971],"study_design_scores_gemma":[0.0007560072,0.000349997,0.00006352951,0.000092326,0.00002771919,0.00004019917,0.0005093821,0.9970515,0.0004592528,0.000009437337,0.0002931416,0.0003475297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03617263,0.00008213267,0.9608563,0.0003722416,0.0002945442,0.0005290081,0.00006561414,0.0005366866,0.001090814],"genre_scores_gemma":[0.8697698,0.0003260747,0.1282493,0.0001680632,0.0002407679,0.0001047483,0.000528105,0.0001626145,0.000450486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8335972,"threshold_uncertainty_score":0.9999554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408053135","doi":"10.1137/24m1632772","title":"Adaptive Partitioning for Chance-Constrained Problems with Finite Support","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Mathematics; Mathematical optimization; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01161033525573548,"gpt":0.2214505878840791,"spread":0.2098402526283436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001208955,0.0001452271,0.0001417779,0.0001738722,0.0002004472,0.00007621873,0.00006495423,0.00006446786,0.00004122507],"category_scores_gemma":[0.00006252028,0.00012924,0.00003765568,0.0001695477,0.00003017723,0.0002059356,0.000005066996,0.0001747085,0.000002337614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009634424,"about_ca_system_score_gemma":0.00004559401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.207387e-7,"about_ca_topic_score_gemma":0.000001376085,"domain_scores_codex":[0.9993128,0.00001331604,0.0002334992,0.0001282946,0.0001034577,0.0002086751],"domain_scores_gemma":[0.9995261,0.00009070138,0.00008764763,0.00008845966,0.000154955,0.00005214302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007138519,0.00001831731,0.000009896321,0.00003530671,0.00004368775,0.0000021219,0.00007368753,0.9956332,0.000008106141,0.001865667,0.0002290718,0.002009553],"study_design_scores_gemma":[0.000926349,0.0003010566,0.0000181328,0.0001942102,0.00003204531,0.00001008595,0.00005629058,0.9945312,0.0008367659,0.001625873,0.001307272,0.0001607886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007224698,0.0000467021,0.9937158,0.0001239219,0.0003120595,0.0002816584,0.00001240566,0.0001616954,0.005273521],"genre_scores_gemma":[0.6600896,0.0003235615,0.3382347,0.0001689366,0.0001616183,0.00009599643,0.0001139678,0.00004760449,0.0007640744],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6600173,"threshold_uncertainty_score":0.5270253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402461337","doi":"10.1137/23m157627x","title":"Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree; Algorithm; Discrete mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01727637826205133,"gpt":0.3002095516113,"spread":0.2829331733492487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001679756,0.0001230335,0.0001273747,0.0008910921,0.0001336919,0.0005071388,0.0003136871,0.00005583118,0.00002302829],"category_scores_gemma":[0.0001777217,0.0001033524,0.00004764391,0.0009992389,0.00006694953,0.001044161,0.00008656528,0.0004429122,0.000006755407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004762424,"about_ca_system_score_gemma":0.000057236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.148356e-7,"about_ca_topic_score_gemma":7.904773e-7,"domain_scores_codex":[0.9985737,0.0003533098,0.0002484699,0.0002671621,0.0003009906,0.0002563968],"domain_scores_gemma":[0.999084,0.0005147784,0.00005742813,0.0001734102,0.00006394305,0.0001064344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006858946,0.00004101014,0.0001680454,0.00001564779,0.00002503812,0.0002461852,0.001505756,0.5901849,0.0002282254,0.3186097,0.00009665872,0.08881031],"study_design_scores_gemma":[0.0003241133,0.0001970935,0.0003277894,0.0002459486,0.000003157488,0.0001675373,0.0001103467,0.8409053,0.0001176494,0.156973,0.0004836191,0.0001444013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005228286,0.001427835,0.9911171,0.0006959225,0.0003569412,0.00009732364,0.000001066705,0.0000820473,0.0009934828],"genre_scores_gemma":[0.7340166,0.002721671,0.2619975,0.0003689052,0.0001911804,0.00001517919,0.00000409876,0.00004635352,0.0006384625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7291195,"threshold_uncertainty_score":0.4890352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209551251","doi":"10.1137/19m1291145","title":"Lattice Reformulation Cuts","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01282574552117052,"gpt":0.2468545492508314,"spread":0.2340288037296609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002459633,0.00007727735,0.0000794045,0.0001146068,0.0002231062,0.0003348931,0.0002369375,0.00005147795,0.00008932147],"category_scores_gemma":[0.00007485326,0.00006962481,0.00006295247,0.0005470737,0.000009332689,0.001122558,0.00005823511,0.0001878749,0.00002259072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003952771,"about_ca_system_score_gemma":0.00007259242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.261654e-7,"about_ca_topic_score_gemma":0.000001170793,"domain_scores_codex":[0.9991239,0.00008822651,0.0002001201,0.0001714587,0.0002768489,0.0001393868],"domain_scores_gemma":[0.9992282,0.00004062683,0.0001229523,0.0002834489,0.0002351494,0.00008960385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002743295,0.0001891452,0.0002481569,0.00000930374,0.00002581792,0.0001199956,0.0004290681,0.5838712,0.0001259457,0.3933729,0.001874234,0.01970683],"study_design_scores_gemma":[0.0008092654,0.0001874339,0.001564947,0.00007165805,0.0000135873,0.0005543433,0.00004100691,0.9552048,0.001447775,0.02238044,0.01745755,0.0002671905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00168576,0.0001128682,0.9912371,0.001273858,0.0005083599,0.00003380491,0.000002186119,0.00005673322,0.005089346],"genre_scores_gemma":[0.1653946,0.0005901879,0.8319715,0.001506171,0.0003582416,0.00000203689,0.00006282864,0.00001289478,0.0001015512],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3713336,"threshold_uncertainty_score":0.3229382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068022782","doi":"10.1137/130945818","title":"Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives","year":2015,"lang":"en","type":"preprint","venue":"SIAM Journal on Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Complementarity (molecular biology); Vertex (graph theory); Regular polygon; Conic section; Conic optimization; Pure mathematics; Convex set; Convex optimization; Graph; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08091285722626668,"gpt":0.31642708135062,"spread":0.2355142241243533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690689,0.0002655685,0.0004097415,0.0001253321,0.0002760125,0.0003223614,0.000459656,0.0001779568,0.00008636885],"category_scores_gemma":[0.001619073,0.0001224673,0.0001264937,0.000231079,0.0001371354,0.0001961576,0.0002392658,0.0009448724,0.000001670185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005451806,"about_ca_system_score_gemma":0.0001667107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003335495,"about_ca_topic_score_gemma":0.000004935999,"domain_scores_codex":[0.9982085,0.0003696375,0.0006283305,0.0002060198,0.0004050147,0.0001824834],"domain_scores_gemma":[0.9960453,0.001977773,0.001100725,0.00040462,0.0004134251,0.00005816402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005702659,0.0005281234,0.0006504344,0.0006040544,0.001932545,0.00001246714,0.07893606,0.7434208,0.00007528091,0.1593756,0.00788855,0.006005838],"study_design_scores_gemma":[0.0004479321,0.0001637586,0.0001819394,0.0009021658,0.0002158775,0.00002985549,0.006013033,0.06163726,0.0005287551,0.9288459,0.0007664156,0.0002670877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2505969,0.02770176,0.673131,0.0128116,0.00249496,0.001483962,0.0003002178,0.0001202492,0.03135938],"genre_scores_gemma":[0.9759504,0.008195118,0.01384349,0.0001936799,0.001036626,0.000009495707,0.00003432318,0.00006595717,0.000670909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7694703,"threshold_uncertainty_score":0.4994074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391685089","doi":"10.1137/23m1597009","title":"Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Chongqing","keywords":"Mathematics; Pure mathematics; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.0128797847676563,"gpt":0.2531671316334372,"spread":0.2402873468657809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579478,0.0001029161,0.0001856942,0.0005054029,0.0001590365,0.000130829,0.0002372314,0.00005895393,0.00008555032],"category_scores_gemma":[0.0001242504,0.00009066465,0.0001848866,0.0009461826,0.00002729794,0.0005562635,0.0000291472,0.0001087513,0.000005434687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006132329,"about_ca_system_score_gemma":0.0002499501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004494256,"about_ca_topic_score_gemma":9.896065e-7,"domain_scores_codex":[0.9988503,0.00005299502,0.0004801779,0.0001895914,0.0003051263,0.0001218083],"domain_scores_gemma":[0.9985076,0.0001730895,0.0002608601,0.0001630059,0.0008332749,0.00006216795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001664361,0.00009864166,0.00002431879,0.00004216655,0.00008712922,0.000001445295,0.0002328601,0.919414,0.0003725012,0.07830669,0.000448955,0.000954692],"study_design_scores_gemma":[0.0002932017,0.0001937205,0.000135041,0.0001016041,0.00005756037,0.00003817633,0.00003045408,0.9962283,0.000612063,0.001336817,0.0008799222,0.00009317334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003040555,0.00008279003,0.9963925,0.001914855,0.000497473,0.0001694036,0.00002638209,0.0000482161,0.0005643415],"genre_scores_gemma":[0.4679463,0.0001143796,0.5303692,0.0001753999,0.0001808067,0.00002819935,0.00006710286,0.00002168913,0.001096876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4676422,"threshold_uncertainty_score":0.3697197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407702284","doi":"10.1137/24m164344x","title":"Everything Is Possible: Constructing Spectrahedra with Prescribed Facial Dimensions","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Liquid Crystal Research Advancements","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Kensington Health","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Respiratory Council","keywords":"Mathematics; Mathematical optimization; Algebra over a field; Calculus (dental); Pure mathematics; Orthodontics","retraction":null,"screen_n_in":null,"score":{"opus":0.01332729680817567,"gpt":0.2881948608291784,"spread":0.2748675640210028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431346,0.000155676,0.0001749241,0.0002403349,0.0005403879,0.0004128939,0.0002252039,0.00005206682,0.000883935],"category_scores_gemma":[0.0003440597,0.0001217795,0.00003920871,0.0004086252,0.00009445423,0.0008000802,0.00007857847,0.0003144151,0.00002579778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002315251,"about_ca_system_score_gemma":0.0003408531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005359555,"about_ca_topic_score_gemma":0.000001829892,"domain_scores_codex":[0.998234,0.000124136,0.0003374705,0.0002658821,0.0006381055,0.000400446],"domain_scores_gemma":[0.9990671,0.00009308586,0.000202609,0.0001900095,0.0003060343,0.0001411957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009979024,0.0001714768,0.001140722,0.0000478702,0.00007328721,0.0001045731,0.0007860021,0.7927992,0.1969032,0.0027213,0.001463528,0.002791028],"study_design_scores_gemma":[0.01015027,0.002682207,0.0006075604,0.003150238,0.0001729085,0.0006449628,0.002630578,0.1220666,0.8430557,0.006325504,0.007113243,0.001400309],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5634296,0.0002055792,0.4175676,0.00168153,0.001347396,0.0006375981,0.00003332799,0.0001425765,0.01495481],"genre_scores_gemma":[0.8706964,0.0001291455,0.1266238,0.0007248354,0.0001581102,0.00001062064,0.000007634466,0.00002779939,0.001621684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6707326,"threshold_uncertainty_score":0.9678468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226198151","doi":"10.1137/22m1484742","title":"Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Shandong Province; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Smoothness; Order (exchange); Mathematics; Mathematical optimization; Variational analysis; Optimization problem; Applied mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02115896620607888,"gpt":0.2717379495631903,"spread":0.2505789833571114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797316,0.0002214182,0.0004611745,0.001534827,0.0004772292,0.0003933111,0.0003080618,0.0001339854,0.0002540936],"category_scores_gemma":[0.000231902,0.0002064322,0.0002266892,0.00427394,0.00005186789,0.001020486,0.00006925112,0.0001412404,0.000004426929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001154038,"about_ca_system_score_gemma":0.0001680612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000877255,"about_ca_topic_score_gemma":0.000003596474,"domain_scores_codex":[0.9976908,0.0002201218,0.0008227033,0.0004425876,0.0005587573,0.0002650052],"domain_scores_gemma":[0.9968129,0.0003668462,0.0007902298,0.0002737659,0.001594028,0.0001622362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002097741,0.00009284031,0.0003812519,0.00002322554,0.0008746604,8.439015e-7,0.0002715692,0.9206715,0.00002363991,0.07729309,0.0002968259,0.00004964023],"study_design_scores_gemma":[0.0008562521,0.0001355806,0.003065391,0.00002158638,0.0004278761,0.000007914507,0.00004788019,0.9943472,0.00001060315,0.0007309835,0.0001311015,0.0002176839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001063902,0.00003489307,0.9962495,0.00105083,0.000395198,0.0004217833,0.0001954778,0.0001010419,0.0004873923],"genre_scores_gemma":[0.1786783,0.000501661,0.8142749,0.0005414307,0.0003792218,0.0002278209,0.003297176,0.00005818067,0.002041301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1819746,"threshold_uncertainty_score":0.841806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}