{"meta":{"query_hash":"0f9774884d15","filters":{"venue":"SIAM Journal on Optimization"},"cohort_total":43,"direct_labels_cover":0,"predictions_cover":43,"exported":43,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/0f9774884d15","api":"https://metacan.xera.ac/api/v1/cohort?venue=SIAM+Journal+on+Optimization"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03817071064495997,"score_gpt":0.38230960659738866,"score_spread":0.3441388959524287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534354577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037038586,0.000069006834,0.9931399,0.0034635954,0.00035494482,0.0010910464,0.000095329415,0.00018201524,0.0015670948],"genre_scores_gemma":[0.00023026268,0.00032785904,0.99583614,0.00074221974,0.00094316836,0.00005291733,0.00016754895,0.00011689612,0.0015829636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682415,0.00027443137,0.000994049,0.00043317763,0.0008829021,0.0005912732],"domain_scores_gemma":[0.99646676,0.00062623445,0.0006280412,0.00034209192,0.0015584785,0.00037841537],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001458012,0.00036741764,0.00045345555,0.00042720494,0.00047354563,0.00030256828,0.0003983861,0.00024862643,0.0012210298],"category_scores_gemma":[0.0019497155,0.00034504468,0.00025340763,0.0006278929,0.000075309435,0.0006626554,0.000049941624,0.00044950642,0.000029887075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026505964,0.00030526117,0.0000041878484,0.00003388568,0.000090263085,0.0000062491004,0.00015844929,0.98158944,0.000029956402,0.004790443,0.0019853984,0.010741391],"study_design_scores_gemma":[0.003238788,0.00036883092,0.0000011265433,0.00008042084,0.000065444925,0.00012177711,0.00011110031,0.9860988,0.00042308832,0.0011523853,0.007982412,0.00035578554],"about_ca_topic_score_codex":0.0000012202017,"about_ca_topic_score_gemma":0.0000034250265,"teacher_disagreement_score":0.010385606,"about_ca_system_score_codex":0.00042525088,"about_ca_system_score_gemma":0.00030521894,"threshold_uncertainty_score":0.99990016},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09482905424110503,"score_gpt":0.326649580935868,"score_spread":0.23182052669476294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969129923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010113987,0.000054450098,0.9961119,0.00060923485,0.000057179648,0.0007668628,0.000004647491,0.00016445204,0.0021301322],"genre_scores_gemma":[0.0049695363,0.00010060383,0.9932923,0.00016668385,0.00023426741,0.0001473151,0.0000144557225,0.000100293924,0.00097459246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802065,0.0000880849,0.00048225277,0.0003143803,0.00064074184,0.0004539077],"domain_scores_gemma":[0.9983833,0.000196216,0.0002908955,0.00030911498,0.0005203909,0.00030008054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000370152,0.00023384273,0.00023965034,0.0004150564,0.0005055925,0.00029688503,0.00025393814,0.0000849497,0.00079029414],"category_scores_gemma":[0.0002835185,0.00020570637,0.00006226778,0.00096176955,0.000036401198,0.0005086901,0.000043877084,0.0004700983,0.00006349534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027203223,0.00016565151,0.000026582344,0.000026191592,0.000026824313,0.000024818402,0.0003387669,0.9747135,0.00003561764,0.00070937315,0.00022688069,0.023678595],"study_design_scores_gemma":[0.0008079245,0.00035754347,0.0000071826303,0.00020228607,0.000024659186,0.00047542798,0.00018405043,0.98802835,0.00031612298,0.0011675918,0.0080286255,0.0004002626],"about_ca_topic_score_codex":5.1388264e-7,"about_ca_topic_score_gemma":0.0000010774855,"teacher_disagreement_score":0.023278331,"about_ca_system_score_codex":0.00021823094,"about_ca_system_score_gemma":0.000026056636,"threshold_uncertainty_score":0.8653167},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0346690006164164,"score_gpt":0.2906724988904961,"score_spread":0.2560034982740797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971969277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06104711,0.000005564235,0.9141226,0.0026210004,0.00016241487,0.0011165048,0.0000025579573,0.00005813788,0.020864125],"genre_scores_gemma":[0.87506497,0.000048759517,0.12183354,0.00083798106,0.00021725736,0.00012529363,0.00004494128,0.000047031244,0.0017802203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.00017114602,0.0005067375,0.00009240554,0.00040442205,0.00012172467],"domain_scores_gemma":[0.9984698,0.0005249909,0.0004282352,0.00017267244,0.00034526884,0.00005898125],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000572743,0.00012374125,0.00018856548,0.00008938826,0.00014258901,0.00009544082,0.00012136072,0.00007281182,0.003930435],"category_scores_gemma":[0.0010704133,0.00006800912,0.00010729736,0.00015565645,0.000044095475,0.00021555676,0.000008348424,0.00024376476,0.00012261767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009953133,0.0006050287,0.000004350141,0.00006769893,0.000045757966,8.3015993e-7,0.0005758148,0.029018631,0.00014905793,0.9588095,0.007935545,0.0026882421],"study_design_scores_gemma":[0.0010807433,0.00040575486,0.0000074657596,0.00025453873,0.000019355335,0.000016115333,0.00015650467,0.58143526,0.0021162173,0.41424724,0.00015464002,0.00010613966],"about_ca_topic_score_codex":9.91361e-7,"about_ca_topic_score_gemma":2.3360279e-7,"teacher_disagreement_score":0.8140179,"about_ca_system_score_codex":0.000038815437,"about_ca_system_score_gemma":0.000020233349,"threshold_uncertainty_score":0.99698013},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conic section; Dual (grammatical number); Algorithm; Mathematical optimization; Geometry","score_opus":0.009995191754433275,"score_gpt":0.22356960838471207,"score_spread":0.2135744166302788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972729079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031811255,0.0008536833,0.99767303,0.00006851398,0.0001432846,0.0002689482,0.000014012906,0.00028955578,0.00037086324],"genre_scores_gemma":[0.3304239,0.00093363505,0.66776705,0.000073416464,0.00031999525,0.000052638377,0.00003536389,0.00010345201,0.00029059313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886507,0.000028000128,0.0003813673,0.00016707597,0.00028403345,0.00027445544],"domain_scores_gemma":[0.9992963,0.00014757707,0.00015102801,0.0001450996,0.00014495698,0.000115036506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015821625,0.00020442945,0.00028028456,0.00022140925,0.00015931175,0.00012813047,0.00011238712,0.000083281404,0.00010296105],"category_scores_gemma":[0.00006541245,0.00015939579,0.00009047552,0.0003152669,0.000020558293,0.00034745346,0.000012324567,0.0002773648,0.0000075477874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021310065,0.000037332924,0.000009382905,0.000013261895,0.000051478208,0.000010284477,0.000043251053,0.96693724,0.00009385966,0.000035792073,0.00025030627,0.032496497],"study_design_scores_gemma":[0.0006233511,0.0004276408,0.0000036375466,0.00012875444,0.00004140412,0.000108061824,0.000020184181,0.997153,0.00038956065,0.000048316633,0.0008465598,0.00020953584],"about_ca_topic_score_codex":0.0000015607081,"about_ca_topic_score_gemma":4.5434123e-7,"teacher_disagreement_score":0.33010578,"about_ca_system_score_codex":0.00018768194,"about_ca_system_score_gemma":0.000007641876,"threshold_uncertainty_score":0.6499972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011268161642003643,"score_gpt":0.2191056682143998,"score_spread":0.20783750657239616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973823738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025700874,0.00008321491,0.9896805,0.0043821787,0.0003750639,0.00008221142,6.1714434e-7,0.00006338313,0.00507581],"genre_scores_gemma":[0.64203596,0.0029757875,0.33510104,0.00463794,0.00092846283,0.000025141308,0.000020949637,0.000046216366,0.014228527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998568,0.00026465897,0.00030475826,0.00018196242,0.0004838953,0.00019671564],"domain_scores_gemma":[0.9988509,0.00020937277,0.00023259348,0.00027898356,0.00032471056,0.00010345366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00071301,0.00011688012,0.000103553015,0.00014418237,0.0014094787,0.00033369774,0.00056112575,0.000046605775,0.00015226025],"category_scores_gemma":[0.0002108388,0.00007534911,0.00010826302,0.0005742218,0.000045736335,0.00063811353,0.000052536725,0.00022646165,0.00006462239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018307635,0.000042429598,0.00007013089,5.6782216e-7,0.000025965708,0.000010279187,0.0001590616,0.8541345,0.0000031177449,0.142393,0.000911219,0.0022314058],"study_design_scores_gemma":[0.0003558687,0.00008065048,0.00052503083,0.0000071188733,0.000007649112,0.00019636053,0.000012313026,0.99132305,0.00005041585,0.004005594,0.0033172488,0.00011866986],"about_ca_topic_score_codex":5.000627e-7,"about_ca_topic_score_gemma":2.6431468e-7,"teacher_disagreement_score":0.65457946,"about_ca_system_score_codex":0.0000699767,"about_ca_system_score_gemma":0.00014551509,"threshold_uncertainty_score":0.99989057},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015198572735487343,"score_gpt":0.23953245100648488,"score_spread":0.22433387827099754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986219860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007537108,0.00015501547,0.9857324,0.000020415364,0.0004978512,0.00011550861,2.2220475e-7,0.0006031387,0.0053383824],"genre_scores_gemma":[0.57198673,0.00011626505,0.42742366,0.00007948034,0.00030342568,0.0000015039686,0.000006753017,0.00005699031,0.000025204701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989832,0.000022054115,0.00037557815,0.000112340065,0.00020791644,0.00029890766],"domain_scores_gemma":[0.9994925,0.000049067585,0.00011408059,0.00013337404,0.00012099977,0.00008995809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045164904,0.00015784382,0.00014655336,0.00021263148,0.00015812425,0.00012877876,0.000106693406,0.00009127104,0.00002257175],"category_scores_gemma":[0.000049593084,0.00015571812,0.000052185744,0.00028278385,0.000014232252,0.00020171516,0.000019845733,0.00034811685,0.000008584013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018721745,0.000013289098,0.00004865573,0.000011554263,0.000019176687,0.000027719103,0.00013019015,0.9432331,0.0016668264,0.000038578208,0.00012235234,0.05466989],"study_design_scores_gemma":[0.00018102032,0.00009566195,0.000033163265,0.00022545499,0.000012512274,0.00021541084,0.00005308174,0.99014837,0.007182414,0.00012088022,0.0015329757,0.00019907446],"about_ca_topic_score_codex":0.00000127603,"about_ca_topic_score_gemma":0.0000013891471,"teacher_disagreement_score":0.5644496,"about_ca_system_score_codex":0.00010153224,"about_ca_system_score_gemma":0.000008465349,"threshold_uncertainty_score":0.6350001},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04063804245902447,"score_gpt":0.27524008602790423,"score_spread":0.23460204356887976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001096515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004095199,0.00006515122,0.9933334,0.00021713327,0.00073463435,0.0005022137,0.000014926326,0.0003007806,0.00073656667],"genre_scores_gemma":[0.32532328,0.000026714499,0.67332035,0.00006122113,0.00036179216,0.000031735126,0.00049523974,0.00012609051,0.00025354806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.00006400799,0.0004288389,0.00019918258,0.0003129535,0.00028964167],"domain_scores_gemma":[0.9986882,0.00013299905,0.0002462885,0.00017028832,0.00058651436,0.00017571567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178702,0.00021357571,0.0001944682,0.00020825182,0.00028030633,0.00047907527,0.0001031829,0.00013803285,0.000024896415],"category_scores_gemma":[0.00048595812,0.00022226956,0.00008069944,0.00038151172,0.000040349423,0.0007104121,0.00000630953,0.00025989063,0.000016332544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004327897,0.000028558194,0.0000759923,0.00003452487,0.000024852243,0.0000018059437,0.00034846796,0.99553925,0.00026805064,0.000047916034,0.00093673216,0.002650565],"study_design_scores_gemma":[0.0009685795,0.00013694292,0.00011894247,0.00014876752,0.000034036726,0.000019535977,0.00014303833,0.9945212,0.0019485073,0.0001022732,0.0016243663,0.00023378158],"about_ca_topic_score_codex":0.0000012739541,"about_ca_topic_score_gemma":7.7640533e-7,"teacher_disagreement_score":0.3212281,"about_ca_system_score_codex":0.00047588922,"about_ca_system_score_gemma":0.000128104,"threshold_uncertainty_score":0.90638894},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03093109542292634,"score_gpt":0.22838908214857484,"score_spread":0.19745798672564852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004793002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37916416,0.00021088812,0.61833596,0.00018109019,0.00030512476,0.00018120685,0.00018133393,0.000006317906,0.001433912],"genre_scores_gemma":[0.9853658,0.00034354412,0.014133129,0.000017452452,0.00004508249,0.0000068548106,0.000046167734,0.0000100146835,0.000031966527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988298,0.000047620102,0.0007807895,0.00016273113,0.00004102612,0.00013804263],"domain_scores_gemma":[0.9984952,0.000076302495,0.0010282763,0.00025397324,0.000097994314,0.000048244532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064155,0.00009962699,0.0002646283,0.00007669563,0.00012224725,0.0000405595,0.0001533596,0.0000730788,0.0004032841],"category_scores_gemma":[0.00024186596,0.00008566426,0.00011572132,0.00013103904,0.000065253895,0.00030144388,0.000019389923,0.00013875672,0.000009964708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000299321,0.00012648692,0.0053519276,0.0000069428497,0.00004015728,1.4021785e-7,0.000107460015,0.35379043,0.00003312401,0.640415,0.000010864018,0.00008749877],"study_design_scores_gemma":[0.0013645578,0.00030584045,0.014778654,0.00004675366,0.000031696778,0.0000102440945,0.00006878855,0.098157,0.0018429891,0.87465626,0.00846561,0.0002716029],"about_ca_topic_score_codex":0.000018365368,"about_ca_topic_score_gemma":0.000002371786,"teacher_disagreement_score":0.60620165,"about_ca_system_score_codex":0.0001241595,"about_ca_system_score_gemma":0.000037345715,"threshold_uncertainty_score":0.44156778},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06237039632763324,"score_gpt":0.39680670029346676,"score_spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006905759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090100206,0.000032527063,0.99552315,0.0005175121,0.0003368575,0.0014988992,0.000013151207,0.00013577256,0.0018520541],"genre_scores_gemma":[0.0037913641,0.000041968025,0.99392253,0.00019547153,0.00016843439,0.00015541232,0.00007259583,0.00011337429,0.0015388363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996449,0.00069826166,0.0010250598,0.00043397877,0.0007558551,0.0006378402],"domain_scores_gemma":[0.99646515,0.0011686021,0.0006197946,0.00031418976,0.0011157853,0.00031650273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014077104,0.0003585924,0.0005197202,0.00039756106,0.0006028433,0.00042889366,0.00023022307,0.00022184163,0.00091273716],"category_scores_gemma":[0.0052217767,0.00032728745,0.00020693816,0.0005739118,0.000101749276,0.00049020356,0.000023077233,0.0004290356,0.000009784073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020557204,0.00053959794,0.00001323107,0.00015420925,0.00015688023,0.000012064932,0.00035262233,0.805012,0.00024869063,0.18787883,0.00083379814,0.004592501],"study_design_scores_gemma":[0.0032254509,0.0005456461,0.0000010048511,0.00012318752,0.00011107169,0.00015840412,0.00037060303,0.94543755,0.0018245623,0.04564778,0.002148906,0.00040584712],"about_ca_topic_score_codex":5.427288e-7,"about_ca_topic_score_gemma":0.0000015199071,"teacher_disagreement_score":0.14223105,"about_ca_system_score_codex":0.00025337667,"about_ca_system_score_gemma":0.00038105273,"threshold_uncertainty_score":0.9999179},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07053505632736073,"score_gpt":0.37942709032516825,"score_spread":0.3088920339978075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014632088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011822847,0.00007681404,0.9911462,0.0017583331,0.00050532114,0.0012744416,0.000023376178,0.0002640402,0.0037691975],"genre_scores_gemma":[0.004993619,0.0022250572,0.9832737,0.0002769424,0.0009815402,0.00014820458,0.00023556536,0.00023484736,0.00763054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616235,0.0003712041,0.000987593,0.0005531907,0.0011612404,0.00076439953],"domain_scores_gemma":[0.99621254,0.0008346906,0.00053278694,0.0004168359,0.0016398578,0.0003633078],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015421499,0.00040743276,0.00047166387,0.0008352011,0.00087085855,0.0003884221,0.00028323644,0.00029330197,0.000991335],"category_scores_gemma":[0.0020475613,0.0003885828,0.00023017886,0.0012387978,0.000094097006,0.001001221,0.000067882596,0.0006679682,0.000029861018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006759123,0.00034887195,0.00007845336,0.000048932376,0.00006691424,0.000020066946,0.00018995139,0.98979944,0.00008155754,0.0024755388,0.002081186,0.0041331733],"study_design_scores_gemma":[0.0030720811,0.00058986706,0.000020629996,0.00015659428,0.0000554486,0.00034867408,0.00017480271,0.9892978,0.0005640031,0.0027865027,0.0025065918,0.0004269803],"about_ca_topic_score_codex":0.0000025511538,"about_ca_topic_score_gemma":0.0000022078368,"teacher_disagreement_score":0.007872508,"about_ca_system_score_codex":0.0006394419,"about_ca_system_score_gemma":0.00022523945,"threshold_uncertainty_score":0.9999219},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02689754769041781,"score_gpt":0.21637426638135435,"score_spread":0.18947671869093655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059707428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025588047,0.00019977998,0.9793468,0.0006800603,0.00039920342,0.00035618106,3.9751413e-7,0.00018042333,0.01858124],"genre_scores_gemma":[0.32760537,0.0013259876,0.6691473,0.0004166732,0.0010254047,0.000027096645,0.0000340889,0.0001264237,0.00029160516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861103,0.0001598531,0.0005379122,0.00013057745,0.0002443804,0.0003162343],"domain_scores_gemma":[0.99941206,0.000117200936,0.0001720193,0.00014155725,0.000090924295,0.00006624076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085527054,0.00017799396,0.00015612096,0.0001642603,0.00023687867,0.00026618998,0.00014574936,0.000117379364,0.000108774955],"category_scores_gemma":[0.000057638274,0.0001421485,0.00004833905,0.00072357815,0.00002084375,0.00033702678,0.0000120199,0.00042606075,0.000014526643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002204613,0.000022812132,0.00017740582,0.000010928868,0.000013021377,0.0000055738833,0.00034613663,0.9860526,0.000027662163,0.00042867413,0.00042776595,0.012465409],"study_design_scores_gemma":[0.00045092904,0.0000774353,0.00006138006,0.00018945927,0.0000082871065,0.00007112037,0.000034427718,0.9962603,0.000026016629,0.0010059585,0.0016458341,0.00016885091],"about_ca_topic_score_codex":8.1412975e-7,"about_ca_topic_score_gemma":0.000002824114,"teacher_disagreement_score":0.3273495,"about_ca_system_score_codex":0.0001652593,"about_ca_system_score_gemma":0.000024743124,"threshold_uncertainty_score":0.57966477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04645706831941011,"score_gpt":0.31809869475742075,"score_spread":0.27164162643801065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067796483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001231616,0.000039582552,0.9853478,0.0016941162,0.0006996354,0.00018249071,0.000013829904,0.000050931234,0.010740004],"genre_scores_gemma":[0.8299525,0.0003704112,0.16178526,0.0010225183,0.0015098517,0.00001849696,0.0002057627,0.00006732047,0.00506789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961897,0.000389691,0.00096836226,0.00038999013,0.0017314091,0.00033084198],"domain_scores_gemma":[0.99695617,0.00053483195,0.00076815276,0.0003750653,0.0010941175,0.00027168097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031291908,0.00021358131,0.00028703353,0.00043054088,0.0005480477,0.0007539784,0.00053392973,0.00013412503,0.0010666932],"category_scores_gemma":[0.0024923102,0.00015818165,0.000153856,0.0009412663,0.00006726675,0.00072238344,0.000045334287,0.00033512356,0.00038469044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061544306,0.00007119734,0.00025832895,7.6118533e-7,0.000010254324,0.0000022703366,0.000054694396,0.97058874,0.0000043939503,0.0074441163,0.009427862,0.012075857],"study_design_scores_gemma":[0.0007096659,0.0002795774,0.0007405311,0.000036331465,0.000019508534,0.00010725488,0.000046347224,0.97076255,0.000016382925,0.013974769,0.013071123,0.00023593879],"about_ca_topic_score_codex":0.0000015345804,"about_ca_topic_score_gemma":0.0000014349154,"teacher_disagreement_score":0.82872087,"about_ca_system_score_codex":0.00011213348,"about_ca_system_score_gemma":0.00013668218,"threshold_uncertainty_score":0.99984646},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08091285722626668,"score_gpt":0.31642708135062,"score_spread":0.2355142241243533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068022782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25059685,0.027701763,0.67313105,0.012811603,0.0024949603,0.001483962,0.00030021777,0.000120249206,0.03135938],"genre_scores_gemma":[0.9759504,0.008195118,0.013843492,0.00019367992,0.0010366263,0.000009495707,0.00003432318,0.00006595717,0.000670909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982085,0.00036963754,0.0006283305,0.00020601976,0.00040501473,0.00018248336],"domain_scores_gemma":[0.9960453,0.0019777727,0.0011007249,0.00040462005,0.0004134251,0.000058164023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016906889,0.00026556847,0.00040974148,0.00012533212,0.00027601252,0.00032236145,0.00045965597,0.0001779568,0.000086368855],"category_scores_gemma":[0.0016190729,0.00012246735,0.0001264937,0.00023107899,0.0001371354,0.00019615756,0.00023926576,0.00094487244,0.0000016701852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005702659,0.0005281234,0.0006504344,0.0006040544,0.0019325446,0.000012467141,0.078936055,0.7434208,0.00007528091,0.15937558,0.00788855,0.006005838],"study_design_scores_gemma":[0.0004479321,0.00016375858,0.00018193941,0.00090216583,0.00021587747,0.000029855491,0.0060130334,0.061637256,0.0005287551,0.92884594,0.0007664156,0.00026708771],"about_ca_topic_score_codex":0.000033354947,"about_ca_topic_score_gemma":0.0000049359987,"teacher_disagreement_score":0.76947033,"about_ca_system_score_codex":0.000054518056,"about_ca_system_score_gemma":0.00016671071,"threshold_uncertainty_score":0.49940738},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010602547457741501,"score_gpt":0.2515268811390499,"score_spread":0.24092433368130842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069314331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005932708,0.00010063696,0.9930543,0.0008733779,0.000368785,0.00007863,6.468129e-7,0.00003162365,0.0048987633],"genre_scores_gemma":[0.103352785,0.00021319641,0.8942329,0.000979771,0.00020217856,0.000005512084,0.000013380177,0.000016787884,0.0009834641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869496,0.00028090156,0.0002535418,0.00018728506,0.0003819719,0.00020135238],"domain_scores_gemma":[0.99899244,0.00029424787,0.00022458997,0.00018672565,0.00021367376,0.000088343775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093398057,0.00011446899,0.00009581023,0.00014844158,0.0005981113,0.00048919354,0.00023813584,0.000033221902,0.000019097044],"category_scores_gemma":[0.00013246444,0.0000728079,0.000043960536,0.0005784424,0.000013515256,0.00040239329,0.00001894685,0.00020539902,0.000013097016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001686287,0.000027303196,0.000105008905,0.000001558177,0.000021861575,0.000010437925,0.00008719731,0.9709951,0.000012703259,0.021307489,0.0005225397,0.006891897],"study_design_scores_gemma":[0.00060681335,0.00025314547,0.00011406543,0.000040564162,0.000011550054,0.00077044725,0.000035009285,0.9829317,0.00047027823,0.0015312529,0.0130857,0.0001494923],"about_ca_topic_score_codex":3.6007205e-7,"about_ca_topic_score_gemma":0.0000010193686,"teacher_disagreement_score":0.10275952,"about_ca_system_score_codex":0.000058063815,"about_ca_system_score_gemma":0.000106073894,"threshold_uncertainty_score":0.47173044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11606457632831246,"score_gpt":0.34081999397819235,"score_spread":0.22475541764987989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071468246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008534913,0.000059036476,0.98615235,0.0010565331,0.0004592144,0.0008346168,0.000032188414,0.00009073305,0.0027804065],"genre_scores_gemma":[0.13236713,0.0020545106,0.8592669,0.0006335674,0.0007167732,0.00012458963,0.0004688295,0.00011180405,0.004255928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600446,0.00021731427,0.0012074966,0.00057801785,0.0015299433,0.00046274424],"domain_scores_gemma":[0.9957398,0.0003277769,0.0010918239,0.00052151264,0.0020302138,0.00028885913],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014644127,0.00033551647,0.00041672616,0.0007824421,0.0014466569,0.00044655957,0.00047732398,0.00019689281,0.0003165092],"category_scores_gemma":[0.0007059148,0.00023015079,0.00018850734,0.0014667739,0.000080101774,0.0014814379,0.000032867065,0.00028329066,0.000024942954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025993798,0.00011598067,0.0012741886,0.0000024639571,0.000029003333,0.0000076254973,0.00039523916,0.9916198,0.0000051447864,0.0007015368,0.0032720983,0.0023169324],"study_design_scores_gemma":[0.001684082,0.000605323,0.0003322987,0.000040058127,0.00003152746,0.00031291833,0.00014459639,0.9923385,0.000031189928,0.0006478141,0.0035013095,0.00033037955],"about_ca_topic_score_codex":0.000010623821,"about_ca_topic_score_gemma":0.000009622572,"teacher_disagreement_score":0.12688549,"about_ca_system_score_codex":0.00021894631,"about_ca_system_score_gemma":0.00031139457,"threshold_uncertainty_score":0.9998533},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","score_opus":0.024560821207066683,"score_gpt":0.251635378998436,"score_spread":0.22707455779136934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073044751","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.0617898e-7,0.00043168807,0.8913356,0.0033831054,0.007744553,0.00014006752,0.00010059495,0.00008897868,0.09677508],"genre_scores_gemma":[0.0011803709,0.009602811,0.47148192,0.0025492997,0.00636116,0.000056111872,0.0048564486,0.0001818862,0.50373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958643,0.00048729914,0.0013039156,0.0005048802,0.0014275443,0.00041209435],"domain_scores_gemma":[0.9964255,0.00019632376,0.0014325987,0.0005702755,0.0011661397,0.00020914117],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009810932,0.00042468772,0.00062181125,0.0012552661,0.0005749611,0.000530473,0.0011573795,0.0005165956,0.0025475442],"category_scores_gemma":[0.0003012588,0.00040353014,0.00042654836,0.001364224,0.000061457635,0.001090083,0.0001311448,0.0010353754,0.000074952295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011952894,0.0001296217,0.0000024475023,0.00001715342,0.00013305568,0.0000023946254,0.000125735,0.573627,6.1265195e-7,0.09200415,0.33354944,0.0003964244],"study_design_scores_gemma":[0.00045136033,0.00014911144,0.000081599945,0.00022006215,0.000100754085,0.000048498936,0.000023676948,0.92794794,0.0000016118425,0.006447991,0.06410864,0.00041878107],"about_ca_topic_score_codex":0.000015799309,"about_ca_topic_score_gemma":0.0000044679064,"teacher_disagreement_score":0.41985372,"about_ca_system_score_codex":0.00025561708,"about_ca_system_score_gemma":0.0012423685,"threshold_uncertainty_score":0.99984163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hessian matrix; Mathematics; Combinatorics; Function (biology); Approximations of π; Mathematical analysis; Applied mathematics","score_opus":0.029057031083962268,"score_gpt":0.3622389667632777,"score_spread":0.3331819356793154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089331999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060086525,0.00011354379,0.98807704,0.0014567486,0.0002370638,0.00059352396,0.000064515654,0.00019081586,0.0032580665],"genre_scores_gemma":[0.27883214,0.00058486563,0.7188894,0.00033321092,0.00031947473,0.00007876391,0.0002782223,0.00018435334,0.00049956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944841,0.0007919204,0.0018241267,0.0007286139,0.0014203485,0.00075085316],"domain_scores_gemma":[0.99495506,0.0011821418,0.0013010646,0.000808412,0.0010982631,0.0006550628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016626841,0.00057479256,0.0012441127,0.002010171,0.00073163403,0.00032040544,0.0005441701,0.0003510582,0.00057925325],"category_scores_gemma":[0.0019000632,0.00052381743,0.00046366203,0.00310534,0.00029675,0.00078791706,0.00012867937,0.00086309056,0.000024895407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014185118,0.00082185457,0.00065737485,0.0001467391,0.00078679575,0.000012235256,0.0007412837,0.9105509,0.00010267973,0.0801693,0.00048989675,0.005379099],"study_design_scores_gemma":[0.001407302,0.00040590635,0.00086463144,0.00018137867,0.0006333967,0.00012104144,0.00018103853,0.9781839,0.00026430388,0.01667535,0.0005488375,0.000532863],"about_ca_topic_score_codex":0.000006324701,"about_ca_topic_score_gemma":0.0000042416173,"teacher_disagreement_score":0.2728235,"about_ca_system_score_codex":0.00027773972,"about_ca_system_score_gemma":0.000118562,"threshold_uncertainty_score":0.99972135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008174040744057377,"score_gpt":0.2733736201165596,"score_spread":0.2651995793725022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091859835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021815149,0.000026884105,0.99429786,0.00069847645,0.00043414027,0.00006709505,0.0000010428411,0.000034216013,0.0022587974],"genre_scores_gemma":[0.41067648,0.00006125954,0.5885304,0.00041729573,0.00016476781,9.628225e-7,0.000012579549,0.000008589976,0.00012765556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987545,0.00006791914,0.00046465136,0.00016219073,0.00039859177,0.00015212473],"domain_scores_gemma":[0.998872,0.000069325084,0.00032202966,0.00017762884,0.00044051945,0.0001184934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712196,0.0001027135,0.00014539505,0.00042238575,0.00018034964,0.0001340511,0.0003008358,0.000061966704,0.00013343715],"category_scores_gemma":[0.00005530229,0.00009162569,0.0000914526,0.0007495683,0.000016704917,0.00065914716,0.000032487394,0.00012610713,0.000013484572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019938878,0.000099247365,0.0001466518,0.0000021034023,0.000028262528,0.0000042206175,0.00010515353,0.9589229,0.00014643637,0.038720403,0.00012753226,0.0016771202],"study_design_scores_gemma":[0.00042657313,0.00013804797,0.0007545285,0.000020990281,0.000013965673,0.00003292054,0.000015917316,0.9957033,0.001892611,0.00066136743,0.0002273002,0.000112527705],"about_ca_topic_score_codex":0.0000024408243,"about_ca_topic_score_gemma":8.748035e-7,"teacher_disagreement_score":0.40849498,"about_ca_system_score_codex":0.000082870494,"about_ca_system_score_gemma":0.000062022795,"threshold_uncertainty_score":0.37363872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012313040778714288,"score_gpt":0.2311079300959838,"score_spread":0.2187948893172695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092554297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017239181,0.000091316404,0.97470146,0.00002243684,0.00025584412,0.00009953331,3.415959e-7,0.00021338095,0.0073765046],"genre_scores_gemma":[0.95474035,0.00015774451,0.044868197,0.000026166752,0.0001173725,7.047186e-7,0.000011558148,0.000024869176,0.00005301491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993866,0.000016061651,0.0002478927,0.00005844207,0.00016649504,0.00012449973],"domain_scores_gemma":[0.9996029,0.000017253871,0.000096279684,0.0001017343,0.00013489007,0.000046953424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021797726,0.00008249065,0.00010711607,0.00014887427,0.00004037283,0.000029999523,0.00006563265,0.0000710387,0.000028595705],"category_scores_gemma":[0.000019681034,0.00007753208,0.000040467217,0.00018155185,0.00001838435,0.00011862212,0.000005409198,0.00012955492,0.000001934084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023082821,0.00003253029,0.00014938822,0.000007696621,0.000021127478,0.000008444511,0.00007060546,0.974991,0.0031805423,0.0007542276,0.00034240715,0.020418916],"study_design_scores_gemma":[0.0005184269,0.00035433235,0.0006726972,0.00033996062,0.00002877171,0.00010997019,0.000066029184,0.81528455,0.17919306,0.0012025854,0.001969301,0.00026030384],"about_ca_topic_score_codex":5.298547e-7,"about_ca_topic_score_gemma":2.9119676e-7,"teacher_disagreement_score":0.9375012,"about_ca_system_score_codex":0.000041409927,"about_ca_system_score_gemma":0.000008470281,"threshold_uncertainty_score":0.31616664},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008219891805363337,"score_gpt":0.20426105875204364,"score_spread":0.1960411669466803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093590551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006437052,0.00013815198,0.9966916,0.00005504311,0.0006040695,0.0003545883,0.000020642556,0.00063120923,0.00086098386],"genre_scores_gemma":[0.33318016,0.0006621116,0.6617524,0.0002755651,0.002479002,0.00009526338,0.0006795688,0.00028478453,0.00059117546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986408,0.000048872338,0.00044934524,0.00020432132,0.00024448938,0.00041216766],"domain_scores_gemma":[0.99923354,0.000045941502,0.00014059081,0.00017095316,0.00032993243,0.000079030644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620547,0.00023880672,0.00023052686,0.0002036771,0.00037778748,0.0001688837,0.0001548265,0.0002298006,0.000055948283],"category_scores_gemma":[0.000016734723,0.00023197215,0.00007814368,0.00048201493,0.00004189254,0.00044032768,0.000011051433,0.00021506734,0.000009678574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029712275,0.000042101175,0.000062268606,0.000013708399,0.000019920728,0.00000457796,0.000021462605,0.97689205,0.000024865245,0.0026672818,0.0036370866,0.01658495],"study_design_scores_gemma":[0.00070725946,0.0002727442,0.000023120168,0.00006416572,0.000026003576,0.000028919872,0.0000868146,0.99224347,0.0026198528,0.0017045308,0.0019386646,0.00028445004],"about_ca_topic_score_codex":0.000006431399,"about_ca_topic_score_gemma":0.00000785526,"teacher_disagreement_score":0.33493924,"about_ca_system_score_codex":0.00019461579,"about_ca_system_score_gemma":0.000030981777,"threshold_uncertainty_score":0.945955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03820894580035558,"score_gpt":0.36075720784139065,"score_spread":0.32254826204103504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128286686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0235213,0.00025229107,0.97404987,0.00023560782,0.00021782522,0.0004928559,0.000017267843,0.000019952804,0.0011930407],"genre_scores_gemma":[0.27233127,0.00063261983,0.7255515,0.00007808129,0.0004507093,0.000059901402,0.000028385644,0.00004783112,0.00081972906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990301,0.00010205004,0.0004506441,0.000108406864,0.00017321356,0.00013559009],"domain_scores_gemma":[0.9986474,0.00052142335,0.00039309237,0.00009734524,0.0002644861,0.0000762491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610087,0.000118639655,0.00029405003,0.000075942306,0.000114207636,0.000047143618,0.000049476843,0.00007694912,0.000040445237],"category_scores_gemma":[0.00026510676,0.000095033785,0.00007107047,0.000057995978,0.00003098342,0.00012677198,0.000010038868,0.00009263307,1.17127314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009493953,0.00034159952,0.00020909424,0.0005898419,0.00022509445,0.0000044604653,0.0007950236,0.9318952,0.00072907354,0.054002497,0.0038179553,0.0064407466],"study_design_scores_gemma":[0.005869648,0.00029503243,0.0000037649427,0.0003759598,0.00013792957,0.00014102715,0.00020598044,0.984844,0.0032320854,0.0013534841,0.003364315,0.00017671786],"about_ca_topic_score_codex":8.483772e-7,"about_ca_topic_score_gemma":7.439146e-7,"teacher_disagreement_score":0.24880996,"about_ca_system_score_codex":0.00006566478,"about_ca_system_score_gemma":0.00003230736,"threshold_uncertainty_score":0.38753653},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028642549120394125,"score_gpt":0.3143879728623788,"score_spread":0.2857454237419847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166798101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049658,0.00006505015,0.99243003,0.00029153045,0.00008784881,0.001555155,0.000050831593,0.00010520659,0.00044855004],"genre_scores_gemma":[0.040710952,0.00015081928,0.9582954,0.00001908062,0.00016419345,0.000084188345,0.00017408737,0.00007462774,0.00032667513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981179,0.000110586545,0.0006494523,0.00028807076,0.00051341637,0.00032056004],"domain_scores_gemma":[0.9975785,0.00033202732,0.00080496003,0.00021637771,0.0009509992,0.00011712846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034947845,0.00024025919,0.00033321982,0.00038736154,0.00038964994,0.00015337783,0.00014362724,0.0001516016,0.00006354244],"category_scores_gemma":[0.00045024508,0.00020078551,0.000072820214,0.0005159615,0.00013600993,0.00047215092,0.000030436877,0.00026639883,4.124326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027413492,0.00019654402,0.0003426814,0.000093073955,0.000040959614,0.0000015887982,0.00011235346,0.99426425,0.000056371504,0.002772247,0.00050001644,0.0013457716],"study_design_scores_gemma":[0.0029342994,0.0010630881,0.00018594114,0.00017561232,0.000079298086,0.00007252345,0.00009641839,0.9884124,0.00066459854,0.0057460205,0.00028199854,0.0002878333],"about_ca_topic_score_codex":0.000007377095,"about_ca_topic_score_gemma":0.000016154334,"teacher_disagreement_score":0.03574515,"about_ca_system_score_codex":0.00012510034,"about_ca_system_score_gemma":0.00013035536,"threshold_uncertainty_score":0.8187795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; 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","score_opus":0.013184622947765672,"score_gpt":0.264885286470722,"score_spread":0.25170066352295634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592535213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000699514,0.000045124565,0.97958106,0.018211687,0.0012317229,0.00015472827,0.0000057230736,0.00007306489,0.0006269203],"genre_scores_gemma":[0.06159885,0.00077931565,0.92643476,0.001872786,0.0016678441,0.000049194045,0.000017179087,0.0000458983,0.0075341896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998463,0.00013124672,0.00043396326,0.00027282862,0.0004149039,0.00028406645],"domain_scores_gemma":[0.9979326,0.00061334134,0.0004592057,0.00028359052,0.00059393636,0.00011732753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089341396,0.00016834211,0.000164015,0.00020496831,0.00086148566,0.0007324054,0.00066874723,0.000054703964,0.000078878475],"category_scores_gemma":[0.00030166475,0.00009120685,0.00017045859,0.0004741368,0.000037506863,0.00094889343,0.00007464571,0.00012965845,0.000020047935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006112196,0.00007617923,0.000045272143,0.0000021098438,0.000114374205,0.000002370149,0.00019961865,0.7031754,0.00006337049,0.038414527,0.0024031384,0.2554425],"study_design_scores_gemma":[0.001202559,0.00017592635,0.000044654917,0.000031675623,0.000020837602,0.000028565044,0.000041123265,0.9874426,0.00030018127,0.0012450716,0.009307173,0.00015962348],"about_ca_topic_score_codex":0.0000036293015,"about_ca_topic_score_gemma":0.0000071332174,"teacher_disagreement_score":0.2842672,"about_ca_system_score_codex":0.00012345944,"about_ca_system_score_gemma":0.00009686388,"threshold_uncertainty_score":0.70626026},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050675731834091915,"score_gpt":0.26990745417082995,"score_spread":0.21923172233673804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898428916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012007125,0.000067314715,0.9862903,0.000057590034,0.00048159738,0.0002301891,0.000043880773,0.000135754,0.00068626745],"genre_scores_gemma":[0.76668906,0.00013597166,0.2327989,0.000033241864,0.00020939685,0.0000057686384,0.00007331293,0.00003796998,0.000016383081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913937,0.000029610916,0.00038289756,0.00011322215,0.00018525889,0.00014966936],"domain_scores_gemma":[0.99889535,0.00006932451,0.00030659413,0.00017295407,0.00049645785,0.000059333466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011871686,0.00014345387,0.00023462539,0.00026576524,0.00017066284,0.000028731343,0.000114323164,0.00009433278,0.000061257975],"category_scores_gemma":[0.00002559838,0.00014577339,0.00010421201,0.00018916384,0.000045803645,0.00018475753,0.000015193768,0.00012957069,0.0000018988183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199536,0.000072849354,0.00013382091,0.000024056431,0.000060880677,5.7718074e-7,0.0000627114,0.9950028,0.003642957,0.000109145934,0.0006141916,0.00021403271],"study_design_scores_gemma":[0.00050726987,0.00024919753,0.00028892193,0.0003946881,0.000069319976,0.0000152422035,0.00005791279,0.9776284,0.020253843,0.00008550464,0.00031428778,0.00013539108],"about_ca_topic_score_codex":0.0000027990277,"about_ca_topic_score_gemma":0.0000011944362,"teacher_disagreement_score":0.75468194,"about_ca_system_score_codex":0.000057377638,"about_ca_system_score_gemma":0.000015725527,"threshold_uncertainty_score":0.5944466},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020903183592654785,"score_gpt":0.24351017904979919,"score_spread":0.2226069954571444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912745458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016905764,0.00066771056,0.977912,0.00017349278,0.0024238406,0.00037127867,0.000016930666,0.00038811273,0.0011408619],"genre_scores_gemma":[0.692149,0.0023894839,0.3033514,0.00012016473,0.0012369595,0.0000662666,0.00041049952,0.00014906068,0.00012720579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989542,0.00004687488,0.0003401634,0.00022301533,0.00019975143,0.00023600346],"domain_scores_gemma":[0.9991845,0.000044623197,0.00018397089,0.0002284832,0.00026266923,0.00009575567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001535194,0.00025269436,0.00027154633,0.00020065735,0.0001505658,0.00037260453,0.00011689629,0.00022317348,0.00006988662],"category_scores_gemma":[0.000053766602,0.0002705171,0.0001892719,0.00007567165,0.000014177993,0.00011573602,0.00006134237,0.0006377304,0.000001782361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012854961,0.000030695817,0.0000061099763,0.000047555823,0.0000935091,0.000016635233,0.00014629377,0.99323034,0.00015906761,0.00014204248,0.0048170704,0.0012977938],"study_design_scores_gemma":[0.00032843775,0.00010283312,0.000067872286,0.0014114802,0.000081181344,0.00013871401,0.000072576964,0.9808723,0.014546281,0.00088231824,0.0011024093,0.000393625],"about_ca_topic_score_codex":0.0000013437624,"about_ca_topic_score_gemma":0.0000014556526,"teacher_disagreement_score":0.6752432,"about_ca_system_score_codex":0.000275879,"about_ca_system_score_gemma":0.00006255465,"threshold_uncertainty_score":0.9999747},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"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","score_opus":0.006123639609745902,"score_gpt":0.22927559750428694,"score_spread":0.22315195789454104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963803091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063347345,0.00049802125,0.9703787,0.02705865,0.0002516169,0.00015058901,0.000013588919,0.000016446127,0.0009989017],"genre_scores_gemma":[0.9205207,0.015809175,0.051666927,0.0021715667,0.00016125743,0.000027149707,0.0001131378,0.00005643658,0.009473608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868,0.00015370046,0.00035388794,0.00020399815,0.0004569475,0.00015145254],"domain_scores_gemma":[0.9981046,0.00008897091,0.00080489524,0.00055392814,0.00037129168,0.000076354416],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00054575293,0.0001223274,0.00012579592,0.000050370432,0.0015827068,0.0006937506,0.000929357,0.000061736995,0.000019188054],"category_scores_gemma":[0.0002527603,0.000072409384,0.0000648562,0.00027016932,0.00012797874,0.0005109535,0.00009704738,0.00016577574,0.0000020009634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006128811,0.00027841554,0.0008186886,0.000009101497,0.00015494152,6.582888e-7,0.00039179364,0.8310421,0.0012081178,0.0391082,0.11529179,0.011634871],"study_design_scores_gemma":[0.0005603001,0.00006205747,0.00036089413,0.000022866861,0.000026571091,0.000007998578,0.000033281205,0.9822543,0.0006295678,0.00054435775,0.015376789,0.000120996985],"about_ca_topic_score_codex":0.00004184159,"about_ca_topic_score_gemma":0.000004838136,"teacher_disagreement_score":0.91988724,"about_ca_system_score_codex":0.000045015644,"about_ca_system_score_gemma":0.00007404421,"threshold_uncertainty_score":0.9997171},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Operator (biology); Computer science; Resource allocation; Convergence (economics); Dimension (graph theory); Computation; Mathematics; Algorithm","score_opus":0.021992650474302464,"score_gpt":0.2669085174709549,"score_spread":0.24491586699665244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966597656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006079112,0.000034868208,0.9693013,0.028615125,0.00015380868,0.00020159301,0.0000024579494,0.00021906201,0.0008639146],"genre_scores_gemma":[0.08809045,0.000012916527,0.90693986,0.004471767,0.000355556,0.000006958473,0.000017468707,0.00002941033,0.00007559022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790245,0.00036319133,0.00044703195,0.0004435215,0.0005011166,0.00034265962],"domain_scores_gemma":[0.9983788,0.00015647527,0.00026207522,0.00047436586,0.00025607357,0.00047218296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080676546,0.00020202949,0.00023225586,0.00015843197,0.00039722605,0.00075028173,0.0009945835,0.00008763422,0.000043583983],"category_scores_gemma":[0.0007996539,0.00019217316,0.00009895301,0.0009810188,0.0000116998235,0.00053698395,0.00031748888,0.00037739772,0.00003612702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044668912,0.000027935339,0.000011151144,0.000008070843,0.000015993897,0.000018536879,0.0011438407,0.9805327,0.00070992176,0.00078111986,0.006501581,0.010204493],"study_design_scores_gemma":[0.00044267596,0.00023154823,0.000041361414,0.000089422516,0.000011336013,0.00007693041,0.00009272438,0.98266566,0.002064129,0.00011422871,0.013948476,0.00022149272],"about_ca_topic_score_codex":0.0000027978185,"about_ca_topic_score_gemma":1.4888097e-7,"teacher_disagreement_score":0.087482534,"about_ca_system_score_codex":0.00012346846,"about_ca_system_score_gemma":0.00008616848,"threshold_uncertainty_score":0.7836594},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07053607418130879,"score_gpt":0.35574779963651165,"score_spread":0.28521172545520285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981781020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042244284,0.000051363695,0.98852783,0.0015111255,0.0002000919,0.0009932983,0.000011517419,0.00007156643,0.0044087777],"genre_scores_gemma":[0.051954355,0.0007709603,0.94536436,0.0004763826,0.00018846904,0.000037810503,0.000088191366,0.00012155887,0.0009979366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701667,0.00048242544,0.0007144207,0.00034087448,0.0009675487,0.00047807992],"domain_scores_gemma":[0.9976565,0.000853895,0.0005282712,0.00040510733,0.000431999,0.0001241891],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015246634,0.00028837522,0.00034439412,0.00048940664,0.0004087828,0.00027493585,0.000415887,0.00010618393,0.0014731335],"category_scores_gemma":[0.00047625913,0.00019987211,0.00007054893,0.0011574739,0.000066715,0.00070430734,0.000114174916,0.00080636144,0.00003346884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021280193,0.00014876862,0.0016968301,0.000025158759,0.000036620302,0.000015161131,0.0002958519,0.99371076,0.000006679132,0.0029004419,0.0002582469,0.0006927013],"study_design_scores_gemma":[0.002108012,0.0003242978,0.000116436204,0.00020001462,0.000021598626,0.00008895338,0.0005740313,0.993611,0.00010678834,0.0017517754,0.0008149921,0.00028211164],"about_ca_topic_score_codex":0.000013183456,"about_ca_topic_score_gemma":0.000020626368,"teacher_disagreement_score":0.047729928,"about_ca_system_score_codex":0.0004862335,"about_ca_system_score_gemma":0.00014871184,"threshold_uncertainty_score":0.99943966},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006177420138452229,"score_gpt":0.2001085071382088,"score_spread":0.19393108699975656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083147274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014036498,0.00044542202,0.99167156,0.00031216955,0.0011253724,0.0004389764,0.000008762979,0.00028186207,0.004312231],"genre_scores_gemma":[0.92892873,0.00081632583,0.068512104,0.00020671738,0.00045635144,0.00017608321,0.00015982428,0.00020530414,0.000538572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796873,0.00023576795,0.0006997445,0.00025474626,0.00044481055,0.00039622543],"domain_scores_gemma":[0.99921626,0.000072873,0.00024521752,0.00025186056,0.000100694044,0.000113124974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004569579,0.00025741322,0.00030528256,0.00064032566,0.00041123203,0.0001300449,0.0002512076,0.00008021518,0.00030428602],"category_scores_gemma":[0.00009966509,0.000290072,0.00009490928,0.0008868197,0.000021183307,0.00065150583,0.000047136964,0.0006508559,0.0000069917896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045193286,0.00005311744,0.000056881545,0.000011469053,0.000023597697,0.000028768343,0.0003007076,0.9971453,0.000056041517,0.0009051501,0.00036882685,0.0010049731],"study_design_scores_gemma":[0.0012997664,0.00011282801,0.000025703392,0.00006864348,0.000015234779,0.00013039053,0.00032676733,0.99600923,0.000019451852,0.00015093143,0.0015408148,0.0003002256],"about_ca_topic_score_codex":0.0000025165475,"about_ca_topic_score_gemma":0.0000041366143,"teacher_disagreement_score":0.92752504,"about_ca_system_score_codex":0.0008624382,"about_ca_system_score_gemma":0.00004867301,"threshold_uncertainty_score":0.9999551},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.027359444982844986,"score_gpt":0.25164085193651253,"score_spread":0.22428140695366755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088059505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005219783,0.000008792655,0.98412466,0.014065014,0.00047869884,0.0005519317,0.000014443415,0.000028520191,0.00020594255],"genre_scores_gemma":[0.32579362,0.000037070717,0.6573502,0.015774863,0.0006475955,0.00014907197,0.000022363467,0.000035583762,0.00018963883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986134,0.0001502105,0.00041663705,0.00022263658,0.00044231862,0.00015476391],"domain_scores_gemma":[0.998549,0.0002857814,0.00037581846,0.00022095763,0.00045288893,0.00011557933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043578897,0.0001377154,0.00017632329,0.00011581877,0.00042519715,0.00016298739,0.0004886907,0.000057133762,0.00010378623],"category_scores_gemma":[0.0003664068,0.00008259677,0.00021153173,0.00078153587,0.000031403044,0.00020822625,0.00006051902,0.00019810372,0.00000920295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053881322,0.00007980177,0.000039687144,0.000003362467,0.00004689675,7.250347e-7,0.0003590041,0.96947706,0.000049471193,0.020546814,0.00060649385,0.008736808],"study_design_scores_gemma":[0.0005154744,0.00045164453,0.00014485927,0.00002828638,0.00005633913,0.000008370933,0.000085872794,0.9970782,0.00042030992,0.0001491821,0.0009596859,0.000101802594],"about_ca_topic_score_codex":0.0000017558252,"about_ca_topic_score_gemma":7.257055e-7,"teacher_disagreement_score":0.32677448,"about_ca_system_score_codex":0.000051336207,"about_ca_system_score_gemma":0.00011041157,"threshold_uncertainty_score":0.33681986},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007751141731016588,"score_gpt":0.2169832816624985,"score_spread":0.2092321399314819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195078226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000878918,0.000060116567,0.9837889,0.011761066,0.0005443255,0.00009026497,0.0000018134331,0.000055212964,0.0036103963],"genre_scores_gemma":[0.68879974,0.00067063275,0.2860886,0.0083400225,0.0008005497,0.000104241786,0.000063645784,0.00005697394,0.015075588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984696,0.0002649445,0.0002727987,0.00017247249,0.0006421737,0.0001780171],"domain_scores_gemma":[0.9991703,0.000095967596,0.0002477637,0.00024218188,0.0001655263,0.00007827534],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007301557,0.00009159684,0.000082503786,0.00015293279,0.0023435699,0.00053546514,0.0007122645,0.000018369197,0.00040510166],"category_scores_gemma":[0.00006553643,0.00006665463,0.00009458613,0.00070502463,0.0000153466,0.00040527567,0.00015984928,0.00029424595,0.000017924385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023456,0.000049056536,0.000036932943,4.118941e-7,0.000019688032,0.000005525254,0.00011225724,0.91650414,0.000002810877,0.079533085,0.0017293791,0.0019946916],"study_design_scores_gemma":[0.00027672885,0.000119825105,0.000109378874,0.0000018544968,0.000005520718,0.00008434011,0.000030137731,0.9791336,0.000010010654,0.0013953976,0.01874245,0.00009074111],"about_ca_topic_score_codex":9.139204e-7,"about_ca_topic_score_gemma":3.6437754e-7,"teacher_disagreement_score":0.6977003,"about_ca_system_score_codex":0.00014286813,"about_ca_system_score_gemma":0.00011191165,"threshold_uncertainty_score":0.99895525},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04715189319642251,"score_gpt":0.3360420978468465,"score_spread":0.28889020465042403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203691100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041304445,0.00005383595,0.9931789,0.0008615846,0.00021753825,0.00061719347,0.000051014074,0.00012726718,0.000762189],"genre_scores_gemma":[0.106018245,0.001378937,0.890836,0.00004866634,0.00020186872,0.000057982765,0.0004347692,0.00012318585,0.00090033555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969477,0.00032824697,0.0011748482,0.0003001366,0.00094893714,0.00030014277],"domain_scores_gemma":[0.9958292,0.0009148798,0.0013420101,0.00026465274,0.0014968009,0.00015242741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012632777,0.00024080081,0.0004039756,0.0010720483,0.00027873286,0.00007909064,0.0001698164,0.00020002092,0.00040281643],"category_scores_gemma":[0.0039285477,0.00022682654,0.00010647968,0.0015055869,0.0001651415,0.0007735386,0.000075131364,0.00041191556,0.000008222443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100322504,0.00015952524,0.0003335192,0.000109272056,0.00006569241,0.0000037540608,0.00085513067,0.96939033,0.0000912892,0.027591297,0.00041786866,0.00088200194],"study_design_scores_gemma":[0.0014227107,0.00035942186,0.00050013897,0.00028682014,0.000044764656,0.00004880203,0.00042973642,0.9793111,0.0002969903,0.017041655,0.00005016857,0.00020766148],"about_ca_topic_score_codex":0.0000049963755,"about_ca_topic_score_gemma":0.0000027994813,"teacher_disagreement_score":0.102342926,"about_ca_system_score_codex":0.0001513391,"about_ca_system_score_gemma":0.00020145436,"threshold_uncertainty_score":0.92497176},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.012825745521170521,"score_gpt":0.24685454925083142,"score_spread":0.2340288037296609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209551251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016857603,0.00011286818,0.9912371,0.0012738577,0.0005083599,0.00003380491,0.0000021861194,0.00005673322,0.0050893463],"genre_scores_gemma":[0.16539462,0.0005901879,0.83197147,0.0015061714,0.00035824155,0.00000203689,0.000062828636,0.000012894779,0.000101551224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912393,0.00008822651,0.00020012009,0.0001714587,0.0002768489,0.00013938683],"domain_scores_gemma":[0.99922824,0.000040626826,0.00012295226,0.00028344893,0.00023514937,0.000089603855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002459633,0.00007727735,0.000079404505,0.00011460676,0.00022310624,0.0003348931,0.0002369375,0.000051477946,0.00008932147],"category_scores_gemma":[0.00007485326,0.00006962481,0.00006295247,0.00054707367,0.000009332689,0.0011225583,0.00005823511,0.00018787486,0.000022590719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027432952,0.00018914523,0.00024815692,0.00000930374,0.000025817917,0.00011999557,0.00042906808,0.5838712,0.00012594566,0.3933729,0.0018742337,0.01970683],"study_design_scores_gemma":[0.0008092654,0.00018743389,0.0015649474,0.000071658054,0.000013587297,0.0005543433,0.000041006908,0.9552048,0.0014477753,0.022380441,0.017457554,0.00026719054],"about_ca_topic_score_codex":7.2616535e-7,"about_ca_topic_score_gemma":0.0000011707926,"teacher_disagreement_score":0.37133363,"about_ca_system_score_codex":0.00003952771,"about_ca_system_score_gemma":0.00007259242,"threshold_uncertainty_score":0.32293817},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02115896620607888,"score_gpt":0.2717379495631903,"score_spread":0.25057898335711143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226198151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010639018,0.000034893066,0.9962495,0.0010508298,0.000395198,0.00042178328,0.00019547777,0.00010104188,0.0004873923],"genre_scores_gemma":[0.1786783,0.000501661,0.8142749,0.00054143067,0.0003792218,0.00022782094,0.0032971762,0.000058180667,0.002041301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976908,0.00022012183,0.0008227033,0.0004425876,0.0005587573,0.00026500525],"domain_scores_gemma":[0.9968129,0.0003668462,0.0007902298,0.00027376594,0.0015940276,0.00016223625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797316,0.00022141825,0.00046117452,0.0015348272,0.0004772292,0.00039331106,0.00030806178,0.00013398538,0.00025409355],"category_scores_gemma":[0.00023190201,0.00020643219,0.00022668924,0.00427394,0.000051867893,0.0010204862,0.00006925112,0.00014124044,0.0000044269286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020977406,0.00009284031,0.00038125194,0.000023225542,0.0008746604,8.4390155e-7,0.00027156918,0.92067146,0.000023639912,0.07729309,0.0002968259,0.00004964023],"study_design_scores_gemma":[0.0008562521,0.00013558062,0.003065391,0.000021586377,0.00042787613,0.000007914507,0.00004788019,0.99434716,0.000010603148,0.0007309835,0.00013110152,0.00021768386],"about_ca_topic_score_codex":0.00000877255,"about_ca_topic_score_gemma":0.000003596474,"teacher_disagreement_score":0.18197457,"about_ca_system_score_codex":0.00011540375,"about_ca_system_score_gemma":0.00016806123,"threshold_uncertainty_score":0.841806},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007490345301454423,"score_gpt":0.237609898501728,"score_spread":0.23011955320027358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380609297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089372285,0.000063936175,0.9731783,0.01666451,0.00043889883,0.00041755007,0.000023928693,0.000057442023,0.00021819453],"genre_scores_gemma":[0.9556527,0.00090999913,0.03527198,0.0023145,0.0006068079,0.00014775612,0.00017974575,0.00005791863,0.0048585795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998392,0.00019855019,0.00042659463,0.00025577212,0.00049699604,0.00023008113],"domain_scores_gemma":[0.9988038,0.0002338905,0.00034374575,0.00021520306,0.00030314442,0.000100205754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562167,0.00015354305,0.00014943637,0.000116356,0.0009860218,0.00044461907,0.00043025348,0.000056877212,0.00001729985],"category_scores_gemma":[0.000118062984,0.00008666051,0.00006004057,0.0011383748,0.00003938417,0.0003332706,0.000108768465,0.000200608,0.000013440931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083280494,0.000040486648,0.00022942002,0.0000049904634,0.00007757141,2.5196718e-7,0.0020128181,0.9625424,0.00048381876,0.0024804508,0.028555226,0.0034892554],"study_design_scores_gemma":[0.00030839877,0.00019989516,0.00026347808,0.000016001119,0.000023047018,0.000008671835,0.0013098343,0.9888325,0.00088022626,0.000028685246,0.008003573,0.00012571484],"about_ca_topic_score_codex":0.00008258871,"about_ca_topic_score_gemma":0.000027363385,"teacher_disagreement_score":0.9467155,"about_ca_system_score_codex":0.00008415698,"about_ca_system_score_gemma":0.00005129853,"threshold_uncertainty_score":0.7583782},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011887117270661976,"score_gpt":0.2350073656440852,"score_spread":0.22312024837342323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387693852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036172632,0.00008213267,0.9608563,0.00037224157,0.00029454415,0.0005290081,0.00006561414,0.0005366866,0.001090814],"genre_scores_gemma":[0.8697698,0.0003260747,0.1282493,0.00016806317,0.00024076793,0.000104748324,0.000528105,0.00016261451,0.00045048597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983274,0.00006996104,0.00044513043,0.00029348323,0.00044698024,0.00041708286],"domain_scores_gemma":[0.99909216,0.00006407707,0.000120068726,0.00020621569,0.000263138,0.00025431372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004176897,0.00030295484,0.00024971136,0.00042938534,0.00025842353,0.00027209858,0.00014860908,0.000114201,0.00015231925],"category_scores_gemma":[0.00008554808,0.00028984784,0.00004585863,0.00092839525,0.000024794332,0.00070990395,0.000033858658,0.00028778278,0.00010493988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008831485,0.000025184847,0.00001803291,0.000039083076,0.000038262282,0.000010755104,0.00047282042,0.99760896,0.00023776725,0.0007438359,0.00045021356,0.0002667971],"study_design_scores_gemma":[0.0007560072,0.000349997,0.000063529515,0.000092326,0.000027719192,0.000040199167,0.0005093821,0.9970515,0.00045925283,0.000009437337,0.0002931416,0.00034752965],"about_ca_topic_score_codex":0.0000015166537,"about_ca_topic_score_gemma":0.000002350897,"teacher_disagreement_score":0.8335972,"about_ca_system_score_codex":0.00023412141,"about_ca_system_score_gemma":0.000041649004,"threshold_uncertainty_score":0.99995536},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012879784767656305,"score_gpt":0.25316713163343724,"score_spread":0.24028734686578093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391685089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003040555,0.00008279003,0.9963925,0.0019148545,0.000497473,0.00016940359,0.000026382093,0.000048216105,0.0005643415],"genre_scores_gemma":[0.4679463,0.00011437959,0.5303692,0.00017539987,0.0001808067,0.000028199347,0.00006710286,0.000021689128,0.0010968759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988503,0.000052995023,0.0004801779,0.00018959142,0.00030512628,0.0001218083],"domain_scores_gemma":[0.9985076,0.00017308955,0.00026086014,0.00016300587,0.0008332749,0.00006216795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035794778,0.000102916136,0.00018569415,0.0005054029,0.00015903651,0.00013082898,0.00023723136,0.00005895393,0.00008555032],"category_scores_gemma":[0.00012425041,0.00009066465,0.00018488655,0.0009461826,0.00002729794,0.0005562635,0.0000291472,0.000108751265,0.0000054346874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016643615,0.00009864166,0.000024318793,0.00004216655,0.00008712922,0.0000014452951,0.00023286008,0.919414,0.00037250124,0.07830669,0.00044895496,0.000954692],"study_design_scores_gemma":[0.00029320165,0.00019372048,0.00013504097,0.00010160407,0.000057560374,0.00003817633,0.000030454077,0.9962283,0.000612063,0.0013368174,0.0008799222,0.000093173345],"about_ca_topic_score_codex":0.0000044942562,"about_ca_topic_score_gemma":9.896065e-7,"teacher_disagreement_score":0.46764225,"about_ca_system_score_codex":0.00006132329,"about_ca_system_score_gemma":0.00024995013,"threshold_uncertainty_score":0.3697197},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04309997475809929,"score_gpt":0.29497667689339835,"score_spread":0.25187670213529906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400787272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006185045,0.0032360344,0.9753018,0.008865106,0.0018704855,0.0002787213,0.0000067503074,0.00011443944,0.004141597],"genre_scores_gemma":[0.99294615,0.00036383027,0.0055542286,0.00015268344,0.00039295453,0.0000063521275,0.0000030735373,0.000027424723,0.0005533005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752027,0.00040996372,0.00059399614,0.0003265336,0.0009251948,0.00022405387],"domain_scores_gemma":[0.99730307,0.0020069059,0.00013588874,0.00029098775,0.00012685655,0.00013628571],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046502454,0.00017235366,0.0002518048,0.00022848284,0.0003871397,0.0012681573,0.00038063552,0.000094987314,0.00045236418],"category_scores_gemma":[0.0020030134,0.00009179885,0.00012322307,0.0006527968,0.00016028347,0.0004243194,0.00005731578,0.00050268945,0.000044417833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008885355,0.000026665713,0.00012916248,0.000014983909,0.000023494666,0.00002087698,0.0007744081,0.9727197,0.000013818101,0.01434657,0.0031536075,0.008687842],"study_design_scores_gemma":[0.00060511084,0.000104957886,0.00026948118,0.00014248722,0.000031689116,0.00015176152,0.00034892405,0.9769048,0.00002613994,0.010721925,0.010548044,0.00014466108],"about_ca_topic_score_codex":0.0000012527319,"about_ca_topic_score_gemma":0.000002024056,"teacher_disagreement_score":0.9867611,"about_ca_system_score_codex":0.00007610309,"about_ca_system_score_gemma":0.00012242612,"threshold_uncertainty_score":0.9997686},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016791898185659324,"score_gpt":0.2575591347630491,"score_spread":0.24076723657738977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401550494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007166707,0.00028325678,0.99618006,0.000105752755,0.00057835056,0.00062123337,0.000015283442,0.000709052,0.0007903389],"genre_scores_gemma":[0.17036264,0.00040199715,0.8285296,0.000030263052,0.0003864481,0.00007428873,0.000050653543,0.00010005058,0.000064071435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.00006508936,0.00030089464,0.00024540286,0.00024550594,0.0002570787],"domain_scores_gemma":[0.99933136,0.00009698338,0.00009212726,0.00013981308,0.00024591965,0.00009377351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023058898,0.00023447572,0.00020402014,0.0003585905,0.00016528738,0.00023767861,0.000094254065,0.0001129569,0.000022803953],"category_scores_gemma":[0.000028431325,0.00019292976,0.00008702344,0.00034833458,0.00002306712,0.0004010428,0.000009507666,0.00033077542,0.0000022358006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018766348,0.00003314132,0.0000053005515,0.000023883742,0.00010034566,0.000018186625,0.00012786662,0.9939216,0.00021416665,0.0011248029,0.0012877466,0.002955327],"study_design_scores_gemma":[0.00048941805,0.0007944941,0.000013387828,0.00038657078,0.000081307146,0.00010672511,0.000071790935,0.992211,0.004516396,0.000102988895,0.0009915839,0.00023432812],"about_ca_topic_score_codex":0.0000030748502,"about_ca_topic_score_gemma":0.0000011864532,"teacher_disagreement_score":0.16964597,"about_ca_system_score_codex":0.00023027876,"about_ca_system_score_gemma":0.000062724066,"threshold_uncertainty_score":0.7867447},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017276378262051327,"score_gpt":0.30020955161130003,"score_spread":0.2829331733492487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402461337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005228286,0.0014278353,0.9911171,0.00069592247,0.00035694116,0.00009732364,0.0000010667052,0.0000820473,0.0009934828],"genre_scores_gemma":[0.7340166,0.0027216712,0.26199752,0.00036890517,0.00019118043,0.000015179186,0.00000409876,0.000046353518,0.00063846254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857366,0.0003533098,0.00024846994,0.00026716213,0.00030099056,0.00025639683],"domain_scores_gemma":[0.999084,0.0005147784,0.00005742813,0.00017341021,0.00006394305,0.0001064344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001679756,0.00012303346,0.00012737466,0.00089109206,0.00013369191,0.00050713884,0.0003136871,0.000055831184,0.000023028286],"category_scores_gemma":[0.00017772174,0.000103352424,0.000047643905,0.0009992389,0.000066949535,0.0010441612,0.00008656528,0.00044291222,0.0000067554065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006858946,0.00004101014,0.00016804542,0.00001564779,0.000025038116,0.0002461852,0.0015057558,0.59018487,0.0002282254,0.31860968,0.000096658725,0.08881031],"study_design_scores_gemma":[0.00032411332,0.00019709345,0.00032778937,0.00024594858,0.0000031574882,0.0001675373,0.00011034667,0.8409053,0.00011764938,0.15697303,0.00048361908,0.00014440129],"about_ca_topic_score_codex":5.1483556e-7,"about_ca_topic_score_gemma":7.9047726e-7,"teacher_disagreement_score":0.72911954,"about_ca_system_score_codex":0.000047624242,"about_ca_system_score_gemma":0.000057236,"threshold_uncertainty_score":0.48903516},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013327296808175666,"score_gpt":0.28819486082917845,"score_spread":0.27486756402100276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407702284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5634296,0.00020557924,0.41756758,0.0016815305,0.0013473956,0.0006375981,0.000033327986,0.00014257651,0.014954811],"genre_scores_gemma":[0.87069637,0.00012914551,0.12662378,0.00072483544,0.00015811017,0.000010620637,0.000007634466,0.00002779939,0.0016216841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998234,0.00012413604,0.00033747053,0.00026588212,0.0006381055,0.000400446],"domain_scores_gemma":[0.99906707,0.00009308586,0.00020260902,0.00019000952,0.0003060343,0.00014119575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043134598,0.00015567603,0.00017492409,0.00024033486,0.0005403879,0.00041289386,0.00022520393,0.00005206682,0.00088393496],"category_scores_gemma":[0.0003440597,0.000121779485,0.000039208706,0.00040862523,0.00009445423,0.00080008025,0.000078578465,0.00031441514,0.000025797777],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009979024,0.0001714768,0.0011407217,0.000047870202,0.000073287214,0.00010457308,0.0007860021,0.7927992,0.19690315,0.0027212999,0.001463528,0.002791028],"study_design_scores_gemma":[0.010150272,0.002682207,0.00060756045,0.0031502382,0.00017290852,0.0006449628,0.0026305781,0.12206658,0.84305567,0.006325504,0.007113243,0.0014003086],"about_ca_topic_score_codex":0.0000053595554,"about_ca_topic_score_gemma":0.0000018298922,"teacher_disagreement_score":0.67073256,"about_ca_system_score_codex":0.0002315251,"about_ca_system_score_gemma":0.00034085306,"threshold_uncertainty_score":0.96784675},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011610335255735484,"score_gpt":0.22145058788407912,"score_spread":0.20984025262834363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408053135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007224698,0.000046702102,0.99371576,0.00012392187,0.00031205954,0.0002816584,0.000012405655,0.0001616954,0.005273521],"genre_scores_gemma":[0.6600896,0.00032356154,0.33823466,0.00016893659,0.00016161826,0.00009599643,0.000113967835,0.000047604488,0.00076407444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.000013316036,0.00023349925,0.00012829463,0.000103457736,0.00020867512],"domain_scores_gemma":[0.9995261,0.00009070138,0.000087647626,0.00008845966,0.000154955,0.000052143023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012089547,0.00014522711,0.0001417779,0.00017387222,0.00020044725,0.000076218734,0.000064954234,0.00006446786,0.000041225067],"category_scores_gemma":[0.00006252028,0.00012923998,0.00003765568,0.0001695477,0.000030177227,0.00020593558,0.000005066996,0.00017470852,0.0000023376142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007138519,0.000018317314,0.000009896321,0.000035306708,0.00004368775,0.0000021219,0.00007368753,0.9956332,0.000008106141,0.001865667,0.0002290718,0.0020095527],"study_design_scores_gemma":[0.00092634896,0.00030105657,0.000018132796,0.0001942102,0.00003204531,0.000010085948,0.000056290577,0.99453115,0.0008367659,0.0016258731,0.0013072721,0.00016078862],"about_ca_topic_score_codex":2.2073871e-7,"about_ca_topic_score_gemma":0.0000013760848,"teacher_disagreement_score":0.6600173,"about_ca_system_score_codex":0.000096344236,"about_ca_system_score_gemma":0.00004559401,"threshold_uncertainty_score":0.52702534},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009435308930310997,"score_gpt":0.24150252159109312,"score_spread":0.23206721266078212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413992645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006878769,0.00016014965,0.989072,0.005665007,0.00077609747,0.00012174156,0.0000030976535,0.0000483112,0.003465686],"genre_scores_gemma":[0.34525222,0.0014197876,0.6384022,0.004852085,0.0008737598,0.00003697862,0.000017791484,0.000041057658,0.009104078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989001,0.00018572719,0.00026845295,0.00021766486,0.00024624128,0.00018181227],"domain_scores_gemma":[0.99899924,0.0003626449,0.00015365276,0.00026591925,0.00014347078,0.000075090575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063835416,0.00013354674,0.00011713571,0.00015950647,0.00062199146,0.00021831211,0.0004125149,0.00006377519,0.00014689555],"category_scores_gemma":[0.00017601025,0.000093690775,0.000054060627,0.0004533866,0.00006363403,0.00038967907,0.00008577302,0.0003780852,0.000022224263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013430955,0.00004686344,0.000033764238,0.000003978653,0.00003277165,0.00000782826,0.00023352675,0.5219141,0.0000074544228,0.46066958,0.0017005806,0.0153360935],"study_design_scores_gemma":[0.00028587892,0.00010954199,0.00010469888,0.00007897468,0.000011680188,0.000024431638,0.000058705955,0.97611207,0.00022130682,0.021866405,0.0010230009,0.00010328911],"about_ca_topic_score_codex":0.0000011927544,"about_ca_topic_score_gemma":2.2613435e-7,"teacher_disagreement_score":0.45419797,"about_ca_system_score_codex":0.000053243857,"about_ca_system_score_gemma":0.00009521725,"threshold_uncertainty_score":0.47839186},"labels":[],"label_agreement":null}]}