{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596949,0.001092453,0.0009248803,0.001257861,0.0005038732,0.00263913,0.0007551692,0.0007676935,0.02630045],"category_scores_gemma":[0.00111701,0.0004377242,0.0005456699,0.002201289,0.00120048,0.002667952,0.0008135542,0.002712234,0.008954946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037679,"about_ca_system_score_gemma":0.001014619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008491922,"about_ca_topic_score_gemma":0.001376373,"domain_scores_codex":[0.9997138,0.00004097655,0.000009111836,0.00003392937,0.0001841884,0.0000179098],"domain_scores_gemma":[0.9997099,0.0001543926,0.0000152488,0.00002689512,0.00006978267,0.00002367457],"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.00001420725,0.0000291831,0.0000597197,0.0003893252,0.0000199667,0.00003982734,0.0001042762,0.002307303,0.001274424,0.7361022,0.167032,0.09262748],"study_design_scores_gemma":[0.000009653868,0.00001669487,0.0003922895,0.000182406,0.00001095718,0.000129383,0.00004645361,0.004861303,0.0004518589,0.6618466,0.3320356,0.00001675262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00346504,0.1068401,0.1294039,0.005578472,0.004239266,0.00005417198,0.000723689,0.0005196442,0.7491758],"genre_scores_gemma":[0.05743942,0.08974067,0.06819215,0.002338484,0.007941375,0.0002977803,0.001307207,0.0009275638,0.7718154],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02630045,"threshold_uncertainty_score":0.08798379,"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","authors":[{"name":"Benoît Colson","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578643,0.00122926,0.002310185,0.00224552,0.0006703121,0.004150532,0.001429981,0.001750879,0.004650323],"category_scores_gemma":[0.003123576,0.001199676,0.001340767,0.005175051,0.001328604,0.004505584,0.002301374,0.004243394,0.00298452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009787934,"about_ca_system_score_gemma":0.001453605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175945,"about_ca_topic_score_gemma":0.001225355,"domain_scores_codex":[0.9987028,0.0003748231,0.0001399987,0.0002180009,0.0004915646,0.00007281253],"domain_scores_gemma":[0.9990765,0.0005096351,0.00004388398,0.0001096241,0.0002144509,0.00004590168],"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.00005459095,0.0001036573,0.0004037008,0.001599662,0.0001207378,0.00008887194,0.00008994828,0.03831459,0.00109593,0.5517302,0.01952026,0.3868778],"study_design_scores_gemma":[0.00001507906,0.00005482881,0.000260927,0.0003694085,0.00004696954,0.0002421039,0.0000423845,0.09333689,0.0006794911,0.7284936,0.1764091,0.00004927315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.0009222586,0.1339676,0.8402208,0.002334118,0.0006528414,0.00003206666,0.0001724297,0.0003796945,0.02131815],"genre_scores_gemma":[0.06688674,0.3492979,0.5561443,0.001595282,0.005677685,0.0002518502,0.0008620612,0.0006364181,0.01864777],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004650323,"threshold_uncertainty_score":0.01555687,"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","authors":[{"name":"Muhammad Aslam Noor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004658144,0.001436936,0.001300661,0.00155073,0.0008686144,0.002069929,0.002823465,0.002251141,0.005317872],"category_scores_gemma":[0.01093236,0.0008334292,0.001668225,0.001298666,0.002021078,0.003628682,0.004642765,0.004690714,0.000960654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001905441,"about_ca_system_score_gemma":0.001259445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001719979,"about_ca_topic_score_gemma":0.002497083,"domain_scores_codex":[0.9986001,0.0006597268,0.00008263539,0.0001467974,0.0004204872,0.0000903596],"domain_scores_gemma":[0.9972312,0.001597296,0.0001685589,0.0003513616,0.0004510995,0.000200476],"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.0001176418,0.00009461771,0.0003003208,0.0001822898,0.00005631033,0.00008481646,0.000256802,0.08900188,0.004242059,0.834349,0.003950299,0.06736398],"study_design_scores_gemma":[0.000035051,0.0000536611,0.00008584772,0.00004158889,0.00002133982,0.00006629459,0.0000279757,0.8193368,0.000799921,0.1700045,0.009504698,0.00002245989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004662092,0.0007568466,0.9886796,0.0003478028,0.0003534551,0.00006661994,0.00004517439,0.00007756578,0.005010864],"genre_scores_gemma":[0.1548803,0.001839743,0.8148866,0.0004432225,0.0005274386,0.0003939648,0.0002448821,0.0002833654,0.02650053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005317872,"threshold_uncertainty_score":0.02463496,"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","authors":[{"name":"Benoît Colson","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002609101,0.001752311,0.003290727,0.002194519,0.0008091701,0.004918254,0.002339618,0.002221325,0.00521886],"category_scores_gemma":[0.005621284,0.001648576,0.001557112,0.007537689,0.001470027,0.005335092,0.003097742,0.004509043,0.002653187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009416775,"about_ca_system_score_gemma":0.001721822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508306,"about_ca_topic_score_gemma":0.001482547,"domain_scores_codex":[0.9982687,0.0004926682,0.0001653967,0.0004616823,0.0005173842,0.00009405702],"domain_scores_gemma":[0.9968314,0.002172618,0.000113331,0.0003156638,0.0004635591,0.000103484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009892738,0.0003849809,0.001443494,0.003838329,0.0002024603,0.00008111071,0.0001654982,0.02426464,0.0005756574,0.1926196,0.02262275,0.7537026],"study_design_scores_gemma":[0.00006850674,0.0002650952,0.001500827,0.00172252,0.000170914,0.0008068123,0.0003304663,0.1687407,0.001680667,0.5401075,0.2844924,0.0001135101],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003758857,0.4203731,0.5446454,0.003584704,0.0005874702,0.00007505934,0.0003462503,0.0004048547,0.0262242],"genre_scores_gemma":[0.06745701,0.6124957,0.3012641,0.00166934,0.003451701,0.0002478656,0.001218755,0.0006249939,0.01157056],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00521886,"threshold_uncertainty_score":0.01745886,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019287,0.001548042,0.001098672,0.001066147,0.001311689,0.001427001,0.001672952,0.001998931,0.002580415],"category_scores_gemma":[0.005553576,0.0005530503,0.001288937,0.0005489063,0.004015405,0.002773815,0.003853714,0.003816691,0.001022592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006546448,"about_ca_system_score_gemma":0.001209476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004347285,"about_ca_topic_score_gemma":0.000451771,"domain_scores_codex":[0.9990445,0.0003842236,0.00003940901,0.0001304372,0.0003396049,0.00006176654],"domain_scores_gemma":[0.9981888,0.000923291,0.0001387556,0.0001616769,0.0004170109,0.0001705054],"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.00004646203,0.00005697094,0.0001906629,0.0002767006,0.00004575182,0.0001830507,0.0002793774,0.04030349,0.01144232,0.9175038,0.002150634,0.02752077],"study_design_scores_gemma":[0.00002898211,0.0001813982,0.0002086393,0.00007136024,0.00002174505,0.0002013827,0.00004815089,0.3826382,0.004461796,0.6014962,0.01060275,0.00003939106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006988614,0.0006853958,0.983225,0.0007733072,0.0001580491,0.00007898053,0.00003231453,0.00007931385,0.00797895],"genre_scores_gemma":[0.2830981,0.002951618,0.6866438,0.0008214581,0.0007739906,0.0009108674,0.0001371971,0.000278771,0.02438418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004019287,"threshold_uncertainty_score":0.02125627,"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)","authors":[{"name":"M. Shahid Shaikh","is_ca":false},{"name":"Peter E. Caines","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979756,0.00149564,0.001532931,0.001045893,0.0005840245,0.002015997,0.001596279,0.002074696,0.003704353],"category_scores_gemma":[0.004408453,0.0006192538,0.000855685,0.001948149,0.002127105,0.002219588,0.002641476,0.002744198,0.0006416609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206913,"about_ca_system_score_gemma":0.001259781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003243598,"about_ca_topic_score_gemma":0.001490386,"domain_scores_codex":[0.9992524,0.0003430603,0.00003480053,0.0001481632,0.0001630199,0.00005852336],"domain_scores_gemma":[0.9981784,0.001473122,0.0000938054,0.00006645369,0.0001441041,0.0000442675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003198726,0.00004159975,0.0002855576,0.000287456,0.00004873291,0.0000766204,0.0001037833,0.5079207,0.0004095727,0.4304144,0.003274061,0.05710541],"study_design_scores_gemma":[0.00001008896,0.00002177502,0.00007242031,0.00002998515,0.00000660554,0.00002965162,0.00001719433,0.8290047,0.00009553201,0.1681038,0.002598632,0.000009557735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001500674,0.001267913,0.9934948,0.0002983354,0.0000464174,0.00002416364,0.00002739572,0.00003684213,0.003303462],"genre_scores_gemma":[0.3061162,0.007816604,0.6709067,0.0004847745,0.000624981,0.001203351,0.0004389161,0.0001613703,0.01224711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003704353,"threshold_uncertainty_score":0.01239222,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979644,0.001032308,0.0005982133,0.002337533,0.00077074,0.002500357,0.0007631519,0.0008490381,0.001870534],"category_scores_gemma":[0.005208817,0.0004997179,0.001015564,0.001896738,0.004457046,0.005017416,0.001992027,0.003122117,0.0003550884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118022,"about_ca_system_score_gemma":0.0008409963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001013527,"about_ca_topic_score_gemma":0.0008423698,"domain_scores_codex":[0.999077,0.000283225,0.00006064552,0.0001374573,0.0003174003,0.0001243713],"domain_scores_gemma":[0.9981831,0.0008398736,0.0002396604,0.0002540366,0.0003269266,0.0001565213],"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.00002243956,0.000006171962,0.0001741113,0.00004573359,0.00001067753,0.00007316722,0.0001148553,0.003018639,0.00132315,0.9864901,0.000821513,0.007899427],"study_design_scores_gemma":[0.000004889968,0.00002778797,0.00061738,0.00002439995,0.000009568525,0.0001737568,0.00008566499,0.01906643,0.001052468,0.9733314,0.00558843,0.00001780755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1196281,0.007044429,0.8119898,0.00225851,0.0004357932,0.00005175283,0.0002291839,0.0002013223,0.05816111],"genre_scores_gemma":[0.8527814,0.006901783,0.1195926,0.000462768,0.0007647654,0.0001308534,0.0003369825,0.0001506651,0.01887818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002500357,"threshold_uncertainty_score":0.0104695,"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","authors":[{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005171598,0.002365486,0.003312884,0.003083947,0.002032862,0.004178828,0.002820011,0.003491297,0.02052457],"category_scores_gemma":[0.02683853,0.002742761,0.002368118,0.002293721,0.003865194,0.007826472,0.003378458,0.007892336,0.002407423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002320571,"about_ca_system_score_gemma":0.004969097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003124133,"about_ca_topic_score_gemma":0.003803545,"domain_scores_codex":[0.9969131,0.0008950287,0.0002903254,0.0005206287,0.0007112229,0.0006697059],"domain_scores_gemma":[0.9781713,0.01551097,0.001654787,0.000566685,0.003358991,0.0007373525],"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.0002143957,0.000333973,0.0005647487,0.0005033346,0.00007765216,0.0003621663,0.0003443739,0.04638112,0.003517848,0.9290426,0.007026417,0.01163131],"study_design_scores_gemma":[0.0001948736,0.0001108436,0.0006304525,0.0001750812,0.00006808588,0.0001473842,0.0002215812,0.1721852,0.00219604,0.8181465,0.005862906,0.00006092357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06540858,0.001511369,0.8557984,0.004793557,0.0004903091,0.0008421171,0.002871555,0.0006046543,0.06767945],"genre_scores_gemma":[0.6946191,0.003402661,0.2753664,0.001252175,0.001300099,0.002839418,0.003271967,0.0008366755,0.01711147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02052457,"threshold_uncertainty_score":0.06866151,"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","authors":[{"name":"Benoît Colson","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003228689,0.0008526475,0.00119854,0.000463427,0.0005109578,0.001423623,0.001403152,0.001547697,0.003434134],"category_scores_gemma":[0.01124774,0.0007378855,0.0009197876,0.0007071017,0.001186774,0.002161742,0.001612508,0.002713803,0.0009655129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006164787,"about_ca_system_score_gemma":0.001172037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005174519,"about_ca_topic_score_gemma":0.002533456,"domain_scores_codex":[0.9991367,0.0004527553,0.000040368,0.00008711233,0.0002432844,0.00003972279],"domain_scores_gemma":[0.9944183,0.003984385,0.0001544521,0.0003457071,0.0009668906,0.0001303257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003528686,0.0001772868,0.0005034915,0.000321426,0.00008291709,0.0001374196,0.0004012119,0.6736961,0.004659612,0.1191705,0.00316592,0.1973312],"study_design_scores_gemma":[0.00001253496,0.00003647487,0.00002439565,0.000009196453,0.00000684357,0.00002470851,0.000008264791,0.991352,0.00074209,0.006789902,0.0009856028,0.000008031378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002331394,0.0002038133,0.9965498,0.00006071961,0.00001873497,0.00001382729,0.000007429982,0.00008797313,0.0007261526],"genre_scores_gemma":[0.1299838,0.0006571963,0.8659523,0.00004626266,0.00005126351,0.0001095392,0.00004546575,0.0002393576,0.002914966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005174519,"threshold_uncertainty_score":0.01707518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973823738","doi":"10.1137/070687542","title":"The Proximal Average: Basic Theory","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Regular polygon; Convex function; Effective domain; Convex analysis; Proper convex function; Proximal Gradient Methods; Domain (mathematical analysis); Pure mathematics; Function (biology); Convex set; Convex optimization; Mathematical analysis; Geometry","authors":[{"name":"Heinz H. Bauschke","is_ca":false},{"name":"Rafal Goebel","is_ca":false},{"name":"Yves Lucet","is_ca":false},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01126816164200364,"gpt":0.2191056682143998,"spread":0.2078375065723962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002708011,0.0008648722,0.001190967,0.002667994,0.001340105,0.003409613,0.00186805,0.001702132,0.004523398],"category_scores_gemma":[0.006161282,0.0005849043,0.0011005,0.002832997,0.004432963,0.006180914,0.002892035,0.003197797,0.001246599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001844056,"about_ca_system_score_gemma":0.0009596564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116762,"about_ca_topic_score_gemma":0.0005924081,"domain_scores_codex":[0.9987109,0.0004038084,0.00007549383,0.0002914865,0.0004145595,0.0001037578],"domain_scores_gemma":[0.9981951,0.001040518,0.0001253802,0.000176022,0.0003424079,0.0001205065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003166766,0.0000041963,0.00006176476,0.00003388599,0.000006371144,0.00001805561,0.00004221687,0.003282445,0.0001171544,0.9907507,0.0005877896,0.005092191],"study_design_scores_gemma":[0.000003487433,0.00001656738,0.000105249,0.00002510353,0.000007399383,0.00007734969,0.00002939525,0.02845102,0.0002256512,0.9605867,0.01046136,0.00001068367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008614019,0.004556994,0.9541401,0.001143433,0.0002381932,0.0000348245,0.0001645113,0.00009898359,0.031009],"genre_scores_gemma":[0.5949412,0.02005077,0.3463362,0.001304641,0.003124946,0.0004658192,0.000524874,0.0003173677,0.0329342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004523398,"threshold_uncertainty_score":0.01513225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Yunier Bello-Cruz","is_ca":false},{"name":"T. T. A. Nghia","is_ca":true},{"name":"Hung M. Phan","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01166629,0.001426971,0.001247495,0.00221784,0.00121048,0.003010627,0.002392524,0.002311973,0.007419782],"category_scores_gemma":[0.05143667,0.0007028728,0.0009400581,0.001481519,0.004005719,0.005719813,0.003774978,0.00430058,0.002372164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180822,"about_ca_system_score_gemma":0.001705727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001998475,"about_ca_topic_score_gemma":0.001250896,"domain_scores_codex":[0.9961579,0.001885224,0.0001678339,0.000525717,0.0009141785,0.0003492169],"domain_scores_gemma":[0.9723528,0.01973564,0.001043779,0.002253304,0.003762044,0.0008523742],"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.0005111255,0.00009986963,0.002925892,0.0005165986,0.0001131211,0.0001631524,0.0004906393,0.09395614,0.009668321,0.7911468,0.006956158,0.0934521],"study_design_scores_gemma":[0.00006024375,0.0002041091,0.001687913,0.0002116687,0.00004901754,0.0004395185,0.0002092294,0.6832101,0.01253251,0.2901238,0.01114652,0.0001253869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05134073,0.003384406,0.9188583,0.002134474,0.0005705892,0.0001208539,0.0002905868,0.0007184463,0.02258159],"genre_scores_gemma":[0.6230777,0.005532956,0.3332008,0.001114099,0.0008128076,0.0005789525,0.0009537925,0.001833879,0.03289487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01166629,"threshold_uncertainty_score":0.06169802,"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","authors":[{"name":"Muhammad Aslam Noor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002589623,0.0008510635,0.001092607,0.000785991,0.0007076488,0.001332812,0.002343652,0.00197398,0.004365583],"category_scores_gemma":[0.006321208,0.0008556133,0.001158114,0.0005814443,0.001663613,0.001606373,0.003740723,0.002332561,0.0007284637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210764,"about_ca_system_score_gemma":0.001757943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004277812,"about_ca_topic_score_gemma":0.005278093,"domain_scores_codex":[0.9994338,0.0002060282,0.00003824115,0.00006619083,0.0001994053,0.00005621278],"domain_scores_gemma":[0.9970945,0.001913558,0.0001534704,0.0002004199,0.0004800278,0.0001580627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003146472,0.0001885202,0.0008795516,0.0003456969,0.0001118646,0.0001587874,0.0004700254,0.6530125,0.008414709,0.2295039,0.00208593,0.1045139],"study_design_scores_gemma":[0.00001428588,0.00002344253,0.00002958481,0.000009734435,0.000005011671,0.00001151213,0.00001353763,0.9820095,0.0006999436,0.01649336,0.0006822424,0.000007818333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005128859,0.00006041264,0.9934029,0.00006601667,0.00002960297,0.00004127972,0.00001455345,0.00009308866,0.001163348],"genre_scores_gemma":[0.1742285,0.0001162252,0.8195686,0.00009288025,0.0000270123,0.0003929695,0.00009249088,0.0001871925,0.005294152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004365583,"threshold_uncertainty_score":0.01460439,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Claudia Sagastizábal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272704,0.001674006,0.002331113,0.002393982,0.0008578717,0.002074282,0.001934479,0.002355682,0.003878951],"category_scores_gemma":[0.01484975,0.001610487,0.001049029,0.001345334,0.002179017,0.00269776,0.003305448,0.002781397,0.0009230926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001350963,"about_ca_system_score_gemma":0.001715785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002108754,"about_ca_topic_score_gemma":0.002840691,"domain_scores_codex":[0.9989915,0.0004349057,0.00004163534,0.0001616673,0.000275979,0.00009421655],"domain_scores_gemma":[0.9953566,0.003293465,0.0002605364,0.0002317166,0.0005637776,0.0002938966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000392842,0.0002069897,0.001141046,0.000404827,0.0001081695,0.000165694,0.0002742788,0.7614292,0.004592224,0.1262148,0.002682743,0.1023872],"study_design_scores_gemma":[0.00002693314,0.00008904053,0.000168909,0.00002961067,0.0000166913,0.00003195335,0.0000488529,0.917621,0.002147291,0.07898521,0.0008217303,0.00001276451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02668675,0.0001915643,0.9712435,0.0001375324,0.00003451077,0.00005199628,0.00004299742,0.0001848599,0.001426325],"genre_scores_gemma":[0.3506562,0.0004649781,0.6420283,0.0000680438,0.00007884657,0.0002142861,0.0002952776,0.0003879066,0.005806265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003878951,"threshold_uncertainty_score":0.01730788,"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","authors":[{"name":"Jonathan M. Borwein","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691867,0.0008563297,0.0007680894,0.001364512,0.0008130714,0.001997357,0.0007003983,0.0005181153,0.005358432],"category_scores_gemma":[0.004699349,0.0004662461,0.001247799,0.0007614154,0.003637396,0.003403408,0.00273222,0.003447827,0.0008324459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512196,"about_ca_system_score_gemma":0.0008223425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000539073,"about_ca_topic_score_gemma":0.0005906741,"domain_scores_codex":[0.9980421,0.000776599,0.00007339846,0.0003339123,0.0006285754,0.0001453894],"domain_scores_gemma":[0.9982218,0.0009515487,0.0001335923,0.0001681115,0.0003940621,0.0001307124],"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.000008726333,0.000004894302,0.00006519646,0.00006287072,0.00001517617,0.00003040639,0.0000484754,0.001235485,0.0007258673,0.9901186,0.001395007,0.006289375],"study_design_scores_gemma":[0.000005313308,0.00001338734,0.0001973965,0.00003734653,0.00001074187,0.0001089703,0.00003692678,0.016596,0.0008072677,0.9733647,0.008814506,0.000007476576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03430402,0.006158658,0.768328,0.005818767,0.0004260795,0.00009966131,0.0003548513,0.000216664,0.1842934],"genre_scores_gemma":[0.7942815,0.004450181,0.167907,0.001887068,0.001016379,0.0003575778,0.0003949591,0.0002317416,0.02947354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005358432,"threshold_uncertainty_score":0.01792574,"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","authors":[{"name":"Zili Wu","is_ca":true},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02346814,0.00478363,0.004160792,0.005353895,0.001879805,0.006130626,0.005568291,0.005779,0.00823218],"category_scores_gemma":[0.08017739,0.001802839,0.002826075,0.004349193,0.007664478,0.01258109,0.01070687,0.01580351,0.001391504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005266225,"about_ca_system_score_gemma":0.00232114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005571954,"about_ca_topic_score_gemma":0.003056789,"domain_scores_codex":[0.9909343,0.003691013,0.0005136548,0.001102905,0.002844424,0.0009138163],"domain_scores_gemma":[0.9180068,0.06723677,0.002251999,0.003718081,0.006469704,0.002316818],"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.0005771983,0.0002112152,0.001297708,0.0009544217,0.0002096584,0.0002518354,0.0008261199,0.1500593,0.004131104,0.7771025,0.006931085,0.05744796],"study_design_scores_gemma":[0.00003280279,0.0001164721,0.0006401644,0.0003451558,0.00007628348,0.00009745552,0.0001267329,0.4832416,0.001990837,0.5081217,0.005153092,0.00005765514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02232997,0.01141285,0.9375955,0.003269446,0.0009364318,0.00009546582,0.0002551717,0.0003150133,0.02379017],"genre_scores_gemma":[0.5417029,0.02087679,0.3678924,0.003951257,0.003377546,0.0009704095,0.00188049,0.002766552,0.05658168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02346814,"threshold_uncertainty_score":0.1241129,"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","authors":[{"name":"Yonghong Cheng","is_ca":false},{"name":"Dexiang Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992564,0.00215835,0.001403869,0.002386941,0.001259955,0.002477106,0.001526338,0.001565531,0.008012009],"category_scores_gemma":[0.007753174,0.0006541,0.001562366,0.0009755531,0.002774532,0.003757437,0.004164771,0.004278499,0.001221203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283882,"about_ca_system_score_gemma":0.00138091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001890762,"about_ca_topic_score_gemma":0.001165639,"domain_scores_codex":[0.9990859,0.0003567075,0.00004291776,0.0001557268,0.0002659626,0.00009283888],"domain_scores_gemma":[0.9957021,0.002326929,0.0002685986,0.0001675788,0.001278755,0.0002560426],"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.0001870858,0.00005989299,0.0005168673,0.0002420751,0.0001257817,0.0001441741,0.0003016292,0.05958008,0.01166584,0.8954467,0.005624637,0.02610529],"study_design_scores_gemma":[0.00002648042,0.0001049953,0.000329205,0.00005193364,0.00003978307,0.00008249787,0.0001030115,0.450508,0.002196202,0.5419675,0.004555294,0.00003508989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02952542,0.002046604,0.9202509,0.002507107,0.000432338,0.00008933609,0.0002291075,0.0001825528,0.04473667],"genre_scores_gemma":[0.8225215,0.004152782,0.09977446,0.001513623,0.001549671,0.0006617177,0.0007800777,0.0009467113,0.06809936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008012009,"threshold_uncertainty_score":0.02680278,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Dominikus Noll","is_ca":false},{"name":"Hung M. Phan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328765,0.001029367,0.0006483875,0.0008786609,0.0004103115,0.0009823706,0.00106809,0.0009027364,0.002723292],"category_scores_gemma":[0.01216624,0.0004262495,0.0009725189,0.0005248002,0.002001628,0.001737594,0.002280334,0.001550669,0.000354025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008308027,"about_ca_system_score_gemma":0.001212407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001124499,"about_ca_topic_score_gemma":0.001274972,"domain_scores_codex":[0.9987123,0.0005733144,0.00007699468,0.0002150897,0.0003177444,0.0001045727],"domain_scores_gemma":[0.9954088,0.003039679,0.000358395,0.0004498065,0.0005543436,0.0001889325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002096456,0.00008965658,0.001662125,0.0003421857,0.0001229071,0.0001596208,0.0002657192,0.5073503,0.01038576,0.4060119,0.0016524,0.07174793],"study_design_scores_gemma":[0.000007944709,0.0000464897,0.0001600484,0.00001738887,0.000007138945,0.00003439141,0.00001476639,0.9638084,0.00232622,0.03273382,0.0008344817,0.000008956233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0244417,0.0002856963,0.9714787,0.0001420577,0.00004738574,0.00004184797,0.00002592659,0.0001085614,0.003428136],"genre_scores_gemma":[0.5241323,0.0005588414,0.4672071,0.000179464,0.0001277186,0.0003364365,0.0001725745,0.0002271186,0.007058394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00328765,"threshold_uncertainty_score":0.01738691,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Claudia Sagastizábal","is_ca":false},{"name":"M. V. Solodov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018236,0.001148863,0.002026328,0.001204818,0.000808896,0.001433257,0.001854972,0.002824822,0.007424215],"category_scores_gemma":[0.003545167,0.0009583986,0.001321396,0.001200212,0.001742956,0.002034778,0.003768977,0.00276971,0.002267773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006390714,"about_ca_system_score_gemma":0.001524982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001507556,"about_ca_topic_score_gemma":0.001937265,"domain_scores_codex":[0.999149,0.0003127148,0.00003493642,0.0001219288,0.0003345512,0.0000469396],"domain_scores_gemma":[0.9989936,0.0004360667,0.00006106992,0.0001170674,0.0002600877,0.0001321358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002275166,0.0002894699,0.0004438784,0.0006972473,0.000182403,0.0003376605,0.0003787834,0.3560691,0.01802622,0.3287474,0.01318999,0.2814105],"study_design_scores_gemma":[0.00002776641,0.0001025799,0.0000708859,0.00002693154,0.00002215364,0.000100285,0.00002566561,0.9406292,0.001608229,0.05010099,0.007261035,0.00002415081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007543585,0.00006613998,0.9984774,0.00005542965,0.00004873499,0.00001531696,0.000009587744,0.00006087983,0.0005120495],"genre_scores_gemma":[0.04198677,0.0003270238,0.949528,0.0001182712,0.000153359,0.0001582917,0.00007318059,0.0003013532,0.007353624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007424215,"threshold_uncertainty_score":0.02483642,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Adrian S. Lewis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003859539,0.001101379,0.001271343,0.00153782,0.001011158,0.001906077,0.002052102,0.002642955,0.007490873],"category_scores_gemma":[0.01139162,0.0007436997,0.0009492782,0.001799378,0.002548299,0.003340899,0.004495159,0.00414724,0.003351535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001159644,"about_ca_system_score_gemma":0.003529972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002987667,"about_ca_topic_score_gemma":0.003224635,"domain_scores_codex":[0.9977603,0.0007283918,0.0001187727,0.000312048,0.000870958,0.000209431],"domain_scores_gemma":[0.9969572,0.001365304,0.0001534145,0.0005881031,0.0007766741,0.0001593447],"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.0002134463,0.0001143366,0.0006688741,0.0002116974,0.00007276382,0.0001320651,0.0003322898,0.1309948,0.005417937,0.625008,0.00898194,0.2278517],"study_design_scores_gemma":[0.0000906744,0.0001126968,0.000259237,0.00008053343,0.00001810438,0.0002657937,0.00007663031,0.7788267,0.006120372,0.197651,0.01643246,0.00006576057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002649321,0.0002864916,0.9923707,0.0003775589,0.00006023114,0.00005608878,0.00003493939,0.0002456206,0.003918977],"genre_scores_gemma":[0.06957828,0.0006723064,0.9182022,0.0003577617,0.00009607068,0.0003788102,0.0001678672,0.0003696672,0.01017698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007490873,"threshold_uncertainty_score":0.02505946,"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","authors":[{"name":"Luce Brotcorne","is_ca":true},{"name":"Martine Labbé","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001482983,0.001136778,0.001972498,0.0007716964,0.0008839391,0.002822108,0.002003045,0.003226012,0.005208916],"category_scores_gemma":[0.004035679,0.0009586018,0.001058116,0.001835481,0.001200706,0.002412725,0.002320782,0.003365095,0.0008058544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001580969,"about_ca_system_score_gemma":0.001977918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007215203,"about_ca_topic_score_gemma":0.005176615,"domain_scores_codex":[0.9992833,0.0003103224,0.00002469048,0.0001339818,0.0001247739,0.0001231164],"domain_scores_gemma":[0.9991487,0.0005321045,0.00006446117,0.00004072166,0.0001467873,0.00006725927],"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.00002880752,0.00004756333,0.0001222338,0.00005845197,0.00001743627,0.00004777313,0.00005838456,0.9456339,0.0002299231,0.04219353,0.000974496,0.01058741],"study_design_scores_gemma":[0.00001139418,0.00001191795,0.00001249878,0.000006487751,0.000003503814,0.000008982611,0.00001832994,0.9829019,0.00006140456,0.01628361,0.0006759935,0.000003932942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006212451,0.0001979518,0.9896947,0.0003131296,0.00002701729,0.00003957692,0.00006078108,0.00007794441,0.003376471],"genre_scores_gemma":[0.3267411,0.0007574775,0.6634588,0.0002058193,0.00008981064,0.0005216183,0.0003391609,0.0001617256,0.007724503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007215203,"threshold_uncertainty_score":0.01742554,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Jonathan M. Borwein","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582698,0.001300444,0.001920211,0.002514914,0.001815609,0.005682867,0.002373133,0.002113876,0.0080883],"category_scores_gemma":[0.02152347,0.00139855,0.002506519,0.002583851,0.00471171,0.009992911,0.005489967,0.007922073,0.002377447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001995234,"about_ca_system_score_gemma":0.001617969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001588354,"about_ca_topic_score_gemma":0.001575205,"domain_scores_codex":[0.9962574,0.001326004,0.0001629687,0.0006686947,0.001246987,0.0003378949],"domain_scores_gemma":[0.9887367,0.006541906,0.0006159921,0.001980649,0.001594848,0.0005300068],"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.00003172913,0.00001082489,0.0001205543,0.00004637504,0.00001654512,0.00003908713,0.00008691721,0.004714314,0.0004291709,0.9817719,0.002174994,0.01055756],"study_design_scores_gemma":[0.000007236269,0.00001703082,0.0003968326,0.00003292716,0.00001660745,0.0001567533,0.00004754992,0.02318744,0.0007790098,0.9679512,0.007384988,0.00002234323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03055075,0.004326797,0.796185,0.002795559,0.000353398,0.0000630254,0.0003522866,0.0002216115,0.1651516],"genre_scores_gemma":[0.6234943,0.006653897,0.2511972,0.00103343,0.001244019,0.0005078008,0.00114347,0.001440111,0.1132858],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0080883,"threshold_uncertainty_score":0.02705801,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false},{"name":"Serge Kruk","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842156,0.0008159089,0.001219142,0.0008653623,0.0005232595,0.0008098821,0.001436598,0.001366065,0.004854783],"category_scores_gemma":[0.007374644,0.000573196,0.0008234623,0.0009959433,0.000905982,0.001707394,0.002152628,0.002405054,0.0009457691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005436588,"about_ca_system_score_gemma":0.000810952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001715852,"about_ca_topic_score_gemma":0.001742262,"domain_scores_codex":[0.9995139,0.0002091642,0.00002785804,0.00005137936,0.0001604964,0.00003724761],"domain_scores_gemma":[0.9979717,0.001370996,0.0001116797,0.0001773527,0.000286714,0.00008145991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000417036,0.0001209984,0.0006611308,0.0003474317,0.00006413808,0.0002662288,0.0002163123,0.6982238,0.007829021,0.109248,0.004478178,0.1781277],"study_design_scores_gemma":[0.00001483224,0.0000216907,0.00004501284,0.00001740174,0.000006567565,0.00003278667,0.000009982749,0.9796435,0.0008748966,0.01818394,0.0011435,0.000005886583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005917444,0.0002310576,0.991192,0.0001204616,0.00004822527,0.00002928114,0.0000271203,0.0001997725,0.002234598],"genre_scores_gemma":[0.2432709,0.0006431529,0.747826,0.0001933839,0.0001067529,0.0002824492,0.0002445884,0.0003760323,0.007056572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004854783,"threshold_uncertainty_score":0.01624084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073044751","doi":"10.1137/s1052623499360616","title":"Erratum: Weak Sharp Solutions of Variational Inequalities","year":2000,"lang":"en","type":"erratum","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Daoli Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02456082120706668,"gpt":0.251635378998436,"spread":0.2270745577913693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002866571,0.002149106,0.001411436,0.002792018,0.003186495,0.002624423,0.002304989,0.003870624,0.05083478],"category_scores_gemma":[0.03912772,0.000825829,0.00113518,0.002387678,0.00167954,0.003532922,0.001343768,0.005949847,0.02745317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002439438,"about_ca_system_score_gemma":0.002413203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005819987,"about_ca_topic_score_gemma":0.006750775,"domain_scores_codex":[0.9975063,0.0004615292,0.0005113891,0.000417609,0.0009484938,0.0001546377],"domain_scores_gemma":[0.9868011,0.00400667,0.0005411603,0.001026662,0.007262637,0.0003618303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006673382,0.00001170807,0.00007857259,0.0001248957,0.000008670696,0.0001937391,0.00003818677,0.0001336245,0.0001048643,0.005995889,0.9813674,0.01187572],"study_design_scores_gemma":[0.00005367198,0.00005432822,0.0005200175,0.000376002,0.00004629683,0.0005308444,0.0001008728,0.001012196,0.0008609896,0.01389917,0.9824886,0.00005697774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0008770004,0.004321621,0.009447668,0.08005221,0.8774118,0.0000813705,0.002182298,0.000753353,0.02487263],"genre_scores_gemma":[0.04405758,0.01849057,0.03755404,0.1243067,0.2098098,0.0004395365,0.008773435,0.004192661,0.5523757],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.05083478,"threshold_uncertainty_score":0.1700593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Adrian S. Lewis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032185,0.001234161,0.001466222,0.001300601,0.0007392295,0.002171898,0.001591545,0.001790446,0.002651124],"category_scores_gemma":[0.01035909,0.0008368555,0.001251827,0.0007097465,0.004302494,0.005209163,0.00486008,0.003977599,0.0006052116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000552212,"about_ca_system_score_gemma":0.0009950853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005908399,"about_ca_topic_score_gemma":0.0005281724,"domain_scores_codex":[0.9985707,0.0004867857,0.00007296298,0.0003024563,0.0004436553,0.0001234531],"domain_scores_gemma":[0.9944662,0.003531771,0.0006202474,0.0006384891,0.0005034103,0.0002398699],"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.00007277829,0.00004165537,0.0007180186,0.0001488394,0.00004409917,0.0001718759,0.0002640503,0.2487588,0.00764769,0.7105024,0.0011199,0.03051001],"study_design_scores_gemma":[0.00001342622,0.00003958061,0.0001454791,0.00001661243,0.000008362908,0.00005187077,0.00003968459,0.6696172,0.002623736,0.32587,0.001554203,0.00001975375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01011417,0.00008987138,0.987579,0.0001454307,0.00001363403,0.00001938315,0.00002244823,0.00005419863,0.00196174],"genre_scores_gemma":[0.5742174,0.0006663805,0.4158548,0.000183058,0.0001390874,0.0003262726,0.0002605441,0.0002826479,0.008069751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0032185,"threshold_uncertainty_score":0.01702124,"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","authors":[{"name":"Gui-Hua Lin","is_ca":false},{"name":"Mengwei Xu","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064913,0.00138958,0.001775226,0.0007026269,0.0007249207,0.001891523,0.001395506,0.002255389,0.005514376],"category_scores_gemma":[0.00932856,0.001055966,0.001266153,0.001413101,0.002087611,0.00287218,0.00350551,0.002873906,0.0005570695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007955218,"about_ca_system_score_gemma":0.001010543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151273,"about_ca_topic_score_gemma":0.002571686,"domain_scores_codex":[0.9991006,0.0004534419,0.00003713618,0.0001321474,0.0002043805,0.00007227351],"domain_scores_gemma":[0.9971197,0.002328058,0.0001340505,0.0001555155,0.0001544805,0.0001082316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009633649,0.000159046,0.0003417954,0.0002755549,0.00004954393,0.00008692784,0.000162253,0.7404262,0.001307674,0.213715,0.00236713,0.04101242],"study_design_scores_gemma":[0.00001170058,0.00002986413,0.00003389824,0.00001283816,0.000005879827,0.00001062343,0.00001322211,0.9350828,0.0001774813,0.06388531,0.0007309836,0.000005459984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01450419,0.0001882465,0.9769531,0.0004036672,0.00005929629,0.00007495932,0.00004643601,0.0001000414,0.00766998],"genre_scores_gemma":[0.3196015,0.0005883798,0.6636315,0.0003958597,0.0001797869,0.0005024292,0.0002115291,0.0003848578,0.01450418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005514376,"threshold_uncertainty_score":0.01844746,"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","authors":[{"name":"S.S. Chang","is_ca":false},{"name":"Kok-Keong Tan","is_ca":true},{"name":"Joseph H. W. Lee","is_ca":false},{"name":"Chi Kin Chan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009780143,0.002109061,0.002366069,0.002802849,0.001560539,0.002851188,0.002837532,0.00360559,0.002617629],"category_scores_gemma":[0.04527501,0.000966049,0.001951796,0.001080659,0.006077539,0.004788609,0.006240582,0.004516419,0.0002375718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00277997,"about_ca_system_score_gemma":0.002686868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005120852,"about_ca_topic_score_gemma":0.002166935,"domain_scores_codex":[0.9975584,0.00127808,0.000114593,0.0003039007,0.0005613639,0.0001835704],"domain_scores_gemma":[0.9705287,0.02251937,0.001691682,0.0007394508,0.00328945,0.001231303],"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.0002937684,0.00008378207,0.001422301,0.000314326,0.0001041183,0.0002506457,0.0007730104,0.2735135,0.003895621,0.7079024,0.0006606337,0.01078577],"study_design_scores_gemma":[0.0000164893,0.00006529222,0.000142947,0.00003839376,0.0000156807,0.00005604129,0.00004273219,0.9211626,0.00052862,0.07745183,0.0004542547,0.00002511779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158466,0.00165112,0.8717688,0.001262462,0.0001880341,0.0001304933,0.00005599948,0.0001114667,0.008984935],"genre_scores_gemma":[0.8553526,0.00191629,0.1213339,0.0003094983,0.0001833283,0.0003915071,0.0001413182,0.0002237168,0.02014785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009780143,"threshold_uncertainty_score":0.05172294,"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","authors":[{"name":"Chao Ding","is_ca":false},{"name":"Defeng Sun","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810283,0.002531754,0.001764665,0.002400722,0.001259073,0.004584034,0.00175557,0.002228284,0.01348905],"category_scores_gemma":[0.01154894,0.00137109,0.001585086,0.001848335,0.002992243,0.005308438,0.00193214,0.007761954,0.002048074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002604183,"about_ca_system_score_gemma":0.004332084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003477462,"about_ca_topic_score_gemma":0.004183489,"domain_scores_codex":[0.9981668,0.0005582462,0.0001106633,0.0002674877,0.0005997436,0.0002970577],"domain_scores_gemma":[0.9908896,0.006195677,0.0006366677,0.0002827995,0.001624965,0.0003702053],"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.00004680292,0.0001093337,0.0001382259,0.0002332655,0.00002064206,0.0001145432,0.0002334932,0.05791335,0.002074257,0.9251007,0.004390125,0.009625213],"study_design_scores_gemma":[0.00003517821,0.00007441805,0.0002191258,0.0001229812,0.00002084755,0.00009686996,0.0001130139,0.3152808,0.002108454,0.6760441,0.005840315,0.00004388998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01709412,0.0008485169,0.9276854,0.001229619,0.0002983666,0.0001878692,0.0007546183,0.0001801599,0.05172141],"genre_scores_gemma":[0.5720803,0.004136856,0.3670968,0.00121866,0.000988147,0.001523729,0.002405562,0.001090325,0.0494595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01348905,"threshold_uncertainty_score":0.04512531,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"D. Lüke","is_ca":false},{"name":"Hung M. Phan","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040328,0.001328541,0.001217967,0.001714009,0.0009489512,0.002822589,0.002490574,0.001480595,0.005398747],"category_scores_gemma":[0.00933586,0.001098148,0.001525654,0.001316787,0.004051164,0.004740644,0.004019776,0.005160911,0.0008045285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126694,"about_ca_system_score_gemma":0.001755943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001537807,"about_ca_topic_score_gemma":0.001244207,"domain_scores_codex":[0.9978759,0.001287623,0.00006394723,0.0002293483,0.0004554437,0.00008766421],"domain_scores_gemma":[0.9962193,0.002343147,0.0002218212,0.0003009934,0.0005837764,0.0003308239],"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.000008828587,0.00001191389,0.000036896,0.00003339174,0.00001001441,0.000009982875,0.00003645603,0.0040511,0.0002036482,0.9892545,0.0007584308,0.005584758],"study_design_scores_gemma":[0.000009652429,0.00001675802,0.00004596944,0.00002199311,0.000006655398,0.00003981136,0.00001915626,0.08865977,0.0001789816,0.9079159,0.003071772,0.00001356723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003635217,0.0008572647,0.98643,0.0004671808,0.0001286141,0.00002620235,0.00004881794,0.00006767676,0.008339028],"genre_scores_gemma":[0.248577,0.003757904,0.7134413,0.0006162733,0.0009734131,0.0004745475,0.0003210508,0.0006185626,0.03121999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005398747,"threshold_uncertainty_score":0.02132779,"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","authors":[{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004803509,0.001242381,0.001526561,0.0009829946,0.001374659,0.002692245,0.001239978,0.002036701,0.009382006],"category_scores_gemma":[0.01572519,0.000742487,0.00109557,0.00200107,0.004182826,0.004622371,0.002944018,0.004073285,0.002088724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686354,"about_ca_system_score_gemma":0.003021754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003063136,"about_ca_topic_score_gemma":0.002049115,"domain_scores_codex":[0.9958059,0.001781704,0.0003182229,0.0006517646,0.001026376,0.0004160086],"domain_scores_gemma":[0.9945781,0.003156047,0.0006142842,0.0003529883,0.001060763,0.0002377725],"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.00001773509,0.00002151051,0.0001677556,0.0001550614,0.0000160537,0.0001456661,0.0001386183,0.04942535,0.0004510759,0.9377631,0.00249299,0.009205077],"study_design_scores_gemma":[0.0000250263,0.00003342373,0.0001534421,0.00008631097,0.000007929737,0.00007087853,0.00009351693,0.1221141,0.0004252497,0.8684593,0.008504531,0.00002620283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00910328,0.0006640374,0.9565957,0.002001996,0.0001844083,0.0001143049,0.0004626612,0.00009062938,0.03078299],"genre_scores_gemma":[0.5322267,0.004450012,0.4363115,0.001509443,0.0006614813,0.001490723,0.001994222,0.000255898,0.02110009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009382006,"threshold_uncertainty_score":0.03138596,"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","authors":[{"name":"Shu‐Cherng Fang","is_ca":false},{"name":"David Yang Gao","is_ca":false},{"name":"Ruey-Lin Sheu","is_ca":true},{"name":"Soon‐Yi Wu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531822,0.001130847,0.0006557847,0.0008589873,0.000616899,0.00160231,0.0009282743,0.0008078018,0.00539881],"category_scores_gemma":[0.00209024,0.0004422478,0.0009338408,0.0008421551,0.001577581,0.001449958,0.002093993,0.002473206,0.001242392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007885637,"about_ca_system_score_gemma":0.001656921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400896,"about_ca_topic_score_gemma":0.001801081,"domain_scores_codex":[0.9991286,0.0004653875,0.00002276395,0.00009402795,0.0002093627,0.00007978093],"domain_scores_gemma":[0.9996333,0.0001237229,0.00002880119,0.0000378669,0.0001367529,0.00003946816],"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.00002270194,0.0000550614,0.0001837101,0.00008286231,0.00001987053,0.00005424349,0.00008957322,0.09324308,0.001063622,0.8759496,0.003203224,0.0260325],"study_design_scores_gemma":[0.00001815602,0.00006025142,0.00006731449,0.00002281953,0.000008579913,0.00007265913,0.00004596074,0.6865814,0.0009487164,0.3039422,0.00821633,0.00001566398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003546628,0.0003107673,0.9832377,0.0002610629,0.0001053605,0.00003399515,0.00003189889,0.00006132685,0.01241122],"genre_scores_gemma":[0.2606926,0.001993429,0.7108202,0.0004094327,0.000494766,0.0004922521,0.0002215086,0.0002101812,0.02466561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00539881,"threshold_uncertainty_score":0.0180608,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Gilles Savard","is_ca":true},{"name":"Walid Zghal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734072,0.001740529,0.003278204,0.001758877,0.001101937,0.002246084,0.002466322,0.002894373,0.009772832],"category_scores_gemma":[0.004286913,0.001551196,0.001105667,0.00260859,0.0009500926,0.002605068,0.002726729,0.004134641,0.001719838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00097131,"about_ca_system_score_gemma":0.002312121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003200371,"about_ca_topic_score_gemma":0.005152469,"domain_scores_codex":[0.9990421,0.0002761515,0.00005800319,0.000136871,0.0003931199,0.00009372429],"domain_scores_gemma":[0.9985051,0.0007542033,0.00007002623,0.000128809,0.0004310315,0.0001108511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004603315,0.000458022,0.0005541525,0.000350309,0.000176579,0.0001266697,0.00011848,0.3705539,0.003669339,0.05867083,0.01509829,0.5497631],"study_design_scores_gemma":[0.00007211687,0.00003845866,0.00004611208,0.00001801023,0.00001614508,0.00002827166,0.000009559443,0.9813033,0.0005293069,0.01563827,0.002290407,0.00001007878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002532291,0.0002403391,0.9945636,0.000136972,0.0001021237,0.00005237653,0.00005504635,0.0004757665,0.001841514],"genre_scores_gemma":[0.03781828,0.0002228228,0.9577699,0.0001278525,0.00009236793,0.0002506086,0.0002843589,0.0003318314,0.003101859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009772832,"threshold_uncertainty_score":0.03269339,"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","authors":[{"name":"Lei Guo","is_ca":false},{"name":"Gui-Hua Lin","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004777255,0.002258969,0.002206782,0.003032955,0.001430928,0.004324513,0.001999443,0.002688579,0.01440081],"category_scores_gemma":[0.01358456,0.001590799,0.002283641,0.001716366,0.002756288,0.006826806,0.002525809,0.006723403,0.00145989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002854246,"about_ca_system_score_gemma":0.00435049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004201209,"about_ca_topic_score_gemma":0.005761241,"domain_scores_codex":[0.9980555,0.0005942484,0.0001328137,0.0002653948,0.0005769994,0.0003751085],"domain_scores_gemma":[0.9893919,0.007350474,0.0006115079,0.0003436968,0.00182995,0.0004724569],"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.00004634464,0.00008915776,0.0001859849,0.0001318834,0.00002327765,0.0001142715,0.0002194455,0.03593342,0.001660094,0.9546223,0.002599661,0.004374284],"study_design_scores_gemma":[0.00004783459,0.00006891814,0.0003549045,0.00007309551,0.00002431388,0.00007779166,0.0001235529,0.2966923,0.00154103,0.696674,0.004283438,0.00003885429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03612331,0.001030337,0.8996319,0.002206068,0.0003770148,0.0001984165,0.0007646231,0.0002044999,0.0594639],"genre_scores_gemma":[0.7220702,0.002615145,0.2162119,0.001072887,0.0009733116,0.00116183,0.001906843,0.0008495697,0.0531383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01440081,"threshold_uncertainty_score":0.04817551,"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","authors":[{"name":"Jonathan M. Borwein","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005134062,0.001233393,0.001272537,0.002290504,0.001559741,0.002854807,0.001581926,0.001163383,0.002308005],"category_scores_gemma":[0.01197181,0.0007737624,0.002278994,0.001077007,0.005296614,0.006600681,0.005949639,0.003458851,0.0002481451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00123371,"about_ca_system_score_gemma":0.0008191578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002948376,"about_ca_topic_score_gemma":0.0002653135,"domain_scores_codex":[0.9965475,0.001023244,0.0002550343,0.0008157668,0.0009465307,0.0004118164],"domain_scores_gemma":[0.9895835,0.006496522,0.0009660408,0.0004071429,0.00118301,0.001363871],"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.0001194872,0.00002719819,0.0006597381,0.0001275433,0.0000651144,0.0003197914,0.0004082544,0.004432915,0.007181183,0.981396,0.0003485047,0.004914278],"study_design_scores_gemma":[0.00001699108,0.00009367976,0.0003516895,0.00002441388,0.00003233604,0.0003903942,0.0001636775,0.0455689,0.004715207,0.947226,0.001377772,0.00003896824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2910859,0.001006239,0.6874136,0.000932234,0.0001796124,0.00007400777,0.0001332064,0.0001716821,0.01900343],"genre_scores_gemma":[0.8859642,0.0006520856,0.1060628,0.0002432574,0.0002646572,0.0001766894,0.0001476312,0.0001250034,0.006363651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005134062,"threshold_uncertainty_score":0.02715182,"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","authors":[{"name":"Jane J. Ye","is_ca":true},{"name":"Qiji Jim Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883031,0.001331681,0.001637636,0.0009418408,0.0006176676,0.00204694,0.001562965,0.002467255,0.003673572],"category_scores_gemma":[0.003739831,0.0008078711,0.0009832226,0.001424784,0.0008950543,0.001874175,0.002389185,0.001582972,0.0004426716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000953639,"about_ca_system_score_gemma":0.0009829374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00132583,"about_ca_topic_score_gemma":0.00119163,"domain_scores_codex":[0.9990937,0.0003322926,0.00004229161,0.0001735711,0.0002799052,0.00007835493],"domain_scores_gemma":[0.9991065,0.0005659509,0.0001014377,0.0000486945,0.0001198121,0.00005757083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007960848,0.00009347372,0.0003536277,0.0002857237,0.0001202201,0.0002518083,0.00006518407,0.794762,0.004688161,0.1479297,0.002722187,0.04864839],"study_design_scores_gemma":[0.00001772806,0.00003979159,0.0001356932,0.00002443947,0.00002088689,0.00005778219,0.00001428244,0.9533873,0.001116993,0.04286921,0.002304841,0.00001097124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009854377,0.0004650787,0.981576,0.0003996856,0.00009121848,0.00004650914,0.0001056423,0.00005507433,0.007406494],"genre_scores_gemma":[0.4757987,0.0008704435,0.5007185,0.0003591421,0.0001961392,0.0004810019,0.0003359889,0.0002250347,0.02101503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003673572,"threshold_uncertainty_score":0.01228935,"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","authors":[{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004958773,0.002044616,0.002183653,0.002617738,0.001629452,0.003645421,0.001622128,0.002455678,0.01476763],"category_scores_gemma":[0.01988917,0.001660539,0.002093381,0.001778163,0.003767938,0.004865353,0.003244625,0.005791001,0.002425928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002005922,"about_ca_system_score_gemma":0.003633569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431168,"about_ca_topic_score_gemma":0.001789952,"domain_scores_codex":[0.9959477,0.001158479,0.0003280688,0.0005858775,0.00138897,0.0005909723],"domain_scores_gemma":[0.9911376,0.005434964,0.0008539076,0.0003350346,0.001844141,0.0003944031],"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.00008756568,0.0001225435,0.0005639935,0.0005161182,0.00005787958,0.0003779884,0.0003330573,0.1205861,0.003207338,0.852587,0.006433623,0.01512662],"study_design_scores_gemma":[0.00006570199,0.0001105546,0.000412938,0.0002717738,0.00003288556,0.0001600792,0.0001664093,0.3211842,0.002832966,0.6673577,0.007351493,0.00005323141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01961544,0.001215358,0.9340419,0.001669862,0.0002096433,0.000271331,0.0007638247,0.0002641747,0.04194848],"genre_scores_gemma":[0.5610971,0.004624401,0.4146275,0.000830495,0.0006880533,0.002278892,0.001768622,0.0007122441,0.01337258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01476763,"threshold_uncertainty_score":0.04940259,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003006019,0.0009753425,0.001470624,0.001539392,0.0009333702,0.001872654,0.001681285,0.001462961,0.001803712],"category_scores_gemma":[0.006584436,0.001115278,0.001324691,0.0007033679,0.00195183,0.002492591,0.003814836,0.002886033,0.0006263261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001353123,"about_ca_system_score_gemma":0.001138288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007868093,"about_ca_topic_score_gemma":0.0009218064,"domain_scores_codex":[0.9980342,0.0007364971,0.00008576262,0.0002272157,0.0007358245,0.0001804199],"domain_scores_gemma":[0.9982497,0.0006907001,0.0001617728,0.0002686087,0.0004639253,0.0001652687],"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.0001985331,0.00007879046,0.0009735546,0.0002213281,0.00009827538,0.0002740811,0.001115725,0.1534653,0.02120318,0.746987,0.001420097,0.07396415],"study_design_scores_gemma":[0.00002951593,0.0001417941,0.0001640291,0.00006583479,0.00002398061,0.0001957941,0.0001848236,0.77652,0.01550563,0.2015898,0.005530802,0.0000481439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01697486,0.0001197719,0.980693,0.00009354696,0.00002109922,0.00003158335,0.00001598039,0.0002008966,0.00184922],"genre_scores_gemma":[0.2637704,0.0002637723,0.7315828,0.00006461258,0.00001938723,0.0001588087,0.00008487041,0.0001790834,0.003876228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003006019,"threshold_uncertainty_score":0.01589757,"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","authors":[{"name":"Alexander B. Kurzhanski","is_ca":false},{"name":"Ian M. Mitchell","is_ca":true},{"name":"Pravin Varaiya","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503366,0.001566358,0.001991665,0.00160333,0.0007394006,0.001479435,0.00190418,0.001626986,0.003185236],"category_scores_gemma":[0.003982896,0.0009408816,0.001448057,0.001789513,0.001518612,0.001986639,0.002744855,0.003144858,0.000645425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009731227,"about_ca_system_score_gemma":0.001520129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005642211,"about_ca_topic_score_gemma":0.004886906,"domain_scores_codex":[0.9993649,0.0002286051,0.00004057849,0.00008882144,0.0002277377,0.00004922272],"domain_scores_gemma":[0.9990915,0.0005710181,0.00008088388,0.0000561804,0.0001601944,0.00004025395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008065801,0.0001046047,0.0002379971,0.0004561796,0.0001439641,0.00006750852,0.0001448666,0.4766004,0.003086049,0.401125,0.004779114,0.1131736],"study_design_scores_gemma":[0.0000118161,0.00001757133,0.00007500595,0.00002691037,0.00001723077,0.00001561367,0.00001341527,0.8992137,0.0003131276,0.09667166,0.00361379,0.00001021353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001337311,0.001197878,0.9937698,0.0002093184,0.00009320558,0.00002090613,0.00002705121,0.00005701941,0.003287495],"genre_scores_gemma":[0.2278394,0.006885225,0.7343909,0.0005124563,0.0006924415,0.0006363503,0.0003841644,0.0006304614,0.02802865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005642211,"threshold_uncertainty_score":0.01121873,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003457519,0.0008897065,0.0009692818,0.001875635,0.001189573,0.002385576,0.002013365,0.001987675,0.005036142],"category_scores_gemma":[0.008221202,0.0006689015,0.001592239,0.001400326,0.002408206,0.004154314,0.00478058,0.004127773,0.001251035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331051,"about_ca_system_score_gemma":0.001854327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007450844,"about_ca_topic_score_gemma":0.0008754786,"domain_scores_codex":[0.9977093,0.0006384202,0.000179348,0.0005446753,0.0007530604,0.0001751356],"domain_scores_gemma":[0.9982311,0.0008934854,0.00010468,0.0002269552,0.0004025446,0.0001411816],"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.0001319901,0.0001003991,0.0003333497,0.0001627757,0.00005657344,0.0001415291,0.0004088129,0.01908264,0.01036757,0.7991813,0.001584967,0.1684481],"study_design_scores_gemma":[0.0001214799,0.0002183821,0.0002188846,0.00006281768,0.00003527932,0.0004325771,0.0001397713,0.467026,0.01703001,0.5010685,0.01356753,0.00007864449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003532933,0.00004177726,0.9947062,0.00008380675,0.00002345044,0.00005925019,0.0000135656,0.0001051522,0.001433819],"genre_scores_gemma":[0.04688101,0.00006723625,0.949962,0.00006929949,0.00002801288,0.0001556282,0.00005314247,0.00007084362,0.002712764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005036142,"threshold_uncertainty_score":0.01828533,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Sarah M. Moffat","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003137764,0.0007888716,0.001048455,0.001683883,0.00165268,0.004903844,0.001452869,0.00252576,0.004170393],"category_scores_gemma":[0.01047147,0.0009193732,0.001139888,0.001881787,0.004322993,0.007835259,0.00341617,0.005770214,0.0003410142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019048,"about_ca_system_score_gemma":0.001229612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000694645,"about_ca_topic_score_gemma":0.0005248307,"domain_scores_codex":[0.9982713,0.0008546948,0.00008045359,0.0003339457,0.0003358239,0.0001236996],"domain_scores_gemma":[0.9955832,0.002941884,0.000497032,0.0002931991,0.0003705522,0.0003140951],"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.00001088457,0.00001291791,0.00004944483,0.00001318357,0.000004713101,0.00002786526,0.00007606255,0.001014892,0.000205036,0.9966115,0.0002062468,0.001767046],"study_design_scores_gemma":[0.000005313367,0.00001252356,0.00007130575,0.000006939395,0.000003457774,0.00004486535,0.00004317252,0.009345136,0.0001196405,0.9895682,0.0007753897,0.000004187391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1336443,0.004103038,0.7790624,0.006543658,0.0003815025,0.00006789726,0.0001755028,0.00008620178,0.07593539],"genre_scores_gemma":[0.9011373,0.002508156,0.0716071,0.0007451293,0.0006399902,0.0001515397,0.0001619592,0.0000886981,0.02296004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004903844,"threshold_uncertainty_score":0.01659429,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Dominikus Noll","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008053732,0.000981192,0.001534548,0.001856336,0.001312026,0.001632398,0.002102961,0.001930964,0.004884889],"category_scores_gemma":[0.02392412,0.0005172401,0.001206529,0.001229361,0.003696648,0.002385286,0.004190042,0.002910646,0.0009628036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796006,"about_ca_system_score_gemma":0.001971616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005089126,"about_ca_topic_score_gemma":0.004033836,"domain_scores_codex":[0.9981894,0.001107576,0.00004881381,0.0001654353,0.0003222781,0.0001665661],"domain_scores_gemma":[0.9897139,0.007383897,0.0003899527,0.0006647485,0.001379642,0.0004678995],"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.0004204528,0.00008663045,0.001078465,0.0002450203,0.00007382401,0.00009959205,0.0002945057,0.1820308,0.003326492,0.770641,0.003975917,0.03772729],"study_design_scores_gemma":[0.00005238412,0.0001258569,0.0004694131,0.00008237949,0.00002974158,0.00008659997,0.00007110413,0.7847831,0.001637975,0.2081685,0.004449004,0.00004386727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05376056,0.002921147,0.9124369,0.001403576,0.0003146141,0.00009329554,0.00008298226,0.0002036412,0.02878332],"genre_scores_gemma":[0.6878256,0.00249617,0.2655696,0.0009426232,0.000454766,0.0003325149,0.0002609138,0.0006152637,0.04150249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008053732,"threshold_uncertainty_score":0.0425927,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"D. Lüke","is_ca":false},{"name":"Hung M. Phan","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003128348,0.001524255,0.001268205,0.001439717,0.0006589235,0.001851413,0.001749161,0.00132864,0.0050617],"category_scores_gemma":[0.006459213,0.0008953772,0.00130967,0.001417171,0.002675955,0.002679403,0.003522702,0.00424545,0.0009070314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008254471,"about_ca_system_score_gemma":0.001437742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001841517,"about_ca_topic_score_gemma":0.001611825,"domain_scores_codex":[0.9985449,0.0009262509,0.00004623942,0.0001563755,0.0002772505,0.00004901596],"domain_scores_gemma":[0.9977692,0.001278305,0.0001390151,0.000159288,0.0004361639,0.0002179804],"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.00005273159,0.00006669293,0.000132944,0.0001498529,0.00004033208,0.00005198798,0.0001076736,0.03195897,0.001641697,0.9230919,0.002953906,0.03975131],"study_design_scores_gemma":[0.00002408475,0.00004412765,0.00009515152,0.0000445655,0.00001365311,0.0001032503,0.00003666578,0.3633944,0.0006542356,0.6278573,0.007699281,0.00003318814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002761208,0.001063147,0.9899418,0.0003213099,0.0001321677,0.00002562858,0.00004109277,0.00008582318,0.005627918],"genre_scores_gemma":[0.1366525,0.004120881,0.8391251,0.0003248891,0.0005888802,0.0003064729,0.0002028541,0.0005688245,0.01810953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0050617,"threshold_uncertainty_score":0.01693302,"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","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Yves Lucet","is_ca":true},{"name":"Boris S. Mordukhovich","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319094,0.0007648271,0.0004891628,0.0009867911,0.000489494,0.003001718,0.0006375958,0.0006265172,0.004402134],"category_scores_gemma":[0.005088752,0.0003935047,0.0008064839,0.0009054914,0.002488003,0.004499516,0.001862518,0.002165557,0.0008499488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358155,"about_ca_system_score_gemma":0.0005698229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153245,"about_ca_topic_score_gemma":0.001058978,"domain_scores_codex":[0.9989266,0.0002430325,0.00008394958,0.0002842777,0.0003953701,0.00006682552],"domain_scores_gemma":[0.9981943,0.0006370925,0.0003005387,0.0002079332,0.0005212729,0.0001388619],"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.00005414981,0.00001510484,0.0006387953,0.0001313736,0.00002842633,0.0001463212,0.0002702462,0.01816366,0.003211676,0.9388651,0.001836963,0.03663825],"study_design_scores_gemma":[0.00001260393,0.00006928356,0.001636538,0.00007258418,0.00001783175,0.000408412,0.0002008428,0.1514075,0.004212482,0.8180965,0.02383259,0.00003289414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07779208,0.003109279,0.8802683,0.001406471,0.0001991878,0.0000452415,0.0005500585,0.0002319543,0.03639748],"genre_scores_gemma":[0.7156184,0.00364,0.2407539,0.0004850914,0.0004517415,0.0001653525,0.001334129,0.0002407535,0.03731062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004402134,"threshold_uncertainty_score":0.01472658,"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","authors":[{"name":"Anthony Lau","is_ca":true},{"name":"Yong Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839359,0.0006592213,0.0009652076,0.002293033,0.001486547,0.00246841,0.0009177375,0.001161131,0.007898296],"category_scores_gemma":[0.005287996,0.000471889,0.001553691,0.0008955179,0.003183863,0.003550946,0.002204088,0.002180615,0.0005357016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00102324,"about_ca_system_score_gemma":0.0006014228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009782792,"about_ca_topic_score_gemma":0.0007142979,"domain_scores_codex":[0.9993609,0.000185843,0.00004032664,0.0001389313,0.0001838063,0.00009012342],"domain_scores_gemma":[0.9954876,0.002668361,0.000420045,0.0002654742,0.0005709496,0.0005875242],"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.00002280893,0.00001691699,0.0002032409,0.00002612218,0.00001175822,0.0001354569,0.0003634184,0.001573077,0.001937379,0.9936876,0.0002203618,0.001801813],"study_design_scores_gemma":[0.00001244511,0.00002836896,0.0002504728,0.000007740397,0.000005801803,0.0001050553,0.0001177581,0.01147944,0.0002860268,0.9867776,0.0009184712,0.00001084109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3885646,0.001688963,0.5463179,0.00178777,0.0002758255,0.0001010727,0.0003182219,0.0002229916,0.06072261],"genre_scores_gemma":[0.9499733,0.0008389613,0.02837953,0.000215843,0.0004337652,0.000183987,0.0002604802,0.0001190565,0.01959514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007898296,"threshold_uncertainty_score":0.02642244,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Xianfu Wang","is_ca":true},{"name":"Liangjin Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357341,0.0004921601,0.0004598693,0.001187228,0.0007747661,0.001309903,0.0007070518,0.0007196615,0.003164742],"category_scores_gemma":[0.004988434,0.0002597678,0.0006208465,0.001010956,0.002739802,0.004002104,0.001159077,0.001329663,0.0003456105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008824171,"about_ca_system_score_gemma":0.0003388423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006685969,"about_ca_topic_score_gemma":0.0004679481,"domain_scores_codex":[0.999155,0.0002594553,0.00003020663,0.0001927836,0.0002068714,0.0001556268],"domain_scores_gemma":[0.9970683,0.001703122,0.000423614,0.0002461226,0.0003431564,0.0002156773],"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.00002219275,0.00001396254,0.0005400283,0.00003616479,0.000009550647,0.00008053438,0.0002124714,0.004638506,0.002763934,0.9833265,0.0005998192,0.007756306],"study_design_scores_gemma":[0.000004991456,0.00002544823,0.0004852875,0.00001300628,0.000005835058,0.0001582327,0.0001097784,0.04107103,0.001636126,0.9545979,0.00187911,0.00001318806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.404967,0.001413432,0.5552389,0.001493953,0.00006003099,0.0000435612,0.0002313854,0.0001558885,0.03639598],"genre_scores_gemma":[0.9580366,0.0005600055,0.03725611,0.0001382577,0.0001002042,0.00004465866,0.00009110767,0.00006464027,0.00370844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003164742,"threshold_uncertainty_score":0.0105871,"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","authors":[{"name":"Jean-Pierre Crouzeix","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Daoli Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01015732,0.002648021,0.002418681,0.002897103,0.001971778,0.003977945,0.002936694,0.003590003,0.006234088],"category_scores_gemma":[0.06786124,0.001051577,0.001938239,0.002265497,0.003903711,0.003952492,0.005060454,0.008037418,0.002496634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008857939,"about_ca_system_score_gemma":0.003641495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717254,"about_ca_topic_score_gemma":0.001362496,"domain_scores_codex":[0.9956026,0.00133498,0.0004234517,0.0005303809,0.001697342,0.0004113043],"domain_scores_gemma":[0.9727972,0.01807837,0.001622719,0.001463031,0.005282216,0.0007564335],"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.0005349977,0.0002486744,0.001156782,0.001085935,0.000162634,0.0006217228,0.0006845855,0.1708055,0.03125654,0.7232897,0.008855352,0.0612976],"study_design_scores_gemma":[0.00014723,0.0001874593,0.000869313,0.0004996812,0.00008642535,0.000367912,0.0003295363,0.4940956,0.01840771,0.4727092,0.01220542,0.00009440996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01607947,0.0006717611,0.9624991,0.0006776163,0.0002268953,0.000317916,0.0005759308,0.0002308963,0.01872045],"genre_scores_gemma":[0.3865513,0.004754763,0.5901939,0.0009041762,0.0009079345,0.002211293,0.00296827,0.0011402,0.01036818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015732,"threshold_uncertainty_score":0.05371773,"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","authors":[{"name":"Joël Benoist","is_ca":false},{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Nicolae Popovici","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970207,0.001153643,0.0006740454,0.002038545,0.0007129972,0.002577992,0.0006889642,0.0007106799,0.004266378],"category_scores_gemma":[0.005085805,0.000410817,0.0008972432,0.001217351,0.002636103,0.00439697,0.001566426,0.002087993,0.0007921366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001770013,"about_ca_system_score_gemma":0.0008875812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512211,"about_ca_topic_score_gemma":0.0008485843,"domain_scores_codex":[0.9984628,0.0005511897,0.00008978612,0.0003074033,0.0004142813,0.0001745227],"domain_scores_gemma":[0.9959993,0.001549641,0.0005429905,0.0002233594,0.001283532,0.000401251],"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.00004320694,0.00002095155,0.0007825912,0.0001167588,0.00002092077,0.0001733004,0.0002955416,0.009773332,0.005218233,0.9736028,0.001600267,0.008352067],"study_design_scores_gemma":[0.00001604066,0.0002352565,0.002948872,0.0001141437,0.0000411819,0.0006289117,0.0005821738,0.2418241,0.006822692,0.725445,0.02125944,0.00008234647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.167786,0.00142753,0.7900804,0.001658613,0.00018507,0.00007488488,0.0007159146,0.0002583404,0.03781332],"genre_scores_gemma":[0.892946,0.002109004,0.07326857,0.0005043453,0.0004919101,0.0001653006,0.00122985,0.0003697866,0.02891531],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004266378,"threshold_uncertainty_score":0.01427245,"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","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Laura Wynter","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734754,0.0006599995,0.0009409918,0.0007681908,0.000927975,0.002293862,0.00151883,0.002516057,0.01019991],"category_scores_gemma":[0.004583709,0.0003568507,0.0009199331,0.0009648744,0.002437554,0.00766775,0.001936487,0.005538492,0.0007231585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211514,"about_ca_system_score_gemma":0.0009917897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827713,"about_ca_topic_score_gemma":0.001718233,"domain_scores_codex":[0.9990907,0.0003240219,0.00002668863,0.0002530105,0.0002195785,0.00008604366],"domain_scores_gemma":[0.9987043,0.0007991015,0.0000875546,0.0001445995,0.0001646432,0.00009975808],"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.00002066113,0.00003349771,0.0001510026,0.0000652375,0.00001807707,0.00006919552,0.00009032719,0.01691229,0.0004928568,0.9612669,0.003908715,0.01697126],"study_design_scores_gemma":[0.00001282647,0.00002077443,0.0001014493,0.00003237404,0.000008022304,0.0001001335,0.00008223784,0.1138643,0.0003513145,0.8673052,0.01810954,0.00001190091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01083466,0.002490279,0.9481102,0.009486483,0.0004157026,0.00003570506,0.0001131838,0.0001110874,0.02840268],"genre_scores_gemma":[0.4102869,0.005512849,0.5302586,0.003654005,0.002522022,0.0002340865,0.0002818471,0.0003588258,0.04689093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01019991,"threshold_uncertainty_score":0.03412211,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002687369,0.001245831,0.001240889,0.002588346,0.001098448,0.002607005,0.001864758,0.00187302,0.005460251],"category_scores_gemma":[0.00932462,0.0007817757,0.001385211,0.00133505,0.00292076,0.006446569,0.002696723,0.002864538,0.0004698873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166924,"about_ca_system_score_gemma":0.0008720277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005555257,"about_ca_topic_score_gemma":0.0005171941,"domain_scores_codex":[0.9987814,0.0004383094,0.00006734159,0.0002221998,0.0003427969,0.0001479941],"domain_scores_gemma":[0.9967636,0.001509281,0.0004840714,0.0002326954,0.0005351043,0.0004753064],"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.00001431745,0.00001442936,0.00009121504,0.00003043134,0.00002004292,0.00005201655,0.0000983244,0.003374547,0.0009152247,0.991872,0.0004420823,0.003075267],"study_design_scores_gemma":[0.000005666625,0.00001637184,0.0001413587,0.000009212332,0.000007891073,0.00009675315,0.00003178144,0.04462321,0.0002906038,0.9539451,0.0008203522,0.00001162002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1949862,0.003040235,0.7613516,0.001597692,0.0004841205,0.00007608745,0.0002439975,0.0002349107,0.03798529],"genre_scores_gemma":[0.8510844,0.00219904,0.1150309,0.0006290677,0.0009893273,0.0001895569,0.0002165119,0.0003113864,0.02934985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005460251,"threshold_uncertainty_score":0.01826638,"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","authors":[{"name":"Mengwei Xu","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083414,0.0008243934,0.001437376,0.0006754629,0.0006190339,0.001080805,0.001316528,0.001385388,0.004046075],"category_scores_gemma":[0.003010276,0.0007409359,0.0009826182,0.001210507,0.0009844857,0.001172731,0.001726922,0.002082568,0.000916652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004140968,"about_ca_system_score_gemma":0.001429332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003167257,"about_ca_topic_score_gemma":0.005007406,"domain_scores_codex":[0.9996099,0.0001333445,0.00002285433,0.0000458608,0.0001594553,0.00002863484],"domain_scores_gemma":[0.9990433,0.0005221842,0.00006499657,0.0001314695,0.0001742453,0.00006373287],"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.0001153419,0.0001119532,0.0003990498,0.0002126519,0.00009029303,0.00009543178,0.0001190586,0.7238091,0.005515556,0.1282799,0.003696166,0.1375555],"study_design_scores_gemma":[0.00000689124,0.00001355114,0.00002600749,0.000004890309,0.000004664644,0.000007584833,0.000003625757,0.9869089,0.000245596,0.01149529,0.001277248,0.000005866406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002556305,0.00006583516,0.9960181,0.00004324188,0.0000389385,0.00001813033,0.00002204543,0.0001609931,0.001076337],"genre_scores_gemma":[0.1126675,0.0002253724,0.8794926,0.00009581935,0.00007636077,0.0002090834,0.0001696482,0.000333067,0.006730617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004046075,"threshold_uncertainty_score":0.0135355,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Radu Ioan Boţ","is_ca":false},{"name":"Warren Hare","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060785,0.0008043837,0.001734826,0.001800686,0.002429061,0.003367763,0.00253372,0.003249943,0.008384845],"category_scores_gemma":[0.008544444,0.0006330892,0.00153911,0.001255513,0.00547353,0.00836616,0.004935929,0.006605104,0.000701523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476013,"about_ca_system_score_gemma":0.001544612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00102193,"about_ca_topic_score_gemma":0.0009019889,"domain_scores_codex":[0.9985464,0.0006757778,0.00006398543,0.0002120131,0.0003306073,0.0001711332],"domain_scores_gemma":[0.997272,0.001230589,0.0002504811,0.0003920618,0.000397881,0.0004569604],"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.00000868496,0.00000838994,0.0000328161,0.00001326305,0.00000404351,0.00003380253,0.00004270861,0.000595348,0.0001575621,0.9975478,0.0006013484,0.0009542111],"study_design_scores_gemma":[0.000007785405,0.000007868497,0.00004595573,0.00001041567,0.00000297308,0.00006260807,0.00004809698,0.01972366,0.0000806649,0.9790922,0.0009127373,0.000005106465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147508,0.003920022,0.6849353,0.02213666,0.001628804,0.000096128,0.0002486627,0.0002100742,0.1720736],"genre_scores_gemma":[0.8646966,0.001989989,0.08559071,0.003291476,0.001860856,0.0001512261,0.000198908,0.0003219706,0.04189825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008384845,"threshold_uncertainty_score":0.02805012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}