{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":43,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":43,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"0f9774884d15","filters":{"venue":"SIAM Journal on Optimization"}},"results":[{"id":"W2166798101","doi":"10.1137/050623802","title":"Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":462,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Semidefinite programming; Mathematics; Explained sum of squares; Polynomial; Graph; Constraint (computer-aided design); Mathematical optimization; Combinatorics","authors":[{"name":"Hayato Waki","is_ca":false},{"name":"Sunyoung Kim","is_ca":true},{"name":"Masakazu Kojima","is_ca":false},{"name":"Masakazu Muramatsu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02864254912039413,"gpt":0.3143879728623788,"spread":0.2857454237419847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880349,0.0017984,0.001158945,0.0005734209,0.000370211,0.001151419,0.0008847834,0.001088254,0.003151695],"category_scores_gemma":[0.006836253,0.0006157194,0.0009632789,0.001306131,0.001160896,0.001256072,0.001358935,0.002866464,0.0006281416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006542478,"about_ca_system_score_gemma":0.001280517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002024155,"about_ca_topic_score_gemma":0.002654685,"domain_scores_codex":[0.9988159,0.0006157755,0.00004380639,0.0001572974,0.0002690827,0.00009817319],"domain_scores_gemma":[0.9953209,0.003817387,0.0003223111,0.0001487656,0.0002874601,0.0001032163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008178137,0.00007864853,0.0002192107,0.0002032701,0.00003688348,0.00008681497,0.00006732659,0.9149042,0.001053659,0.05395184,0.00227667,0.02703978],"study_design_scores_gemma":[0.00001173785,0.0000278221,0.00003475767,0.000008785886,0.000003801078,0.00001411219,0.00001815678,0.9810386,0.0002605637,0.01803641,0.0005412002,0.000004056093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009499181,0.0003835252,0.9852158,0.0003240333,0.00004017671,0.00005353077,0.0001434167,0.0001111392,0.00422918],"genre_scores_gemma":[0.4234152,0.00173331,0.5637295,0.0002738244,0.0002890138,0.0006874799,0.000985209,0.0003281621,0.008558245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003151695,"threshold_uncertainty_score":0.01054347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986219860","doi":"10.1137/050641983","title":"Approximating K‐means‐type Clustering via Semidefinite Programming","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Semidefinite programming; Cluster analysis; Mathematics; Biclustering; Mathematical optimization; Linear programming; Matrix (chemical analysis); Spectral clustering; Algorithm; Computer science; Correlation clustering; CURE data clustering algorithm","authors":[{"name":"Jiming Peng","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519857273548734,"gpt":0.2395324510064849,"spread":0.2243338782709975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451526,0.001623138,0.001390661,0.0008317751,0.0006505387,0.001381533,0.001506627,0.001549524,0.002527519],"category_scores_gemma":[0.006623043,0.0009372588,0.001065689,0.001246791,0.001517649,0.001615227,0.001446249,0.003024476,0.0007915326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001452688,"about_ca_system_score_gemma":0.001713842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004548074,"about_ca_topic_score_gemma":0.005756875,"domain_scores_codex":[0.9982007,0.0009150529,0.00006655527,0.0002785907,0.000410092,0.0001290595],"domain_scores_gemma":[0.9960397,0.002896786,0.0002894277,0.000233668,0.0004344982,0.000105794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004728554,0.00005755394,0.0002146534,0.00008918329,0.00002282945,0.00003589242,0.00005251217,0.9609562,0.000998926,0.02078453,0.002230201,0.01451029],"study_design_scores_gemma":[0.000004636051,0.000008151864,0.00001832819,0.000003103233,0.000001176081,0.000006179672,0.000007986792,0.9940802,0.0001942581,0.005498393,0.0001747389,0.000002826037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006136537,0.00007875232,0.9917807,0.0001821078,0.00001581538,0.0000354105,0.00007832845,0.0002367709,0.001455433],"genre_scores_gemma":[0.2696442,0.0003670396,0.7244222,0.0003261922,0.00006410952,0.0004541636,0.0008082787,0.0003015735,0.003612131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004548074,"threshold_uncertainty_score":0.01296508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973823738","doi":"10.1137/070687542","title":"The Proximal Average: Basic Theory","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Regular polygon; Convex function; Effective domain; Convex analysis; Proper convex function; Proximal Gradient Methods; Domain (mathematical analysis); Pure mathematics; Function (biology); Convex set; Convex optimization; Mathematical analysis; Geometry","authors":[{"name":"Heinz H. Bauschke","is_ca":false},{"name":"Rafal Goebel","is_ca":false},{"name":"Yves Lucet","is_ca":false},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01126816164200364,"gpt":0.2191056682143998,"spread":0.2078375065723962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002708011,0.0008648722,0.001190967,0.002667994,0.001340105,0.003409613,0.00186805,0.001702132,0.004523398],"category_scores_gemma":[0.006161282,0.0005849043,0.0011005,0.002832997,0.004432963,0.006180914,0.002892035,0.003197797,0.001246599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001844056,"about_ca_system_score_gemma":0.0009596564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116762,"about_ca_topic_score_gemma":0.0005924081,"domain_scores_codex":[0.9987109,0.0004038084,0.00007549383,0.0002914865,0.0004145595,0.0001037578],"domain_scores_gemma":[0.9981951,0.001040518,0.0001253802,0.000176022,0.0003424079,0.0001205065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003166766,0.0000041963,0.00006176476,0.00003388599,0.000006371144,0.00001805561,0.00004221687,0.003282445,0.0001171544,0.9907507,0.0005877896,0.005092191],"study_design_scores_gemma":[0.000003487433,0.00001656738,0.000105249,0.00002510353,0.000007399383,0.00007734969,0.00002939525,0.02845102,0.0002256512,0.9605867,0.01046136,0.00001068367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008614019,0.004556994,0.9541401,0.001143433,0.0002381932,0.0000348245,0.0001645113,0.00009898359,0.031009],"genre_scores_gemma":[0.5949412,0.02005077,0.3463362,0.001304641,0.003124946,0.0004658192,0.000524874,0.0003173677,0.0329342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004523398,"threshold_uncertainty_score":0.01513225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092554297","doi":"10.1137/060675320","title":"Exact Regularization of Convex Programs","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Mathematics; Regularization perspectives on support vector machines; Regular polygon; Proximal gradient methods for learning; Lagrange multiplier; Applied mathematics; Exact solutions in general relativity; Degenerate energy levels; Convex optimization; Backus–Gilbert method; Semidefinite programming; Mathematical optimization; Mathematical analysis; Subderivative; Tikhonov regularization; Inverse problem; Computer science; Geometry; Physics","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Paul Tseng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01231304077871429,"gpt":0.2311079300959838,"spread":0.2187948893172695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399416,0.000857855,0.001079966,0.0006886461,0.0004961665,0.001399347,0.0007693296,0.001186642,0.001142786],"category_scores_gemma":[0.00895113,0.0004590698,0.0006813909,0.0006595303,0.001963861,0.001732879,0.002046062,0.002075983,0.0001865884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106873,"about_ca_system_score_gemma":0.0009290989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001102095,"about_ca_topic_score_gemma":0.0009383328,"domain_scores_codex":[0.9979231,0.0008805904,0.00008194501,0.0003331197,0.0006058076,0.000175565],"domain_scores_gemma":[0.9968678,0.001866929,0.0003608283,0.0004060877,0.0003819648,0.0001164301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008126093,0.00006467833,0.0006299383,0.0001489368,0.00004465778,0.00009832122,0.0001489583,0.7820693,0.005748423,0.1781331,0.001358712,0.03147351],"study_design_scores_gemma":[0.000007207795,0.0000258945,0.0001263934,0.000009416007,0.00000337154,0.00002989934,0.00001551996,0.9450596,0.001208257,0.05298852,0.0005198611,0.000006072339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03492878,0.0002786707,0.9603574,0.0002972775,0.00001751611,0.00003265333,0.00004432546,0.0001345991,0.003908735],"genre_scores_gemma":[0.770453,0.0005189669,0.223571,0.000297662,0.00007320007,0.0002151515,0.0002307442,0.0001806126,0.004459669],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002399416,"threshold_uncertainty_score":0.01268947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059707428","doi":"10.1137/s1052623497321432","title":"Approximating the Single-Sink Link-Installation Problem in Network Design","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sink (geography); Mathematical optimization; Network planning and design; Graph; Mathematics; Topology (electrical circuits); Upper and lower bounds; Computer science; Combinatorics; Computer network","authors":[{"name":"F. Sibel Salman","is_ca":false},{"name":"Joseph Cheriyan","is_ca":true},{"name":"R. Ravi","is_ca":false},{"name":"Sairam Subramanian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02689754769041781,"gpt":0.2163742663813543,"spread":0.1894767186909365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002928012,0.001694957,0.001932768,0.001174785,0.0009382626,0.001721935,0.002283213,0.002288833,0.006772333],"category_scores_gemma":[0.01564653,0.0008955247,0.001199468,0.001808132,0.00162812,0.00438606,0.001829169,0.002593191,0.0008563668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002079834,"about_ca_system_score_gemma":0.001572092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002874374,"about_ca_topic_score_gemma":0.004074696,"domain_scores_codex":[0.9983772,0.0008366063,0.00005049955,0.0002856828,0.0002555338,0.0001944963],"domain_scores_gemma":[0.9905398,0.007966354,0.0004505882,0.0004871944,0.0003517788,0.0002043037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001570686,0.0001213803,0.0009688592,0.0002647801,0.00004239076,0.00008941754,0.0001044226,0.9167073,0.0006581881,0.05000369,0.003834344,0.02704814],"study_design_scores_gemma":[0.00003574099,0.00007188803,0.000168926,0.00003124984,0.00001660285,0.00004944969,0.00004566136,0.9327754,0.0003653833,0.0648398,0.001591398,0.000008460601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06340972,0.0009903806,0.9188752,0.001721499,0.0001210561,0.0001883457,0.0003234431,0.000387606,0.01398277],"genre_scores_gemma":[0.4710369,0.00129073,0.5187557,0.0005027165,0.000192772,0.0004629301,0.0007104847,0.0002858876,0.00676194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006772333,"threshold_uncertainty_score":0.02265573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073044751","doi":"10.1137/s1052623499360616","title":"Erratum: Weak Sharp Solutions of Variational Inequalities","year":2000,"lang":"en","type":"erratum","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Daoli Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02456082120706668,"gpt":0.251635378998436,"spread":0.2270745577913693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002866571,0.002149106,0.001411436,0.002792018,0.003186495,0.002624423,0.002304989,0.003870624,0.05083478],"category_scores_gemma":[0.03912772,0.000825829,0.00113518,0.002387678,0.00167954,0.003532922,0.001343768,0.005949847,0.02745317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002439438,"about_ca_system_score_gemma":0.002413203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005819987,"about_ca_topic_score_gemma":0.006750775,"domain_scores_codex":[0.9975063,0.0004615292,0.0005113891,0.000417609,0.0009484938,0.0001546377],"domain_scores_gemma":[0.9868011,0.00400667,0.0005411603,0.001026662,0.007262637,0.0003618303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006673382,0.00001170807,0.00007857259,0.0001248957,0.000008670696,0.0001937391,0.00003818677,0.0001336245,0.0001048643,0.005995889,0.9813674,0.01187572],"study_design_scores_gemma":[0.00005367198,0.00005432822,0.0005200175,0.000376002,0.00004629683,0.0005308444,0.0001008728,0.001012196,0.0008609896,0.01389917,0.9824886,0.00005697774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0008770004,0.004321621,0.009447668,0.08005221,0.8774118,0.0000813705,0.002182298,0.000753353,0.02487263],"genre_scores_gemma":[0.04405758,0.01849057,0.03755404,0.1243067,0.2098098,0.0004395365,0.008773435,0.004192661,0.5523757],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.05083478,"threshold_uncertainty_score":0.1700593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067796483","doi":"10.1137/130915315","title":"Distributionally Robust Stochastic Knapsack Problem","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Knapsack problem; Mathematical optimization; Continuous knapsack problem; Mathematics; Change-making problem; Relaxation (psychology); Stochastic programming; Robust optimization; Constraint (computer-aided design); Semidefinite programming; Independence (probability theory); Random variable; Upper and lower bounds","authors":[{"name":"Jianqiang Cheng","is_ca":false},{"name":"Erick Delage","is_ca":true},{"name":"Abdel Lisser","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04645706831941011,"gpt":0.3180986947574208,"spread":0.2716416264380107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005388277,0.002018686,0.003257772,0.001191878,0.0007606992,0.002940072,0.002941185,0.002819443,0.00402029],"category_scores_gemma":[0.01198717,0.0009950579,0.001694452,0.001862335,0.001744301,0.002934334,0.002550928,0.002593344,0.0007635473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001659216,"about_ca_system_score_gemma":0.002091163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002916834,"about_ca_topic_score_gemma":0.001717784,"domain_scores_codex":[0.9939172,0.002340653,0.000379892,0.00147942,0.001277021,0.0006059025],"domain_scores_gemma":[0.9933305,0.003974337,0.001049085,0.000566998,0.0007963515,0.0002827725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006689154,0.00006067765,0.0002616465,0.00009352707,0.0000609425,0.000118506,0.0000294413,0.9480433,0.0006881114,0.03795247,0.0009292573,0.0116951],"study_design_scores_gemma":[0.00001015034,0.00005418466,0.00009844397,0.00001031165,0.00001086743,0.00004401104,0.00001807988,0.9664907,0.0003490326,0.03226781,0.0006320933,0.00001438772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0121504,0.000301055,0.9827673,0.0004070072,0.00007690294,0.00008081994,0.0002707712,0.0001478885,0.0037979],"genre_scores_gemma":[0.7299578,0.001069625,0.2553147,0.0005011806,0.0003456413,0.0005364041,0.001452675,0.0002953984,0.01052655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005388277,"threshold_uncertainty_score":0.02849627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093590551","doi":"10.1137/040621600","title":"SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Semidefinite programming; Scalability; Relaxation (psychology); Algorithm; Mathematics; Set (abstract data type); Mathematical optimization; Sequence (biology); Selection (genetic algorithm); Computer science; Artificial intelligence; Computer network","authors":[{"name":"Holly Hui Jin","is_ca":false},{"name":"Michael A. Saunders","is_ca":false},{"name":"Yinyu Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008219891805363337,"gpt":0.2042610587520436,"spread":0.1960411669466803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007162982,0.0010041,0.0009198898,0.0006794824,0.0004676485,0.0006243355,0.001418729,0.0007503065,0.003013063],"category_scores_gemma":[0.001851205,0.0003950837,0.0005026598,0.0008338519,0.0006190691,0.001260144,0.001697879,0.001354302,0.001025943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004913512,"about_ca_system_score_gemma":0.001505256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982277,"about_ca_topic_score_gemma":0.004236167,"domain_scores_codex":[0.9995885,0.0001085073,0.00002261211,0.0000744913,0.0001653345,0.00004056891],"domain_scores_gemma":[0.9993955,0.0002759029,0.00005455275,0.0000935629,0.0001402478,0.00004020339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001283459,0.0001020175,0.0004127356,0.00009999848,0.00004823727,0.00008073163,0.00005025238,0.7194343,0.005155046,0.01736781,0.008360264,0.2487602],"study_design_scores_gemma":[0.00002333698,0.00002543149,0.00003179858,0.000003717356,0.000003055551,0.00001924439,0.000004951006,0.9934325,0.0008087724,0.004116958,0.00152663,0.000003673767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002965158,0.00008911308,0.9948749,0.00007194567,0.00003248606,0.00003584627,0.00003124434,0.0007427779,0.001156575],"genre_scores_gemma":[0.1387384,0.0002176953,0.8566882,0.0002283434,0.00005678293,0.0003891031,0.0003401045,0.0003626802,0.002978652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003013063,"threshold_uncertainty_score":0.01007974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006905759","doi":"10.1137/s1052623401398120","title":"A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Quadratic growth; Mathematics; Quadratically constrained quadratic program; Quadratic programming; Second-order cone programming; Mathematical optimization; Rate of convergence; Quadratic equation; Differentiable function; Convex optimization; Interior point method; Sequential quadratic programming; Quadratic function; Function (biology); Convergence (economics); Regular polygon; Algorithm; Computer science; Mathematical analysis","authors":[{"name":"Masao Fukushima","is_ca":false},{"name":"Zhi‐Quan Luo","is_ca":true},{"name":"Paul Tseng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06237039632763324,"gpt":0.3968067002934668,"spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235641,0.0008771059,0.000862314,0.0004543902,0.0004603156,0.0005793858,0.001095336,0.0006857889,0.006374431],"category_scores_gemma":[0.001425082,0.000409328,0.0007863538,0.0007251799,0.000640763,0.0007699497,0.001184165,0.001519266,0.002316313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004022424,"about_ca_system_score_gemma":0.001434763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326051,"about_ca_topic_score_gemma":0.002995639,"domain_scores_codex":[0.9993938,0.000160034,0.00002207979,0.00007663852,0.0003176739,0.0000297782],"domain_scores_gemma":[0.9996114,0.0001597225,0.00003078997,0.00004358341,0.0001196729,0.00003485323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001404962,0.0001392813,0.00039979,0.0005016678,0.00009873048,0.0001935056,0.0001239376,0.4868859,0.01840137,0.09194363,0.01449517,0.3866765],"study_design_scores_gemma":[0.00002170866,0.0000671344,0.00005579422,0.00001047814,0.000008680659,0.00006400654,0.000004963731,0.9792595,0.001346911,0.009056599,0.01009485,0.000009370175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005078146,0.00007616133,0.9980085,0.00004838772,0.00003387751,0.00002133614,0.00001637712,0.0001206822,0.001166747],"genre_scores_gemma":[0.04090634,0.0003030977,0.9517169,0.0001101907,0.0001046166,0.0002248919,0.0001599697,0.0002483481,0.006225582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006374431,"threshold_uncertainty_score":0.02132457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001096515","doi":"10.1137/130940670","title":"Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Non-negative matrix factorization; Separable space; Hyperspectral imaging; Mathematics; Semidefinite programming; Matrix (chemical analysis); Matrix decomposition; Algorithm; Factorization; Mathematical optimization; Artificial intelligence; Computer science; Eigenvalues and eigenvectors","authors":[{"name":"Nicolas Gillis","is_ca":false},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04063804245902447,"gpt":0.2752400860279042,"spread":0.2346020435688798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379717,0.001257918,0.001002744,0.0003828021,0.0003498758,0.0007292537,0.0006092521,0.0008241154,0.003725455],"category_scores_gemma":[0.00415092,0.0003631752,0.0006764508,0.000626236,0.001139316,0.001302597,0.001245354,0.002219586,0.0008454907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003421127,"about_ca_system_score_gemma":0.0009869062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001041946,"about_ca_topic_score_gemma":0.001778408,"domain_scores_codex":[0.9992792,0.0003090034,0.00003562132,0.000125761,0.0002002464,0.00005022793],"domain_scores_gemma":[0.9985246,0.0008323605,0.0001422525,0.0002183664,0.0002123958,0.0000700465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001592256,0.0001605715,0.0003373144,0.0003156906,0.00005805662,0.0002244572,0.0001742073,0.7610947,0.03716789,0.091987,0.006615494,0.1017053],"study_design_scores_gemma":[0.00001098955,0.00002909193,0.0000363437,0.000005830516,0.000002303973,0.00002350897,0.000009116893,0.9850351,0.002137872,0.01178114,0.0009232325,0.000005462085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004302399,0.00004266423,0.9944558,0.00008841312,0.00002402157,0.00001644098,0.0000257398,0.0001361063,0.0009085942],"genre_scores_gemma":[0.1663385,0.0002223246,0.8302611,0.0002305205,0.0001060691,0.0001855691,0.0002950431,0.0002351671,0.002125818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003725455,"threshold_uncertainty_score":0.01246291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534354577","doi":"10.1137/s1052623402419789","title":"A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"MINOS; Augmented Lagrangian method; Mathematics; Mathematical optimization; Robustness (evolution); Nonlinear system; Nonlinear programming; Lagrangian; Constrained optimization; MATLAB; Constrained optimization problem; Optimization problem; Applied mathematics; Computer science","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Michael A. Saunders","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03817071064495997,"gpt":0.3823096065973887,"spread":0.3441388959524287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007572706,0.0007448575,0.0007122257,0.0006005307,0.0004481535,0.0006150538,0.0007293817,0.0009751502,0.004723906],"category_scores_gemma":[0.001702529,0.0003439498,0.0005383352,0.0005996653,0.0007721853,0.0006439259,0.001432674,0.001409961,0.002017497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004844012,"about_ca_system_score_gemma":0.001060062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665872,"about_ca_topic_score_gemma":0.001691674,"domain_scores_codex":[0.9995671,0.0001472386,0.00001200542,0.00004851087,0.0002043193,0.00002074243],"domain_scores_gemma":[0.9996698,0.0001285105,0.00003487514,0.00004186163,0.0001003856,0.00002462693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000670712,0.00006475036,0.0003903738,0.0003245559,0.00004596571,0.0001988435,0.0001775877,0.6164317,0.01654564,0.1309051,0.01421193,0.2206364],"study_design_scores_gemma":[0.00001250728,0.00002280526,0.00004163209,0.00001580125,0.000002964041,0.00003846533,0.000007484296,0.9858609,0.001263691,0.007140119,0.00558369,0.000009970399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001329918,0.0001354849,0.9939477,0.00009705007,0.00003284757,0.00003165633,0.00003066385,0.0002129281,0.004181588],"genre_scores_gemma":[0.08046191,0.0003383828,0.9067854,0.0002066259,0.00007713067,0.0004058592,0.0002063895,0.0004253346,0.01109308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004723906,"threshold_uncertainty_score":0.01580304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004793002","doi":"10.1137/s1052623401400324","title":"Probability Distributions of Assets Inferred from Option Prices via the Principle of Maximum Entropy","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Mathematical optimization; Principle of maximum entropy; Entropy (arrow of time); Computation; Regular polygon; Bellman equation; Constraint (computer-aided design); Exploit; Probability distribution; Applied mathematics; Convex function; Maximum entropy probability distribution; Mathematical economics; Algorithm; Computer science; Statistics","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Rustum Choksi","is_ca":true},{"name":"Pierre Maréchal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03093109542292634,"gpt":0.2283890821485748,"spread":0.1974579867256485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003818362,0.0005644385,0.0009923248,0.001561261,0.0005435896,0.002266295,0.00153838,0.001092673,0.00152751],"category_scores_gemma":[0.02049603,0.000826725,0.0008563285,0.0009333102,0.002662128,0.005415079,0.002485364,0.002321664,0.0002620896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009852274,"about_ca_system_score_gemma":0.0009464884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009650224,"about_ca_topic_score_gemma":0.0007515051,"domain_scores_codex":[0.9984005,0.0008161846,0.00007237973,0.0002080404,0.0004055,0.00009745156],"domain_scores_gemma":[0.9901867,0.008145118,0.0006130593,0.000610434,0.0002736497,0.000171068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001062095,0.00003899181,0.00158202,0.00007213135,0.00005920081,0.0001735345,0.0001405955,0.6591392,0.001692887,0.3074419,0.0004345093,0.02911874],"study_design_scores_gemma":[0.000008304664,0.000009332076,0.0002885864,0.00001109515,0.000003387576,0.00002337593,0.000008468888,0.7816925,0.000581411,0.2171604,0.0002020649,0.00001105596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03904743,0.0001112884,0.9593151,0.0002982536,0.000008750381,0.00001605878,0.00006412612,0.0001088553,0.001030153],"genre_scores_gemma":[0.7885131,0.0004356744,0.2087311,0.0001016979,0.00008920753,0.00009394297,0.0003990035,0.0001501174,0.001486229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003818362,"threshold_uncertainty_score":0.0201937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972729079","doi":"10.1137/s1052623401386794","title":"A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conic section; Dual (grammatical number); Algorithm; Mathematical optimization; Geometry","authors":[{"name":"Felipe Cucker","is_ca":true},{"name":"Javier Peña","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009995191754433275,"gpt":0.2235696083847121,"spread":0.2135744166302788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187796,0.001228857,0.001412973,0.0006229244,0.0007626503,0.001164334,0.001385927,0.001319987,0.005196206],"category_scores_gemma":[0.002363787,0.0007980315,0.0005698275,0.0008364031,0.0009301326,0.001026948,0.001567513,0.002170466,0.001603065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009225805,"about_ca_system_score_gemma":0.00184348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002993905,"about_ca_topic_score_gemma":0.004101086,"domain_scores_codex":[0.9994506,0.0001434774,0.0000300815,0.00009184917,0.0002177287,0.00006639032],"domain_scores_gemma":[0.9994134,0.0002904078,0.00004775708,0.00007979331,0.000122363,0.0000463112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001204029,0.0000875114,0.0002531929,0.0001552212,0.00002920045,0.0000680649,0.00005398949,0.8398132,0.002079627,0.03731884,0.003847642,0.1161732],"study_design_scores_gemma":[0.00003991086,0.00002352369,0.00002441392,0.000009926361,0.000003892598,0.00002157807,0.00000619381,0.989029,0.0006716576,0.008099432,0.00206515,0.000005277535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002052028,0.0001359589,0.9952984,0.00008482231,0.00003351629,0.00004286435,0.00003755749,0.0003330573,0.001981724],"genre_scores_gemma":[0.05772603,0.0001049192,0.9396378,0.00005820094,0.0000308817,0.0002361492,0.0001290003,0.000107891,0.001969067],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005196206,"threshold_uncertainty_score":0.01738304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969129923","doi":"10.1137/s1052623499358586","title":"Robust Filtering via Semidefinite Programming with Applications to Target Tracking","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Bounded function; Interior point method; Mathematical optimization; Upper and lower bounds; Robustness (evolution); Mathematics; Norm (philosophy); Robust optimization; Semidefinite embedding; Computer science; Algorithm; Quadratically constrained quadratic program","authors":[{"name":"Lingjie Li","is_ca":true},{"name":"Zhi‐Quan Luo","is_ca":true},{"name":"Timothy N. Davidson","is_ca":true},{"name":"KH Wong","is_ca":true},{"name":"Éloi Bossé","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09482905424110503,"gpt":0.326649580935868,"spread":0.2318205266947629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478182,0.0008751241,0.0009468879,0.0003759961,0.0002539612,0.0008276969,0.0007455788,0.0008994875,0.001858026],"category_scores_gemma":[0.002393265,0.0003769608,0.0006998566,0.0004884294,0.001021613,0.0007793538,0.0006947768,0.001822472,0.0003286689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004658873,"about_ca_system_score_gemma":0.0007128606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001046847,"about_ca_topic_score_gemma":0.0008187548,"domain_scores_codex":[0.9992506,0.0002988162,0.0000374736,0.0001197889,0.0002564747,0.00003679025],"domain_scores_gemma":[0.9983026,0.001208496,0.0001695438,0.0000933698,0.0001941932,0.00003177011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004585239,0.00005739819,0.0001135832,0.0001478394,0.0000370487,0.0000691217,0.00006153913,0.8847735,0.004815203,0.05174956,0.0008192096,0.05731012],"study_design_scores_gemma":[0.000005624626,0.000019898,0.00001218044,0.000003719722,0.000002783808,0.00001091256,0.000002572289,0.9928256,0.0006710555,0.005919472,0.000521861,0.000004323727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006960681,0.0000588121,0.998689,0.00004118904,0.000008694928,0.0000051248,0.000004738815,0.00005373596,0.0004426628],"genre_scores_gemma":[0.2220675,0.0007696751,0.7735146,0.0001857845,0.0001016072,0.0002101105,0.0001008547,0.0001462582,0.002903571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001858026,"threshold_uncertainty_score":0.007817447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592535213","doi":"10.1137/15m1016989","title":"The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Iterated function; Linear subspace; Monotone polygon; Affine transformation; Sequence (biology); Regular polygon; Convergence (economics); Algorithm; Cone (formal languages); Conic optimization; Pure mathematics; Convex optimization; Subderivative; Mathematical analysis; Geometry","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01318462294776567,"gpt":0.264885286470722,"spread":0.2517006635229563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432475,0.0006398582,0.000855257,0.0009331124,0.001056681,0.001187639,0.001177479,0.0009710967,0.002965434],"category_scores_gemma":[0.005564027,0.0003698931,0.0008184435,0.0006702045,0.001695596,0.002065972,0.002173637,0.001613253,0.0005095874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067582,"about_ca_system_score_gemma":0.001967113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003141059,"about_ca_topic_score_gemma":0.003678485,"domain_scores_codex":[0.9992836,0.0001856036,0.00005702886,0.0001095294,0.0002478773,0.0001163483],"domain_scores_gemma":[0.9984161,0.0006576411,0.0001387316,0.0002843796,0.0003617142,0.0001414756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004232331,0.0001161695,0.002966337,0.00016948,0.00005468167,0.0003277006,0.0006311773,0.2668355,0.01128813,0.451214,0.002025523,0.263948],"study_design_scores_gemma":[0.00002742285,0.0001179238,0.0002910487,0.00002739057,0.00001075438,0.0001181431,0.0001111326,0.9154867,0.006708042,0.07433818,0.002739581,0.00002370834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02770719,0.00007579824,0.9701635,0.00007407571,0.00001899498,0.00004890319,0.00001625289,0.0001229032,0.001772332],"genre_scores_gemma":[0.2632632,0.0001062933,0.7312488,0.00006514176,0.00001866396,0.0001146009,0.0001259019,0.0001219661,0.004935533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003141059,"threshold_uncertainty_score":0.01286435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071468246","doi":"10.1137/060650003","title":"Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Robust optimization; Mathematics; Mathematical optimization; Optimization problem; Convex optimization; Class (philosophy); Set (abstract data type); Range (aeronautics); Regular polygon; Computer science","authors":[{"name":"Igor Averbakh","is_ca":true},{"name":"Yun-Bin Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1160645763283125,"gpt":0.3408199939781923,"spread":0.2247554176498799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004099404,0.001461576,0.001292435,0.0008528376,0.0004198079,0.002430217,0.001951216,0.001624605,0.004216481],"category_scores_gemma":[0.008008682,0.0006637641,0.00174773,0.001093163,0.001849236,0.005200921,0.002644492,0.003639523,0.0008262895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140231,"about_ca_system_score_gemma":0.001001584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008488529,"about_ca_topic_score_gemma":0.0009460201,"domain_scores_codex":[0.9978092,0.0008335889,0.0001479622,0.000335575,0.0007493795,0.0001242416],"domain_scores_gemma":[0.9974813,0.001313829,0.0004119979,0.0004120694,0.0003258715,0.00005491147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001350131,0.00003474297,0.00006779961,0.0001607118,0.00002413427,0.0001085624,0.00008845208,0.1977655,0.0011121,0.7845432,0.0009859675,0.01509544],"study_design_scores_gemma":[0.00001695467,0.00005054749,0.0000894176,0.00007245879,0.00001965533,0.00005951204,0.00003979759,0.6526291,0.001183824,0.3399494,0.005868451,0.00002082421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003246068,0.0003141409,0.9911824,0.0002705743,0.00003847964,0.00003580692,0.00006412003,0.00003028903,0.004818049],"genre_scores_gemma":[0.3359212,0.002432433,0.6489655,0.0004900459,0.0005900316,0.0006560707,0.0005513174,0.0001736155,0.0102198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004216481,"threshold_uncertainty_score":0.02167994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069314331","doi":"10.1137/s1052623400374148","title":"The Analytic Center Cutting Plane Method with Semidefinite Cuts","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cutting-plane method; Mathematics; Semidefinite embedding; Semidefinite programming; Center (category theory); Plane (geometry); Mathematical analysis; Combinatorics; Quadratically constrained quadratic program; Geometry; Applied mathematics; Mathematical optimization; Quadratic equation; Integer programming","authors":[{"name":"Mohammad R. Oskoorouchi","is_ca":false},{"name":"Jean‐Louis Goffin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0106025474577415,"gpt":0.2515268811390499,"spread":0.2409243336813084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002810491,0.001872813,0.001532227,0.001431236,0.0005349954,0.001822912,0.002057739,0.001805483,0.004147502],"category_scores_gemma":[0.006285999,0.001029101,0.001086257,0.001308776,0.001703502,0.002003602,0.001872628,0.003136881,0.001250245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322955,"about_ca_system_score_gemma":0.001483881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002214312,"about_ca_topic_score_gemma":0.001777439,"domain_scores_codex":[0.9986817,0.0005037094,0.00004596878,0.000173559,0.0004704622,0.0001245947],"domain_scores_gemma":[0.9972618,0.001750558,0.0002784649,0.0002027632,0.0003970396,0.0001093643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000229718,0.000125042,0.0004926555,0.0002144101,0.00006500829,0.0001111816,0.0001561337,0.7799063,0.002974779,0.1251065,0.003197778,0.08742049],"study_design_scores_gemma":[0.00002264233,0.00003526109,0.00002647829,0.00001259908,0.000005685552,0.00001899836,0.000009859436,0.9802684,0.0007003126,0.01779264,0.001101245,0.000005847281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002288877,0.00009031527,0.9962348,0.00006532719,0.00001285584,0.000039051,0.00002136368,0.0001617199,0.001085634],"genre_scores_gemma":[0.1149919,0.0002705462,0.8810919,0.0001412618,0.00005148909,0.000418408,0.000244406,0.0002954094,0.002494659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004147502,"threshold_uncertainty_score":0.01486349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898428916","doi":"10.1137/17m114741x","title":"Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Mathematics; Manifold (fluid mechanics); Piecewise; Iterated function; Subgradient method; Piecewise linear function; Sampling (signal processing); Sequence (biology); Differentiable function; Function (biology); Stationary point; Combinatorics; Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Kamil A. Khan","is_ca":true},{"name":"Jeffrey Larson","is_ca":false},{"name":"Stefan M. Wild","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05067573183409192,"gpt":0.26990745417083,"spread":0.219231722336738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064288,0.001010073,0.0009839095,0.0006975792,0.0003225469,0.0005447351,0.0007828186,0.0007469879,0.001275053],"category_scores_gemma":[0.004290654,0.0004335974,0.0007428798,0.0006601954,0.0009637383,0.0009950498,0.0007890607,0.001153175,0.0003926872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007826157,"about_ca_system_score_gemma":0.0008375803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003220331,"about_ca_topic_score_gemma":0.002981496,"domain_scores_codex":[0.9996251,0.0001363256,0.00001498357,0.00006691607,0.0001259215,0.0000306976],"domain_scores_gemma":[0.9990464,0.000581858,0.0001014273,0.00009622818,0.0001375313,0.00003650533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009966579,0.00003883624,0.0008352653,0.0001075047,0.00004047225,0.00006941655,0.00007900131,0.9139754,0.005036036,0.0258716,0.001038369,0.05280845],"study_design_scores_gemma":[0.000002187503,0.0000161252,0.0000400251,0.000002530438,0.000001541556,0.000007650145,0.000003087058,0.9970019,0.0004589083,0.002243398,0.0002205346,0.000002000627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009102214,0.0001463105,0.990099,0.00006020052,0.000009948022,0.00001873804,0.00001603393,0.000142991,0.0004045326],"genre_scores_gemma":[0.4257414,0.0004279758,0.5710109,0.00008940936,0.00005813907,0.000166544,0.0002454437,0.0002149943,0.002045143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003220331,"threshold_uncertainty_score":0.006403148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128286686","doi":"10.1137/s105262340343470x","title":"Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Nuffield Foundation; City University of Hong Kong","keywords":"Mathematics; Conic section; Combinatorics; Moment (physics); Distribution (mathematics); Gaussian; Upper and lower bounds; Second moment of area; Mathematical analysis; Geometry; Physics","authors":[{"name":"Dennis Cheung","is_ca":true},{"name":"Felipe Cucker","is_ca":true},{"name":"Raphael Hauser","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03820894580035558,"gpt":0.3607572078413906,"spread":0.322548262041035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006252504,0.001548976,0.001452882,0.002897464,0.001281615,0.00243436,0.002262757,0.001824137,0.009598839],"category_scores_gemma":[0.06266572,0.0009150548,0.0009600958,0.001528125,0.004310357,0.007297055,0.002336126,0.005086727,0.001321745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003574744,"about_ca_system_score_gemma":0.00187311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002127334,"about_ca_topic_score_gemma":0.001616996,"domain_scores_codex":[0.9978124,0.0005942108,0.00008124419,0.0003967787,0.0007356855,0.0003795959],"domain_scores_gemma":[0.9391364,0.04492926,0.006119644,0.003671469,0.004538714,0.001604526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003529427,0.0001568235,0.003896192,0.0004320865,0.00007961933,0.0002514934,0.0006356584,0.2967748,0.009952749,0.6596459,0.005049701,0.02277207],"study_design_scores_gemma":[0.00001520892,0.00005930587,0.0009039397,0.00008073755,0.0000188817,0.0001088104,0.00006075275,0.898529,0.003039649,0.09589197,0.001232279,0.00005952118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05863987,0.001386007,0.9270701,0.001342873,0.00009998983,0.0001123464,0.000288186,0.0007130341,0.01034748],"genre_scores_gemma":[0.8862388,0.002489622,0.0950172,0.0007912103,0.0004653706,0.0007450841,0.0009536007,0.0008472135,0.01245183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009598839,"threshold_uncertainty_score":0.03306675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089331999","doi":"10.1137/130933691","title":"Numerical Analysis of $\\mathcal{V}\\mathcal{U}$-Decomposition, $\\mathcal{U}$-Gradient, and $\\mathcal{U}$-Hessian Approximations","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Hessian matrix; Mathematics; Combinatorics; Function (biology); Approximations of π; Mathematical analysis; Applied mathematics","authors":[{"name":"Warren Hare","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02905703108396227,"gpt":0.3622389667632777,"spread":0.3331819356793154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424846,0.000806949,0.0007831245,0.0007331787,0.0004631487,0.001062366,0.0009318548,0.000972638,0.003272542],"category_scores_gemma":[0.007957853,0.0004028823,0.000694845,0.0004847673,0.001501762,0.001599118,0.001459637,0.001963319,0.0008338105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001304134,"about_ca_system_score_gemma":0.001458306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003880746,"about_ca_topic_score_gemma":0.004159403,"domain_scores_codex":[0.9992632,0.0002722954,0.00002595862,0.0000725956,0.0003025463,0.00006333659],"domain_scores_gemma":[0.9974875,0.001553377,0.0001910902,0.0002583447,0.0004020265,0.0001076549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009157015,0.00004577108,0.0009394022,0.0001422358,0.00002991456,0.00005287306,0.0001175001,0.7674271,0.003303288,0.1959705,0.002104953,0.02977496],"study_design_scores_gemma":[0.000002035923,0.000005541686,0.00004594331,0.000006989012,0.000001447284,0.000005110267,0.000003894607,0.9899577,0.0005180528,0.00898258,0.0004683222,0.000002284856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00994729,0.0002181167,0.9846372,0.0001785009,0.00003126531,0.00002021139,0.00003000282,0.0002070284,0.00473035],"genre_scores_gemma":[0.3819895,0.0005126511,0.6078106,0.0001962961,0.0000562922,0.0002115271,0.0002379427,0.0007081727,0.008276958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003880746,"threshold_uncertainty_score":0.012824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966597656","doi":"10.1137/19m127879x","title":"A Privacy-Preserving Method to Optimize Distributed Resource Allocation","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Operator (biology); Computer science; Resource allocation; Convergence (economics); Dimension (graph theory); Computation; Mathematics; Algorithm","authors":[{"name":"Olivier Beaude","is_ca":false},{"name":"Pascal Benchimol","is_ca":false},{"name":"Stéphane Gaubert","is_ca":false},{"name":"Paulin Jacquot","is_ca":true},{"name":"Nadia Oudjane","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02199265047430246,"gpt":0.2669085174709549,"spread":0.2449158669966524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187692,0.001040595,0.0009545693,0.0005078812,0.0006684666,0.001166917,0.001398168,0.001494338,0.002795474],"category_scores_gemma":[0.003846985,0.0005876374,0.0008797492,0.0008304505,0.001588093,0.001252692,0.001986693,0.002370919,0.0004922689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315459,"about_ca_system_score_gemma":0.001918674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002323398,"about_ca_topic_score_gemma":0.001968209,"domain_scores_codex":[0.999001,0.0004003853,0.0000301191,0.0002013861,0.0002653297,0.0001017633],"domain_scores_gemma":[0.9990207,0.0006072046,0.0000798466,0.0001315089,0.0001014311,0.00005933457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007798749,0.00004297225,0.0001691928,0.00006457275,0.00002972232,0.00005907236,0.00008021752,0.9077606,0.002232094,0.06361841,0.00137117,0.02449405],"study_design_scores_gemma":[0.00001478896,0.00002408396,0.00002452897,0.000005213929,0.000004001434,0.00001327888,0.000008795355,0.9726854,0.0005261735,0.02572032,0.0009692022,0.000004233489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002414652,0.00005144895,0.9960828,0.0001330872,0.00001724371,0.00003022636,0.00002497303,0.00007666404,0.001168945],"genre_scores_gemma":[0.3168765,0.0002165654,0.6763552,0.0002178893,0.00006527087,0.0004338403,0.0001511642,0.0001505027,0.005532997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002795474,"threshold_uncertainty_score":0.0099262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091859835","doi":"10.1137/060658357","title":"Asplund Decomposition of Monotone Operators","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Remainder; Mathematics; Indecomposable module; Monotone polygon; Subderivative; Monotonic function; Operator (biology); Strongly monotone; Pure mathematics; Nonlinear system; Discrete mathematics; Algebra over a field; Mathematical analysis; Regular polygon; Arithmetic; Convex optimization","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Herre Wiersma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008174040744057377,"gpt":0.2733736201165596,"spread":0.2651995793725022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512907,0.0005839362,0.0002750304,0.0008664655,0.0004543274,0.001124545,0.000433398,0.0005233106,0.005562788],"category_scores_gemma":[0.001063992,0.000177767,0.0004995975,0.0003258335,0.000971118,0.002086228,0.001110312,0.001342409,0.0006244277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006926893,"about_ca_system_score_gemma":0.0004934683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005750325,"about_ca_topic_score_gemma":0.0004870089,"domain_scores_codex":[0.9997416,0.00004129289,0.00001672842,0.00004698778,0.0001125674,0.00004076992],"domain_scores_gemma":[0.999692,0.00005428216,0.00004582779,0.00003535322,0.00009020797,0.00008229807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001064719,0.00001001156,0.00006157583,0.00001607396,0.000001854872,0.00005418586,0.00008992264,0.001239098,0.001949569,0.9915293,0.0003228722,0.004714839],"study_design_scores_gemma":[0.000009790941,0.00003348689,0.0001363264,0.00001282678,0.000003934827,0.0001485866,0.00008432543,0.03728857,0.00171092,0.9547647,0.005797775,0.000008909816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2206879,0.0005756711,0.6756713,0.000623721,0.0001949338,0.0001086719,0.0002614608,0.0001746908,0.1017016],"genre_scores_gemma":[0.8072724,0.0007902118,0.1324027,0.0002733067,0.0002237379,0.000125399,0.0003328152,0.0001133439,0.05846614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005562788,"threshold_uncertainty_score":0.01860934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014632088","doi":"10.1137/s1052623499352632","title":"A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Overdetermined system; Symmetrization; Mathematics; Semidefinite programming; Interior point method; Linearization; Gauss; Mathematical optimization; Optimization problem; Applied mathematics; Combinatorics; Nonlinear system","authors":[{"name":"Etienne de Klerk","is_ca":false},{"name":"Jiming Peng","is_ca":false},{"name":"C. Roos","is_ca":false},{"name":"Tamás Terlaky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07053505632736073,"gpt":0.3794270903251682,"spread":0.3088920339978075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833449,0.001248054,0.0009630627,0.0006201164,0.0004275664,0.0009736027,0.0008752708,0.0009998684,0.004313725],"category_scores_gemma":[0.002895211,0.0005093818,0.0006532603,0.0007474583,0.001011759,0.001100735,0.001277507,0.002135356,0.001674484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005854105,"about_ca_system_score_gemma":0.001071568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006484304,"about_ca_topic_score_gemma":0.001132576,"domain_scores_codex":[0.9992595,0.0003544454,0.00002690586,0.00008634963,0.0002436736,0.00002897919],"domain_scores_gemma":[0.9991522,0.0003921256,0.00006686286,0.0000845945,0.0002532288,0.00005102595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002641741,0.000235728,0.000481808,0.0004398149,0.0000804617,0.0001742522,0.0001445748,0.5205433,0.009506673,0.2221039,0.01211353,0.2339117],"study_design_scores_gemma":[0.00003819713,0.00007540755,0.00004036587,0.00001767352,0.00000748224,0.00005289457,0.0000107059,0.9751692,0.001769497,0.01802198,0.004786737,0.00001004095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001359322,0.0001448006,0.9965764,0.000097664,0.00004578721,0.00004359827,0.00002177012,0.00009286896,0.001617766],"genre_scores_gemma":[0.06073916,0.000339897,0.9350094,0.000167657,0.00007484455,0.0002846826,0.0001134314,0.0001162994,0.003154617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004313725,"threshold_uncertainty_score":0.01443088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088059505","doi":"10.1137/19m1281538","title":"On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematical optimization; Subject (documents); Function (biology); Convex function; Algorithm; Computer science","authors":[{"name":"Heinz H. Bauschke","is_ca":false},{"name":"Walaa M. Moursi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02735944498284499,"gpt":0.2516408519365125,"spread":0.2242814069536676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01748774,0.001905798,0.001706377,0.002590411,0.00194539,0.002844334,0.002573793,0.003612915,0.004799499],"category_scores_gemma":[0.06325123,0.0009295226,0.001458978,0.001835732,0.004762623,0.005099419,0.002958928,0.004063646,0.0007808272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003284094,"about_ca_system_score_gemma":0.004987605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01099376,"about_ca_topic_score_gemma":0.007656431,"domain_scores_codex":[0.9942926,0.003762831,0.000164479,0.0004830494,0.000947346,0.000349561],"domain_scores_gemma":[0.9364835,0.05395909,0.001999059,0.001651286,0.004548892,0.001358149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000806474,0.0002518075,0.003571867,0.0004233629,0.000125248,0.0002260647,0.0005696203,0.4046701,0.004669766,0.5344492,0.008448157,0.04178842],"study_design_scores_gemma":[0.0000317523,0.00007799018,0.000300062,0.0000996649,0.00001568965,0.00005358357,0.00005191873,0.9446926,0.0007627441,0.05307677,0.0008088,0.00002835037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06830971,0.003924397,0.8980989,0.003511042,0.0003129487,0.0001295598,0.0001596647,0.0004165177,0.02513726],"genre_scores_gemma":[0.4919531,0.003648118,0.4799448,0.001705666,0.0003737383,0.0004110106,0.0006718207,0.001352956,0.01993886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01748774,"threshold_uncertainty_score":0.09248519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083147274","doi":"10.1137/21m1420915","title":"Escaping Unknown Discontinuous Regions in Blackbox Optimization","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Classification of discontinuities; Mathematical optimization; Optimization problem; Constraint (computer-aided design); Variable (mathematics); Nonlinear system; Computer science; Convergence (economics); Space (punctuation); Key (lock); Mathematics; Penalty method; Series (stratigraphy); Algorithm","authors":[{"name":"Charles Audet","is_ca":false},{"name":"Alain Batailly","is_ca":false},{"name":"Solène Kojtych","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006177420138452229,"gpt":0.2001085071382088,"spread":0.1939310869997566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194618,0.0006297877,0.00104468,0.0004726805,0.0003418793,0.0007007625,0.0006955691,0.0009582406,0.001423767],"category_scores_gemma":[0.003008802,0.0005365819,0.000577309,0.000240908,0.001208034,0.0005987019,0.001428321,0.0009059276,0.0002269973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004473464,"about_ca_system_score_gemma":0.0007227279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002099246,"about_ca_topic_score_gemma":0.001475729,"domain_scores_codex":[0.9997428,0.0001250027,0.000009826762,0.00002959346,0.00006404982,0.00002877183],"domain_scores_gemma":[0.998784,0.0009440225,0.00009063778,0.00007294364,0.00006570028,0.00004266475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005454002,0.00001702946,0.0003366039,0.00004717903,0.00001774635,0.00004121846,0.00004190687,0.9814163,0.001323217,0.006620663,0.000154837,0.009928656],"study_design_scores_gemma":[0.000006962363,0.00001391666,0.00002352901,0.000005908217,0.000001909898,0.000004119466,0.000004466447,0.9975777,0.0003499136,0.001861565,0.0001481513,0.000001828098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.047703,0.0002315697,0.9494162,0.0001189972,0.00002387991,0.00004168387,0.00002157375,0.000270657,0.002172328],"genre_scores_gemma":[0.6755293,0.0002324448,0.3205184,0.0001365033,0.00002332768,0.000257734,0.00007455466,0.0001576386,0.003070015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002099246,"threshold_uncertainty_score":0.006317794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380609297","doi":"10.1137/22m1483165","title":"The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear subspace; Intersection (aeronautics); Convexity; Monotone polygon; Convergence (economics); Projection (relational algebra); Monotonic function; Operator (biology); Algorithm; Mathematical optimization; Pure mathematics; Mathematical analysis","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Shambhavi Singh","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007490345301454423,"gpt":0.237609898501728,"spread":0.2301195532002736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192898,0.001276679,0.001090072,0.001482542,0.001059932,0.001163502,0.00144106,0.001320763,0.0025941],"category_scores_gemma":[0.005532254,0.000575263,0.00140906,0.001114848,0.002734388,0.001721678,0.003487331,0.003387696,0.0006138664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001604991,"about_ca_system_score_gemma":0.001971941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007014588,"about_ca_topic_score_gemma":0.004515291,"domain_scores_codex":[0.9991782,0.0002547294,0.00004359981,0.0001288786,0.0003114059,0.00008323403],"domain_scores_gemma":[0.9987821,0.0005157719,0.00008047296,0.0001755299,0.0003604852,0.00008562153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002180424,0.0001258017,0.001619064,0.0004605335,0.0001201133,0.0001677061,0.001137282,0.1608953,0.01445027,0.488895,0.00417759,0.3277332],"study_design_scores_gemma":[0.00005267873,0.0002059028,0.0006815675,0.00007430868,0.00003763131,0.0002234325,0.0001524843,0.8736303,0.009844569,0.1033435,0.01168022,0.00007334552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01930022,0.001024781,0.9721604,0.0003002376,0.0001488115,0.0001842427,0.00004153964,0.000124802,0.006714982],"genre_scores_gemma":[0.2453095,0.001695455,0.7389379,0.0002598361,0.0001408649,0.0005896198,0.0001925674,0.0002443456,0.01262997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007014588,"threshold_uncertainty_score":0.01394755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981781020","doi":"10.1137/18m1193657","title":"Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Mathematics; Combinatorics; Semidefinite programming; Vertex (graph theory); Conic optimization; Regular polygon; Convex optimization; Discrete mathematics; Graph; Convex set; Mathematical optimization","authors":[{"name":"Marcel K. de Carli Silva","is_ca":false},{"name":"Levent Tunçel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07053607418130879,"gpt":0.3557477996365117,"spread":0.2852117254552028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099764,0.001732398,0.0012658,0.0007534035,0.0007784134,0.00232276,0.0009496241,0.001423914,0.006054625],"category_scores_gemma":[0.006186182,0.0008760248,0.001218339,0.001371361,0.002271464,0.002418544,0.002121292,0.003870733,0.0007792555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269098,"about_ca_system_score_gemma":0.00144645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002637897,"about_ca_topic_score_gemma":0.002686575,"domain_scores_codex":[0.9984878,0.0005549527,0.00006628679,0.000316837,0.000418812,0.0001552046],"domain_scores_gemma":[0.9972336,0.00187414,0.0002894617,0.0001546025,0.0002682166,0.0001800474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001375943,0.0001586741,0.0007976628,0.0003999985,0.00008603932,0.0004964758,0.0002213058,0.5385119,0.002297337,0.4111818,0.008559188,0.03715198],"study_design_scores_gemma":[0.00002585759,0.00007224069,0.0001558382,0.00005082835,0.00001266288,0.000101916,0.00004541162,0.7837049,0.000593925,0.2118973,0.003317557,0.00002148584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02531617,0.001369922,0.9544961,0.0007056436,0.0001264954,0.0001053038,0.0002699335,0.0002753749,0.0173351],"genre_scores_gemma":[0.6295315,0.002643155,0.3483015,0.001042804,0.000335684,0.0005360594,0.001108308,0.000457832,0.0160431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006054625,"threshold_uncertainty_score":0.02025479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203691100","doi":"10.1137/21m1455127","title":"Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Imperial College London; Pacific Institute for the Mathematical Sciences","keywords":"Pointwise; Mathematics; Infimum and supremum; Nabla symbol; Combinatorics; Upper and lower bounds; Convex function; Relaxation (psychology); Omega; Regular polygon; Applied mathematics; Discrete mathematics; Mathematical analysis","authors":[{"name":"Alexander I. Chernyavsky","is_ca":true},{"name":"Jason J. Bramburger","is_ca":true},{"name":"Giovanni Fantuzzi","is_ca":true},{"name":"David Goluskin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04715189319642251,"gpt":0.3360420978468465,"spread":0.288890204650424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003307084,0.002098246,0.001601047,0.001061415,0.0005127718,0.002018463,0.002039952,0.001696533,0.002859143],"category_scores_gemma":[0.005195043,0.001101193,0.001634425,0.00124324,0.00268144,0.002521091,0.003371044,0.005136676,0.0007496483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001432196,"about_ca_system_score_gemma":0.001611771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001917857,"about_ca_topic_score_gemma":0.001621729,"domain_scores_codex":[0.9985915,0.0006376984,0.00004762747,0.0002453454,0.0003565046,0.0001213328],"domain_scores_gemma":[0.9985754,0.0009020128,0.0001397651,0.0001472149,0.0001601149,0.0000755098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005683754,0.00007595722,0.0002703698,0.0002478226,0.00007972686,0.00009509596,0.000166507,0.6324334,0.00286053,0.3234573,0.003271148,0.03698539],"study_design_scores_gemma":[0.00000904065,0.0000274716,0.0000395585,0.00002496425,0.00001001703,0.00002882174,0.00001807643,0.9348976,0.0009097578,0.06104999,0.002974483,0.00001029878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001323463,0.0002568034,0.9961905,0.0001755419,0.00002993109,0.00001668676,0.00002789858,0.00003720312,0.001941961],"genre_scores_gemma":[0.1452224,0.001421198,0.8440383,0.0004126259,0.0003706896,0.0003520356,0.0003109368,0.0003295435,0.007542287],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.003307084,"threshold_uncertainty_score":0.01748979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400787272","doi":"10.1137/23m1561968","title":"Square Root LASSO: Well-Posedness, Lipschitz Stability, and the Tuning Trade-Off","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Concordia University; Institut de Valorisation des Données; Centre de Recherches Mathématiques","keywords":"Mathematics; Lipschitz continuity; Lasso (programming language); Stability (learning theory); Square root; Square (algebra); Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry; Computer science","authors":[{"name":"Aaron Berk","is_ca":true},{"name":"Simone Brugiapaglia","is_ca":true},{"name":"Tim Hoheisel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04309997475809929,"gpt":0.2949766768933983,"spread":0.2518767021352991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007670849,0.001381546,0.001512577,0.0006188393,0.0005555029,0.002260216,0.001269653,0.002723678,0.002113214],"category_scores_gemma":[0.0321009,0.000713091,0.0005507843,0.0006596027,0.002868694,0.003627794,0.002146033,0.002766706,0.0005008648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005732712,"about_ca_system_score_gemma":0.001062854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001007391,"about_ca_topic_score_gemma":0.0008755383,"domain_scores_codex":[0.9967231,0.00177085,0.0001368596,0.0005528229,0.0006539734,0.0001624068],"domain_scores_gemma":[0.9862563,0.0113419,0.0007272484,0.0007525331,0.0006761749,0.0002458621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000964119,0.0001946973,0.003121899,0.0006743961,0.0003069997,0.0003769521,0.0002541082,0.581497,0.01755834,0.1870952,0.009408494,0.1985478],"study_design_scores_gemma":[0.00003248595,0.0001096516,0.000392852,0.00003502059,0.00002006232,0.00009930097,0.00002678574,0.9373831,0.002013693,0.05897442,0.00088411,0.00002857591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01689122,0.001887163,0.9763187,0.001677131,0.0001080248,0.00002294987,0.0000919282,0.0002530726,0.002749929],"genre_scores_gemma":[0.7509394,0.00233864,0.2370203,0.001106081,0.0005911176,0.000234697,0.0002903713,0.000486126,0.006993275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007670849,"threshold_uncertainty_score":0.04056782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912745458","doi":"10.1137/19m130858x","title":"Dual Space Preconditioning for Gradient Descent","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Laboratory; Army Research Office; Engineering and Physical Sciences Research Council; Ministry of Defence; Natural Sciences and Engineering Research Council of Canada; European Commission; Institute for Advanced Studies in the Humanities, University of Edinburgh; DeepMind; Seventh Framework Programme","keywords":"Convexity; Lipschitz continuity; Mathematics; Smoothness; Stochastic gradient descent; Gradient descent; Applied mathematics; Convex function; Gradient method; Nonlinear conjugate gradient method; Bregman divergence; Norm (philosophy); Proximal Gradient Methods; Mathematical analysis; Mathematical optimization; Regular polygon; Computer science; Geometry","authors":[{"name":"Chris J. Maddison","is_ca":false},{"name":"Daniel Paulin","is_ca":false},{"name":"Yee Whye Teh","is_ca":false},{"name":"Arnaud Doucet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02090318359265479,"gpt":0.2435101790497992,"spread":0.2226069954571444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034802,0.0008191328,0.0008250181,0.0005108307,0.0004798355,0.0009081197,0.0006051853,0.0009143467,0.005052785],"category_scores_gemma":[0.004092924,0.0003479508,0.0005779281,0.0005241585,0.001276678,0.001043176,0.002138655,0.002467028,0.001531839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005620768,"about_ca_system_score_gemma":0.001096192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001143478,"about_ca_topic_score_gemma":0.001385714,"domain_scores_codex":[0.9992824,0.0002613782,0.00003017699,0.00009922114,0.000257638,0.00006924757],"domain_scores_gemma":[0.9991807,0.0002617252,0.00007396415,0.0001978272,0.0002093309,0.00007641865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002750441,0.00009395497,0.000699453,0.0002968696,0.00006595174,0.0002397411,0.0002085948,0.2550195,0.03477192,0.5544465,0.01035254,0.1435299],"study_design_scores_gemma":[0.00002527362,0.00005714819,0.0001397945,0.00002208592,0.000007482135,0.00006885773,0.0000141463,0.9226864,0.007249345,0.0615325,0.008182159,0.00001475745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00275181,0.00008777287,0.9943817,0.00012782,0.00005149739,0.00001967407,0.00003246444,0.0001839581,0.002363252],"genre_scores_gemma":[0.2416906,0.000509805,0.7435734,0.0004539288,0.0002297564,0.0003166529,0.0003287326,0.0006419469,0.01225519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005052785,"threshold_uncertainty_score":0.01690322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963803091","doi":"10.1137/16m1082172","title":"The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Resolvent; Regular polygon; Quotient; Convex function; Binary relation; Convex set; Connection (principal bundle); Pure mathematics; Bijection; Order (exchange); Combinatorics; Discrete mathematics; Convex optimization","authors":[{"name":"Sedi Bartz","is_ca":true},{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006123639609745902,"gpt":0.2292755975042869,"spread":0.223151957894541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160754,0.0007525148,0.0009293508,0.002393196,0.001816858,0.004081542,0.0008905517,0.001314019,0.003895054],"category_scores_gemma":[0.005827464,0.000431869,0.001264291,0.002218808,0.005897749,0.01148359,0.003358024,0.004038216,0.001088234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901731,"about_ca_system_score_gemma":0.001417939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274453,"about_ca_topic_score_gemma":0.001304463,"domain_scores_codex":[0.9982263,0.0005011708,0.0001231554,0.000350957,0.0006139512,0.000184448],"domain_scores_gemma":[0.9972937,0.00107139,0.0003108647,0.0005221135,0.0005037205,0.0002981875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004983647,0.000004795341,0.000051997,0.00001325617,0.000001357702,0.0000129849,0.0001075436,0.0002654677,0.000113897,0.9956172,0.000387332,0.00341936],"study_design_scores_gemma":[0.000004855778,0.00001988148,0.0000866826,0.00003272326,0.000003981695,0.00005865988,0.00006395891,0.002158622,0.0003141306,0.9764074,0.02083512,0.00001388061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05777319,0.01898579,0.7144444,0.008423519,0.002017754,0.0001158454,0.0005756312,0.0002277539,0.1974361],"genre_scores_gemma":[0.608718,0.01196403,0.3281233,0.001909133,0.00253183,0.0002327922,0.0005779217,0.0004241323,0.04551884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004081542,"threshold_uncertainty_score":0.01671588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3195078226","doi":"10.1137/21m1442474","title":"The Bregman Proximal Average","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bregman divergence; Combinatorics; Mathematical optimization; Applied mathematics","authors":[{"name":"Xianfu Wang","is_ca":true},{"name":"Heinz H. Bauschke","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007751141731016588,"gpt":0.2169832816624985,"spread":0.2092321399314819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783689,0.001070448,0.001047601,0.001480708,0.001170974,0.002190151,0.001350129,0.00170775,0.01175709],"category_scores_gemma":[0.005441579,0.0004488022,0.001075866,0.001129448,0.002461518,0.003778297,0.003424398,0.002798626,0.003966885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001142732,"about_ca_system_score_gemma":0.001387243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001269271,"about_ca_topic_score_gemma":0.001506415,"domain_scores_codex":[0.9988174,0.0003059486,0.00004662208,0.0002679806,0.0004150798,0.0001469697],"domain_scores_gemma":[0.9986165,0.0003653752,0.0001130493,0.0002314579,0.0004772365,0.0001963837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003375181,0.00002013463,0.0001742898,0.00007662967,0.000027004,0.0000738505,0.0001081444,0.02983529,0.003108786,0.9273996,0.00532946,0.03381301],"study_design_scores_gemma":[0.00001160521,0.00009456428,0.0002362808,0.00004546434,0.00002273932,0.0002300388,0.0000585925,0.1922332,0.003171944,0.7726847,0.03116192,0.00004887391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008828743,0.0006294365,0.9664726,0.0006621539,0.000252349,0.00002642037,0.0001075804,0.000250126,0.02277056],"genre_scores_gemma":[0.4222749,0.003303769,0.4749024,0.001938505,0.0009943695,0.000213541,0.0005244326,0.001257261,0.09459092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01175709,"threshold_uncertainty_score":0.03933144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401550494","doi":"10.1137/23m1552140","title":"MGProx: A Nonsmooth Multigrid Proximal Gradient Method with Adaptive Restriction for Strongly Convex Optimization","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Multigrid method; Regular polygon; Mathematical optimization; Convex optimization; Proximal Gradient Methods; Applied mathematics; Mathematical analysis; Geometry; Partial differential equation","authors":[{"name":"Andersen Ang","is_ca":false},{"name":"Hans De Sterck","is_ca":true},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01679189818565932,"gpt":0.2575591347630491,"spread":0.2407672365773898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009494319,0.0007080141,0.0009269296,0.0004713745,0.0003473834,0.0006246265,0.001214483,0.001141634,0.001540553],"category_scores_gemma":[0.001774653,0.000449639,0.0006946877,0.0005023733,0.000932432,0.0008883889,0.001784139,0.001493795,0.0005643793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003663716,"about_ca_system_score_gemma":0.001041824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001755228,"about_ca_topic_score_gemma":0.001828722,"domain_scores_codex":[0.9995978,0.0001556428,0.00001421909,0.00005203496,0.0001504992,0.00002976884],"domain_scores_gemma":[0.9994692,0.0002861421,0.00004754766,0.00007129034,0.00008100164,0.00004480255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001154333,0.00008838579,0.0006980958,0.000241989,0.00008746718,0.0001763014,0.0001139314,0.8465865,0.01080228,0.04013107,0.003740911,0.0972177],"study_design_scores_gemma":[0.000008456958,0.00002396525,0.00003883155,0.000004991153,0.000002344937,0.00001632232,0.000003456301,0.9946235,0.0008191147,0.003343284,0.001111873,0.000003827189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00337035,0.0001322447,0.9954443,0.0001249322,0.00003110253,0.00002955887,0.00001404698,0.0001571355,0.0006962694],"genre_scores_gemma":[0.1694637,0.0003538277,0.8256542,0.0002313741,0.00008520304,0.000248648,0.0001113544,0.0002243115,0.003627408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001755228,"threshold_uncertainty_score":0.005153596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971969277","doi":"10.1137/120869390","title":"On the Average Condition of Random Linear Programs","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Logarithm; Upper and lower bounds; Combinatorics; Basis (linear algebra); Condition number; Linear programming; Dual (grammatical number); Discrete mathematics; Applied mathematics; Mathematical optimization; Mathematical analysis","authors":[{"name":"Dennis Cheung","is_ca":false},{"name":"Felipe Cucker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0346690006164164,"gpt":0.2906724988904961,"spread":0.2560034982740797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006172893,0.001443067,0.001983489,0.001854406,0.001292456,0.003304374,0.002932879,0.002121582,0.01683721],"category_scores_gemma":[0.06256144,0.0007960618,0.00127833,0.001993857,0.00482359,0.01091227,0.003097249,0.005798682,0.002078459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003506117,"about_ca_system_score_gemma":0.002506939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002359463,"about_ca_topic_score_gemma":0.002339496,"domain_scores_codex":[0.9947296,0.001694323,0.0001736757,0.001070454,0.001540017,0.0007918832],"domain_scores_gemma":[0.945042,0.04320977,0.002656816,0.004047716,0.003248637,0.001795203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004978362,0.0001239507,0.001561748,0.000274382,0.00005479236,0.0001576589,0.0001649706,0.1770658,0.00249931,0.7805582,0.01017727,0.02686416],"study_design_scores_gemma":[0.00004230215,0.00006780977,0.0004371511,0.0000560375,0.00002009872,0.00006443261,0.00002761108,0.5937657,0.00122637,0.4024828,0.001774061,0.00003567045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08566409,0.002379596,0.8633222,0.004314995,0.0003491609,0.0001320796,0.001174751,0.001231816,0.0414313],"genre_scores_gemma":[0.8294271,0.002729114,0.1471313,0.001429298,0.001112287,0.0007072459,0.0016203,0.001045578,0.01479774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01683721,"threshold_uncertainty_score":0.05632609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413992645","doi":"10.1137/23m1587919","title":"On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convergence (economics); Applied mathematics; Algorithm; Mathematical optimization","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true},{"name":"Shambhavi Singh","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009435308930310997,"gpt":0.2415025215910931,"spread":0.2320672126607821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029968,0.001352444,0.00121612,0.001594933,0.00119171,0.001815394,0.00275359,0.002746173,0.006481357],"category_scores_gemma":[0.01440044,0.0006279934,0.0008629214,0.001488012,0.00277935,0.00272448,0.004472508,0.003393895,0.002058221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722827,"about_ca_system_score_gemma":0.002567025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005500769,"about_ca_topic_score_gemma":0.005479412,"domain_scores_codex":[0.9987191,0.0006612763,0.00005343106,0.0001774996,0.0002834069,0.0001053686],"domain_scores_gemma":[0.9965839,0.002333529,0.0001335605,0.0002194443,0.0005880812,0.0001414784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002653376,0.0001041908,0.0008831673,0.000285017,0.00009987473,0.0001064466,0.0002971169,0.2675584,0.002398146,0.6114824,0.00844819,0.1080718],"study_design_scores_gemma":[0.00003886598,0.00004765307,0.0001715801,0.00004639947,0.00001495837,0.00003311145,0.00002398392,0.8602172,0.0007971872,0.1338807,0.004697974,0.00003040962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01257656,0.002078451,0.9665445,0.001431529,0.0002956796,0.0001097628,0.00008729719,0.000183973,0.01669224],"genre_scores_gemma":[0.3567651,0.003052748,0.5981234,0.001090692,0.0006089521,0.000686735,0.0004446666,0.0005822706,0.03864554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006481357,"threshold_uncertainty_score":0.02168226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387693852","doi":"10.1137/22m1469651","title":"Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Mathematics; Quadratic equation; Optimization problem; Nonlinear system; Power flow; Sequence (biology); Quadratic programming; Robust optimization; Set (abstract data type); Nonlinear programming; Ellipsoid; Feasible region; Electric power system; Power (physics); Computer science","authors":[{"name":"Olga Kuryatnikova","is_ca":false},{"name":"Bissan Ghaddar","is_ca":true},{"name":"Daniel K. Molzahn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01188711727066198,"gpt":0.2350073656440852,"spread":0.2231202483734232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004188308,0.001716964,0.001859743,0.0006854146,0.0004958695,0.00130866,0.001379077,0.00172177,0.003116689],"category_scores_gemma":[0.008090856,0.0008749714,0.001220374,0.0009459768,0.001470494,0.001783249,0.002258414,0.002305366,0.0003450864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141702,"about_ca_system_score_gemma":0.001262757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005433328,"about_ca_topic_score_gemma":0.002955225,"domain_scores_codex":[0.9985144,0.0006986702,0.00006390856,0.0002753053,0.0003212625,0.0001265219],"domain_scores_gemma":[0.9972064,0.001999936,0.000212746,0.0001634366,0.0003320003,0.00008542777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003390066,0.00002237944,0.00008326286,0.00004229217,0.00001709366,0.00003327325,0.00002591017,0.9794302,0.0005857813,0.01318849,0.0001840883,0.006353283],"study_design_scores_gemma":[0.000003057662,0.00001353256,0.00001098412,0.000001584635,0.0000016022,0.000002735997,0.000001336582,0.9975158,0.000166041,0.002191483,0.0000891952,0.000002646577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005720228,0.0001904661,0.991899,0.0001231056,0.00002230069,0.00003492388,0.00001830242,0.00009949266,0.001892155],"genre_scores_gemma":[0.6341485,0.0003558022,0.3587464,0.0001501245,0.00008498186,0.0003137463,0.0001339902,0.0002080145,0.005858477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005433328,"threshold_uncertainty_score":0.02215016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408053135","doi":"10.1137/24m1632772","title":"Adaptive Partitioning for Chance-Constrained Problems with Finite Support","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Mathematics; Mathematical optimization; Applied mathematics","authors":[{"name":"Marius Roland","is_ca":true},{"name":"Alexandre Forel","is_ca":true},{"name":"Thibaut Vidal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01161033525573548,"gpt":0.2214505878840791,"spread":0.2098402526283436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002439611,0.001477799,0.002320462,0.001170732,0.0006883657,0.001461356,0.002960233,0.002328862,0.003601161],"category_scores_gemma":[0.0147561,0.001640945,0.001274061,0.001215608,0.001697666,0.002231093,0.003158081,0.002205893,0.0003547474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038964,"about_ca_system_score_gemma":0.001136455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005699594,"about_ca_topic_score_gemma":0.003945351,"domain_scores_codex":[0.9988368,0.0005926787,0.00005927841,0.000158699,0.0002289157,0.0001235632],"domain_scores_gemma":[0.9895563,0.009070645,0.000459578,0.0002568719,0.0003726232,0.0002839597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001166297,0.00005132543,0.0003156475,0.000150704,0.00004993202,0.00006922451,0.00005280202,0.9624594,0.0009048114,0.0217086,0.0007758709,0.01334495],"study_design_scores_gemma":[0.00001013349,0.00001342868,0.00004098152,0.000008671118,0.000004018988,0.00001063475,0.000005907744,0.9904661,0.0001101442,0.009175578,0.0001501597,0.000004205256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01458735,0.000433888,0.9825974,0.0002828041,0.00004625817,0.00007187389,0.00008023266,0.00007892664,0.001821204],"genre_scores_gemma":[0.5831554,0.001105655,0.4064272,0.0003133391,0.0002401815,0.0008706062,0.0006297825,0.0002957851,0.006962091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005699594,"threshold_uncertainty_score":0.01290208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402461337","doi":"10.1137/23m157627x","title":"Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree; Algorithm; Discrete mathematics; Mathematical optimization","authors":[{"name":"Christopher Ryan","is_ca":true},{"name":"Robert L. Smith","is_ca":false},{"name":"Marina A. Epelman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01727637826205133,"gpt":0.3002095516113,"spread":0.2829331733492487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002383717,0.001517605,0.00257868,0.00363931,0.00177355,0.005467239,0.004929935,0.003504115,0.00501099],"category_scores_gemma":[0.01989285,0.001820765,0.001735805,0.008240855,0.003825257,0.01262043,0.002922145,0.005856981,0.0009876324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002500106,"about_ca_system_score_gemma":0.001798792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716378,"about_ca_topic_score_gemma":0.002588417,"domain_scores_codex":[0.9983345,0.0006198122,0.00009612339,0.0004262752,0.0003666478,0.0001566322],"domain_scores_gemma":[0.9805401,0.01672336,0.0009336246,0.0006855961,0.0007565389,0.0003607678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008150657,0.0001596302,0.0007153018,0.0006672021,0.00007421881,0.00008079859,0.0003727309,0.1131557,0.0006591775,0.7948224,0.0103974,0.07881379],"study_design_scores_gemma":[0.00001825013,0.00001688501,0.000131036,0.00005713448,0.00002559575,0.00008099958,0.0000722723,0.1660554,0.000212446,0.831004,0.002310548,0.00001546755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02828815,0.008236773,0.9490252,0.002312592,0.0002390226,0.00007280981,0.0004129345,0.0004061996,0.01100633],"genre_scores_gemma":[0.4251371,0.01662892,0.5390633,0.00110941,0.001748072,0.0005321215,0.001580109,0.0005033533,0.01369769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005467239,"threshold_uncertainty_score":0.0181396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209551251","doi":"10.1137/19m1291145","title":"Lattice Reformulation Cuts","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","authors":[{"name":"Karen Aardal","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Andrea Tramontani","is_ca":true},{"name":"Frederik von Heymann","is_ca":true},{"name":"Laurence A. Wolsey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01282574552117052,"gpt":0.2468545492508314,"spread":0.2340288037296609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286337,0.0007861665,0.0006975972,0.0008032607,0.0007526395,0.002300438,0.001053889,0.0007348649,0.02337853],"category_scores_gemma":[0.005073082,0.0004148892,0.001117219,0.0007495882,0.00154445,0.00261787,0.001687213,0.003493944,0.00311954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251642,"about_ca_system_score_gemma":0.001132488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117916,"about_ca_topic_score_gemma":0.001574059,"domain_scores_codex":[0.9988108,0.0002920783,0.00005739812,0.0002367466,0.0004179689,0.0001851571],"domain_scores_gemma":[0.998738,0.0006131474,0.0001006488,0.0002268827,0.000243766,0.00007763311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001494148,0.000121379,0.0002910584,0.0002363496,0.00002711399,0.0001438762,0.0002388329,0.08666534,0.004033064,0.8150392,0.008071223,0.08498313],"study_design_scores_gemma":[0.00009097368,0.0002200181,0.0001833841,0.0001375476,0.00002405591,0.0001211269,0.0002690615,0.2635063,0.007432162,0.6907509,0.03723674,0.00002775551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04089172,0.0004470526,0.8789774,0.0008868576,0.0002549369,0.0003233282,0.0006821574,0.0007110356,0.07682548],"genre_scores_gemma":[0.3404179,0.000478548,0.6355808,0.0006448263,0.000145898,0.0006422842,0.001646654,0.0006690563,0.01977408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02337853,"threshold_uncertainty_score":0.07820892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068022782","doi":"10.1137/130945818","title":"Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives","year":2015,"lang":"en","type":"preprint","venue":"SIAM Journal on Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Complementarity (molecular biology); Vertex (graph theory); Regular polygon; Conic section; Conic optimization; Pure mathematics; Convex set; Convex optimization; Graph; Geometry","authors":[{"name":"Marcel K. de Carli Silva","is_ca":false},{"name":"Levent Tunçel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08091285722626668,"gpt":0.31642708135062,"spread":0.2355142241243533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617405,0.000587987,0.0005512441,0.001999855,0.001221442,0.003990532,0.0007602716,0.0007773186,0.007553183],"category_scores_gemma":[0.002810332,0.0003357588,0.0006747764,0.00123836,0.002717179,0.003788631,0.00176247,0.002356485,0.0007171507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001079947,"about_ca_system_score_gemma":0.000534034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007449924,"about_ca_topic_score_gemma":0.0009045032,"domain_scores_codex":[0.9994916,0.00008723806,0.00002293349,0.0001036168,0.0001955029,0.00009916905],"domain_scores_gemma":[0.9986798,0.0005186858,0.000250125,0.00009594358,0.0002276982,0.0002276654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001587648,0.00001346235,0.0003099704,0.00002326772,0.000003426733,0.00005260897,0.0001449857,0.002188592,0.0005775106,0.9917441,0.0005602587,0.004365946],"study_design_scores_gemma":[0.000007564427,0.00001672222,0.0002310221,0.00001833031,0.000003476606,0.000108051,0.000247865,0.01531738,0.0005208912,0.9806968,0.002823374,0.000008513158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4377328,0.0005601259,0.4426546,0.0008735607,0.0001498942,0.0001387558,0.00078783,0.0001777738,0.1169246],"genre_scores_gemma":[0.9371679,0.0005172286,0.04225975,0.0001910329,0.0001707085,0.0001497721,0.0006149119,0.0001381627,0.01879046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007553183,"threshold_uncertainty_score":0.02526796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391685089","doi":"10.1137/23m1597009","title":"Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Chongqing","keywords":"Mathematics; Pure mathematics; Algebra over a field","authors":[{"name":"Honglin Luo","is_ca":false},{"name":"Xianfu Wang","is_ca":true},{"name":"Xinmin Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0128797847676563,"gpt":0.2531671316334372,"spread":0.2402873468657809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00595801,0.001067427,0.001104513,0.00207095,0.001359701,0.002807094,0.001476134,0.001504704,0.004832335],"category_scores_gemma":[0.01989374,0.0008197348,0.001639516,0.001239388,0.006246316,0.008370358,0.005843985,0.004536739,0.0005147426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126074,"about_ca_system_score_gemma":0.0009251689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000264356,"about_ca_topic_score_gemma":0.0002500844,"domain_scores_codex":[0.9961124,0.001090601,0.0003130059,0.001215852,0.001018953,0.000249157],"domain_scores_gemma":[0.9900221,0.006238856,0.0008911578,0.001005444,0.001239517,0.0006028162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006297023,0.00003987833,0.0007640658,0.0001703366,0.0000679498,0.0002542953,0.0006425586,0.01354331,0.00336777,0.9551201,0.0006071074,0.02535976],"study_design_scores_gemma":[0.00002289443,0.0003093618,0.001885357,0.00009493389,0.00005474842,0.0008359668,0.0004388164,0.07942872,0.006472857,0.9013225,0.009063317,0.00007057316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05987978,0.000999486,0.9235017,0.0005515257,0.0001449868,0.000128669,0.00008658582,0.0001027571,0.01460442],"genre_scores_gemma":[0.7374769,0.002782656,0.2466035,0.0004668671,0.0004814232,0.0005748415,0.0002530281,0.0001907746,0.01116998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00595801,"threshold_uncertainty_score":0.03150934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407702284","doi":"10.1137/24m164344x","title":"Everything Is Possible: Constructing Spectrahedra with Prescribed Facial Dimensions","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Liquid Crystal Research Advancements","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Kensington Health","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Respiratory Council","keywords":"Mathematics; Mathematical optimization; Algebra over a field; Calculus (dental); Pure mathematics; Orthodontics","authors":[{"name":"Vera Roshchina","is_ca":true},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01332729680817567,"gpt":0.2881948608291784,"spread":0.2748675640210028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567097,0.0006247039,0.0007366921,0.0005117669,0.0007229584,0.000939819,0.001247535,0.0008436901,0.005418395],"category_scores_gemma":[0.002264691,0.0004320597,0.0006589781,0.0005466414,0.001394105,0.001209916,0.002160891,0.001789214,0.001089868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005951764,"about_ca_system_score_gemma":0.000728904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00143468,"about_ca_topic_score_gemma":0.002691718,"domain_scores_codex":[0.9997236,0.00007830063,0.00001044853,0.0000399548,0.00009783779,0.0000497542],"domain_scores_gemma":[0.9995426,0.0002087698,0.00002904948,0.0001026848,0.00006213276,0.00005480598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002155373,0.0001063797,0.0005708953,0.0001753914,0.00001954489,0.0001020206,0.0003164817,0.221106,0.006066695,0.6455578,0.007897915,0.1178653],"study_design_scores_gemma":[0.00005598365,0.0000675561,0.00007862913,0.00004882221,0.000009113585,0.00005124093,0.0001695677,0.5868565,0.002599704,0.4030519,0.006995134,0.00001580211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1074728,0.0001854895,0.8541973,0.0005121614,0.0001474276,0.0001157781,0.0003490867,0.0005343102,0.03648572],"genre_scores_gemma":[0.3956822,0.0002218399,0.5953979,0.000210372,0.00002921337,0.0002165903,0.000342402,0.0004527196,0.007446807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005418395,"threshold_uncertainty_score":0.01812631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226198151","doi":"10.1137/22m1484742","title":"Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Shandong Province; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Smoothness; Order (exchange); Mathematics; Mathematical optimization; Variational analysis; Optimization problem; Applied mathematics; Computer science","authors":[{"name":"Matúš Benko","is_ca":false},{"name":"Helmut Gfrerer","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02115896620607888,"gpt":0.2717379495631903,"spread":0.2505789833571114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004166183,0.001313994,0.001163843,0.001462357,0.0007874277,0.002071484,0.001422559,0.001625736,0.005795186],"category_scores_gemma":[0.006691628,0.0007704139,0.001623195,0.0007220901,0.002742557,0.00387941,0.00220663,0.004227673,0.0007889836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633498,"about_ca_system_score_gemma":0.002013369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001571752,"about_ca_topic_score_gemma":0.00198062,"domain_scores_codex":[0.9982376,0.0004653993,0.0001021131,0.0003415879,0.0006356185,0.00021769],"domain_scores_gemma":[0.997065,0.001830522,0.0002392256,0.0001861416,0.0005261611,0.000152897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002206696,0.00003063098,0.0003187079,0.0001499064,0.00002411921,0.0001208506,0.0001510523,0.07142277,0.004455521,0.9152697,0.001855663,0.00617896],"study_design_scores_gemma":[0.00001568479,0.00005445813,0.0003617949,0.00005467591,0.00001432004,0.0001072479,0.00008157183,0.5909442,0.002522871,0.3999819,0.005830001,0.00003111812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008469348,0.0004073215,0.9821469,0.0004854792,0.00006586417,0.00004693885,0.0001394095,0.00007553303,0.008163084],"genre_scores_gemma":[0.5865476,0.001949454,0.3924631,0.0006400119,0.0004603556,0.0005872381,0.000936417,0.000449403,0.01596648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005795186,"threshold_uncertainty_score":0.02203315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}