{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013299176,0.00013548492,0.99394774,0.00009705007,0.000032847565,0.000031656327,0.00003066385,0.00021292808,0.0041815876],"genre_scores_gemma":[0.08046191,0.00033838282,0.90678537,0.00020662587,0.00007713067,0.0004058592,0.00020638954,0.00042533455,0.011093082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995671,0.00014723864,0.0000120054165,0.000048510872,0.00020431925,0.000020742431],"domain_scores_gemma":[0.9996698,0.00012851052,0.000034875142,0.00004186163,0.0001003856,0.000024626932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075727055,0.00074485753,0.00071222574,0.0006005307,0.00044815347,0.00061505375,0.0007293817,0.0009751502,0.0047239056],"category_scores_gemma":[0.0017025288,0.0003439498,0.0005383352,0.0005996653,0.0007721853,0.00064392586,0.0014326738,0.001409961,0.0020174973],"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.000067071196,0.00006475036,0.00039037384,0.00032455588,0.00004596571,0.0001988435,0.00017758775,0.61643165,0.016545642,0.13090514,0.014211932,0.22063644],"study_design_scores_gemma":[0.00001250728,0.000022805261,0.000041632095,0.000015801248,0.0000029640412,0.000038465332,0.000007484296,0.98586094,0.0012636908,0.0071401186,0.0055836895,0.000009970399],"about_ca_topic_score_codex":0.0016658717,"about_ca_topic_score_gemma":0.0016916735,"teacher_disagreement_score":0.0047239056,"about_ca_system_score_codex":0.00048440124,"about_ca_system_score_gemma":0.0010600621,"threshold_uncertainty_score":0.01580304},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006960681,0.0000588121,0.998689,0.000041189036,0.000008694928,0.0000051248,0.0000047388153,0.000053735956,0.00044266283],"genre_scores_gemma":[0.22206748,0.0007696751,0.77351457,0.00018578453,0.000101607235,0.00021011046,0.00010085471,0.00014625821,0.0029035714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992506,0.00029881622,0.000037473605,0.00011978889,0.00025647474,0.00003679025],"domain_scores_gemma":[0.9983026,0.0012084962,0.0001695438,0.0000933698,0.0001941932,0.00003177011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014781817,0.0008751241,0.00094688794,0.0003759961,0.00025396116,0.0008276969,0.0007455788,0.0008994875,0.0018580261],"category_scores_gemma":[0.0023932653,0.00037696082,0.00069985655,0.00048842945,0.0010216133,0.00077935384,0.00069477677,0.0018224716,0.00032866886],"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.000045852386,0.000057398192,0.0001135832,0.00014783938,0.000037048703,0.0000691217,0.000061539125,0.8847735,0.0048152027,0.05174956,0.00081920956,0.05731012],"study_design_scores_gemma":[0.000005624626,0.000019898003,0.000012180435,0.000003719722,0.0000027838075,0.000010912558,0.0000025722893,0.9928256,0.00067105546,0.005919472,0.00052186096,0.000004323727],"about_ca_topic_score_codex":0.0010468469,"about_ca_topic_score_gemma":0.0008187548,"teacher_disagreement_score":0.0018580261,"about_ca_system_score_codex":0.00046588734,"about_ca_system_score_gemma":0.0007128606,"threshold_uncertainty_score":0.007817447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085664086,0.0023795965,0.8633222,0.004314995,0.00034916092,0.00013207963,0.0011747512,0.0012318164,0.041431297],"genre_scores_gemma":[0.8294271,0.0027291137,0.14713134,0.0014292976,0.001112287,0.0007072459,0.0016202999,0.0010455782,0.014797739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947296,0.0016943234,0.00017367574,0.0010704541,0.001540017,0.00079188315],"domain_scores_gemma":[0.94504195,0.04320977,0.0026568163,0.004047716,0.003248637,0.0017952026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006172893,0.0014430666,0.001983489,0.0018544056,0.0012924562,0.003304374,0.002932879,0.0021215817,0.016837208],"category_scores_gemma":[0.06256144,0.00079606177,0.0012783301,0.0019938566,0.00482359,0.010912266,0.0030972487,0.005798682,0.002078459],"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.0004978362,0.00012395065,0.0015617475,0.00027438198,0.000054792356,0.00015765887,0.00016497064,0.1770658,0.0024993096,0.7805582,0.010177267,0.026864162],"study_design_scores_gemma":[0.00004230215,0.00006780977,0.00043715112,0.000056037497,0.00002009872,0.00006443261,0.000027611084,0.59376574,0.0012263696,0.40248278,0.0017740612,0.000035670455],"about_ca_topic_score_codex":0.002359463,"about_ca_topic_score_gemma":0.0023394956,"teacher_disagreement_score":0.016837208,"about_ca_system_score_codex":0.0035061166,"about_ca_system_score_gemma":0.002506939,"threshold_uncertainty_score":0.05632609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020520277,0.00013595891,0.99529845,0.000084822306,0.00003351629,0.00004286435,0.00003755749,0.00033305725,0.0019817243],"genre_scores_gemma":[0.057726033,0.000104919156,0.9396378,0.00005820094,0.000030881703,0.00023614918,0.00012900034,0.00010789099,0.0019690671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994506,0.00014347737,0.000030081495,0.00009184917,0.0002177287,0.00006639032],"domain_scores_gemma":[0.9994134,0.00029040777,0.000047757083,0.00007979331,0.00012236298,0.0000463112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011877962,0.0012288573,0.0014129727,0.0006229244,0.00076265034,0.0011643337,0.0013859273,0.0013199874,0.0051962063],"category_scores_gemma":[0.0023637873,0.0007980315,0.0005698275,0.00083640305,0.00093013264,0.0010269481,0.0015675125,0.0021704661,0.0016030654],"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.00012040291,0.0000875114,0.0002531929,0.00015522116,0.000029200453,0.000068064895,0.000053989486,0.8398132,0.002079627,0.03731884,0.0038476423,0.11617319],"study_design_scores_gemma":[0.000039910865,0.000023523686,0.000024413921,0.000009926361,0.0000038925978,0.000021578071,0.00000619381,0.98902905,0.00067165756,0.008099432,0.00206515,0.000005277535],"about_ca_topic_score_codex":0.0029939048,"about_ca_topic_score_gemma":0.004101086,"teacher_disagreement_score":0.0051962063,"about_ca_system_score_codex":0.0009225805,"about_ca_system_score_gemma":0.0018434796,"threshold_uncertainty_score":0.017383039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086140195,0.0045569944,0.9541401,0.0011434326,0.0002381932,0.000034824498,0.0001645113,0.00009898359,0.031008998],"genre_scores_gemma":[0.5949412,0.020050768,0.3463362,0.0013046408,0.0031249465,0.00046581923,0.00052487396,0.00031736773,0.032934204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987109,0.00040380837,0.00007549383,0.00029148647,0.00041455953,0.00010375781],"domain_scores_gemma":[0.9981951,0.0010405176,0.0001253802,0.00017602197,0.0003424079,0.00012050649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002708011,0.00086487224,0.0011909674,0.0026679945,0.0013401054,0.003409613,0.0018680504,0.0017021324,0.0045233984],"category_scores_gemma":[0.006161282,0.00058490434,0.0011005003,0.0028329971,0.004432963,0.0061809137,0.0028920346,0.0031977969,0.0012465988],"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.000003166766,0.0000041963,0.00006176476,0.00003388599,0.0000063711436,0.00001805561,0.000042216867,0.0032824455,0.000117154384,0.99075073,0.0005877896,0.0050921906],"study_design_scores_gemma":[0.000003487433,0.000016567375,0.00010524895,0.00002510353,0.000007399383,0.000077349694,0.00002939525,0.028451024,0.00022565121,0.9605867,0.010461362,0.000010683672],"about_ca_topic_score_codex":0.0011676202,"about_ca_topic_score_gemma":0.0005924081,"teacher_disagreement_score":0.0045233984,"about_ca_system_score_codex":0.0018440562,"about_ca_system_score_gemma":0.0009596564,"threshold_uncertainty_score":0.015132248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061365366,0.000078752324,0.9917807,0.00018210782,0.000015815382,0.000035410503,0.00007832845,0.0002367709,0.0014554329],"genre_scores_gemma":[0.2696442,0.00036703958,0.7244222,0.0003261922,0.00006410952,0.00045416364,0.00080827874,0.0003015735,0.0036121309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820065,0.0009150529,0.000066555265,0.00027859074,0.000410092,0.00012905951],"domain_scores_gemma":[0.99603975,0.0028967862,0.00028942773,0.00023366796,0.00043449822,0.00010579403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024515255,0.0016231379,0.0013906612,0.00083177513,0.00065053866,0.0013815331,0.001506627,0.0015495244,0.002527519],"category_scores_gemma":[0.006623043,0.0009372588,0.0010656888,0.0012467911,0.0015176487,0.0016152266,0.0014462486,0.0030244759,0.0007915326],"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.000047285543,0.000057553938,0.00021465344,0.00008918329,0.000022829452,0.000035892415,0.00005251217,0.96095616,0.000998926,0.020784529,0.0022302011,0.0145102935],"study_design_scores_gemma":[0.0000046360515,0.000008151864,0.000018328194,0.0000031032325,0.0000011760808,0.000006179672,0.000007986792,0.99408025,0.00019425814,0.0054983934,0.00017473889,0.0000028260374],"about_ca_topic_score_codex":0.0045480737,"about_ca_topic_score_gemma":0.005756875,"teacher_disagreement_score":0.0045480737,"about_ca_system_score_codex":0.0014526878,"about_ca_system_score_gemma":0.0017138419,"threshold_uncertainty_score":0.012965083},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043023992,0.000042664225,0.99445575,0.00008841312,0.00002402157,0.000016440981,0.000025739795,0.00013610626,0.00090859423],"genre_scores_gemma":[0.16633847,0.00022232455,0.83026105,0.0002305205,0.00010606911,0.00018556914,0.00029504314,0.00023516711,0.0021258176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992792,0.0003090034,0.000035621317,0.00012576103,0.00020024643,0.00005022793],"domain_scores_gemma":[0.9985246,0.00083236047,0.00014225254,0.00021836645,0.00021239578,0.0000700465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013797166,0.0012579178,0.0010027441,0.0003828021,0.00034987577,0.00072925375,0.0006092521,0.00082411536,0.0037254551],"category_scores_gemma":[0.00415092,0.00036317523,0.00067645084,0.00062623597,0.0011393158,0.0013025965,0.0012453538,0.0022195862,0.0008454907],"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.00015922562,0.00016057151,0.0003373144,0.00031569065,0.000058056616,0.0002244572,0.00017420731,0.76109475,0.037167888,0.091987,0.0066154944,0.10170532],"study_design_scores_gemma":[0.0000109895545,0.000029091927,0.000036343696,0.0000058305163,0.0000023039731,0.000023508974,0.000009116893,0.98503506,0.0021378717,0.011781142,0.0009232325,0.0000054620846],"about_ca_topic_score_codex":0.0010419461,"about_ca_topic_score_gemma":0.0017784084,"teacher_disagreement_score":0.0037254551,"about_ca_system_score_codex":0.0003421127,"about_ca_system_score_gemma":0.0009869062,"threshold_uncertainty_score":0.012462914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039047427,0.00011128841,0.95931506,0.00029825358,0.000008750381,0.000016058782,0.00006412612,0.00010885535,0.001030153],"genre_scores_gemma":[0.7885131,0.00043567445,0.20873107,0.00010169792,0.000089207526,0.00009394297,0.00039900353,0.00015011744,0.0014862294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984005,0.0008161846,0.000072379735,0.00020804044,0.00040550003,0.00009745156],"domain_scores_gemma":[0.9901867,0.008145118,0.0006130593,0.000610434,0.0002736497,0.000171068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038183625,0.00056443847,0.0009923248,0.0015612615,0.0005435896,0.0022662955,0.0015383799,0.0010926734,0.0015275104],"category_scores_gemma":[0.020496035,0.00082672504,0.0008563285,0.00093331025,0.002662128,0.0054150787,0.0024853637,0.0023216642,0.0002620896],"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.000106209496,0.000038991813,0.0015820197,0.00007213135,0.000059200807,0.00017353451,0.00014059553,0.65913916,0.0016928874,0.30744195,0.0004345093,0.02911874],"study_design_scores_gemma":[0.000008304664,0.000009332076,0.00028858642,0.000011095153,0.000003387576,0.000023375926,0.000008468888,0.7816925,0.000581411,0.21716039,0.00020206488,0.000011055956],"about_ca_topic_score_codex":0.0009650224,"about_ca_topic_score_gemma":0.0007515051,"teacher_disagreement_score":0.0038183625,"about_ca_system_score_codex":0.0009852274,"about_ca_system_score_gemma":0.0009464884,"threshold_uncertainty_score":0.020193696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005078146,0.00007616133,0.99800855,0.000048387723,0.000033877506,0.000021336138,0.000016377124,0.00012068223,0.0011667466],"genre_scores_gemma":[0.040906344,0.00030309768,0.9517169,0.0001101907,0.00010461658,0.00022489193,0.00015996973,0.00024834814,0.0062255817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00016003396,0.000022079787,0.00007663852,0.00031767387,0.000029778204],"domain_scores_gemma":[0.99961144,0.00015972248,0.00003078997,0.000043583408,0.00011967295,0.000034853227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092356413,0.0008771059,0.00086231396,0.0004543902,0.00046031555,0.0005793858,0.0010953357,0.0006857889,0.006374431],"category_scores_gemma":[0.0014250823,0.000409328,0.00078635383,0.00072517985,0.00064076297,0.0007699497,0.0011841649,0.001519266,0.0023163126],"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.00014049624,0.0001392813,0.00039979003,0.0005016678,0.00009873048,0.00019350558,0.00012393761,0.4868859,0.018401366,0.09194363,0.014495173,0.38667652],"study_design_scores_gemma":[0.000021708658,0.0000671344,0.000055794222,0.000010478137,0.000008680659,0.00006400654,0.0000049637306,0.9792595,0.0013469106,0.009056599,0.010094853,0.000009370175],"about_ca_topic_score_codex":0.002326051,"about_ca_topic_score_gemma":0.0029956389,"teacher_disagreement_score":0.006374431,"about_ca_system_score_codex":0.0004022424,"about_ca_system_score_gemma":0.0014347627,"threshold_uncertainty_score":0.021324575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001359322,0.00014480061,0.99657637,0.000097664,0.000045787212,0.000043598266,0.000021770118,0.00009286896,0.0016177663],"genre_scores_gemma":[0.060739163,0.00033989703,0.9350094,0.00016765704,0.00007484455,0.00028468255,0.000113431386,0.000116299416,0.003154617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925953,0.00035444542,0.00002690586,0.00008634963,0.00024367358,0.000028979191],"domain_scores_gemma":[0.9991522,0.0003921256,0.00006686286,0.0000845945,0.00025322882,0.00005102595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018334491,0.0012480541,0.0009630627,0.0006201164,0.00042756644,0.0009736027,0.0008752708,0.0009998684,0.004313725],"category_scores_gemma":[0.002895211,0.00050938176,0.0006532603,0.00074745825,0.0010117592,0.0011007352,0.0012775073,0.0021353564,0.0016744838],"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.0002641741,0.000235728,0.000481808,0.0004398149,0.0000804617,0.00017425219,0.0001445748,0.52054334,0.009506673,0.22210391,0.012113527,0.2339117],"study_design_scores_gemma":[0.000038197126,0.00007540755,0.000040365874,0.000017673521,0.00000748224,0.000052894575,0.000010705903,0.9751692,0.0017694973,0.018021977,0.0047867373,0.000010040953],"about_ca_topic_score_codex":0.00064843043,"about_ca_topic_score_gemma":0.0011325759,"teacher_disagreement_score":0.004313725,"about_ca_system_score_codex":0.00058541045,"about_ca_system_score_gemma":0.0010715675,"threshold_uncertainty_score":0.014430881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06340972,0.0009903806,0.91887516,0.0017214988,0.000121056095,0.00018834573,0.00032344306,0.00038760604,0.013982765],"genre_scores_gemma":[0.47103685,0.0012907295,0.5187557,0.0005027165,0.00019277197,0.0004629301,0.00071048475,0.00028588757,0.0067619397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.0008366063,0.000050499548,0.00028568282,0.0002555338,0.0001944963],"domain_scores_gemma":[0.9905398,0.0079663545,0.00045058824,0.00048719443,0.00035177878,0.00020430368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029280123,0.0016949574,0.0019327677,0.0011747847,0.0009382626,0.0017219352,0.0022832127,0.0022888333,0.006772333],"category_scores_gemma":[0.015646534,0.00089552475,0.0011994684,0.0018081323,0.0016281201,0.00438606,0.0018291692,0.002593191,0.0008563668],"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.00015706861,0.00012138028,0.00096885924,0.00026478007,0.00004239076,0.00008941754,0.000104422616,0.91670734,0.0006581881,0.05000369,0.0038343437,0.027048137],"study_design_scores_gemma":[0.00003574099,0.000071888026,0.00016892601,0.000031249838,0.000016602853,0.000049449685,0.000045661356,0.93277544,0.00036538334,0.064839795,0.0015913983,0.000008460601],"about_ca_topic_score_codex":0.002874374,"about_ca_topic_score_gemma":0.004074696,"teacher_disagreement_score":0.006772333,"about_ca_system_score_codex":0.002079834,"about_ca_system_score_gemma":0.0015720917,"threshold_uncertainty_score":0.022655725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012150401,0.000301055,0.98276734,0.00040700723,0.000076902936,0.00008081994,0.00027077115,0.0001478885,0.0037979004],"genre_scores_gemma":[0.72995776,0.0010696253,0.2553147,0.0005011806,0.00034564134,0.0005364041,0.0014526753,0.00029539838,0.010526553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391717,0.0023406532,0.000379892,0.0014794201,0.0012770207,0.0006059025],"domain_scores_gemma":[0.99333054,0.003974337,0.0010490853,0.000566998,0.0007963515,0.0002827725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053882767,0.0020186864,0.0032577717,0.0011918781,0.0007606992,0.0029400715,0.0029411847,0.0028194431,0.0040202895],"category_scores_gemma":[0.011987166,0.0009950579,0.0016944525,0.0018623351,0.0017443011,0.0029343336,0.0025509282,0.0025933438,0.00076354726],"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.00006689154,0.000060677652,0.00026164655,0.000093527065,0.000060942504,0.00011850596,0.000029441302,0.94804335,0.00068811135,0.03795247,0.0009292573,0.011695104],"study_design_scores_gemma":[0.000010150341,0.00005418466,0.00009844397,0.00001031165,0.000010867431,0.00004401104,0.00001807988,0.96649075,0.00034903263,0.03226781,0.00063209335,0.000014387715],"about_ca_topic_score_codex":0.0029168343,"about_ca_topic_score_gemma":0.0017177836,"teacher_disagreement_score":0.0053882767,"about_ca_system_score_codex":0.0016592164,"about_ca_system_score_gemma":0.0020911628,"threshold_uncertainty_score":0.028496265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43773285,0.0005601259,0.44265458,0.00087356067,0.00014989424,0.00013875584,0.00078783,0.00017777378,0.11692459],"genre_scores_gemma":[0.93716794,0.00051722856,0.042259745,0.00019103294,0.00017070846,0.00014977211,0.0006149119,0.00013816274,0.018790463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994916,0.00008723806,0.000022933493,0.00010361683,0.00019550287,0.000099169054],"domain_scores_gemma":[0.9986798,0.0005186858,0.00025012498,0.00009594358,0.00022769817,0.00022766537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046174054,0.00058798696,0.0005512441,0.0019998546,0.001221442,0.0039905324,0.0007602716,0.0007773186,0.007553183],"category_scores_gemma":[0.0028103322,0.0003357588,0.00067477644,0.0012383602,0.0027171785,0.0037886307,0.0017624703,0.002356485,0.0007171507],"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.000015876483,0.000013462354,0.00030997038,0.000023267718,0.0000034267327,0.00005260897,0.00014498566,0.0021885918,0.0005775106,0.9917441,0.0005602587,0.004365946],"study_design_scores_gemma":[0.0000075644266,0.000016722215,0.00023102212,0.00001833031,0.0000034766058,0.00010805105,0.00024786495,0.01531738,0.0005208912,0.9806968,0.0028233735,0.000008513158],"about_ca_topic_score_codex":0.0007449924,"about_ca_topic_score_gemma":0.00090450316,"teacher_disagreement_score":0.007553183,"about_ca_system_score_codex":0.0010799468,"about_ca_system_score_gemma":0.000534034,"threshold_uncertainty_score":0.025267959},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002288877,0.00009031527,0.99623483,0.00006532719,0.000012855837,0.000039051003,0.000021363683,0.00016171995,0.0010856345],"genre_scores_gemma":[0.114991926,0.0002705462,0.8810919,0.0001412618,0.00005148909,0.000418408,0.000244406,0.00029540935,0.0024946593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986817,0.0005037094,0.000045968776,0.00017355898,0.0004704622,0.0001245947],"domain_scores_gemma":[0.99726176,0.0017505583,0.0002784649,0.00020276321,0.00039703958,0.0001093643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028104912,0.0018728131,0.0015322274,0.0014312358,0.0005349954,0.0018229123,0.0020577388,0.0018054827,0.0041475017],"category_scores_gemma":[0.006285999,0.0010291012,0.0010862568,0.0013087759,0.0017035024,0.0020036022,0.0018726278,0.0031368807,0.0012502451],"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.00022971802,0.00012504199,0.0004926555,0.00021441007,0.000065008295,0.00011118156,0.0001561337,0.7799063,0.0029747786,0.12510647,0.0031977778,0.08742049],"study_design_scores_gemma":[0.000022642333,0.00003526109,0.000026478287,0.000012599076,0.000005685552,0.000018998364,0.000009859436,0.9802684,0.0007003126,0.017792642,0.0011012454,0.0000058472806],"about_ca_topic_score_codex":0.002214312,"about_ca_topic_score_gemma":0.0017774395,"teacher_disagreement_score":0.0041475017,"about_ca_system_score_codex":0.001322955,"about_ca_system_score_gemma":0.0014838807,"threshold_uncertainty_score":0.014863491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003246068,0.00031414087,0.99118245,0.00027057427,0.000038479637,0.000035806916,0.00006412003,0.000030289026,0.004818049],"genre_scores_gemma":[0.33592123,0.0024324334,0.64896554,0.0004900459,0.00059003156,0.0006560707,0.0005513174,0.00017361551,0.0102198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780923,0.00083358894,0.00014796222,0.000335575,0.0007493795,0.00012424165],"domain_scores_gemma":[0.9974813,0.001313829,0.00041199793,0.00041206944,0.0003258715,0.000054911474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040994035,0.0014615762,0.0012924345,0.00085283763,0.0004198079,0.0024302166,0.0019512158,0.0016246052,0.0042164805],"category_scores_gemma":[0.008008682,0.0006637641,0.0017477302,0.0010931633,0.0018492364,0.005200921,0.0026444923,0.003639523,0.00082628947],"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.000013501313,0.000034742974,0.000067799614,0.0001607118,0.00002413427,0.000108562424,0.00008845208,0.19776547,0.0011121002,0.7845432,0.0009859675,0.015095437],"study_design_scores_gemma":[0.00001695467,0.000050547493,0.0000894176,0.00007245879,0.00001965533,0.00005951204,0.000039797585,0.65262914,0.0011838244,0.3399494,0.005868451,0.000020824213],"about_ca_topic_score_codex":0.0008488529,"about_ca_topic_score_gemma":0.00094602007,"teacher_disagreement_score":0.0042164805,"about_ca_system_score_codex":0.001140231,"about_ca_system_score_gemma":0.0010015845,"threshold_uncertainty_score":0.021679938},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087700045,0.004321621,0.009447668,0.08005221,0.87741184,0.0000813705,0.0021822983,0.000753353,0.02487263],"genre_scores_gemma":[0.044057578,0.018490573,0.037554044,0.124306716,0.20980978,0.0004395365,0.008773435,0.0041926606,0.5523757],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975063,0.00046152924,0.0005113891,0.00041760897,0.0009484938,0.00015463769],"domain_scores_gemma":[0.98680115,0.0040066703,0.0005411603,0.0010266622,0.007262637,0.00036183032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002866571,0.0021491058,0.0014114355,0.0027920178,0.0031864948,0.0026244235,0.0023049894,0.0038706241,0.05083478],"category_scores_gemma":[0.039127722,0.000825829,0.0011351802,0.0023876785,0.0016795397,0.003532922,0.0013437675,0.0059498474,0.027453175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00006673382,0.000011708069,0.00007857259,0.00012489573,0.000008670696,0.00019373914,0.00003818677,0.00013362449,0.00010486425,0.005995889,0.9813674,0.011875717],"study_design_scores_gemma":[0.00005367198,0.000054328222,0.00052001746,0.00037600205,0.00004629683,0.0005308444,0.000100872785,0.0010121964,0.0008609896,0.013899174,0.98248863,0.000056977744],"about_ca_topic_score_codex":0.005819987,"about_ca_topic_score_gemma":0.0067507746,"teacher_disagreement_score":0.05083478,"about_ca_system_score_codex":0.0024394381,"about_ca_system_score_gemma":0.0024132025,"threshold_uncertainty_score":0.17005926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00994729,0.00021811674,0.9846372,0.00017850092,0.000031265314,0.00002021139,0.000030002824,0.00020702837,0.00473035],"genre_scores_gemma":[0.3819895,0.0005126511,0.6078106,0.00019629607,0.000056292196,0.0002115271,0.00023794269,0.0007081727,0.008276958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.00027229544,0.000025958625,0.0000725956,0.0003025463,0.000063336585],"domain_scores_gemma":[0.99748755,0.0015533775,0.00019109019,0.00025834466,0.00040202652,0.00010765494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024248462,0.000806949,0.00078312453,0.0007331787,0.0004631487,0.0010623661,0.0009318548,0.000972638,0.003272542],"category_scores_gemma":[0.007957853,0.00040288235,0.000694845,0.00048476728,0.0015017621,0.0015991179,0.0014596366,0.0019633193,0.00083381054],"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.00009157015,0.000045771085,0.0009394022,0.00014223583,0.00002991456,0.000052873056,0.00011750006,0.76742715,0.0033032885,0.19597048,0.002104953,0.029774956],"study_design_scores_gemma":[0.0000020359232,0.0000055416863,0.00004594331,0.000006989012,0.0000014472837,0.000005110267,0.000003894607,0.98995775,0.00051805284,0.00898258,0.0004683222,0.000002284856],"about_ca_topic_score_codex":0.0038807457,"about_ca_topic_score_gemma":0.004159403,"teacher_disagreement_score":0.0038807457,"about_ca_system_score_codex":0.001304134,"about_ca_system_score_gemma":0.0014583055,"threshold_uncertainty_score":0.012823999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22068793,0.0005756711,0.6756713,0.00062372105,0.00019493385,0.00010867193,0.00026146075,0.00017469075,0.101701595],"genre_scores_gemma":[0.8072724,0.0007902118,0.13240272,0.00027330668,0.00022373792,0.000125399,0.0003328152,0.00011334389,0.058466144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997416,0.000041292893,0.000016728416,0.00004698778,0.000112567424,0.000040769923],"domain_scores_gemma":[0.99969196,0.000054282158,0.000045827794,0.000035353216,0.00009020797,0.000082298066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512907,0.0005839362,0.0002750304,0.0008664655,0.00045432738,0.0011245452,0.000433398,0.0005233106,0.005562788],"category_scores_gemma":[0.0010639922,0.00017776701,0.00049959746,0.0003258335,0.000971118,0.0020862282,0.001110312,0.0013424092,0.0006244277],"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.000010647191,0.000010011558,0.00006157583,0.000016073958,0.000001854872,0.000054185857,0.00008992264,0.0012390977,0.0019495686,0.99152935,0.00032287222,0.004714839],"study_design_scores_gemma":[0.0000097909415,0.000033486886,0.00013632642,0.000012826781,0.0000039348274,0.00014858661,0.00008432543,0.037288565,0.0017109204,0.95476466,0.005797775,0.000008909816],"about_ca_topic_score_codex":0.0005750325,"about_ca_topic_score_gemma":0.00048700895,"teacher_disagreement_score":0.005562788,"about_ca_system_score_codex":0.00069268927,"about_ca_system_score_gemma":0.0004934683,"threshold_uncertainty_score":0.018609345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034928776,0.0002786707,0.9603574,0.0002972775,0.000017516113,0.000032653326,0.00004432546,0.00013459913,0.003908735],"genre_scores_gemma":[0.77045304,0.00051896693,0.22357105,0.00029766205,0.00007320007,0.00021515148,0.00023074416,0.00018061262,0.004459669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979231,0.0008805904,0.00008194501,0.00033311968,0.0006058076,0.00017556502],"domain_scores_gemma":[0.99686784,0.0018669285,0.0003608283,0.00040608767,0.0003819648,0.0001164301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023994162,0.00085785496,0.0010799664,0.0006886461,0.00049616647,0.0013993471,0.0007693296,0.0011866417,0.0011427859],"category_scores_gemma":[0.00895113,0.00045906976,0.00068139087,0.00065953034,0.0019638613,0.0017328786,0.0020460617,0.0020759827,0.00018658835],"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.00008126093,0.00006467833,0.00062993827,0.00014893682,0.000044657783,0.00009832122,0.00014895826,0.7820693,0.005748423,0.17813314,0.0013587124,0.031473514],"study_design_scores_gemma":[0.0000072077946,0.000025894504,0.00012639335,0.000009416007,0.0000033715403,0.000029899338,0.00001551996,0.9450596,0.0012082567,0.052988518,0.00051986106,0.000006072339],"about_ca_topic_score_codex":0.0011020945,"about_ca_topic_score_gemma":0.0009383328,"teacher_disagreement_score":0.0023994162,"about_ca_system_score_codex":0.0011068728,"about_ca_system_score_gemma":0.0009290989,"threshold_uncertainty_score":0.012689471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029651576,0.00008911308,0.9948749,0.000071945666,0.00003248606,0.000035846275,0.000031244337,0.00074277795,0.0011565753],"genre_scores_gemma":[0.1387384,0.0002176953,0.8566882,0.0002283434,0.000056782927,0.00038910314,0.00034010448,0.00036268018,0.0029786523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958855,0.00010850729,0.00002261211,0.000074491305,0.00016533445,0.000040568913],"domain_scores_gemma":[0.9993955,0.00027590294,0.000054552747,0.0000935629,0.00014024775,0.000040203387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071629824,0.0010041001,0.0009198898,0.0006794824,0.00046764847,0.0006243355,0.0014187294,0.00075030647,0.0030130625],"category_scores_gemma":[0.0018512047,0.00039508374,0.0005026598,0.00083385187,0.0006190691,0.0012601442,0.001697879,0.0013543023,0.0010259433],"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.00012834586,0.00010201745,0.0004127356,0.000099998484,0.00004823727,0.00008073163,0.000050252384,0.71943426,0.005155046,0.017367814,0.008360264,0.24876024],"study_design_scores_gemma":[0.000023336981,0.000025431487,0.00003179858,0.0000037173559,0.0000030555514,0.00001924439,0.0000049510063,0.9934325,0.0008087724,0.0041169575,0.0015266303,0.0000036737667],"about_ca_topic_score_codex":0.0029822774,"about_ca_topic_score_gemma":0.0042361673,"teacher_disagreement_score":0.0030130625,"about_ca_system_score_codex":0.00049135124,"about_ca_system_score_gemma":0.001505256,"threshold_uncertainty_score":0.0100797415},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058639865,0.0013860074,0.92707014,0.0013428726,0.000099989826,0.000112346446,0.00028818595,0.0007130341,0.010347482],"genre_scores_gemma":[0.88623875,0.0024896218,0.0950172,0.0007912103,0.0004653706,0.0007450841,0.0009536007,0.0008472135,0.012451826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978124,0.00059421075,0.000081244194,0.0003967787,0.0007356855,0.0003795959],"domain_scores_gemma":[0.93913645,0.04492926,0.006119644,0.003671469,0.004538714,0.001604526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062525044,0.0015489756,0.0014528822,0.002897464,0.0012816149,0.0024343599,0.0022627574,0.001824137,0.009598839],"category_scores_gemma":[0.062665716,0.00091505476,0.0009600958,0.0015281251,0.0043103574,0.0072970553,0.002336126,0.005086727,0.0013217448],"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.00035294273,0.0001568235,0.0038961922,0.00043208653,0.00007961933,0.0002514934,0.0006356584,0.2967748,0.009952749,0.6596459,0.0050497013,0.022772066],"study_design_scores_gemma":[0.000015208915,0.00005930587,0.0009039397,0.00008073755,0.000018881701,0.00010881036,0.00006075275,0.898529,0.003039649,0.09589197,0.0012322789,0.00005952118],"about_ca_topic_score_codex":0.0021273345,"about_ca_topic_score_gemma":0.0016169955,"teacher_disagreement_score":0.009598839,"about_ca_system_score_codex":0.003574744,"about_ca_system_score_gemma":0.0018731101,"threshold_uncertainty_score":0.03306675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009499181,0.00038352518,0.9852158,0.00032403326,0.00004017671,0.00005353077,0.00014341666,0.000111139205,0.00422918],"genre_scores_gemma":[0.42341518,0.0017333099,0.5637295,0.0002738244,0.0002890138,0.0006874799,0.000985209,0.00032816213,0.008558245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988159,0.0006157755,0.000043806394,0.00015729739,0.00026908267,0.00009817319],"domain_scores_gemma":[0.99532086,0.0038173867,0.0003223111,0.00014876555,0.00028746008,0.00010321634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018803495,0.0017983998,0.0011589449,0.0005734209,0.000370211,0.0011514188,0.0008847834,0.0010882543,0.0031516952],"category_scores_gemma":[0.006836253,0.0006157194,0.0009632789,0.001306131,0.0011608956,0.0012560723,0.0013589348,0.0028664635,0.0006281416],"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.00008178137,0.000078648525,0.0002192107,0.00020327012,0.000036883484,0.00008681497,0.00006732659,0.9149042,0.0010536589,0.053951845,0.0022766704,0.02703978],"study_design_scores_gemma":[0.000011737848,0.000027822103,0.000034757668,0.000008785886,0.0000038010776,0.000014112187,0.000018156785,0.98103863,0.00026056374,0.018036408,0.00054120016,0.000004056093],"about_ca_topic_score_codex":0.0020241549,"about_ca_topic_score_gemma":0.0026546852,"teacher_disagreement_score":0.0031516952,"about_ca_system_score_codex":0.0006542478,"about_ca_system_score_gemma":0.0012805174,"threshold_uncertainty_score":0.010543466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027707193,0.00007579824,0.9701635,0.00007407571,0.000018994975,0.00004890319,0.000016252889,0.00012290322,0.0017723322],"genre_scores_gemma":[0.26326317,0.000106293315,0.7312488,0.000065141765,0.000018663963,0.00011460092,0.00012590195,0.0001219661,0.0049355333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992836,0.00018560357,0.000057028858,0.0001095294,0.00024787732,0.00011634829],"domain_scores_gemma":[0.99841607,0.0006576411,0.00013873164,0.0002843796,0.0003617142,0.00014147555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024324753,0.00063985825,0.00085525704,0.0009331124,0.0010566808,0.0011876391,0.0011774786,0.00097109674,0.0029654345],"category_scores_gemma":[0.0055640275,0.00036989313,0.0008184435,0.0006702045,0.0016955965,0.0020659724,0.0021736368,0.0016132533,0.0005095874],"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.00042323305,0.00011616951,0.0029663371,0.00016947996,0.00005468167,0.00032770057,0.0006311773,0.2668355,0.011288125,0.45121405,0.0020255235,0.26394802],"study_design_scores_gemma":[0.00002742285,0.00011792379,0.00029104867,0.000027390572,0.000010754377,0.00011814307,0.00011113258,0.9154867,0.0067080418,0.074338175,0.002739581,0.00002370834],"about_ca_topic_score_codex":0.0031410588,"about_ca_topic_score_gemma":0.0036784846,"teacher_disagreement_score":0.0031410588,"about_ca_system_score_codex":0.0010675824,"about_ca_system_score_gemma":0.0019671135,"threshold_uncertainty_score":0.012864351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009102214,0.0001463105,0.990099,0.000060200524,0.000009948022,0.000018738036,0.000016033928,0.00014299103,0.0004045326],"genre_scores_gemma":[0.42574137,0.00042797578,0.57101095,0.00008940936,0.000058139074,0.000166544,0.00024544366,0.0002149943,0.0020451434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.00013632562,0.000014983573,0.00006691607,0.00012592148,0.000030697596],"domain_scores_gemma":[0.9990464,0.000581858,0.000101427286,0.00009622818,0.00013753127,0.000036505327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010642877,0.0010100728,0.0009839095,0.00069757923,0.0003225469,0.00054473506,0.00078281865,0.00074698793,0.001275053],"category_scores_gemma":[0.004290654,0.0004335974,0.0007428798,0.0006601954,0.0009637383,0.0009950498,0.00078906066,0.001153175,0.0003926872],"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.00009966579,0.000038836242,0.0008352653,0.00010750471,0.000040472245,0.00006941655,0.000079001315,0.9139754,0.005036036,0.025871595,0.0010383695,0.05280845],"study_design_scores_gemma":[0.0000021875035,0.000016125203,0.0000400251,0.0000025304385,0.0000015415555,0.000007650145,0.000003087058,0.99700195,0.00045890827,0.0022433985,0.00022053458,0.000002000627],"about_ca_topic_score_codex":0.0032203314,"about_ca_topic_score_gemma":0.0029814963,"teacher_disagreement_score":0.0032203314,"about_ca_system_score_codex":0.00078261574,"about_ca_system_score_gemma":0.0008375803,"threshold_uncertainty_score":0.006403148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027518105,0.00008777287,0.9943817,0.00012782,0.000051497387,0.000019674066,0.000032464442,0.00018395812,0.0023632525],"genre_scores_gemma":[0.24169056,0.000509805,0.74357337,0.0004539288,0.00022975642,0.0003166529,0.0003287326,0.00064194686,0.012255195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.00026137824,0.000030176989,0.000099221135,0.00025763802,0.00006924757],"domain_scores_gemma":[0.99918073,0.00026172525,0.000073964155,0.00019782718,0.0002093309,0.00007641865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348024,0.00081913284,0.0008250181,0.0005108307,0.0004798355,0.0009081197,0.00060518534,0.00091434666,0.005052785],"category_scores_gemma":[0.0040929243,0.00034795085,0.00057792815,0.00052415853,0.0012766777,0.0010431758,0.002138655,0.0024670276,0.0015318394],"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.00027504406,0.00009395497,0.000699453,0.00029686958,0.00006595174,0.00023974114,0.00020859476,0.25501946,0.03477192,0.5544465,0.010352537,0.1435299],"study_design_scores_gemma":[0.00002527362,0.00005714819,0.00013979447,0.00002208592,0.0000074821346,0.00006885773,0.000014146302,0.9226864,0.0072493446,0.061532497,0.008182159,0.000014757447],"about_ca_topic_score_codex":0.0011434784,"about_ca_topic_score_gemma":0.0013857142,"teacher_disagreement_score":0.005052785,"about_ca_system_score_codex":0.0005620768,"about_ca_system_score_gemma":0.0010961916,"threshold_uncertainty_score":0.016903222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057773188,0.01898579,0.7144444,0.008423519,0.0020177537,0.00011584537,0.0005756312,0.00022775386,0.19743608],"genre_scores_gemma":[0.60871804,0.011964032,0.32812327,0.0019091333,0.0025318298,0.00023279218,0.0005779217,0.0004241323,0.045518838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822634,0.00050117075,0.00012315545,0.00035095698,0.0006139512,0.00018444797],"domain_scores_gemma":[0.99729365,0.0010713895,0.00031086474,0.0005221135,0.00050372054,0.0002981875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160754,0.00075251475,0.00092935085,0.0023931956,0.0018168576,0.004081542,0.0008905517,0.0013140186,0.003895054],"category_scores_gemma":[0.0058274637,0.00043186898,0.0012642912,0.002218808,0.005897749,0.011483592,0.003358024,0.0040382156,0.0010882335],"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.0000049836467,0.0000047953413,0.000051997,0.000013256168,0.0000013577022,0.000012984902,0.000107543594,0.0002654677,0.00011389696,0.99561715,0.00038733202,0.0034193604],"study_design_scores_gemma":[0.0000048557777,0.000019881478,0.0000866826,0.000032723263,0.0000039816955,0.000058659876,0.00006395891,0.0021586218,0.00031413062,0.9764074,0.02083512,0.000013880608],"about_ca_topic_score_codex":0.0012744531,"about_ca_topic_score_gemma":0.0013044631,"teacher_disagreement_score":0.004081542,"about_ca_system_score_codex":0.0019017308,"about_ca_system_score_gemma":0.0014179392,"threshold_uncertainty_score":0.016715884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024146521,0.00005144895,0.9960828,0.00013308722,0.00001724371,0.000030226362,0.000024973031,0.000076664044,0.0011689448],"genre_scores_gemma":[0.31687653,0.00021656536,0.67635524,0.00021788935,0.00006527087,0.00043384032,0.00015116419,0.00015050266,0.0055329967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900097,0.00040038532,0.000030119101,0.00020138612,0.00026532973,0.00010176332],"domain_scores_gemma":[0.9990207,0.00060720457,0.0000798466,0.00013150889,0.00010143106,0.000059334572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018769198,0.0010405945,0.00095456926,0.0005078812,0.00066846656,0.0011669169,0.0013981682,0.0014943378,0.0027954744],"category_scores_gemma":[0.003846985,0.00058763736,0.0008797492,0.0008304505,0.0015880935,0.0012526923,0.0019866934,0.002370919,0.0004922689],"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.00007798749,0.000042972246,0.00016919279,0.00006457275,0.000029722321,0.00005907236,0.00008021752,0.90776056,0.0022320938,0.06361841,0.0013711702,0.024494052],"study_design_scores_gemma":[0.00001478896,0.000024083962,0.000024528967,0.000005213929,0.0000040014343,0.00001327888,0.000008795355,0.9726854,0.0005261735,0.025720319,0.0009692022,0.0000042334887],"about_ca_topic_score_codex":0.002323398,"about_ca_topic_score_gemma":0.0019682092,"teacher_disagreement_score":0.0027954744,"about_ca_system_score_codex":0.0013154591,"about_ca_system_score_gemma":0.001918674,"threshold_uncertainty_score":0.0099262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025316168,0.0013699221,0.9544961,0.0007056436,0.00012649539,0.00010530381,0.00026993352,0.00027537486,0.0173351],"genre_scores_gemma":[0.6295315,0.0026431552,0.34830153,0.0010428042,0.00033568396,0.0005360594,0.0011083081,0.00045783204,0.016043102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.0005549527,0.00006628679,0.00031683702,0.000418812,0.00015520462],"domain_scores_gemma":[0.99723357,0.0018741401,0.0002894617,0.00015460247,0.0002682166,0.00018004738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020997638,0.0017323978,0.0012657999,0.00075340347,0.0007784134,0.0023227602,0.0009496241,0.0014239142,0.0060546254],"category_scores_gemma":[0.006186182,0.0008760248,0.001218339,0.0013713607,0.0022714639,0.002418544,0.002121292,0.003870733,0.00077925547],"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.00013759432,0.00015867414,0.0007976628,0.0003999985,0.00008603932,0.00049647584,0.00022130585,0.5385119,0.0022973367,0.41118184,0.008559188,0.03715198],"study_design_scores_gemma":[0.000025857595,0.00007224069,0.00015583822,0.000050828352,0.000012662883,0.00010191603,0.000045411623,0.7837049,0.00059392495,0.21189734,0.0033175573,0.000021485841],"about_ca_topic_score_codex":0.0026378967,"about_ca_topic_score_gemma":0.0026865746,"teacher_disagreement_score":0.0060546254,"about_ca_system_score_codex":0.0012690979,"about_ca_system_score_gemma":0.0014464498,"threshold_uncertainty_score":0.02025479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047703,0.00023156966,0.9494162,0.00011899716,0.000023879915,0.000041683867,0.000021573747,0.00027065698,0.0021723283],"genre_scores_gemma":[0.6755293,0.00023244481,0.32051837,0.00013650334,0.00002332768,0.000257734,0.000074554664,0.00015763861,0.0030700145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997428,0.00012500274,0.000009826762,0.000029593455,0.00006404982,0.000028771834],"domain_scores_gemma":[0.998784,0.0009440225,0.000090637775,0.000072943636,0.00006570028,0.00004266475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011946178,0.0006297877,0.00104468,0.0004726805,0.00034187926,0.0007007625,0.00069556915,0.0009582406,0.0014237671],"category_scores_gemma":[0.0030088024,0.0005365819,0.000577309,0.00024090802,0.0012080335,0.0005987019,0.0014283207,0.0009059276,0.00022699728],"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.000054540018,0.000017029459,0.00033660387,0.00004717903,0.000017746348,0.000041218464,0.00004190687,0.98141634,0.0013232173,0.0066206628,0.00015483696,0.009928656],"study_design_scores_gemma":[0.0000069623634,0.000013916663,0.000023529014,0.0000059082167,0.0000019098977,0.0000041194658,0.0000044664466,0.9975777,0.00034991358,0.0018615646,0.00014815135,0.0000018280978],"about_ca_topic_score_codex":0.0020992456,"about_ca_topic_score_gemma":0.0014757288,"teacher_disagreement_score":0.0020992456,"about_ca_system_score_codex":0.00044734636,"about_ca_system_score_gemma":0.0007227279,"threshold_uncertainty_score":0.0063177943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06830971,0.0039243973,0.8980989,0.0035110419,0.00031294872,0.00012955976,0.00015966472,0.00041651767,0.025137259],"genre_scores_gemma":[0.4919531,0.0036481177,0.47994477,0.0017056658,0.00037373826,0.00041101058,0.00067182066,0.001352956,0.019938864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942926,0.0037628305,0.00016447905,0.00048304943,0.000947346,0.00034956096],"domain_scores_gemma":[0.9364835,0.053959087,0.0019990592,0.0016512865,0.0045488924,0.0013581493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017487742,0.0019057982,0.0017063771,0.0025904113,0.0019453899,0.0028443336,0.002573793,0.0036129153,0.004799499],"category_scores_gemma":[0.06325123,0.0009295226,0.0014589778,0.0018357324,0.004762623,0.005099419,0.002958928,0.0040636463,0.0007808272],"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.00080647395,0.0002518075,0.003571867,0.00042336286,0.00012524801,0.00022606467,0.00056962034,0.40467006,0.0046697664,0.5344492,0.008448157,0.04178842],"study_design_scores_gemma":[0.0000317523,0.00007799018,0.00030006203,0.0000996649,0.000015689653,0.000053583568,0.00005191873,0.9446926,0.0007627441,0.05307677,0.0008088,0.000028350369],"about_ca_topic_score_codex":0.010993763,"about_ca_topic_score_gemma":0.007656431,"teacher_disagreement_score":0.017487742,"about_ca_system_score_codex":0.0032840944,"about_ca_system_score_gemma":0.0049876054,"threshold_uncertainty_score":0.09248519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008828743,0.0006294365,0.96647257,0.0006621539,0.000252349,0.000026420374,0.000107580425,0.00025012603,0.022770563],"genre_scores_gemma":[0.42227492,0.0033037688,0.47490236,0.001938505,0.0009943695,0.000213541,0.0005244326,0.0012572615,0.094590925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988174,0.0003059486,0.00004662208,0.00026798062,0.00041507985,0.00014696973],"domain_scores_gemma":[0.99861646,0.00036537516,0.00011304932,0.00023145787,0.0004772365,0.00019638368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017836891,0.0010704476,0.0010476006,0.0014807082,0.0011709745,0.0021901515,0.0013501286,0.0017077504,0.0117570935],"category_scores_gemma":[0.005441579,0.0004488022,0.0010758656,0.0011294478,0.0024615184,0.0037782968,0.0034243977,0.0027986264,0.003966885],"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.000033751814,0.00002013463,0.00017428985,0.000076629665,0.000027004002,0.000073850504,0.000108144435,0.029835287,0.0031087864,0.92739964,0.0053294604,0.03381301],"study_design_scores_gemma":[0.000011605205,0.000094564275,0.00023628076,0.00004546434,0.000022739318,0.00023003883,0.0000585925,0.19223325,0.0031719438,0.7726847,0.031161916,0.000048873906],"about_ca_topic_score_codex":0.0012692714,"about_ca_topic_score_gemma":0.0015064153,"teacher_disagreement_score":0.0117570935,"about_ca_system_score_codex":0.0011427324,"about_ca_system_score_gemma":0.0013872433,"threshold_uncertainty_score":0.039331436},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013234629,0.0002568034,0.99619055,0.00017554189,0.00002993109,0.000016686763,0.000027898575,0.00003720312,0.0019419611],"genre_scores_gemma":[0.14522235,0.0014211978,0.8440383,0.0004126259,0.0003706896,0.0003520356,0.00031093677,0.00032954352,0.007542287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985915,0.0006376984,0.00004762747,0.00024534544,0.00035650464,0.00012133278],"domain_scores_gemma":[0.99857545,0.0009020128,0.00013976512,0.00014721493,0.00016011485,0.0000755098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033070839,0.0020982458,0.0016010473,0.0010614146,0.00051277183,0.0020184633,0.0020399524,0.001696533,0.002859143],"category_scores_gemma":[0.005195043,0.001101193,0.0016344251,0.0012432395,0.0026814397,0.0025210907,0.0033710438,0.005136676,0.00074964826],"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.00005683754,0.00007595722,0.00027036984,0.00024782258,0.00007972686,0.00009509596,0.00016650703,0.63243335,0.0028605303,0.32345727,0.0032711478,0.036985394],"study_design_scores_gemma":[0.00000904065,0.000027471599,0.000039558498,0.000024964249,0.000010017027,0.000028821743,0.00001807643,0.9348976,0.0009097578,0.061049987,0.002974483,0.000010298784],"about_ca_topic_score_codex":0.0019178569,"about_ca_topic_score_gemma":0.001621729,"teacher_disagreement_score":0.0033070839,"about_ca_system_score_codex":0.0014321957,"about_ca_system_score_gemma":0.0016117708,"threshold_uncertainty_score":0.01748979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04089172,0.00044705265,0.8789774,0.0008868576,0.0002549369,0.0003233282,0.0006821574,0.00071103557,0.076825485],"genre_scores_gemma":[0.3404179,0.00047854803,0.6355808,0.0006448263,0.00014589797,0.0006422842,0.0016466544,0.00066905626,0.019774083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881077,0.0002920783,0.000057398123,0.00023674662,0.00041796893,0.00018515711],"domain_scores_gemma":[0.998738,0.0006131474,0.00010064884,0.00022688272,0.000243766,0.000077633114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012863373,0.0007861665,0.00069759716,0.0008032607,0.00075263955,0.0023004385,0.0010538889,0.00073486485,0.023378527],"category_scores_gemma":[0.0050730817,0.00041488922,0.001117219,0.0007495882,0.0015444498,0.0026178702,0.0016872133,0.0034939442,0.0031195397],"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.00014941477,0.00012137898,0.0002910584,0.00023634959,0.000027113989,0.00014387618,0.0002388329,0.08666534,0.0040330645,0.8150392,0.008071223,0.084983125],"study_design_scores_gemma":[0.000090973685,0.0002200181,0.0001833841,0.00013754758,0.000024055907,0.000121126875,0.00026906148,0.2635063,0.007432162,0.6907509,0.037236735,0.000027755514],"about_ca_topic_score_codex":0.0011179157,"about_ca_topic_score_gemma":0.0015740591,"teacher_disagreement_score":0.023378527,"about_ca_system_score_codex":0.0012516422,"about_ca_system_score_gemma":0.001132488,"threshold_uncertainty_score":0.07820892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008469348,0.00040732152,0.9821469,0.00048547925,0.00006586417,0.00004693885,0.00013940946,0.000075533026,0.008163084],"genre_scores_gemma":[0.58654755,0.0019494543,0.3924631,0.00064001186,0.00046035563,0.0005872381,0.00093641697,0.00044940299,0.01596648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982376,0.00046539932,0.00010211305,0.00034158787,0.0006356185,0.00021768999],"domain_scores_gemma":[0.997065,0.0018305219,0.00023922561,0.00018614161,0.0005261611,0.00015289703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004166183,0.0013139942,0.001163843,0.0014623572,0.0007874277,0.0020714842,0.0014225595,0.0016257361,0.0057951864],"category_scores_gemma":[0.0066916277,0.0007704139,0.0016231949,0.0007220901,0.0027425573,0.0038794097,0.0022066296,0.004227673,0.0007889836],"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.000022066957,0.00003063098,0.00031870793,0.00014990641,0.00002411921,0.00012085062,0.00015105231,0.07142277,0.004455521,0.91526973,0.0018556627,0.0061789597],"study_design_scores_gemma":[0.000015684793,0.000054458134,0.00036179487,0.000054675915,0.000014320036,0.00010724787,0.00008157183,0.59094423,0.002522871,0.39998195,0.005830001,0.00003111812],"about_ca_topic_score_codex":0.0015717519,"about_ca_topic_score_gemma":0.0019806195,"teacher_disagreement_score":0.0057951864,"about_ca_system_score_codex":0.001633498,"about_ca_system_score_gemma":0.0020133695,"threshold_uncertainty_score":0.022033155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019300219,0.0010247813,0.9721604,0.00030023765,0.00014881152,0.00018424272,0.000041539635,0.00012480201,0.0067149815],"genre_scores_gemma":[0.24530955,0.0016954546,0.73893785,0.0002598361,0.00014086494,0.0005896198,0.00019256744,0.00024434563,0.012629973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917823,0.0002547294,0.000043599808,0.00012887863,0.0003114059,0.00008323403],"domain_scores_gemma":[0.9987821,0.00051577186,0.00008047296,0.00017552989,0.00036048522,0.00008562153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192898,0.0012766789,0.0010900721,0.0014825417,0.0010599323,0.0011635016,0.0014410595,0.0013207626,0.0025941],"category_scores_gemma":[0.0055322545,0.000575263,0.0014090596,0.0011148481,0.0027343885,0.0017216777,0.0034873313,0.0033876963,0.0006138664],"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.00021804242,0.00012580174,0.001619064,0.00046053348,0.000120113335,0.00016770612,0.0011372824,0.16089532,0.0144502735,0.488895,0.0041775904,0.3277332],"study_design_scores_gemma":[0.000052678726,0.00020590282,0.0006815675,0.00007430868,0.00003763131,0.00022343248,0.00015248431,0.87363034,0.0098445695,0.10334349,0.011680223,0.00007334552],"about_ca_topic_score_codex":0.007014588,"about_ca_topic_score_gemma":0.004515291,"teacher_disagreement_score":0.007014588,"about_ca_system_score_codex":0.0016049913,"about_ca_system_score_gemma":0.0019719407,"threshold_uncertainty_score":0.0139475465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057202284,0.00019046607,0.991899,0.00012310556,0.000022300692,0.000034923876,0.000018302424,0.00009949266,0.0018921552],"genre_scores_gemma":[0.63414854,0.00035580219,0.35874638,0.00015012447,0.00008498186,0.00031374634,0.00013399021,0.00020801454,0.0058584767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851435,0.00069867016,0.000063908556,0.0002753053,0.0003212625,0.00012652195],"domain_scores_gemma":[0.9972064,0.001999936,0.00021274605,0.00016343663,0.00033200035,0.00008542777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041883076,0.0017169636,0.0018597427,0.0006854146,0.00049586955,0.0013086605,0.0013790769,0.0017217704,0.0031166894],"category_scores_gemma":[0.008090856,0.00087497145,0.0012203744,0.00094597676,0.0014704943,0.0017832494,0.0022584144,0.0023053663,0.00034508636],"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.00003390066,0.00002237944,0.00008326286,0.000042292173,0.000017093662,0.000033273252,0.000025910173,0.9794302,0.0005857813,0.0131884925,0.00018408835,0.0063532833],"study_design_scores_gemma":[0.0000030576618,0.000013532556,0.000010984119,0.0000015846355,0.0000016022004,0.0000027359974,0.0000013365824,0.9975158,0.00016604099,0.002191483,0.0000891952,0.0000026465768],"about_ca_topic_score_codex":0.0054333275,"about_ca_topic_score_gemma":0.002955225,"teacher_disagreement_score":0.0054333275,"about_ca_system_score_codex":0.0011417016,"about_ca_system_score_gemma":0.0012627569,"threshold_uncertainty_score":0.022150159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059879784,0.000999486,0.9235017,0.00055152574,0.00014498681,0.00012866895,0.000086585824,0.000102757134,0.014604421],"genre_scores_gemma":[0.73747694,0.0027826563,0.24660347,0.00046686712,0.00048142317,0.0005748415,0.0002530281,0.00019077463,0.011169976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961124,0.001090601,0.00031300588,0.0012158524,0.0010189533,0.00024915696],"domain_scores_gemma":[0.9900221,0.0062388564,0.00089115783,0.0010054437,0.0012395171,0.00060281623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059580095,0.0010674273,0.0011045134,0.0020709499,0.0013597013,0.0028070936,0.0014761342,0.0015047037,0.0048323353],"category_scores_gemma":[0.019893741,0.0008197348,0.0016395163,0.001239388,0.006246316,0.0083703585,0.005843985,0.0045367386,0.0005147426],"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.000062970226,0.000039878327,0.0007640658,0.0001703366,0.0000679498,0.00025429527,0.00064255856,0.0135433115,0.0033677695,0.95512015,0.0006071074,0.025359755],"study_design_scores_gemma":[0.000022894432,0.00030936176,0.001885357,0.00009493389,0.000054748416,0.00083596684,0.0004388164,0.079428725,0.006472857,0.90132254,0.0090633165,0.00007057316],"about_ca_topic_score_codex":0.00026435603,"about_ca_topic_score_gemma":0.00025008444,"teacher_disagreement_score":0.0059580095,"about_ca_system_score_codex":0.0011260745,"about_ca_system_score_gemma":0.00092516886,"threshold_uncertainty_score":0.03150934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01689122,0.0018871628,0.97631866,0.0016771308,0.000108024804,0.000022949873,0.000091928196,0.00025307262,0.002749929],"genre_scores_gemma":[0.75093937,0.0023386402,0.23702025,0.0011060811,0.0005911176,0.00023469704,0.0002903713,0.000486126,0.0069932747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967231,0.0017708504,0.00013685964,0.0005528229,0.0006539734,0.00016240677],"domain_scores_gemma":[0.9862563,0.011341902,0.00072724844,0.00075253315,0.0006761749,0.00024586206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007670849,0.0013815463,0.0015125774,0.00061883935,0.00055550295,0.002260216,0.001269653,0.0027236782,0.0021132142],"category_scores_gemma":[0.0321009,0.000713091,0.0005507843,0.0006596027,0.002868694,0.0036277939,0.002146033,0.0027667063,0.0005008648],"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.000964119,0.00019469729,0.003121899,0.00067439605,0.00030699975,0.00037695214,0.00025410816,0.581497,0.017558338,0.1870952,0.0094084935,0.1985478],"study_design_scores_gemma":[0.000032485947,0.000109651584,0.00039285197,0.00003502059,0.00002006232,0.000099300974,0.000026785743,0.93738306,0.0020136926,0.05897442,0.00088411005,0.000028575912],"about_ca_topic_score_codex":0.001007391,"about_ca_topic_score_gemma":0.0008755383,"teacher_disagreement_score":0.007670849,"about_ca_system_score_codex":0.0005732712,"about_ca_system_score_gemma":0.0010628541,"threshold_uncertainty_score":0.040567815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033703505,0.00013224468,0.9954443,0.00012493216,0.000031102525,0.000029558867,0.000014046977,0.00015713552,0.0006962694],"genre_scores_gemma":[0.16946368,0.00035382767,0.8256542,0.0002313741,0.00008520304,0.000248648,0.00011135445,0.0002243115,0.0036274083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959785,0.00015564277,0.000014219095,0.000052034957,0.00015049923,0.000029768838],"domain_scores_gemma":[0.9994692,0.00028614208,0.000047547655,0.00007129034,0.000081001635,0.000044802553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094943185,0.00070801406,0.00092692964,0.00047137451,0.00034738338,0.0006246265,0.0012144829,0.0011416341,0.0015405532],"category_scores_gemma":[0.0017746531,0.00044963896,0.0006946877,0.0005023733,0.000932432,0.0008883889,0.0017841392,0.0014937951,0.0005643793],"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.00011543334,0.00008838579,0.00069809577,0.00024198902,0.00008746718,0.00017630144,0.00011393139,0.84658647,0.010802281,0.040131066,0.003740911,0.0972177],"study_design_scores_gemma":[0.000008456958,0.000023965255,0.000038831546,0.0000049911528,0.000002344937,0.000016322325,0.000003456301,0.99462354,0.00081911474,0.003343284,0.0011118726,0.000003827189],"about_ca_topic_score_codex":0.0017552284,"about_ca_topic_score_gemma":0.0018287218,"teacher_disagreement_score":0.0017552284,"about_ca_system_score_codex":0.00036637156,"about_ca_system_score_gemma":0.0010418235,"threshold_uncertainty_score":0.0051535964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028288146,0.008236773,0.94902515,0.0023125915,0.00023902256,0.00007280981,0.0004129345,0.00040619963,0.0110063255],"genre_scores_gemma":[0.42513707,0.016628917,0.5390633,0.0011094098,0.001748072,0.0005321215,0.0015801087,0.00050335325,0.013697686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833447,0.00061981217,0.00009612339,0.00042627516,0.0003666478,0.00015663222],"domain_scores_gemma":[0.9805401,0.016723363,0.00093362463,0.0006855961,0.00075653894,0.0003607678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023837166,0.0015176053,0.0025786797,0.0036393101,0.0017735502,0.005467239,0.0049299346,0.0035041147,0.0050109904],"category_scores_gemma":[0.019892847,0.0018207653,0.0017358052,0.008240855,0.0038252573,0.012620427,0.0029221452,0.0058569806,0.0009876324],"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.00008150657,0.00015963023,0.00071530184,0.0006672021,0.000074218806,0.000080798585,0.00037273092,0.11315574,0.0006591775,0.7948224,0.010397397,0.07881379],"study_design_scores_gemma":[0.000018250134,0.000016885007,0.00013103595,0.00005713448,0.000025595751,0.00008099958,0.0000722723,0.16605543,0.00021244602,0.83100396,0.0023105475,0.000015467549],"about_ca_topic_score_codex":0.0017163785,"about_ca_topic_score_gemma":0.0025884174,"teacher_disagreement_score":0.005467239,"about_ca_system_score_codex":0.0025001063,"about_ca_system_score_gemma":0.001798792,"threshold_uncertainty_score":0.0181396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107472815,0.00018548945,0.8541973,0.00051216135,0.00014742758,0.00011577806,0.00034908674,0.00053431024,0.03648572],"genre_scores_gemma":[0.39568222,0.0002218399,0.5953979,0.000210372,0.000029213374,0.00021659027,0.00034240203,0.00045271957,0.007446807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997236,0.000078300625,0.000010448529,0.000039954797,0.00009783779,0.0000497542],"domain_scores_gemma":[0.9995426,0.00020876982,0.000029049475,0.00010268481,0.000062132756,0.000054805983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055670965,0.00062470394,0.0007366921,0.00051176694,0.00072295836,0.00093981903,0.0012475353,0.00084369007,0.005418395],"category_scores_gemma":[0.0022646906,0.00043205966,0.0006589781,0.00054664136,0.0013941049,0.0012099163,0.0021608914,0.0017892137,0.0010898681],"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.0002155373,0.00010637965,0.0005708953,0.00017539141,0.000019544888,0.000102020604,0.0003164817,0.22110604,0.006066695,0.64555776,0.007897915,0.11786532],"study_design_scores_gemma":[0.000055983648,0.000067556095,0.00007862913,0.000048822214,0.000009113585,0.000051240928,0.00016956766,0.5868565,0.002599704,0.40305194,0.006995134,0.000015802107],"about_ca_topic_score_codex":0.0014346801,"about_ca_topic_score_gemma":0.002691718,"teacher_disagreement_score":0.005418395,"about_ca_system_score_codex":0.0005951764,"about_ca_system_score_gemma":0.000728904,"threshold_uncertainty_score":0.018126309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014587347,0.000433888,0.9825974,0.00028280413,0.00004625817,0.00007187389,0.00008023266,0.00007892664,0.0018212035],"genre_scores_gemma":[0.5831554,0.0011056549,0.40642717,0.00031333906,0.00024018147,0.0008706062,0.0006297825,0.00029578514,0.0069620907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988368,0.00059267867,0.000059278413,0.000158699,0.00022891568,0.0001235632],"domain_scores_gemma":[0.98955625,0.009070645,0.000459578,0.00025687186,0.00037262315,0.0002839597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024396111,0.0014777988,0.002320462,0.0011707318,0.00068836566,0.0014613556,0.0029602326,0.0023288624,0.0036011606],"category_scores_gemma":[0.014756103,0.0016409454,0.001274061,0.001215608,0.0016976657,0.002231093,0.0031580809,0.0022058927,0.00035474738],"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.00011662974,0.000051325427,0.00031564748,0.00015070399,0.000049932016,0.00006922451,0.000052802025,0.96245944,0.00090481143,0.0217086,0.0007758709,0.013344952],"study_design_scores_gemma":[0.0000101334945,0.00001342868,0.00004098152,0.000008671118,0.0000040189875,0.00001063475,0.000005907744,0.9904661,0.00011014422,0.009175578,0.00015015971,0.000004205256],"about_ca_topic_score_codex":0.005699594,"about_ca_topic_score_gemma":0.0039453506,"teacher_disagreement_score":0.005699594,"about_ca_system_score_codex":0.0010389645,"about_ca_system_score_gemma":0.0011364552,"threshold_uncertainty_score":0.012902081},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012576563,0.0020784514,0.9665445,0.0014315291,0.00029567964,0.00010976285,0.00008729719,0.00018397304,0.016692236],"genre_scores_gemma":[0.35676512,0.003052748,0.5981234,0.0010906921,0.00060895213,0.000686735,0.0004446666,0.00058227056,0.03864554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987191,0.00066127634,0.000053431064,0.00017749956,0.0002834069,0.0001053686],"domain_scores_gemma":[0.99658394,0.0023335288,0.00013356052,0.00021944432,0.0005880812,0.0001414784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029968,0.0013524436,0.0012161203,0.0015949331,0.0011917101,0.0018153943,0.0027535902,0.0027461734,0.0064813574],"category_scores_gemma":[0.014400436,0.00062799343,0.00086292136,0.0014880125,0.0027793504,0.0027244801,0.0044725076,0.0033938952,0.0020582215],"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.00026533756,0.000104190774,0.00088316726,0.00028501698,0.000099874735,0.00010644656,0.0002971169,0.26755843,0.0023981459,0.6114824,0.00844819,0.108071804],"study_design_scores_gemma":[0.000038865976,0.000047653073,0.0001715801,0.00004639947,0.000014958368,0.000033111446,0.00002398392,0.86021715,0.0007971872,0.1338807,0.004697974,0.000030409616],"about_ca_topic_score_codex":0.0055007692,"about_ca_topic_score_gemma":0.005479412,"teacher_disagreement_score":0.0064813574,"about_ca_system_score_codex":0.0017228271,"about_ca_system_score_gemma":0.0025670254,"threshold_uncertainty_score":0.021682262},"labels":[],"label_agreement":null}]}