{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":732,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":732,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"2ecb0c628f68","filters":{"topic":"Optimization and Variational Analysis"}},"results":[{"id":"W205960364","doi":"10.1007/978-3-319-48311-5","title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","year":2017,"lang":"en","type":"book","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3471,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Hilbert space; Regular polygon; Pure mathematics; Operator (biology); Convex analysis; Algebra over a field; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01495236541620175,"gpt":0.2544540933838867,"spread":0.239501727967685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008428974,0.0002783034,0.0007977776,0.0008803697,0.00009762472,0.000458026,0.0008945454,0.00023602,0.00008603192],"category_scores_gemma":[0.000141839,0.0002498158,0.0001465085,0.0002571945,0.0001097099,0.0002561728,0.0003339458,0.0002597594,0.00003160655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001161248,"about_ca_system_score_gemma":0.0002226565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001690289,"about_ca_topic_score_gemma":0.0001325473,"domain_scores_codex":[0.998405,0.00007554037,0.0005452674,0.0004609371,0.0003188076,0.0001944364],"domain_scores_gemma":[0.9981877,0.0002998466,0.0004147463,0.0009212414,0.00009754568,0.00007887508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002420863,0.00007476984,0.0004765569,0.0001005747,0.0004131398,0.0000231228,0.002204386,0.0009800391,0.000001825961,0.9941682,0.0008183704,0.0007365632],"study_design_scores_gemma":[0.0004223295,0.00001755939,0.0004172967,0.0002355805,0.0003844953,0.000005561455,0.00004942856,0.5303082,0.00001575198,0.4621848,0.005411691,0.0005473395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000166881,0.0006218001,0.5540542,0.0007595869,0.0001247097,0.0004589896,0.00001911775,0.00007207746,0.4437226],"genre_scores_gemma":[0.002955948,0.0003084326,0.09040359,0.0003325676,0.0000582774,0.00004547271,0.00004461976,0.00003605637,0.905815],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5319834,"threshold_uncertainty_score":0.9999954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124659975","doi":"10.1007/s10479-007-0176-2","title":"An overview of bilevel optimization","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1430,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematical optimization; Simple (philosophy); Computer science; Connection (principal bundle); Focus (optics); Mathematical economics; Optimization problem; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4883983889418265,"gpt":0.5434584453478315,"spread":0.05506005640600498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746118,0.0000534294,0.0001208022,0.0005853513,0.0001619282,0.00007823329,0.0005489948,0.00004445078,0.0001833346],"category_scores_gemma":[0.0002446724,0.00004849176,0.00005165728,0.001969727,0.00006233132,0.0007713058,0.00008446159,0.00007972075,0.00001090619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008941021,"about_ca_system_score_gemma":0.000169296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001881041,"about_ca_topic_score_gemma":0.00006541425,"domain_scores_codex":[0.9984534,0.0001805055,0.0003693868,0.000187629,0.00062915,0.0001799374],"domain_scores_gemma":[0.9966739,0.0001289276,0.0000395626,0.0004434092,0.002625829,0.00008834497],"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.000004032194,0.0001965255,0.0001558569,0.000009480978,0.00001657831,4.361599e-7,0.0002636451,0.6956886,0.0007331767,0.2987503,0.0002094435,0.003971916],"study_design_scores_gemma":[0.00008969718,0.0001113249,0.003092787,0.00001230278,0.000001864651,6.926124e-7,0.00004512491,0.9853575,0.01031124,0.0006793385,0.0002414992,0.00005660742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002560046,0.0002252815,0.9928588,0.002475069,0.00002429137,0.0001192536,0.000007702633,0.00001670519,0.00171282],"genre_scores_gemma":[0.7460229,0.0005586738,0.2529365,0.0001591463,0.00002871485,0.000005868654,0.00003342189,0.000004915044,0.000249912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7434629,"threshold_uncertainty_score":0.2007385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079711316","doi":"10.1006/jmaa.2000.7042","title":"New Approximation Schemes for General Variational Inequalities","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":832,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Convergence (economics); Class (philosophy); Applied mathematics; Inequality; Calculus (dental); Mathematical analysis; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01769835523417246,"gpt":0.273454718719427,"spread":0.2557563634852545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006134,0.00008485981,0.0002784885,0.0002506439,0.0001281689,0.0001676385,0.0002493507,0.00003946111,0.0006055541],"category_scores_gemma":[0.00005127333,0.00006503707,0.0002451336,0.0008630607,0.00001628736,0.0003441076,0.00001915431,0.00005161798,0.00001092766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001599334,"about_ca_system_score_gemma":0.00006473399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003483016,"about_ca_topic_score_gemma":9.834914e-7,"domain_scores_codex":[0.9988816,0.00003548384,0.0005757927,0.0001375848,0.0002775834,0.00009193427],"domain_scores_gemma":[0.9989117,0.0002561056,0.0002753138,0.0001606125,0.0002764443,0.0001198108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003646915,0.0000845297,0.00005736285,0.00001199026,0.0004152146,7.018843e-8,0.0001151736,0.003447293,0.00002778801,0.9533161,0.0002457967,0.04227506],"study_design_scores_gemma":[0.0002504872,0.00002123092,0.000618275,0.000004462735,0.0005158057,0.000007025564,0.00001572908,0.6355156,0.00006484007,0.3523002,0.01059624,0.00009018173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005293657,0.00005760861,0.9958903,0.002844224,0.000005977377,0.0001033511,0.000006167869,0.0000136658,0.0005492938],"genre_scores_gemma":[0.02150636,0.00005825972,0.9755428,0.000215345,0.0002346345,0.00003332805,0.00001992857,0.000004379014,0.00238498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6320683,"threshold_uncertainty_score":0.6630393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975320652","doi":"10.1007/s10288-005-0071-0","title":"Bilevel programming: A survey","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":453,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Simple (philosophy); Mathematical optimization; Computer science; Nonlinear programming; Quadratic programming; Quadratic equation; Linear programming; Nonlinear system; Mathematics; Optimization problem; Artificial intelligence; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03416886300847194,"gpt":0.2682684370357858,"spread":0.2340995740273139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002008061,0.00003765842,0.00004735796,0.00004855373,0.0000463688,0.00009022484,0.0002312242,0.00001610111,0.0000948573],"category_scores_gemma":[0.00004866873,0.00003157074,0.00002671754,0.0003743519,0.000005762322,0.0001863792,0.00004444166,0.00002336593,0.0002585718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001235366,"about_ca_system_score_gemma":0.00002924835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003326929,"about_ca_topic_score_gemma":0.00005197022,"domain_scores_codex":[0.9995583,0.00003006549,0.00008450107,0.000125501,0.0001174437,0.00008413508],"domain_scores_gemma":[0.999671,0.0000316549,0.00002799409,0.0001518964,0.00007717928,0.00004020739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005034245,0.0003750113,0.02572365,0.000005229417,0.0000694852,0.000002291747,0.000654463,0.01180535,0.00004936471,0.1887825,0.01063727,0.7618904],"study_design_scores_gemma":[0.0001874253,0.00001616099,0.09902725,0.000001775427,0.00000387037,0.000001879245,0.000002049929,0.7515683,0.00009215343,0.0003242645,0.1486513,0.0001235503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007086381,0.00002182892,0.9946747,0.003095909,0.00004864489,0.00004104811,0.000001830375,0.00009048147,0.001316958],"genre_scores_gemma":[0.52683,0.000004006725,0.4685086,0.0008332432,0.00007459611,0.000008535329,0.00001412303,0.000003262898,0.003723646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7617668,"threshold_uncertainty_score":0.3323503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062059813","doi":"10.1287/moor.26.2.248.10558","title":"A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College","funders":"","keywords":"Mathematics; Hilbert space; Monotone polygon; Simple (philosophy); Convergence (economics); Applied mathematics; Class (philosophy); Weak convergence; Mathematical optimization; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1493640761500596,"gpt":0.4924049965811565,"spread":0.3430409204310969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445469,0.00008316593,0.0002028203,0.0005672827,0.0001917294,0.0001916566,0.000671907,0.00004360499,0.000133944],"category_scores_gemma":[0.001150988,0.00007495198,0.00005515123,0.001760939,0.00004127878,0.0003228112,0.0002346544,0.0001020145,0.00003809212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006947727,"about_ca_system_score_gemma":0.0001843209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001038389,"about_ca_topic_score_gemma":0.0002176951,"domain_scores_codex":[0.9984607,0.0001697375,0.0004188395,0.0002588659,0.0004342692,0.0002575666],"domain_scores_gemma":[0.9981133,0.0005470649,0.00003576003,0.0004598922,0.000751495,0.00009246525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005602806,0.0003285347,0.0003783358,0.00004053453,0.00002507756,6.620182e-7,0.001923333,0.154121,0.002985756,0.8392646,0.0002240645,0.0007024742],"study_design_scores_gemma":[0.0001953766,0.00005577598,0.0002704451,0.00002327245,0.000003259461,0.000001873426,0.0002097415,0.9907671,0.002632257,0.003707814,0.002049788,0.00008329142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006912806,0.00001929323,0.9848978,0.005593639,0.00003207926,0.0006022069,0.000004741185,0.00001864663,0.001918817],"genre_scores_gemma":[0.09992158,0.00002502226,0.8961238,0.0000350927,0.00001682844,0.000233898,0.000006448874,0.000007781133,0.003629586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8366461,"threshold_uncertainty_score":0.3056453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057794519","doi":"10.1109/tac.2007.904451","title":"On the Hybrid Optimal Control Problem: Theory and Algorithms","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":345,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Controllability; Optimal control; Bounded function; Hamiltonian (control theory); Mathematical optimization; Convergence (economics); Hamiltonian system; Maximum principle; Variational principle; Control theory (sociology); Computer science; Applied mathematics; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.006890618028156842,"gpt":0.2236150882270187,"spread":0.2167244701988618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742219,0.0001832574,0.0002337984,0.0002010964,0.000391352,0.00017958,0.0003508071,0.00004616543,0.0002659308],"category_scores_gemma":[0.00003640351,0.0001236911,0.0001359331,0.0003175506,0.00006630919,0.0002072121,0.000001521106,0.0001608128,0.00008836105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004615068,"about_ca_system_score_gemma":0.0000495225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009343193,"about_ca_topic_score_gemma":0.000005890211,"domain_scores_codex":[0.998417,0.0002701796,0.0003602685,0.0003099673,0.0003790198,0.0002636156],"domain_scores_gemma":[0.9966677,0.002608704,0.0001225638,0.0003889392,0.00009968311,0.0001124192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002106877,0.0007659719,0.000007991212,0.00002349986,0.0008547765,0.00002684234,0.0009304974,0.3199708,0.0003818848,0.3803567,0.000449288,0.2960211],"study_design_scores_gemma":[0.001628824,0.0001295028,0.0001987013,0.00001699155,0.0000893892,0.0000184786,0.00002778047,0.9921173,0.0003826057,0.005147069,0.00009036675,0.0001529595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001591188,0.00001729983,0.9919713,0.004953875,0.0001795872,0.0004674484,0.00001749192,0.000233175,0.0005686927],"genre_scores_gemma":[0.9819999,0.000005067064,0.01397804,0.00346606,0.00002636847,0.00006689169,6.575763e-7,0.000011118,0.0004459076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9804087,"threshold_uncertainty_score":0.5043977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155583876","doi":"10.1142/s0219199701000524","title":"ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES","year":2001,"lang":"en","type":"article","venue":"Communications in Contemporary Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":301,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Guelph","funders":"","keywords":"Mathematics; Convexity; Banach space; Smoothness; Pure mathematics; Duality (order theory); Subderivative; Mathematical analysis; Mathematical proof; Legendre polynomials; Uniformly convex space; Regular polygon; Banach manifold; Convex optimization; Lp space; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07173092289625761,"gpt":0.3143689845143521,"spread":0.2426380616180945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397457,0.0001503863,0.0002664179,0.0004572335,0.000207612,0.000235808,0.001195763,0.00008520323,0.00004695286],"category_scores_gemma":[0.0001378676,0.0001561839,0.00005427441,0.001411919,0.0001392965,0.0007674869,0.0006884275,0.0002277977,0.00002248725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004714994,"about_ca_system_score_gemma":0.0001631713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002098971,"about_ca_topic_score_gemma":0.0005624987,"domain_scores_codex":[0.9985355,0.0002408938,0.0005763738,0.0002638884,0.0002214791,0.0001618678],"domain_scores_gemma":[0.9977597,0.0004957496,0.0002032023,0.001354379,0.0001226646,0.00006429672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001517908,0.001936576,0.07699711,0.00008667525,0.0001058944,0.00002282672,0.004740777,0.002340446,0.00009559825,0.9101884,0.001941206,0.001529316],"study_design_scores_gemma":[0.001013275,0.00002337832,0.007942854,0.00008625133,0.00002091099,0.00002552514,0.00123135,0.963943,0.00002867263,0.01977817,0.005565752,0.00034084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0231016,0.001978021,0.9301585,0.01463225,0.0001729851,0.0004957356,0.00001627908,0.0001645582,0.02928009],"genre_scores_gemma":[0.9466395,0.0005319111,0.05197584,0.0001072874,0.00002001126,0.00004546883,0.00005850192,0.00001041452,0.0006110367],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9616026,"threshold_uncertainty_score":0.6368995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138849538","doi":"10.1016/j.jmaa.2004.10.032","title":"Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":246,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Constraint (computer-aided design); Mathematics; Mathematical optimization; Convexity; Complementarity (molecular biology); Mathematical economics; Piecewise; Economics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01609509908169007,"gpt":0.2793366738783639,"spread":0.2632415747966738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345753,0.0001173289,0.000392351,0.0002183104,0.0001457127,0.0002209709,0.0002240909,0.0000429699,0.00008767925],"category_scores_gemma":[0.00004313823,0.00007856986,0.0001734448,0.0007565959,0.0001938131,0.0002976854,0.00005492341,0.00008338752,0.000004558646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000017104,"about_ca_system_score_gemma":0.00004688185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.026202e-7,"about_ca_topic_score_gemma":0.00000143373,"domain_scores_codex":[0.9987507,0.0000318611,0.0005856261,0.0002026951,0.000285778,0.0001432685],"domain_scores_gemma":[0.9985436,0.0003200345,0.000350097,0.0002075013,0.0003802218,0.0001985409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008034048,0.0008988375,0.0004370129,0.0000686223,0.0008802763,8.560335e-7,0.0002633728,0.004158116,0.00008494984,0.9845343,0.00005593686,0.008609642],"study_design_scores_gemma":[0.0006416371,0.0001514044,0.001403357,0.00003604724,0.001829364,0.0001277765,0.0002345674,0.9112123,0.0001068103,0.08335738,0.0006837953,0.0002156076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009963255,0.00004777445,0.9843749,0.004863195,0.000002514554,0.0002384423,0.00001192832,0.00001818902,0.0004797401],"genre_scores_gemma":[0.6019542,0.00001341342,0.3977118,0.000125732,0.00004708552,0.00005902213,0.00001020758,0.000004325688,0.00007424883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9070541,"threshold_uncertainty_score":0.3203986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007103412","doi":"10.1007/s10589-005-4612-4","title":"A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematics; Trust region; Quadratic equation; Nonlinear system; Constraint (computer-aided design); Mathematical optimization; Sequential quadratic programming; Nonlinear programming; Algorithm; Type (biology); Software; Quadratic programming; Applied mathematics; Computer science; Optimization problem; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02269682176659438,"gpt":0.3136590209992671,"spread":0.2909621992326727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883023,0.0001908077,0.000193475,0.0002322733,0.000549312,0.0003230747,0.0002441031,0.00007802529,0.00001735789],"category_scores_gemma":[0.00003433726,0.0001961279,0.00006510773,0.0006579894,0.00008405258,0.0006057269,0.0001010208,0.00007190475,0.000005810039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004146508,"about_ca_system_score_gemma":0.0001015784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003914052,"about_ca_topic_score_gemma":8.24862e-7,"domain_scores_codex":[0.9984871,0.00004771197,0.0004260557,0.0005788027,0.0002700255,0.0001903214],"domain_scores_gemma":[0.9985294,0.0003438002,0.0002040061,0.0001752805,0.0005757013,0.0001717847],"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.000002282665,0.00008646874,0.0000397227,0.000006688962,0.0000185506,1.050078e-7,0.0002141726,0.7109828,6.490363e-7,0.1064991,0.00009124312,0.1820582],"study_design_scores_gemma":[0.0006589281,0.00002804771,0.000271328,0.000005504466,0.0000217433,0.00003249296,0.00004098362,0.9647809,0.000006624455,0.009333102,0.02459712,0.0002232679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001582318,0.0001094606,0.9936247,0.005200491,0.00002632914,0.0007257902,0.00003796552,0.0001683814,0.00009103909],"genre_scores_gemma":[0.003621142,0.000037449,0.9936104,0.001239926,0.0001532163,0.0006351703,0.0004796462,0.00001588677,0.0002071426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2537981,"threshold_uncertainty_score":0.7997863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973823738","doi":"10.1137/070687542","title":"The Proximal Average: Basic Theory","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Regular polygon; Convex function; Effective domain; Convex analysis; Proper convex function; Proximal Gradient Methods; Domain (mathematical analysis); Pure mathematics; Function (biology); Convex set; Convex optimization; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01126816164200364,"gpt":0.2191056682143998,"spread":0.2078375065723962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00071301,0.0001168801,0.000103553,0.0001441824,0.001409479,0.0003336977,0.0005611258,0.00004660578,0.0001522603],"category_scores_gemma":[0.0002108388,0.00007534911,0.000108263,0.0005742218,0.00004573633,0.0006381135,0.00005253672,0.0002264616,0.00006462239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000699767,"about_ca_system_score_gemma":0.0001455151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.000627e-7,"about_ca_topic_score_gemma":2.643147e-7,"domain_scores_codex":[0.998568,0.000264659,0.0003047583,0.0001819624,0.0004838953,0.0001967156],"domain_scores_gemma":[0.9988509,0.0002093728,0.0002325935,0.0002789836,0.0003247106,0.0001034537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001830764,0.0000424296,0.00007013089,5.678222e-7,0.00002596571,0.00001027919,0.0001590616,0.8541345,0.000003117745,0.142393,0.000911219,0.002231406],"study_design_scores_gemma":[0.0003558687,0.00008065048,0.0005250308,0.000007118873,0.000007649112,0.0001963605,0.00001231303,0.9913231,0.00005041585,0.004005594,0.003317249,0.0001186699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002570087,0.00008321491,0.9896805,0.004382179,0.0003750639,0.00008221142,6.171443e-7,0.00006338313,0.00507581],"genre_scores_gemma":[0.642036,0.002975788,0.335101,0.00463794,0.0009284628,0.00002514131,0.00002094964,0.00004621637,0.01422853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6545795,"threshold_uncertainty_score":0.9998906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963899645","doi":"10.1016/j.jat.2014.06.002","title":"The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle","year":2014,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Rate of convergence; Hilbert space; Trigonometric functions; Projection (relational algebra); Convergence (economics); Regular polygon; Point (geometry); Algorithm; Orthographic projection; Applied mathematics; Mathematical analysis; Pure mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.008027509989422685,"gpt":0.227751311518617,"spread":0.2197238015291944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003391349,0.00008600912,0.0001964827,0.00005267372,0.0002773115,0.00003711636,0.001197031,0.00003812083,0.00001910612],"category_scores_gemma":[0.0005134654,0.00003416243,0.0002763267,0.0005864841,0.0001984547,0.0002383454,0.0001134868,0.0001117524,7.34635e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000142339,"about_ca_system_score_gemma":0.0001027199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005886105,"about_ca_topic_score_gemma":0.000002554805,"domain_scores_codex":[0.998318,0.0004908295,0.0006222106,0.00008537342,0.0003896967,0.0000939259],"domain_scores_gemma":[0.9956003,0.00114742,0.001797708,0.0004305376,0.001000889,0.00002307591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009191228,0.0001774504,0.0005232332,0.00005668433,0.0003027268,4.70697e-8,0.00482036,0.02016833,0.001502718,0.9530323,0.002169346,0.01715485],"study_design_scores_gemma":[0.0004369463,0.00008204914,0.001808388,0.00004612574,0.00008074396,0.000003902555,0.0003947383,0.8860462,0.02858542,0.08009741,0.00235976,0.0000583139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006376391,0.0001325811,0.9846731,0.008006112,0.0003920466,0.0002109941,0.00001090419,0.000003688122,0.0001942188],"genre_scores_gemma":[0.937636,0.0001382838,0.06024152,0.0009004524,0.0002075448,0.00001049408,0.000001542717,0.00001185215,0.0008523031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9312596,"threshold_uncertainty_score":0.2224402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095371903","doi":"10.1006/jmaa.2000.7298","title":"Three-Step Iterative Algorithms for Multivalued Quasi Variational Inclusions","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Resolvent; Algorithm; Iterative method; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02561837382381565,"gpt":0.3063345317158027,"spread":0.280716157891987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006198185,0.0001180556,0.000385127,0.0004052427,0.0003286886,0.0001634085,0.0003596056,0.00005364923,0.0001252295],"category_scores_gemma":[0.0001381348,0.00008624142,0.0003513015,0.001516699,0.00003703433,0.0003066879,0.00009227989,0.00009208043,0.000008286655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003166225,"about_ca_system_score_gemma":0.00005729615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005112012,"about_ca_topic_score_gemma":0.00001188944,"domain_scores_codex":[0.9985777,0.00003961172,0.0006801533,0.00020452,0.0003699227,0.0001281028],"domain_scores_gemma":[0.9977859,0.0006307977,0.000469509,0.0002229903,0.0007352167,0.000155585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008735014,0.0006855425,0.0004883266,0.00001209126,0.001164322,0.000001140074,0.0002713981,0.00459486,0.00005773607,0.9768123,0.000183966,0.01571958],"study_design_scores_gemma":[0.000305488,0.00004111796,0.001430375,0.000006631474,0.000579067,0.00001659185,0.00003101348,0.8124399,0.00001037179,0.1829247,0.002123439,0.00009127414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001409554,0.00005539908,0.9943961,0.00481568,0.00001313074,0.0001865191,0.00001360373,0.00001527917,0.0003633216],"genre_scores_gemma":[0.06514511,0.00006600439,0.933998,0.0002698221,0.0001887108,0.00008363117,0.00002049477,0.000006597739,0.000221637],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8078451,"threshold_uncertainty_score":0.3516823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007277085","doi":"10.1007/s10107-007-0124-6","title":"Computing proximal points of nonconvex functions","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Subgradient method; Proximal Gradient Methods; Bounded function; Lipschitz continuity; Mathematical optimization; Regular polygon; Function (biology); Convex optimization; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01754484837312971,"gpt":0.2718162145073227,"spread":0.254271366134193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525369,0.00008059157,0.0001603741,0.0001166377,0.000098391,0.00006831909,0.0002610329,0.000040254,0.00006631128],"category_scores_gemma":[0.0001731379,0.00006856425,0.00009043305,0.0006013745,0.00004041569,0.000170992,0.0001190108,0.00007718227,0.00007221723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001996789,"about_ca_system_score_gemma":0.00002346296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002686266,"about_ca_topic_score_gemma":0.000001533628,"domain_scores_codex":[0.9989009,0.00002220244,0.0003986571,0.0001780433,0.0002892362,0.0002108952],"domain_scores_gemma":[0.9992036,0.0002237687,0.0001323439,0.0002105462,0.0001460482,0.00008368861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004280042,0.0004334885,0.0008444047,0.00009495413,0.00006885516,0.000004734731,0.0009732347,0.0002450717,0.0001307775,0.8349398,0.00005777448,0.1622027],"study_design_scores_gemma":[0.0004262675,0.0001008551,0.001755101,0.00006881882,0.0000494601,0.00002461753,0.0002352318,0.9655173,0.0009854437,0.02913101,0.00144892,0.0002569116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002055959,0.000008896502,0.9910071,0.0004391444,0.0000486428,0.0001253868,2.828944e-7,0.0001185669,0.006196046],"genre_scores_gemma":[0.4776343,9.451436e-8,0.5221674,0.00004836121,0.00002500927,0.000001730083,0.000001640058,0.000003613459,0.0001178958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9652723,"threshold_uncertainty_score":0.2795969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552240618","doi":"","title":"Maximal Monotonicity via Convex Analysis","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":107,"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":"Subderivative; Combinatorics; Mathematics; Convex set; Monotone polygon; Monotonic function; Regular polygon; Convex function; Domain (mathematical analysis); Banach space; Function (biology); Discrete mathematics; Mathematical analysis; Geometry; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.005486635744944309,"gpt":0.2075682200849598,"spread":0.2020815843400155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001073351,0.00006552023,0.0001293517,0.0002138855,0.00007699807,0.0001127729,0.0003005835,0.00002844725,0.0006454955],"category_scores_gemma":[0.000003356087,0.00005548964,0.0001459719,0.001650455,0.00001142989,0.0002546359,0.0000671141,0.00003106465,0.0001321715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002048048,"about_ca_system_score_gemma":0.00001808118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006613559,"about_ca_topic_score_gemma":0.0001234537,"domain_scores_codex":[0.9992754,0.00002631322,0.0001684762,0.0002223537,0.0001930345,0.0001143945],"domain_scores_gemma":[0.999524,0.00002708657,0.00005279953,0.0002573013,0.0001003647,0.00003843179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000167221,0.0001128277,0.02230443,9.060698e-7,0.0002908939,0.000002725207,0.00002484783,0.1704449,0.00008004114,0.8040519,0.001173717,0.001511094],"study_design_scores_gemma":[0.00008001216,0.000004237415,0.0370451,1.19829e-7,0.00006746417,8.498848e-7,0.000001179574,0.9570762,0.0002431797,0.004606804,0.0007950016,0.00007987768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001532576,0.000008413068,0.9744021,0.001653709,0.00002609519,0.00002741984,9.197512e-7,0.0001184788,0.02223025],"genre_scores_gemma":[0.8572789,0.000001257325,0.1389367,0.0004682253,0.00001929262,0.000003044196,0.00001581177,0.000001725,0.003275045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8557463,"threshold_uncertainty_score":0.7067723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016019828","doi":"10.1007/s101070100278","title":"On error bounds for lower semicontinuous functions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Banach space; Subderivative; Function (biology); Upper and lower bounds; Space (punctuation); Regular polygon; Normed vector space; Metric space; Pure mathematics; Convex function; Discrete mathematics; Mathematical analysis; Applied mathematics; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03133459075991703,"gpt":0.2601535055372161,"spread":0.2288189147772991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000175568,0.00009813128,0.000137634,0.00008012187,0.0001938633,0.0002547303,0.0002417936,0.0000454969,0.0004020063],"category_scores_gemma":[0.0002392623,0.00008072194,0.0001328881,0.0003162779,0.00002250994,0.0001682859,0.00004236429,0.00006471978,0.0004295624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002592972,"about_ca_system_score_gemma":0.000006389439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.070983e-7,"about_ca_topic_score_gemma":5.428962e-7,"domain_scores_codex":[0.9991145,0.00001681195,0.0002172429,0.0002358031,0.0002023097,0.0002133837],"domain_scores_gemma":[0.9992676,0.0002424425,0.00005958642,0.0002632137,0.00008654607,0.00008056696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003560917,0.0006291902,0.000007163751,0.00003124895,0.00004758765,0.000001975427,0.0003979665,0.0005629305,0.00001401992,0.9212629,0.005222405,0.07181905],"study_design_scores_gemma":[0.0002508261,0.0001245693,0.000005229213,0.00001754987,0.00002363816,0.00000510567,0.00002254913,0.9329264,0.00001307997,0.04524856,0.02122078,0.0001417303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003109667,0.00001306673,0.9897662,0.002023532,0.0001136875,0.0002182178,0.000001452829,0.0001997707,0.007353133],"genre_scores_gemma":[0.3965416,8.86072e-7,0.5901344,0.0007179352,0.0001033224,0.0001993381,0.000007544126,0.00001740428,0.01227755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9323635,"threshold_uncertainty_score":0.5521299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088855121","doi":"10.1007/s10898-004-2692-9","title":"Global Stability Results for the Weak Vector Variational Inequality","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Variational inequality; Stability (learning theory); Euclidean space; Applied mathematics; Euclidean geometry; Inequality; Solution set; Set (abstract data type); Vector optimization; Mathematical analysis; Vector space; Space (punctuation); Mathematical optimization; Pure mathematics; Optimization problem; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02314939605882728,"gpt":0.2857274072162192,"spread":0.2625780111573919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961141,0.0001295672,0.00020596,0.00003462048,0.000222462,0.0002348718,0.0006649275,0.00007576338,0.00004544799],"category_scores_gemma":[0.001348666,0.00009101034,0.0002178757,0.0009510891,0.00002990464,0.001043245,0.00007664057,0.00007039268,0.00000428814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005568539,"about_ca_system_score_gemma":0.00037802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001744131,"about_ca_topic_score_gemma":0.00003945833,"domain_scores_codex":[0.9979175,0.0001975939,0.0008848284,0.0002120461,0.0006152854,0.0001727661],"domain_scores_gemma":[0.9968565,0.000396089,0.0008469599,0.0002905486,0.00150433,0.000105543],"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.0001569915,0.0001228105,0.001222339,0.000002644636,0.00007481151,2.038285e-7,0.00004068982,0.8899126,9.116433e-7,0.1047362,0.00242778,0.001301986],"study_design_scores_gemma":[0.001142049,0.00008069861,0.02287241,0.000005685994,0.00005854732,0.00001687997,0.000017244,0.9704631,0.000004866311,0.001871719,0.003366821,0.00009998012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001656824,0.0000948843,0.9704823,0.02758462,0.0004438075,0.0001674996,0.0001294728,0.00002761484,0.0009041344],"genre_scores_gemma":[0.4213256,0.00003644578,0.5773873,0.0006853592,0.0005026707,0.000005075303,0.00002507986,0.00000336419,0.00002905068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4211599,"threshold_uncertainty_score":0.3711294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962704982","doi":"10.48550/arxiv.1402.5460","title":"Linear and strong convergence of algorithms involving averaged\\n nonexpansive operators","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":92,"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","keywords":"Mathematics; Convergence (economics); Regular polygon; Fixed point; Applied mathematics; Algorithm; Point (geometry); Mathematical optimization; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03462281631610042,"gpt":0.1732015387528425,"spread":0.138578722436742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001416589,0.00007932316,0.0001236128,0.0001137901,0.000103868,0.00002434069,0.0003041568,0.0000368265,0.0000358053],"category_scores_gemma":[0.00004019028,0.00008431038,0.00004163028,0.0005349566,0.00004798966,0.0004571447,0.0001496292,0.00005872363,0.00001346438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002043193,"about_ca_system_score_gemma":0.00003590961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007297273,"about_ca_topic_score_gemma":0.00001006551,"domain_scores_codex":[0.9993696,0.00006982584,0.0001064736,0.0002888154,0.00005887006,0.0001064204],"domain_scores_gemma":[0.9993556,0.00007390127,0.00008289985,0.0002204049,0.0001866017,0.00008062996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003644647,0.000029763,0.013325,0.000008642073,0.00004037341,0.000005649577,0.0002661821,0.2549483,0.0001807687,0.7309101,0.00002183108,0.0002597936],"study_design_scores_gemma":[0.0002414577,0.00003004199,0.002373456,0.000006696079,0.00001528483,7.089491e-7,0.00007101291,0.9953365,0.0003802862,0.001382838,0.00006460781,0.00009712426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1205665,0.000009534456,0.8788888,0.00006058989,0.00006042447,0.00003498432,0.000001694828,0.00002836711,0.0003490756],"genre_scores_gemma":[0.9906794,0.00004669006,0.008823207,0.00009159857,0.00001762933,9.490053e-8,0.000002265238,0.000003155536,0.0003360054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8701128,"threshold_uncertainty_score":0.3438078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W356322785","doi":"10.1007/s10589-015-9762-4","title":"A proximal bundle method for nonsmooth nonconvex functions with inexact information","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"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":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Subgradient method; Mathematics; Convergence (economics); Mathematical optimization; Bounded function; Bundle; Limit (mathematics); Class (philosophy); Function (biology); Applied mathematics; Point (geometry); Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01549061829371792,"gpt":0.2657578315025077,"spread":0.2502672132087898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873833,0.0001588872,0.0001627129,0.000281351,0.0003535228,0.0003505687,0.0002269304,0.00006242034,0.00002005541],"category_scores_gemma":[0.00005084899,0.0001430216,0.00004781988,0.000979007,0.00004285613,0.001438386,0.00006301043,0.00006963532,0.00002828441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006275027,"about_ca_system_score_gemma":0.0003297486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000109965,"about_ca_topic_score_gemma":0.000003084488,"domain_scores_codex":[0.9988315,0.00004589641,0.0003506853,0.0003052941,0.0003098356,0.0001567841],"domain_scores_gemma":[0.9979424,0.0001979943,0.0002236079,0.0002147782,0.001216237,0.0002049962],"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.00001232681,0.00008457743,0.00006947951,0.00000822255,0.00003413859,2.818894e-8,0.0001556109,0.8313537,4.948297e-7,0.1626314,0.0007790902,0.004870868],"study_design_scores_gemma":[0.0008500529,0.0001109821,0.0001392472,0.000004559734,0.00003938572,0.00001551222,0.00007937034,0.9613622,0.000004991946,0.005478222,0.03172737,0.0001881123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006519393,0.00002988158,0.9933828,0.003718014,0.00003891969,0.0008051996,0.00004990441,0.000194229,0.001774549],"genre_scores_gemma":[0.008941777,0.000005894637,0.9876599,0.001161264,0.00007545196,0.0008130578,0.001008505,0.00001144668,0.0003226992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1571532,"threshold_uncertainty_score":0.5832253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027711030","doi":"10.1080/02331930008844513","title":"Dykstras algorithm with bregman projections: A convergence proof","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Bregman divergence; Mathematics; Convergence (economics); Algorithm; Regular polygon; Constraint (computer-aided design); Legendre polynomials; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005520435647381991,"gpt":0.2031312555329953,"spread":0.1976108198856133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001014037,0.0001180695,0.0001059475,0.0001219103,0.0002072314,0.0001708971,0.0002682583,0.0000471433,0.001682648],"category_scores_gemma":[0.00001098922,0.0001002264,0.00003652104,0.001194898,0.00002803118,0.0008688186,0.00002000199,0.00006140061,0.00008604743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003781364,"about_ca_system_score_gemma":0.00009421702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000341334,"about_ca_topic_score_gemma":0.000006983096,"domain_scores_codex":[0.9989882,0.00004815977,0.0001909975,0.0003373882,0.0002792161,0.0001560168],"domain_scores_gemma":[0.9993479,0.00002020727,0.00007356482,0.0002792613,0.0002122422,0.00006688603],"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.000004631179,0.000076702,0.0001044924,0.000002860814,0.00002355575,0.000001855474,0.0001522922,0.9664524,0.000001797638,0.003796981,0.0002498002,0.02913259],"study_design_scores_gemma":[0.0002709696,0.00006198152,0.0001694059,0.000009380741,0.00001507643,0.00001902572,0.00001178559,0.9972625,0.00008447652,0.0001397504,0.001805427,0.0001502225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000585194,0.00001728593,0.9909407,0.001035756,0.00005204056,0.0002081349,0.000003312882,0.0001745425,0.007509661],"genre_scores_gemma":[0.01323319,0.00007941011,0.9782319,0.000356389,0.00005636979,0.00006277335,0.00006899033,0.00001250886,0.007898469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03081005,"threshold_uncertainty_score":0.99923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074972460","doi":"10.1287/trsc.34.3.289.12299","title":"A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Tariff; Bilevel optimization; Mathematical optimization; Heuristic; Revenue; Schedule; Integer programming; Set (abstract data type); Integer (computer science); Computer science; Branch and bound; Class (philosophy); Operations research; Mathematics; Economics; Optimization problem; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.01632194362349718,"gpt":0.2490854533792099,"spread":0.2327635097557127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764564,0.00008492692,0.0000888025,0.0001540265,0.0004210971,0.000164524,0.0003159224,0.00002956393,0.00003855748],"category_scores_gemma":[0.000008370637,0.00007802624,0.00003807924,0.0008853487,0.00009287857,0.001336953,0.000004886396,0.00003954342,0.000006179622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002419992,"about_ca_system_score_gemma":0.0001801209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000326405,"about_ca_topic_score_gemma":0.00002356322,"domain_scores_codex":[0.9987829,0.000009013092,0.0002362641,0.0004120589,0.0003567937,0.0002030084],"domain_scores_gemma":[0.9994355,0.00003226934,0.0000701681,0.0001441681,0.0002254181,0.00009242503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000064284,0.00008335047,0.0003318261,0.00001635245,0.00001227626,8.18315e-7,0.003712406,0.2330069,0.002074028,0.1737208,0.0001020741,0.5869327],"study_design_scores_gemma":[0.0002559114,0.00001677928,0.004993312,0.000005862487,0.00000961164,9.570915e-7,0.000007074272,0.9832517,0.0001930343,0.01094157,0.0002153065,0.0001089137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003970245,0.00001295545,0.9941896,0.001092542,0.00002331286,0.0001942987,0.00002371917,0.00007753307,0.0004158081],"genre_scores_gemma":[0.211546,0.00001361163,0.7875404,0.0002826334,0.0000121442,0.00003644361,0.00001978822,0.000003314641,0.0005457382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7502447,"threshold_uncertainty_score":0.3238781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604467579","doi":"10.1016/s1570-579x(01)80004-5","title":"Joint and Separate Convexity of the Bregman Distance","year":2001,"lang":"en","type":"book-chapter","venue":"Studies in computational mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Okanagan University College","funders":"","keywords":"Bregman divergence; Convexity; Mathematics; Regular polygon; Convex function; Separable space; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07660182010554445,"gpt":0.3053946421004872,"spread":0.2287928219949428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002328095,0.0001824514,0.0004183176,0.000104461,0.0001046252,0.00002829294,0.0003165213,0.00006224866,0.00001813789],"category_scores_gemma":[0.00008099854,0.000133545,0.00009827321,0.0001391508,0.0002634432,0.00007868657,0.0003988571,0.0001333772,0.000006990102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006390126,"about_ca_system_score_gemma":0.00006297552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001485096,"about_ca_topic_score_gemma":0.0000138534,"domain_scores_codex":[0.99869,0.00002221819,0.0005419764,0.0002413231,0.0004126011,0.0000918462],"domain_scores_gemma":[0.998518,0.0003713069,0.0004819956,0.0002634971,0.0003416454,0.00002350717],"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":[7.373756e-7,0.000023499,0.00003328941,0.0001385435,0.0001254803,0.000001904489,0.00094174,0.02398494,1.292153e-7,0.9741911,0.0003914193,0.0001672667],"study_design_scores_gemma":[0.0001311573,0.000008981999,0.0002160139,0.0002398261,0.00002626062,0.000008745948,0.0000356188,0.2550408,9.353698e-7,0.7431185,0.001050347,0.0001228763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007496266,0.001477629,0.8536386,0.002665921,0.0003303774,0.0003590884,0.0000382917,0.00003940392,0.1413757],"genre_scores_gemma":[0.1371889,0.003313235,0.6243968,0.001476933,0.0002515975,0.0000529378,0.00005306775,0.00009112954,0.2331754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2310726,"threshold_uncertainty_score":0.5445807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067877923","doi":"10.1007/s11075-005-9010-6","title":"Extrapolation algorithm for affine-convex feasibility problems","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Subgradient method; Linear subspace; Theory of computation; Hilbert space; Affine transformation; Countable set; Algorithm; Mathematical optimization; Regular polygon; Convex optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02880830279725132,"gpt":0.2799854235218669,"spread":0.2511771207246156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174885,0.0001634927,0.000227625,0.0001047564,0.0001820017,0.0001531002,0.0004521826,0.00008541828,0.0001668783],"category_scores_gemma":[0.00005595167,0.0001457366,0.0001742179,0.0006975335,0.00002567539,0.0006677893,0.00007327901,0.0001003033,0.00009771653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072429,"about_ca_system_score_gemma":0.00006990253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274414,"about_ca_topic_score_gemma":0.000002451447,"domain_scores_codex":[0.9984192,0.00005354091,0.0003725928,0.0005173286,0.0003478461,0.0002894968],"domain_scores_gemma":[0.998977,0.0001264803,0.0001265766,0.0003504736,0.0002683872,0.0001510919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003069532,0.0003055662,0.0001904032,0.000006026361,0.00003743724,3.833292e-7,0.0001719442,0.01291383,0.00005466429,0.01190152,0.0007607951,0.9736543],"study_design_scores_gemma":[0.000506713,0.00006394319,0.001241112,0.000002726933,0.00001341652,0.0000036285,0.000004024951,0.9727883,0.0001407767,0.002937808,0.02210284,0.0001946999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000324987,0.00006159984,0.9932193,0.005350889,0.0001717449,0.0003540905,0.0000159245,0.0002311142,0.0005628567],"genre_scores_gemma":[0.02495264,0.00000930301,0.9725329,0.0007924158,0.0004192393,0.00008165993,0.00005362986,0.00001226383,0.001145974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9734597,"threshold_uncertainty_score":0.5942968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073044751","doi":"10.1137/s1052623499360616","title":"Erratum: Weak Sharp Solutions of Variational Inequalities","year":2000,"lang":"en","type":"erratum","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.02456082120706668,"gpt":0.251635378998436,"spread":0.2270745577913693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009810932,0.0004246877,0.0006218113,0.001255266,0.0005749611,0.000530473,0.001157379,0.0005165956,0.002547544],"category_scores_gemma":[0.0003012588,0.0004035301,0.0004265484,0.001364224,0.00006145763,0.001090083,0.0001311448,0.001035375,0.0000749523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002556171,"about_ca_system_score_gemma":0.001242368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001579931,"about_ca_topic_score_gemma":0.000004467906,"domain_scores_codex":[0.9958643,0.0004872991,0.001303916,0.0005048802,0.001427544,0.0004120943],"domain_scores_gemma":[0.9964255,0.0001963238,0.001432599,0.0005702755,0.00116614,0.0002091412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001195289,0.0001296217,0.000002447502,0.00001715342,0.0001330557,0.000002394625,0.000125735,0.573627,6.126519e-7,0.09200415,0.3335494,0.0003964244],"study_design_scores_gemma":[0.0004513603,0.0001491114,0.00008159994,0.0002200622,0.0001007541,0.00004849894,0.00002367695,0.9279479,0.000001611843,0.006447991,0.06410864,0.0004187811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[3.06179e-7,0.0004316881,0.8913356,0.003383105,0.007744553,0.0001400675,0.000100595,0.00008897868,0.09677508],"genre_scores_gemma":[0.001180371,0.009602811,0.4714819,0.0025493,0.00636116,0.00005611187,0.004856449,0.0001818862,0.50373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4198537,"threshold_uncertainty_score":0.9998416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W171925985","doi":"","title":"Identifying active constraints via partial smoothness and prox-regularity","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":81,"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":"Smoothness; Applied mathematics; Mathematics; Mathematical optimization; Nonlinear system; Set (abstract data type); Regular polygon; Computer science; Mathematical analysis; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01927381520613384,"gpt":0.2558426490702251,"spread":0.2365688338640912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001679959,0.00006285193,0.00008663563,0.00005324401,0.0001217655,0.0001479243,0.0001188266,0.00003049451,0.0002606385],"category_scores_gemma":[0.00004002086,0.00005489153,0.00002772434,0.00025189,0.00005036543,0.0004195546,0.00004629083,0.00004268865,0.00001660979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001277942,"about_ca_system_score_gemma":0.00003915112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001454159,"about_ca_topic_score_gemma":0.000008419497,"domain_scores_codex":[0.9993475,0.00006714942,0.0001125019,0.00021804,0.0001480436,0.0001067286],"domain_scores_gemma":[0.9996455,0.00003180148,0.00004391837,0.0001318259,0.00008309367,0.00006381288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001554056,0.00005566727,0.001917755,0.000004400997,0.00003411866,0.00000240065,0.0003510497,0.0002250615,0.0003254526,0.9860816,0.00003955187,0.01096138],"study_design_scores_gemma":[0.001407381,0.00004268877,0.03875094,0.00001450303,0.00006467501,0.00005952929,0.0002573522,0.8519363,0.03307526,0.07201524,0.001736825,0.0006392414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003239216,0.000007577156,0.991007,0.0003989565,0.00007950109,0.00006414101,7.027656e-7,0.0000499505,0.005152931],"genre_scores_gemma":[0.9195842,0.000002444749,0.07977442,0.0002211678,0.00001028741,0.000005184596,0.000001657205,0.000002048758,0.0003985715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.916345,"threshold_uncertainty_score":0.2853808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","retraction":null,"screen_n_in":null,"score":{"opus":0.03310765846871954,"gpt":0.2614845383108118,"spread":0.2283768798420922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002851333,0.0002631092,0.0003021426,0.0001365081,0.0002207977,0.001041273,0.0005954218,0.00008565806,0.0003626011],"category_scores_gemma":[0.0001306994,0.0001784843,0.0001302486,0.0008609645,0.00008442385,0.0006002779,0.000162495,0.0001876567,0.0007085066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005088078,"about_ca_system_score_gemma":0.00005885368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002371658,"about_ca_topic_score_gemma":0.00000553647,"domain_scores_codex":[0.9978411,0.00004926194,0.0004069745,0.0005136663,0.0006415988,0.0005474121],"domain_scores_gemma":[0.99859,0.0001968811,0.0001510336,0.0005431403,0.000277841,0.000241098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005617965,0.001566803,0.0001755921,0.00007108576,0.00008406521,0.00001010861,0.0003826213,0.0002080824,0.00001100952,0.2245823,0.0002126095,0.7726901],"study_design_scores_gemma":[0.0005528395,0.001018258,0.0004333242,0.0001413436,0.00004171127,0.00002590241,0.00009207772,0.8769525,0.0000709775,0.1176394,0.00244387,0.0005878147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003644996,0.000005094059,0.9892941,0.00157299,0.00003792857,0.001327959,6.809934e-7,0.0006937358,0.003422485],"genre_scores_gemma":[0.4076272,3.37279e-7,0.5910476,0.0002308602,0.00003157614,0.0006431341,0.000009473716,0.0000198307,0.0003900309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8767444,"threshold_uncertainty_score":0.9999958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022771530","doi":"10.1016/j.jmaa.2005.05.075","title":"On the convergence of implicit iteration process with error for a finite family of asymptotically nonexpansive mappings","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Banach space; Fixed point; Convergence (economics); Hilbert space; Pure mathematics; Weak convergence; Iterative and incremental development; Discrete mathematics; Applied mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01288656264371331,"gpt":0.2650692070839973,"spread":0.252182644440284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962286,0.00008047657,0.000318913,0.0002002062,0.00008020077,0.00004012546,0.0002852156,0.00002869556,0.0000320137],"category_scores_gemma":[0.000114821,0.00004466032,0.0001699482,0.0009939141,0.0000599826,0.0001520509,0.00001918989,0.00006030481,0.000001582023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008926724,"about_ca_system_score_gemma":0.0000508853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.845019e-7,"about_ca_topic_score_gemma":0.000001436138,"domain_scores_codex":[0.9988624,0.00002582151,0.0006020016,0.0001226589,0.0003132044,0.00007392064],"domain_scores_gemma":[0.9974062,0.000743889,0.0006491238,0.0001921884,0.0009532623,0.00005529712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002637322,0.0003999993,0.0001551379,0.00006669853,0.0007910386,1.067886e-7,0.0007886276,0.06414538,0.0009173725,0.931417,0.00004084131,0.001251396],"study_design_scores_gemma":[0.0002899918,0.0001717425,0.001309631,0.00004713227,0.0007751799,0.000004059458,0.0002075985,0.9395241,0.001315517,0.05617798,0.00008804871,0.00008907037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02080421,0.00001596268,0.9747046,0.00412931,0.000002014558,0.0001728932,0.000007813434,0.00000340912,0.0001597862],"genre_scores_gemma":[0.9099202,0.00001257245,0.08970286,0.0002654545,0.00002168631,0.00003737899,0.000002387963,0.000002920688,0.00003460338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8891159,"threshold_uncertainty_score":0.1821195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.0369526614574933,"gpt":0.2794488674892481,"spread":0.2424962060317548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004023571,0.0002454861,0.0004035879,0.00008417424,0.0004147176,0.0006979351,0.0004575868,0.00007653503,0.001442813],"category_scores_gemma":[0.0002214694,0.0001861175,0.0001313371,0.0005658781,0.0003279886,0.000516528,0.0001442342,0.0001359776,0.0002964019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005253444,"about_ca_system_score_gemma":0.00006512881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001875188,"about_ca_topic_score_gemma":0.00001297201,"domain_scores_codex":[0.9979646,0.00005143898,0.0005969612,0.0004500051,0.0004412458,0.0004957818],"domain_scores_gemma":[0.998005,0.0005742438,0.0001888633,0.0004391156,0.0005485935,0.0002442092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004229765,0.0008972181,0.0003201882,0.0002625781,0.0001628458,0.000002232543,0.0004194857,0.0002507406,0.00001038311,0.9899462,0.0002275102,0.00749632],"study_design_scores_gemma":[0.001042059,0.0002087677,0.0002637989,0.0001263359,0.0001004419,0.00004298867,0.0002684866,0.7677755,0.00002238162,0.228337,0.001408778,0.0004034571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001050038,0.000004421602,0.9908273,0.003892777,0.00002107996,0.001739783,0.00001373743,0.0003006358,0.002150262],"genre_scores_gemma":[0.2175397,4.969851e-7,0.7808929,0.0002581243,0.00002210551,0.001034649,0.0000959617,0.00001572165,0.0001403155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7675248,"threshold_uncertainty_score":0.99947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132628835","doi":"10.1007/s11228-013-0239-2","title":"Restricted Normal Cones and the Method of Alternating Projections: Theory","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Underpinning; Constraint (computer-aided design); Convergence (economics); Cone (formal languages); Mathematics; Computer science; Calculus (dental); Mathematical optimization; Applied mathematics; Algorithm; Engineering; Geometry; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01273990833924538,"gpt":0.2688874153341057,"spread":0.2561475069948603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003288,0.0001152963,0.0002803073,0.0004015681,0.0003000389,0.0001956554,0.0002404807,0.0000458752,0.0001731543],"category_scores_gemma":[0.0003101008,0.00007500362,0.000137726,0.001873999,0.00008264329,0.0004676006,0.0001363602,0.00008271798,0.000004301853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000114357,"about_ca_system_score_gemma":0.00004899441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009642745,"about_ca_topic_score_gemma":0.00001549972,"domain_scores_codex":[0.9983432,0.0005085691,0.0003996228,0.0002875161,0.0003409288,0.0001202148],"domain_scores_gemma":[0.9980879,0.0009216163,0.0002967453,0.0002149667,0.0004235125,0.00005519862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001373699,0.00002759604,0.003399885,0.000005732394,0.001221657,1.545145e-7,0.0008181248,0.01522195,0.0000515343,0.9768947,0.0000319057,0.002313066],"study_design_scores_gemma":[0.0005484858,0.00001130762,0.05897048,0.00000301996,0.0005348843,0.000003743965,0.000112612,0.8864787,0.00001828271,0.05320532,0.00002546778,0.00008769928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004333657,0.0001090139,0.99187,0.002693234,0.00003530529,0.0001590599,0.00001199016,0.00003152734,0.0007562442],"genre_scores_gemma":[0.7253401,0.00008507958,0.2732117,0.0004958594,0.00006899524,0.00005795517,0.000052804,0.000005428963,0.0006821043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9236893,"threshold_uncertainty_score":0.3058559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061220204","doi":"10.1287/moor.1060.0219","title":"Constraint Qualifications and KKT Conditions for Bilevel Programming Problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Mathematics; Bilevel optimization; Mathematical optimization; Constraint programming; Constraint logic programming; Constraint satisfaction; Binary constraint; Set (abstract data type); Nonlinear programming; Sequence (biology); Optimization problem; Nonlinear system; Computer science; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.1242592753038148,"gpt":0.4028250776607806,"spread":0.2785658023569658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994016,0.0000671629,0.0001270676,0.0003234395,0.0004964239,0.0002995167,0.0002733683,0.00003889916,0.00003256092],"category_scores_gemma":[0.0002485532,0.00006012104,0.00004438188,0.0006714138,0.0001666327,0.0002613249,0.0000739058,0.00007029188,0.000008030986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002333473,"about_ca_system_score_gemma":0.0001514037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007980606,"about_ca_topic_score_gemma":0.00007961901,"domain_scores_codex":[0.998853,0.00006212859,0.0003865365,0.0001955003,0.0003327217,0.0001701696],"domain_scores_gemma":[0.998116,0.0004220253,0.000044446,0.0002932636,0.001076046,0.00004828612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.483205e-7,0.0002599103,0.00002635687,0.00005650507,0.00001706128,7.814189e-8,0.0005001245,0.02139419,0.002539957,0.9745247,0.0002726225,0.0004081864],"study_design_scores_gemma":[0.0002101781,0.00004020341,0.0001364333,0.00002388006,0.000009507292,0.000004055077,0.0002623974,0.9375185,0.0005604354,0.06013396,0.001017247,0.00008326025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002049018,0.00003135253,0.9920375,0.003865556,0.00001306671,0.0007109566,0.00005698434,0.00003748474,0.001198045],"genre_scores_gemma":[0.3960365,0.000008124637,0.6028906,0.00001031961,0.00001867318,0.0002414143,0.0001117245,0.00000582417,0.000676788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9161243,"threshold_uncertainty_score":0.3818142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972168423","doi":"10.3934/jimo.2008.4.125","title":"Canonical dual approach to solving 0-1 quadratic programming problems","year":2008,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"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":"Dual polyhedron; Duality gap; Dual (grammatical number); Duality (order theory); Convexity; Mathematics; Canonical transformation; Quadratic programming; Convex analysis; Strong duality; Canonical form; Mathematical optimization; Wolfe duality; Perturbation function; Minification; Linear programming; Transformation (genetics); Convex optimization; Regular polygon; Weak duality; Optimization problem; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05270550080112391,"gpt":0.2373011241684848,"spread":0.1845956233673609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679611,0.000107221,0.0001929124,0.0003344615,0.0001968267,0.0001801331,0.0002261106,0.00006119646,0.000008679503],"category_scores_gemma":[0.00006505828,0.00008833646,0.00006191627,0.0007580506,0.00001943941,0.0006274261,0.0001315296,0.0001202686,0.000001449978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004945687,"about_ca_system_score_gemma":0.00007254021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008232802,"about_ca_topic_score_gemma":8.215861e-7,"domain_scores_codex":[0.9986934,0.00006810576,0.0004961014,0.0001820174,0.0004068054,0.0001535839],"domain_scores_gemma":[0.9992126,0.00002677916,0.0003007809,0.0001150923,0.0002036086,0.0001411906],"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.0000148515,0.0001620721,0.0002856895,0.00001188215,0.00009476121,0.00001024216,0.0004650588,0.9753165,0.000002760181,0.01468713,0.001378,0.007571016],"study_design_scores_gemma":[0.001517513,0.0002301562,0.0002520427,0.00006426351,0.00008438945,0.0001293434,0.0001146665,0.9926881,0.000009788727,0.0001258745,0.00457211,0.0002118213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006941997,0.00003138796,0.9958247,0.001434345,0.0001945658,0.0002696392,3.340658e-7,0.00002416397,0.001526697],"genre_scores_gemma":[0.08390217,0.0002767167,0.9146855,0.000305786,0.0002930425,0.00001464562,0.000006981644,0.000009356129,0.0005057539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08320798,"threshold_uncertainty_score":0.3602256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01117445259928318,"gpt":0.2768035725164913,"spread":0.2656291199172081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118751,0.00007884268,0.0001287935,0.0001846067,0.0002025138,0.0001023496,0.0001780157,0.00004747673,0.00001623261],"category_scores_gemma":[0.00006310004,0.00006758897,0.00005936337,0.0004041691,0.00002650586,0.0004021467,0.00003281543,0.00006580708,8.87428e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001336576,"about_ca_system_score_gemma":0.00006716167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.343389e-7,"about_ca_topic_score_gemma":4.080606e-7,"domain_scores_codex":[0.9992313,0.00003230238,0.0003671394,0.0001358668,0.0001283118,0.0001050121],"domain_scores_gemma":[0.9987677,0.0003228558,0.0003108328,0.0001097341,0.0003483592,0.000140539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001177316,0.00004369403,0.00002249573,0.000005261488,0.00003978578,2.235061e-7,0.0001541752,0.0463891,0.00001916424,0.3246758,0.00005576589,0.6285828],"study_design_scores_gemma":[0.00117215,0.0001228268,0.0002416863,0.0000202312,0.0001126132,0.00009078818,0.0001077051,0.9009352,0.000534338,0.07092709,0.02550657,0.0002288325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001280645,0.0001929533,0.9986866,0.0007306581,0.00004127081,0.0002011217,0.00000256202,0.00002247166,0.00010963],"genre_scores_gemma":[0.00370747,0.0001296727,0.9952095,0.0002524135,0.0002515443,0.00001122217,0.0000075415,0.000006835374,0.0004237791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8545461,"threshold_uncertainty_score":0.2756198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036651327","doi":"10.1007/s10957-012-0228-x","title":"Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Theory of computation; Mathematical optimization; Mathematics; Order (exchange); Mathematical economics; Independence (probability theory); Optimality criterion; Nonlinear system; Economics; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01473810147112159,"gpt":0.275257527337355,"spread":0.2605194258662334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951522,0.0001065311,0.000184421,0.0001182523,0.0001822619,0.0001329381,0.0002166876,0.00005159809,0.0002941604],"category_scores_gemma":[0.0000730429,0.00008164273,0.00006844688,0.0004254134,0.0001476174,0.0009025504,0.00003279767,0.00007988274,0.000003912106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001841768,"about_ca_system_score_gemma":0.00008428814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.71363e-8,"about_ca_topic_score_gemma":8.031049e-8,"domain_scores_codex":[0.9990545,0.0000939298,0.0003969773,0.0001263583,0.0001651074,0.0001631574],"domain_scores_gemma":[0.9982993,0.0003326657,0.0003860793,0.0001768285,0.0006315015,0.0001736198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000209582,0.000286607,0.0001290558,0.00002142287,0.00008772913,1.388862e-7,0.0001983829,0.06018556,0.00003302483,0.9372852,0.00006068743,0.001691253],"study_design_scores_gemma":[0.003750387,0.000533447,0.0008707325,0.0001057852,0.0006449408,0.000801807,0.0009849693,0.7326011,0.0007825374,0.2487276,0.009321503,0.0008751921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000348876,0.00006172182,0.9969479,0.0006609176,0.00002822021,0.0003607701,0.00001379064,0.0000303304,0.001547411],"genre_scores_gemma":[0.2750767,0.00001385057,0.724032,0.0002715779,0.0001361445,0.0001296392,0.00004113685,0.00001053206,0.0002884233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6885576,"threshold_uncertainty_score":0.3329294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1600479821","doi":"10.1090/s0002-9939-07-08960-5","title":"Maximality of sums of two maximal monotone operators in general Banach space","year":2007,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Banach space; Transversality; Pure mathematics; Regular polygon; Function space; Space (punctuation); Approximation property; Discrete mathematics; Function (biology); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01087434134665557,"gpt":0.2684613241348386,"spread":0.257586982788183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103124,0.0001103531,0.0004182354,0.00005010908,0.00003653334,0.00001974583,0.0006979175,0.00002902736,0.00001736974],"category_scores_gemma":[0.0001391223,0.00007829824,0.0002703594,0.001405976,0.000322965,0.0001926528,0.000281309,0.0001051829,0.000001042252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004803011,"about_ca_system_score_gemma":0.00003613047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001436248,"about_ca_topic_score_gemma":0.000001642954,"domain_scores_codex":[0.9985919,0.00001130943,0.0005493379,0.0002002289,0.0004526877,0.0001945656],"domain_scores_gemma":[0.9988161,0.00009808716,0.0005645868,0.0001620827,0.0003010291,0.00005812996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002261433,0.0004644487,0.09181672,0.0002076839,0.0001273991,1.41586e-7,0.003083505,0.0007857888,0.03141899,0.8713356,0.0001848014,0.0005522849],"study_design_scores_gemma":[0.0008825973,0.0001516663,0.0958983,0.000102131,0.00008536266,0.000004558771,0.002019493,0.6772885,0.1331515,0.09003258,0.00002278077,0.0003604904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8341686,0.000007920061,0.163615,0.0009117651,0.00001133324,0.0001210427,0.000002497244,0.00001421163,0.001147643],"genre_scores_gemma":[0.7437877,0.000006207067,0.2560506,0.00009216857,0.00001042939,0.000002675633,2.178826e-7,0.000004736521,0.00004523429],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.781303,"threshold_uncertainty_score":0.3192909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115871049","doi":"10.1007/s10107-002-0365-3","title":"Multiobjective optimization problem with variational inequality constraints","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Variational inequality; Mathematical optimization; Inequality; Numerical analysis; Multi-objective optimization; Variational analysis; Applied mathematics; Mathematical economics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01709248525124503,"gpt":0.2509153616108618,"spread":0.2338228763596167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964764,0.0001372964,0.0001771637,0.000090919,0.00017383,0.0002491541,0.0001969327,0.00005552267,0.0003177623],"category_scores_gemma":[0.0002993866,0.0001063865,0.0000536718,0.0006519866,0.00007438933,0.0004405679,0.00003676223,0.00009593,0.00004076951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005446086,"about_ca_system_score_gemma":0.0001055616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002495935,"about_ca_topic_score_gemma":0.000001055741,"domain_scores_codex":[0.9985921,0.000141215,0.0003216392,0.0003183226,0.0004068729,0.0002198775],"domain_scores_gemma":[0.9990397,0.0001959044,0.0001478324,0.00022478,0.0002896482,0.0001021029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002479565,0.0002380727,0.0002000702,0.00002285331,0.00004921115,0.000001897794,0.0004457156,0.06782138,0.000002888811,0.9259078,0.000005526008,0.005302137],"study_design_scores_gemma":[0.0005817955,0.00006208823,0.000134705,0.00002803252,0.00002958965,0.00002842899,0.0000919036,0.9499975,0.00005806883,0.04851205,0.0002376217,0.000238192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005204474,0.000004141299,0.9872732,0.0003752699,0.00001948387,0.0003118255,0.000001265813,0.0001677173,0.01179507],"genre_scores_gemma":[0.1912858,4.335827e-7,0.8084434,0.00009510443,0.00001064507,0.00005978685,0.000009816519,0.000007259654,0.00008776924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8821762,"threshold_uncertainty_score":0.4338317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120257557","doi":"10.1287/moor.1100.0480","title":"Necessary Optimality Conditions for Multiobjective Bilevel Programs","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Bilevel optimization; Mathematical optimization; Mathematics; Constraint (computer-aided design); Complementarity (molecular biology); Optimization problem; Upper and lower bounds; Multi-objective optimization; Set (abstract data type); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.3096603620746675,"gpt":0.4282102137386596,"spread":0.1185498516639921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100652,0.00007683793,0.0001520429,0.0003009218,0.0003938577,0.0001300214,0.0005649809,0.0000489352,0.0001360177],"category_scores_gemma":[0.0004185879,0.00006652671,0.00008395935,0.0008562493,0.0001194991,0.0004871112,0.0001444349,0.00009610371,0.00003061391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499954,"about_ca_system_score_gemma":0.0001856299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001062618,"about_ca_topic_score_gemma":0.00004607679,"domain_scores_codex":[0.9987373,0.00009747177,0.0003413934,0.0002227788,0.0004053655,0.0001957227],"domain_scores_gemma":[0.9973881,0.0002358759,0.00004339907,0.0004310451,0.001831948,0.00006968027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003301877,0.00107775,0.00009126253,0.00005473652,0.00007008826,3.815e-7,0.00484194,0.006439011,0.0004297252,0.9861546,0.0002187721,0.0006185017],"study_design_scores_gemma":[0.0002385049,0.0001075548,0.0005903392,0.00001771797,0.00001022414,0.000001720296,0.0004780287,0.9565175,0.002242629,0.03967077,0.00003803557,0.00008694041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0034729,0.000009084994,0.990769,0.0004788826,0.00002881854,0.0007229717,0.00003840495,0.00004548416,0.004434409],"genre_scores_gemma":[0.4124573,0.000004136562,0.586675,0.00001199605,0.00001129829,0.0003057152,0.00003543985,0.000005418996,0.0004936795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9500785,"threshold_uncertainty_score":0.3029275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995973195","doi":"10.1090/s0002-9939-03-07050-3","title":"Construction of best Bregman approximations in reflexive Banach spaces","year":2003,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Banach space; Bregman divergence; Countable set; Intersection (aeronautics); Reflexivity; Regular polygon; Uniformly convex space; Construct (python library); Projection (relational algebra); Pure mathematics; Space (punctuation); Point (geometry); Eberlein–Šmulian theorem; Applied mathematics; Computer science; Lp space; Sociology; Algorithm; Geometry; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01318626571058177,"gpt":0.2564702723575298,"spread":0.243284006646948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003322054,0.00007962195,0.0002416596,0.0000428813,0.00006277418,0.00003343534,0.0003684946,0.00002434129,0.00001781582],"category_scores_gemma":[0.0002308428,0.00005692997,0.0001658689,0.001318948,0.0003187291,0.0002133287,0.00007955284,0.00008073255,0.000002774928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003583425,"about_ca_system_score_gemma":0.00003370436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001521521,"about_ca_topic_score_gemma":4.671635e-7,"domain_scores_codex":[0.9991228,0.00001422147,0.0003122317,0.0001562949,0.0002801053,0.0001143624],"domain_scores_gemma":[0.9990825,0.00008579846,0.0004650101,0.0001146762,0.0002188624,0.0000331419],"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.000001131523,0.0001308365,0.003668793,0.00005822664,0.00003279061,8.987501e-9,0.00121885,0.000125536,0.0007789416,0.993568,0.00009356374,0.0003232961],"study_design_scores_gemma":[0.0004455684,0.0001066934,0.004381508,0.0001472575,0.00009102891,0.00001448913,0.007560224,0.2731146,0.01075483,0.7029464,0.0001436919,0.000293728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4330518,0.00002919255,0.5238798,0.006416197,0.00005521494,0.0004559483,0.000005843321,0.0000698628,0.03603616],"genre_scores_gemma":[0.5253838,0.0000117507,0.4744424,0.00007421494,0.000004748973,0.000007963782,1.950792e-7,0.000003388187,0.00007155416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2906216,"threshold_uncertainty_score":0.2321537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.004767419257291239,"gpt":0.222882289590336,"spread":0.2181148703330448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007588427,0.0001053151,0.0001768231,0.0002019745,0.0002354471,0.0001923861,0.0001673051,0.00005117183,0.00001411348],"category_scores_gemma":[0.00005804148,0.00009258979,0.00005636667,0.0003299809,0.00006631997,0.0006042453,0.0000219102,0.00005973098,2.709284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905176,"about_ca_system_score_gemma":0.00005513498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001688279,"about_ca_topic_score_gemma":5.410595e-7,"domain_scores_codex":[0.9990372,0.0000894472,0.0004719592,0.0001681393,0.0001287259,0.0001045509],"domain_scores_gemma":[0.9984661,0.0003065986,0.000473954,0.0001238992,0.0005624297,0.00006698782],"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.00001571863,0.00005605647,0.00004335476,0.000009602087,0.00002606343,1.163031e-7,0.00003967537,0.7349586,0.00007069846,0.2605249,0.00004437986,0.004210781],"study_design_scores_gemma":[0.0007997679,0.00007432971,0.00007849548,0.00001334716,0.00006949344,0.00003446565,0.00002516869,0.9345019,0.0002039759,0.06266241,0.001405202,0.000131471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003596464,0.0002360857,0.9978185,0.001106333,0.00001977015,0.0004294271,0.0000157023,0.00004743199,0.0002907591],"genre_scores_gemma":[0.1183431,0.0002037079,0.8806117,0.0003026639,0.0001154591,0.0001140386,0.00003076334,0.00001244705,0.0002661273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1995432,"threshold_uncertainty_score":0.3775702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2181874083","doi":"","title":"A Dykstra-like algorithm for two monotone operators","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":57,"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":"Mathematics; Hilbert space; Monotone polygon; Intersection (aeronautics); Extension (predicate logic); Regular polygon; Operator (biology); Resolvent; Duality (order theory); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01212399620389896,"gpt":0.2779850368416671,"spread":0.2658610406377681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003049658,0.00006397504,0.00007784965,0.00009695678,0.00009343891,0.0000973054,0.0002614037,0.00002322579,0.00008716818],"category_scores_gemma":[0.000009573447,0.00005341155,0.00006189578,0.0004010863,0.000007907978,0.0002566242,0.00004131385,0.00002617769,0.00003835508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002007582,"about_ca_system_score_gemma":0.00003241526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000348549,"about_ca_topic_score_gemma":0.00002216353,"domain_scores_codex":[0.9993502,0.000008062809,0.0001586358,0.0001947283,0.0001369949,0.0001513923],"domain_scores_gemma":[0.9995235,0.00006028604,0.00003069294,0.0001667022,0.0001410852,0.00007778362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003006513,0.0001415078,0.000243151,0.000002548038,0.00007954365,0.000003808874,0.0002481986,0.005902186,0.0002153683,0.6957377,0.002779086,0.2946439],"study_design_scores_gemma":[0.0003446124,0.00001922928,0.0002885354,7.501153e-7,0.000005570675,0.000001428324,0.00001505694,0.9903136,0.001205547,0.0009139705,0.006799144,0.00009255904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001219013,0.000008496237,0.9952031,0.0006925976,0.0001460637,0.0001024081,0.00000212799,0.00009416797,0.003629073],"genre_scores_gemma":[0.04384835,0.000002042173,0.9502232,0.001736268,0.00007365561,0.00001016461,0.000009297186,0.00000440665,0.004092599],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9844114,"threshold_uncertainty_score":0.217806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101393121","doi":"10.1007/s11228-011-0187-7","title":"Firmly Nonexpansive Mappings and Maximally Monotone Operators: Correspondence and Duality","year":2011,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Monotone polygon; Mathematics; Duality (order theory); Fixed point; Dual (grammatical number); Convergence (economics); Pure mathematics; Monotonic function; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02664853637802502,"gpt":0.2432763106379922,"spread":0.2166277742599672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089706,0.0002121489,0.00036474,0.0005072565,0.0003489417,0.0002759473,0.0002454578,0.00009401995,0.0002349509],"category_scores_gemma":[0.0001199777,0.0001911006,0.0000984983,0.001594342,0.00009187498,0.0007864687,0.0002468824,0.0001068657,0.00001221557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002420392,"about_ca_system_score_gemma":0.000077185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006240391,"about_ca_topic_score_gemma":0.00005186245,"domain_scores_codex":[0.9981659,0.0001715854,0.0003988314,0.0006620529,0.0003946011,0.0002070152],"domain_scores_gemma":[0.9988082,0.0001452771,0.0001942966,0.000275457,0.0003716066,0.0002051701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008427304,0.0001928266,0.08419247,0.00002967145,0.002470521,0.00001554105,0.009564553,0.001875015,0.000272323,0.8987916,0.0001538372,0.002357368],"study_design_scores_gemma":[0.0003616952,0.00004016254,0.3127097,0.000006390086,0.000462024,0.000008999268,0.0001174927,0.6776665,0.00002732111,0.008240182,0.0001119677,0.0002475735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0874484,0.0002156678,0.9097159,0.00153116,0.0000581932,0.0001463841,0.00005990237,0.00007519651,0.0007492151],"genre_scores_gemma":[0.8930039,0.0001867343,0.105145,0.001052974,0.00004316796,0.00001936101,0.00007050265,0.000007499956,0.0004707756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8905514,"threshold_uncertainty_score":0.7792856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065416951","doi":"10.1007/s00013-014-0652-2","title":"On the local convergence of the Douglas–Rachford algorithm","year":2014,"lang":"en","type":"article","venue":"Archiv der Mathematik","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Regular polygon; Scheme (mathematics); Point (geometry); Fixed point; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007544935065508547,"gpt":0.1968315959106141,"spread":0.1892866608451055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000313691,0.00007688534,0.0001004252,0.00003322229,0.0001414652,0.00003552192,0.0008682311,0.00001604222,0.0001025322],"category_scores_gemma":[0.00009869677,0.00003780641,0.0000970969,0.0002807332,0.0000817538,0.00007933327,0.0001825102,0.00007903434,0.00008555102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006494082,"about_ca_system_score_gemma":0.00002446716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009377213,"about_ca_topic_score_gemma":0.000003212108,"domain_scores_codex":[0.9991375,0.0001219993,0.0001845855,0.0001469491,0.0003029196,0.0001060919],"domain_scores_gemma":[0.9987048,0.0005376677,0.0001185063,0.0005596336,0.00005092105,0.00002847048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.768995e-7,0.00003584881,0.00003223892,0.000004731574,0.00001946318,7.352713e-8,0.00064991,0.002671658,0.00001167668,0.9887372,0.0008898063,0.006946825],"study_design_scores_gemma":[0.00006519412,0.00001239436,0.0008179405,0.00001211397,0.000007310016,0.000002154716,0.00001682581,0.7845933,0.0004264765,0.2131729,0.0008259784,0.00004734239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008767954,0.000004938387,0.9868986,0.004415374,0.0001278836,0.00008018067,0.000001526737,0.00002441162,0.007570315],"genre_scores_gemma":[0.9169945,0.000003815516,0.0800507,0.00178994,0.00003935169,0.00001249769,0.000001426327,0.00000671185,0.001101053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9161177,"threshold_uncertainty_score":0.1613404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041901627","doi":"10.1007/s11228-013-0238-3","title":"Restricted Normal Cones and the Method of Alternating Projections: Applications","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Linear subspace; Convexity; Convex cone; Regular polygon; Cone (formal languages); Generalization; Convex analysis; Mathematics; Simple (philosophy); Convex set; Property (philosophy); Dual cone and polar cone; Subderivative; Convergence (economics); Space (punctuation); Convex optimization; Combinatorics; Mathematical optimization; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01332822731432294,"gpt":0.2756673167549808,"spread":0.2623390894406579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289036,0.0001096505,0.000260408,0.0003939879,0.0003474817,0.0001938145,0.0002492355,0.00004439166,0.0001023784],"category_scores_gemma":[0.0001267352,0.00007532786,0.0001243053,0.002313258,0.00007563286,0.0004211674,0.0001262279,0.00007795506,0.000005606644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001248571,"about_ca_system_score_gemma":0.00005007352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243714,"about_ca_topic_score_gemma":0.00002193951,"domain_scores_codex":[0.9986121,0.000241276,0.0004115958,0.0002998141,0.0003211003,0.0001141181],"domain_scores_gemma":[0.9983566,0.0005633144,0.0003034632,0.0002400946,0.0004773585,0.00005913541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007082142,0.00004432437,0.005989706,0.000008991067,0.001186542,8.443744e-8,0.0005623116,0.02148012,0.00007645735,0.967068,0.00004476443,0.00353158],"study_design_scores_gemma":[0.0004793736,0.00000834501,0.05867196,0.000002142061,0.0004869331,0.000003359757,0.00007295345,0.9198974,0.00001511957,0.02017957,0.00009530824,0.00008757144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001512191,0.00009553041,0.9939937,0.003420818,0.00001876955,0.0002633742,0.00001617146,0.00003429202,0.0006451409],"genre_scores_gemma":[0.5849034,0.0000916184,0.4136881,0.0004091943,0.00008021102,0.0002462319,0.00009049875,0.000005552672,0.0004851216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468884,"threshold_uncertainty_score":0.3071781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534940407","doi":"","title":"Compactly epi-Lipschitzian convex sets and functions in normed spaces","year":2000,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Subspace topology; Codimension; Pure mathematics; Regular polygon; Convex analysis; Convex function; Boundary (topology); Convexity; Mathematical analysis; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009972924484827245,"gpt":0.227520865284448,"spread":0.2175479407996207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008923408,0.00006261172,0.00009613136,0.0001158796,0.00007826371,0.0001358882,0.0001275503,0.00002523358,0.001706166],"category_scores_gemma":[0.000009377918,0.00005282561,0.00002264287,0.0004648315,0.00001929729,0.000347735,0.00002412922,0.00004720663,0.0001833269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197352,"about_ca_system_score_gemma":0.00002623334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001854615,"about_ca_topic_score_gemma":0.0003200118,"domain_scores_codex":[0.9994463,0.00003402522,0.0001251635,0.0001760324,0.0001113433,0.0001071451],"domain_scores_gemma":[0.9996898,0.00005236936,0.00002133578,0.000136827,0.00002858069,0.00007109182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004352202,0.0007422484,0.2708577,0.00002558793,0.0002056533,0.00002352925,0.004333295,0.1128963,0.0001364957,0.442417,0.01616698,0.1521517],"study_design_scores_gemma":[0.0003893657,0.00002044113,0.142327,0.000003740534,0.000005615302,0.000005794489,0.00005257468,0.8478251,0.00001368112,0.001220908,0.008011248,0.000124635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2488767,0.00009593796,0.5356473,0.03749013,0.0001745708,0.0002298475,0.00000929492,0.0003076449,0.1771686],"genre_scores_gemma":[0.9676752,0.0000252826,0.02258528,0.001134945,0.00001353893,0.000003520337,0.000008836457,0.000002512841,0.008550884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7349287,"threshold_uncertainty_score":0.9992064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963452913","doi":"10.1016/j.jfa.2012.07.013","title":"Fixed point properties for semigroups of nonlinear mappings and amenability","year":2012,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Alberta","funders":"","keywords":"Mathematics; Semigroup; Pure mathematics; Bicyclic semigroup; Banach space; Regular polygon; Fixed point; Cancellative semigroup; Fixed-point property; Fixed-point theorem; Bounded function; Discrete mathematics; Special classes of semigroups; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02591067202407278,"gpt":0.2269980357302494,"spread":0.2010873637061766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954529,0.00008805869,0.0003350393,0.0004474297,0.00008369614,0.00004206529,0.0001617945,0.00003763905,0.00007068692],"category_scores_gemma":[0.0002194187,0.00006241053,0.0004063446,0.0009289756,0.00003852858,0.0007268969,0.00005064889,0.00006928004,0.000001162591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004153885,"about_ca_system_score_gemma":0.00006051297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329662,"about_ca_topic_score_gemma":0.000002883673,"domain_scores_codex":[0.9987711,0.00005482373,0.0005540149,0.0001213567,0.000375968,0.0001227557],"domain_scores_gemma":[0.9981452,0.0001477753,0.0005288856,0.0001379133,0.0009308106,0.0001094741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008112735,0.002991083,0.5221271,0.0003451829,0.02255789,0.000002100611,0.004763282,0.3322194,0.02018971,0.08004254,0.004716802,0.009233707],"study_design_scores_gemma":[0.0008055519,0.0001978994,0.1552885,0.0000178333,0.002080187,0.00002890026,0.0002584897,0.8345831,0.00169791,0.002016119,0.002797201,0.0002282816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06703939,0.0003179618,0.9298463,0.002576813,0.0001099953,0.00004928798,0.000007485874,0.000007097661,0.00004563553],"genre_scores_gemma":[0.9073008,0.00002855478,0.09203438,0.0002040467,0.0001883888,0.000003223666,0.00000733197,0.000003059994,0.000230269],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8402613,"threshold_uncertainty_score":0.2545028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1679530233","doi":"10.48550/arxiv.0805.4256","title":"Monotone Linear Relations: Maximality and Fitzpatrick Functions","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":48,"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":"Mathematics; Monotonic function; Monotone polygon; Affine transformation; Linear operators; Skew; Regular polygon; Discrete mathematics; Graph; Operator (biology); Linear map; Pure mathematics; Combinatorics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04762173557120956,"gpt":0.2623533702017976,"spread":0.214731634630588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001950832,0.0002044601,0.0002545647,0.0002363935,0.000330083,0.00008323465,0.0004180946,0.0002153209,0.0001037016],"category_scores_gemma":[0.0001444265,0.000204278,0.0001470561,0.0005630463,0.000051806,0.0003134783,0.0007770525,0.000404784,0.0003597947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000669935,"about_ca_system_score_gemma":0.0001666201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001791643,"about_ca_topic_score_gemma":0.00001025252,"domain_scores_codex":[0.9984375,0.00009667993,0.0003979381,0.0006395371,0.0002584858,0.0001699114],"domain_scores_gemma":[0.9985498,0.0001035243,0.0002354382,0.0007142251,0.0002782687,0.0001186965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000008421579,0.0002452124,0.8704338,0.00003896301,0.0002789443,0.00001472616,0.0006814583,0.1140829,0.00001475274,0.009156052,0.003735238,0.001309507],"study_design_scores_gemma":[0.0002296002,0.00001779238,0.5106601,0.00001707873,0.00007034364,0.0000102869,0.00001166726,0.4806655,0.00001575371,0.001761875,0.006220174,0.0003197687],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1312916,0.0003604342,0.8610035,0.004427281,0.0004085694,0.0002170912,0.00002974941,0.0002559496,0.002005827],"genre_scores_gemma":[0.9233004,0.001226753,0.0667627,0.0006443918,0.0002869567,0.00006791872,0.0002134353,0.00001965605,0.007477746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7942408,"threshold_uncertainty_score":0.8330213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975952334","doi":"10.1007/pl00011384","title":"Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotonic function; Cutting-plane method; Variational inequality; Regular polygon; Plane (geometry); Set (abstract data type); Order (exchange); Applied mathematics; Inequality; Variational analysis; Mathematical optimization; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0348545579723836,"gpt":0.348124457870492,"spread":0.3132698998981084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928855,0.00009257369,0.00019501,0.00004450179,0.0002578722,0.0001232595,0.000357448,0.00004009492,0.0003621203],"category_scores_gemma":[0.0005474849,0.00006601508,0.0001225792,0.0003053971,0.00006771968,0.0001669651,0.00005583448,0.00006948144,0.00001207386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001898602,"about_ca_system_score_gemma":0.00003275431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007346613,"about_ca_topic_score_gemma":5.645089e-7,"domain_scores_codex":[0.9988359,0.0001276217,0.0004537886,0.0002023585,0.0002010497,0.0001792421],"domain_scores_gemma":[0.99694,0.002459274,0.0001256081,0.0002859066,0.0001440015,0.00004523187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002431412,0.000121477,0.00002887394,0.00008338496,0.00004638972,7.002716e-8,0.001006198,0.001647787,0.00008230611,0.8935432,0.00001715732,0.1034208],"study_design_scores_gemma":[0.0001371069,0.00001942303,0.0001438089,0.00001724436,0.00003261305,0.000003893342,0.00009291872,0.7451814,0.0002870728,0.2518659,0.002125059,0.00009360183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004674915,0.00001572034,0.996447,0.001202189,0.00001994153,0.0003325105,0.000006688788,0.00008229799,0.001426119],"genre_scores_gemma":[0.1383611,0.000001032594,0.8611262,0.00008682882,0.00003814956,0.0001661412,0.00001645007,0.000005558256,0.0001985113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7435336,"threshold_uncertainty_score":0.3964963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096624591","doi":"10.1090/s0002-9939-02-06761-8","title":"A characterization of quasiconvex vector-valued functions","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quasiconvex function; Characterization (materials science); Mathematics; Regular polygon; Banach space; Cone (formal languages); Pure mathematics; Convex cone; Scalar (mathematics); Euclidean space; Space (punctuation); Mathematical analysis; Geometry; Subderivative; Convex optimization; Physics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01496332620223861,"gpt":0.2208238028745017,"spread":0.2058604766722631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001666738,0.00008368073,0.0002403086,0.00002661112,0.00008654711,0.00003567079,0.0004746726,0.00002231701,0.0001078914],"category_scores_gemma":[0.0001128261,0.00005804359,0.0002627848,0.001100244,0.0001782751,0.0002302422,0.0001331048,0.00006664931,0.00001577017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002229897,"about_ca_system_score_gemma":0.000009296757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000384454,"about_ca_topic_score_gemma":3.492598e-8,"domain_scores_codex":[0.9990969,0.000008169662,0.0002955862,0.0001544803,0.0003336567,0.0001111942],"domain_scores_gemma":[0.9989795,0.00004742878,0.0005184544,0.0001371398,0.0002761943,0.00004126054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007673873,0.0008538165,0.00287133,0.0002454693,0.0003234928,2.982861e-8,0.006690012,0.0000531525,0.1739122,0.8107665,0.002371666,0.001904723],"study_design_scores_gemma":[0.0002162255,0.0001012947,0.01112446,0.00004757986,0.0000894281,0.000003368281,0.0003868106,0.9672049,0.009764004,0.01069916,0.0001837243,0.0001790913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4258479,0.000008708049,0.5633098,0.006529102,0.00005608995,0.0002317346,0.000008511089,0.0001042759,0.003903935],"genre_scores_gemma":[0.9470162,0.0000130562,0.05191408,0.0003333437,0.00002558194,0.00001175038,8.117063e-7,0.000006707462,0.0006783971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9671517,"threshold_uncertainty_score":0.2366949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161827144","doi":"10.1287/trsc.1030.0039","title":"A New Look at the Multiclass Network Equilibrium Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"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":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Variational inequality; Solver; Convergence (economics); Mathematical optimization; Class (philosophy); Operator (biology); Property (philosophy); Computer science; Flow network; Mathematical economics; Mathematics; Economics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01293488888771944,"gpt":0.2449017071211997,"spread":0.2319668182334802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004881702,0.00009232674,0.000083881,0.00007189599,0.000397003,0.0002056312,0.0009003798,0.00002326854,0.0001086375],"category_scores_gemma":[0.00001447589,0.00006493592,0.0000591092,0.002294976,0.0001429642,0.001027048,0.00002669944,0.00005958014,0.0001201746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008766103,"about_ca_system_score_gemma":0.0004974808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001322862,"about_ca_topic_score_gemma":0.0003650838,"domain_scores_codex":[0.9984169,0.00001581551,0.0002470382,0.0003786836,0.0006698693,0.0002716891],"domain_scores_gemma":[0.9991842,0.00004218716,0.0001089159,0.0003443669,0.0001782254,0.0001421372],"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.000003642331,0.00001727772,0.001493061,0.000002053381,0.000005970418,0.000001793864,0.001509154,0.7769707,0.001451052,0.2169554,0.0003928358,0.00119706],"study_design_scores_gemma":[0.002996877,0.0001452538,0.2201107,0.00006085941,0.00008786916,0.0000164722,0.0001448407,0.6566634,0.01212412,0.09334252,0.01333839,0.0009686649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01016102,0.00003339262,0.9797601,0.008475451,0.000193752,0.0001543797,0.00000186231,0.0001066903,0.001113358],"genre_scores_gemma":[0.6681787,0.00000673422,0.3279312,0.001201836,0.00006761957,0.00001116659,0.00001027511,0.000005286811,0.002587209],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6580177,"threshold_uncertainty_score":0.3053466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020603765","doi":"10.1007/s10107-020-01500-6","title":"Generalized monotone operators and their averaged resolvents","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Resolvent; Monotonic function; Monotone polygon; Operator (biology); Convergence (economics); Set (abstract data type); Scaling; Class (philosophy); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02656643460086841,"gpt":0.2442747187091969,"spread":0.2177082841083285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001688558,0.0001031376,0.0001747764,0.00003240136,0.0001176331,0.0002605262,0.0002439849,0.00003383998,0.00006243225],"category_scores_gemma":[0.0001311722,0.00007500343,0.00005522288,0.0003321348,0.00002285009,0.0001982515,0.0001689457,0.00007329183,0.00004449557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008604778,"about_ca_system_score_gemma":0.00001258386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001873828,"about_ca_topic_score_gemma":2.04459e-7,"domain_scores_codex":[0.9991925,0.00005257238,0.0002138623,0.0002434653,0.0001484393,0.0001491363],"domain_scores_gemma":[0.9995349,0.00006000394,0.00004524348,0.0001486489,0.00004405985,0.0001671193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009430123,0.0001838397,0.0002533451,0.00009381996,0.0001199728,0.00000931071,0.006696657,0.000555981,0.0005605022,0.911284,0.000200851,0.08003232],"study_design_scores_gemma":[0.0003169867,0.00003426461,0.000046792,0.0000100238,0.000009326686,0.000003285989,0.00005647278,0.9831577,0.0004811057,0.01315087,0.002597886,0.0001353023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009135985,0.00004456171,0.9853509,0.00477859,0.0000144856,0.0001520975,6.154208e-7,0.0001494219,0.0003733284],"genre_scores_gemma":[0.556264,0.000005811853,0.4424324,0.001157968,0.00003667225,0.00002234461,0.000003500481,0.000008019138,0.0000692015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9826017,"threshold_uncertainty_score":0.3058551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975786171","doi":"10.1007/s10589-013-9627-7","title":"A smoothing augmented Lagrangian method for solving simple bilevel programs","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Augmented Lagrangian method; Karush–Kuhn–Tucker conditions; Mathematical optimization; Smoothing; Mathematics; Bilevel optimization; Simple (philosophy); Lagrangian relaxation; Penalty method; Optimization problem; Limit point; Bounded function; Constraint (computer-aided design); Bellman equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01853808127030524,"gpt":0.2848250680887153,"spread":0.26628698681841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043166,0.0001489928,0.0001566662,0.0001978227,0.0005121161,0.0005056267,0.0002814719,0.00006109089,0.00008706852],"category_scores_gemma":[0.00003548455,0.000147482,0.00007862408,0.0007608918,0.00003009268,0.0006501033,0.00008703266,0.00005863237,0.00002297539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003530965,"about_ca_system_score_gemma":0.00007044007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003038403,"about_ca_topic_score_gemma":0.000002461429,"domain_scores_codex":[0.9987726,0.00003605639,0.0003589894,0.0004256126,0.0002144761,0.000192228],"domain_scores_gemma":[0.9985567,0.0002751685,0.0001787461,0.0001991607,0.0006526631,0.0001375633],"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":[7.927476e-7,0.00007211683,0.00006962502,0.00001078981,0.00002909126,3.125361e-8,0.00009693053,0.7628666,0.00001782865,0.1931648,0.0003588366,0.04331253],"study_design_scores_gemma":[0.0003991554,0.00001847527,0.0004268214,0.000005558653,0.00001901746,0.000003405014,0.00003402575,0.9548444,0.0000113986,0.04056626,0.003499894,0.0001715548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001745904,0.0000371153,0.9943055,0.003889741,0.00002626787,0.001125374,0.00001236668,0.0002240095,0.0003621865],"genre_scores_gemma":[0.02260544,0.00001026117,0.9739094,0.001175269,0.00006382598,0.001345203,0.0006472269,0.00001515762,0.0002282159],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1919778,"threshold_uncertainty_score":0.6014141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593829505","doi":"10.1016/j.jat.2012.05.008","title":"Attouch–Théra duality revisited: Paramonotonicity and operator splitting","year":2012,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Duality (order theory); Monotone polygon; Hilbert space; Operator (biology); Intersection (aeronautics); Projection (relational algebra); Pure mathematics; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01264066668480964,"gpt":0.2530446148449361,"spread":0.2404039481601265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00329965,0.00008411923,0.0001876145,0.00013249,0.0001209455,0.0001481053,0.0002250307,0.00004447205,0.00005407277],"category_scores_gemma":[0.0003254058,0.00006578962,0.00007780216,0.0002935941,0.00002608729,0.001537655,0.00007214955,0.000126735,0.000009744213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000392575,"about_ca_system_score_gemma":0.00003998669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.704551e-7,"about_ca_topic_score_gemma":5.599995e-8,"domain_scores_codex":[0.9987155,0.0003119805,0.0004694284,0.00009870398,0.0002712765,0.0001331469],"domain_scores_gemma":[0.9987273,0.0002018809,0.0004993625,0.0001623622,0.0002787509,0.0001303608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001887738,0.000121942,0.004651577,0.00002532256,0.0000705738,8.583639e-7,0.001528129,0.0007728664,0.0002717399,0.9835004,0.000211625,0.008826099],"study_design_scores_gemma":[0.002785127,0.0002429703,0.1064678,0.0002218609,0.0003279291,0.0004705035,0.001217957,0.6701162,0.007123676,0.2013399,0.008686258,0.000999833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06824346,0.0003925511,0.9292504,0.000957687,0.0001174706,0.00006680044,0.000001245908,0.00001987794,0.0009504754],"genre_scores_gemma":[0.8528088,0.00005164984,0.1463567,0.0005252872,0.0001726553,0.00000152595,0.000001719144,0.000004330447,0.0000772673],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7845653,"threshold_uncertainty_score":0.2682823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}