{"meta":{"query_hash":"455f61133b2d","filters":{"venue":"Set-Valued and Variational Analysis"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/455f61133b2d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Set-Valued+and+Variational+Analysis"},"results":[{"id":"W1507079114","doi":"10.1007/s11228-015-0326-7","title":"Ubiquitous Subdifferentials, r L –density and Maximal Monotonicity","year":2015,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Subderivative; Monotonic function; Monotone polygon; Banach space; Regular polygon; Closed set; Function (biology); Convex function","score_opus":0.02404510212620979,"score_gpt":0.2523662866681549,"score_spread":0.2283211845419451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507079114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19669834,0.004080685,0.72158986,0.005020621,0.00023184717,0.000068706395,0.00039720343,0.00030721762,0.07160549],"genre_scores_gemma":[0.90208566,0.0024675634,0.076939635,0.0011025531,0.00062109943,0.00012252039,0.0003135891,0.00023032131,0.016117088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984485,0.00061346916,0.00011136838,0.0003976846,0.00025611103,0.0001727782],"domain_scores_gemma":[0.9919636,0.0045612673,0.0007470358,0.00082703796,0.0010769021,0.000824172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036240176,0.0008565742,0.0012781554,0.001807499,0.0014177422,0.0027298478,0.0014443218,0.0015317593,0.004735924],"category_scores_gemma":[0.016245607,0.0008668148,0.0013620127,0.0010125296,0.0052160244,0.008166586,0.00467173,0.004025006,0.0005125844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001668823,0.000013738156,0.00024210673,0.00003803623,0.000007519536,0.00006374853,0.00013412435,0.0008715839,0.0006068885,0.99381655,0.00064484205,0.0035441325],"study_design_scores_gemma":[0.0000073846822,0.000017098751,0.00033753322,0.000018682842,0.000006893962,0.0001792692,0.00007496823,0.0112850815,0.0003055189,0.9857275,0.0020295708,0.000010420567],"about_ca_topic_score_codex":0.0014793968,"about_ca_topic_score_gemma":0.0010190726,"teacher_disagreement_score":0.004735924,"about_ca_system_score_codex":0.0011039127,"about_ca_system_score_gemma":0.00074797415,"threshold_uncertainty_score":0.019165874},"labels":[],"label_agreement":null},{"id":"W2000936202","doi":"10.1007/s11228-010-0168-2","title":"The Concavity Assumption on Felicities and Asymptotic Dynamics in the RSS Model","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Central University of Finance and Economics; Egg Farmers of Canada","keywords":"Equivalence (formal languages); Mathematics; Generalization; Applied mathematics; Function (biology); Convergence (economics); Bellman equation; Parametric statistics; RSS; Symmetry (geometry); Mathematical optimization; Mathematical analysis; Computer science; Pure mathematics; Economics","score_opus":0.02106871951112374,"score_gpt":0.2298201094947784,"score_spread":0.20875138998365467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000936202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20339839,0.0010337818,0.7226738,0.007343706,0.00012621876,0.00006971292,0.00036138028,0.00029868158,0.06469433],"genre_scores_gemma":[0.9460358,0.0008908519,0.020063834,0.0005889901,0.00025467607,0.00011864916,0.00028294252,0.0002609265,0.031503417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.0004911308,0.00004461797,0.0001710631,0.00024701495,0.00020102429],"domain_scores_gemma":[0.9913594,0.0054355636,0.0009113536,0.0007185637,0.0009745698,0.00060039357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034979957,0.00052676373,0.0015473512,0.0014401755,0.0015077608,0.0025906072,0.0024701688,0.002328858,0.007999894],"category_scores_gemma":[0.02010774,0.00065899914,0.0013164768,0.0010447695,0.0041417945,0.005435273,0.0029643632,0.0038695158,0.00071675336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010543664,0.00001207155,0.00027926525,0.000018435025,0.000008556126,0.000028183764,0.000073547235,0.010171341,0.00018748286,0.98649675,0.0009360694,0.0017775838],"study_design_scores_gemma":[0.0000081123035,0.000010522237,0.000275459,0.000015968233,0.0000060785587,0.00004807406,0.000040222963,0.12521352,0.00010054988,0.87339026,0.00087806914,0.000013041781],"about_ca_topic_score_codex":0.005882711,"about_ca_topic_score_gemma":0.0036010765,"teacher_disagreement_score":0.007999894,"about_ca_system_score_codex":0.002518913,"about_ca_system_score_gemma":0.0017772127,"threshold_uncertainty_score":0.026762307},"labels":[],"label_agreement":null},{"id":"W2009873747","doi":"10.1007/s11228-010-0157-5","title":"Convex Hull Algorithms for Piecewise Linear-Quadratic Functions in Computational Convex Analysis","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convex hull; Proper convex function; Mathematics; Convex analysis; Algorithm; Convex conjugate; Convex combination; Subderivative; Mathematical optimization; Convex optimization; Piecewise linear function; Piecewise; Conic optimization; Computation; Quadratic equation; Envelope (radar); Convex set; Regular polygon; Computer science; Mathematical analysis","score_opus":0.05239085046265335,"score_gpt":0.3808286360075549,"score_spread":0.32843778554490155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009873747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013188559,0.00028522068,0.9974107,0.00012065008,0.00003675113,0.00001870076,0.000023712953,0.000098344746,0.000687105],"genre_scores_gemma":[0.13136612,0.0012686679,0.8558362,0.0001898107,0.00021965154,0.0002979572,0.00044387745,0.0007846687,0.009593012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982167,0.0008268457,0.00010092503,0.00022494598,0.00051573256,0.000114845476],"domain_scores_gemma":[0.99191684,0.005911299,0.00030164185,0.00065243675,0.0009370531,0.00028072493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045125275,0.0016456626,0.00248084,0.0018534493,0.0010105348,0.0026534998,0.003279284,0.0017792993,0.0051881867],"category_scores_gemma":[0.014694641,0.0013925497,0.0015842174,0.0026292084,0.0025583678,0.0046467506,0.0045715547,0.0072645037,0.0012170572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021094047,0.000109324115,0.0003881832,0.0004491017,0.00010931087,0.00005865157,0.00029033262,0.5094052,0.0020228329,0.2966286,0.0076396232,0.18268792],"study_design_scores_gemma":[0.000010150696,0.000016506181,0.000050574075,0.000018795217,0.000008467678,0.000008243254,0.0000177127,0.9330563,0.0005322819,0.064937696,0.0013358275,0.000007514643],"about_ca_topic_score_codex":0.0063243504,"about_ca_topic_score_gemma":0.004911028,"teacher_disagreement_score":0.0063243504,"about_ca_system_score_codex":0.002459338,"about_ca_system_score_gemma":0.0017979069,"threshold_uncertainty_score":0.023864865},"labels":[],"label_agreement":null},{"id":"W2030044614","doi":"10.1007/s11228-009-0112-5","title":"A Class of Quadratic Programs with Linear Complementarity Constraints","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Complementarity (molecular biology); Complementarity theory; Quadratic equation; Mathematical optimization; Linear complementarity problem; Class (philosophy); Constraint (computer-aided design); Stationary point; Mixed complementarity problem; Mathematics; Independence (probability theory); Point (geometry); Applied mathematics; Computer science; Mathematical economics; Nonlinear system; Mathematical analysis; Artificial intelligence","score_opus":0.06346052568580175,"score_gpt":0.37194278340215187,"score_spread":0.30848225771635013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030044614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069424674,0.0018774718,0.85821134,0.0015494803,0.00019383147,0.00012836917,0.00066632906,0.0002582073,0.06769031],"genre_scores_gemma":[0.80516875,0.0030814167,0.124570355,0.00065298914,0.0006701626,0.00036225695,0.0010611479,0.00026405044,0.064168826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999524,0.00009782898,0.00001588861,0.0001110016,0.00018494966,0.000066427434],"domain_scores_gemma":[0.9992974,0.00037109456,0.00009258847,0.000044508357,0.000115150535,0.0000792254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006784914,0.0010155767,0.000970007,0.0010042967,0.000855851,0.002162823,0.0011220467,0.0012451487,0.006778288],"category_scores_gemma":[0.0024527048,0.0004346763,0.00082723727,0.0012197027,0.0010400712,0.001987044,0.0014153395,0.0018477222,0.0005857356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004186432,0.00009599266,0.00030459336,0.000167227,0.000035543613,0.00015251347,0.00009658698,0.034216136,0.0016719279,0.924014,0.0066984477,0.032505184],"study_design_scores_gemma":[0.00003622348,0.000054062875,0.00036808112,0.000030816143,0.000018690436,0.00024321207,0.000057857582,0.31799632,0.000451318,0.6679429,0.012783848,0.000016685372],"about_ca_topic_score_codex":0.0013936782,"about_ca_topic_score_gemma":0.0010155874,"teacher_disagreement_score":0.006778288,"about_ca_system_score_codex":0.0007553973,"about_ca_system_score_gemma":0.0007389819,"threshold_uncertainty_score":0.022675693},"labels":[],"label_agreement":null},{"id":"W2030201940","doi":"10.1007/s11228-009-0113-4","title":"Clarke Generalized Jacobian of the Projection onto Symmetric Cones","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Jacobian matrix and determinant; Projection (relational algebra); Rank (graph theory); Mathematics; Pure mathematics; Connection (principal bundle); Order (exchange); Combinatorics; Geometry; Applied mathematics; Algorithm","score_opus":0.03342346534523686,"score_gpt":0.3108755328615045,"score_spread":0.2774520675162676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030201940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24410167,0.0019134681,0.6232946,0.0024334674,0.00085918594,0.000113218295,0.0006997834,0.0002830348,0.12630166],"genre_scores_gemma":[0.8919734,0.0015450657,0.028312959,0.0004067252,0.0005118829,0.000064243846,0.00028908698,0.00018811086,0.07670859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965763,0.00009099624,0.00001205499,0.00007020447,0.00013128162,0.000037788017],"domain_scores_gemma":[0.999342,0.00014539035,0.000096347845,0.000047826732,0.00022914988,0.00013912395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006336666,0.0007264332,0.0005362015,0.0014251249,0.0005550645,0.0022020095,0.0006822047,0.0006153188,0.007195886],"category_scores_gemma":[0.0013986562,0.00029441543,0.000578755,0.0005770788,0.0016986714,0.0019473493,0.0011711507,0.0018325618,0.0007123941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010734509,0.000008531356,0.000082875646,0.000023955661,0.000010985047,0.00006980819,0.0000716762,0.0023291358,0.001704701,0.99156934,0.00080101204,0.0033172367],"study_design_scores_gemma":[0.000014092796,0.000060032336,0.0006378515,0.000020184552,0.00001085528,0.00031554504,0.00011086079,0.043451022,0.0013807899,0.94729733,0.0066783945,0.000022965598],"about_ca_topic_score_codex":0.0022832442,"about_ca_topic_score_gemma":0.0014480264,"teacher_disagreement_score":0.007195886,"about_ca_system_score_codex":0.0010505284,"about_ca_system_score_gemma":0.0012986857,"threshold_uncertainty_score":0.024072647},"labels":[],"label_agreement":null},{"id":"W2038913104","doi":"10.1007/s11228-009-0108-1","title":"A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Convexity; Maximum principle; Mathematics; Optimal control; Independence (probability theory); Mathematical optimization; Applied mathematics; Control (management); Computer science; Statistics; Economics","score_opus":0.011726069260553655,"score_gpt":0.24494637455897195,"score_spread":0.23322030529841828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038913104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002910848,0.00058962917,0.99102485,0.0003559327,0.00008797266,0.000040525603,0.00004461725,0.000041738083,0.0049039004],"genre_scores_gemma":[0.29187104,0.0032743989,0.6746754,0.00086947886,0.0009390829,0.0011157247,0.0003227245,0.00064891303,0.026283149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986469,0.0006676965,0.000058516856,0.00020816125,0.0003474127,0.00007131699],"domain_scores_gemma":[0.9979513,0.001360993,0.00013266905,0.00010372261,0.00030015077,0.0001511448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043447143,0.0026660922,0.002314525,0.0017606171,0.0012022405,0.0022372738,0.0024773201,0.0025382035,0.0035955033],"category_scores_gemma":[0.0059901373,0.0019026496,0.0025127025,0.0012295212,0.0032283142,0.004062738,0.0061173686,0.0047020973,0.00065385294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009346423,0.000067138375,0.00012300341,0.0005044881,0.00014067594,0.000088547975,0.00018850912,0.086575754,0.008548253,0.87321216,0.002603332,0.027854564],"study_design_scores_gemma":[0.000025583395,0.00011532785,0.00012804073,0.00006686042,0.00004155296,0.000056409288,0.000028537072,0.40306622,0.0010652726,0.59032327,0.005054968,0.00002784835],"about_ca_topic_score_codex":0.00070562714,"about_ca_topic_score_gemma":0.0006944269,"teacher_disagreement_score":0.0043447143,"about_ca_system_score_codex":0.0010682243,"about_ca_system_score_gemma":0.0014985993,"threshold_uncertainty_score":0.022977352},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013328227314322936,"score_gpt":0.2756673167549808,"score_spread":0.26233908944065787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041901627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027612075,0.0010631472,0.9899418,0.0003213099,0.00013216773,0.000025628578,0.00004109277,0.00008582318,0.0056279176],"genre_scores_gemma":[0.13665251,0.004120881,0.8391251,0.00032488906,0.00058888015,0.0003064729,0.00020285408,0.0005688245,0.018109532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854493,0.00092625094,0.000046239416,0.0001563755,0.00027725054,0.00004901596],"domain_scores_gemma":[0.99776924,0.001278305,0.00013901512,0.00015928801,0.00043616391,0.0002179804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031283484,0.0015242551,0.0012682049,0.0014397167,0.00065892347,0.0018514134,0.0017491607,0.0013286397,0.0050617005],"category_scores_gemma":[0.0064592133,0.0008953772,0.0013096698,0.0014171711,0.0026759554,0.0026794027,0.0035227023,0.00424545,0.0009070314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005273159,0.000066692926,0.00013294397,0.00014985289,0.000040332085,0.00005198798,0.00010767363,0.03195897,0.0016416969,0.92309195,0.0029539063,0.039751306],"study_design_scores_gemma":[0.000024084746,0.000044127646,0.00009515152,0.000044565495,0.000013653105,0.00010325034,0.00003666578,0.36339444,0.0006542356,0.6278573,0.0076992805,0.00003318814],"about_ca_topic_score_codex":0.0018415169,"about_ca_topic_score_gemma":0.0016118246,"teacher_disagreement_score":0.0050617005,"about_ca_system_score_codex":0.0008254471,"about_ca_system_score_gemma":0.0014377416,"threshold_uncertainty_score":0.016933024},"labels":[],"label_agreement":null},{"id":"W2045050460","doi":"10.1007/s11228-010-0138-8","title":"Optimal Control of Non-convex Measure-driven Differential Inclusions","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differential inclusion; Measure (data warehouse); Mathematics; Extension (predicate logic); Regular polygon; Differential (mechanical device); Mathematical optimization; Optimal control; Control theory (sociology); Applied mathematics; Computer science; Control (management); Artificial intelligence; Data mining; Engineering; Geometry","score_opus":0.007822943143118505,"score_gpt":0.2389375222410473,"score_spread":0.2311145790979288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045050460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100943595,0.0014059985,0.8716522,0.0016516703,0.00032680266,0.00011165847,0.00017689822,0.00014370166,0.023587545],"genre_scores_gemma":[0.94829047,0.000621649,0.03239394,0.00020683685,0.0001124442,0.00017460699,0.000117738055,0.00009652154,0.017985849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991849,0.00032427505,0.000028828295,0.00014717082,0.00019404534,0.00012074903],"domain_scores_gemma":[0.9980958,0.0010291615,0.00025787158,0.00007352192,0.00032756611,0.00021612862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002000341,0.0013855848,0.0018536255,0.0011006503,0.00081384805,0.0027855956,0.0018760997,0.0020266906,0.0023365438],"category_scores_gemma":[0.005356989,0.0008079958,0.00095902296,0.0006823296,0.0026587117,0.0017336436,0.0036586414,0.0014757168,0.00018318449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014766688,0.00014525693,0.00037067058,0.00021719765,0.0000904273,0.00014708177,0.00020175257,0.54989815,0.0047601694,0.42845818,0.0015932836,0.01397019],"study_design_scores_gemma":[0.000017411061,0.000031604242,0.000097015385,0.000010322533,0.000008696838,0.000016662003,0.000026971047,0.9364307,0.00046066308,0.062281642,0.00060781266,0.0000106027865],"about_ca_topic_score_codex":0.005801569,"about_ca_topic_score_gemma":0.003514466,"teacher_disagreement_score":0.005801569,"about_ca_system_score_codex":0.0030887404,"about_ca_system_score_gemma":0.002397219,"threshold_uncertainty_score":0.022410512},"labels":[],"label_agreement":null},{"id":"W2074403900","doi":"10.1007/s11228-014-0310-7","title":"The Monge–Kantorovich Metric on Multimeasures and Self–Similar Multimeasures","year":2014,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Geometry and complex manifolds","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Metric (unit); Completeness (order theory); Metric space; Space (punctuation); Probability measure; Fisher information metric; Stein's method; Markov chain; Equivalence of metrics; Extension (predicate logic); Set (abstract data type); Discrete mathematics; Pure mathematics; Combinatorics; Intrinsic metric; Convex metric space; Mathematical analysis; Computer science; Statistics","score_opus":0.033083881345977804,"score_gpt":0.2859627129001348,"score_spread":0.252878831554157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074403900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5213686,0.0063538253,0.40834904,0.0056188125,0.000936831,0.000073814765,0.0004925541,0.00019430547,0.056612268],"genre_scores_gemma":[0.94130427,0.0021886383,0.036237057,0.0009137774,0.0010693853,0.000076267235,0.0003961587,0.00013111945,0.017683314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893945,0.00044135077,0.00005295929,0.00022317564,0.00022786469,0.00011527298],"domain_scores_gemma":[0.9972796,0.0009415925,0.00053611194,0.00032619236,0.00041758435,0.000498879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021217724,0.0011832836,0.0013840505,0.003257363,0.0020874955,0.0029786385,0.0016761683,0.002609059,0.003668648],"category_scores_gemma":[0.0053325314,0.0006696644,0.0011253131,0.0014315043,0.0049737785,0.006998392,0.0030813096,0.0029634656,0.00038683024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009083978,0.000007829833,0.00010770185,0.000018128036,0.000010567599,0.000030258188,0.00006837763,0.0012616353,0.00030991272,0.9966344,0.00036854376,0.0011734943],"study_design_scores_gemma":[0.0000032043292,0.000009229687,0.00015321904,0.0000056576846,0.0000026324105,0.000052546286,0.000034772234,0.0076572904,0.0000738643,0.99129194,0.0007049051,0.000010727904],"about_ca_topic_score_codex":0.0013477126,"about_ca_topic_score_gemma":0.00093992683,"teacher_disagreement_score":0.003668648,"about_ca_system_score_codex":0.0015883966,"about_ca_system_score_gemma":0.00076410774,"threshold_uncertainty_score":0.012272835},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02664853637802502,"score_gpt":0.2432763106379922,"score_spread":0.21662777425996718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101393121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13364431,0.0041030375,0.77906245,0.0065436577,0.00038150253,0.00006789726,0.00017550279,0.00008620178,0.07593539],"genre_scores_gemma":[0.9011373,0.0025081555,0.0716071,0.0007451293,0.0006399902,0.0001515397,0.00016195922,0.0000886981,0.022960043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827135,0.00085469475,0.00008045359,0.00033394573,0.00033582392,0.00012369963],"domain_scores_gemma":[0.99558324,0.002941884,0.000497032,0.00029319915,0.0003705522,0.00031409514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377638,0.0007888716,0.0010484548,0.0016838834,0.0016526796,0.004903844,0.001452869,0.0025257599,0.004170393],"category_scores_gemma":[0.0104714725,0.00091937324,0.001139888,0.0018817873,0.0043229926,0.007835259,0.0034161701,0.0057702144,0.0003410142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010884567,0.000012917906,0.000049444832,0.000013183572,0.0000047131007,0.000027865259,0.00007606255,0.0010148919,0.00020503599,0.99661154,0.0002062468,0.0017670463],"study_design_scores_gemma":[0.000005313367,0.000012523557,0.000071305745,0.0000069393946,0.000003457774,0.000044865348,0.00004317252,0.009345136,0.00011964047,0.9895682,0.0007753897,0.0000041873914],"about_ca_topic_score_codex":0.000694645,"about_ca_topic_score_gemma":0.00052483066,"teacher_disagreement_score":0.004903844,"about_ca_system_score_codex":0.0019047997,"about_ca_system_score_gemma":0.0012296119,"threshold_uncertainty_score":0.01659429},"labels":[],"label_agreement":null},{"id":"W2118860912","doi":"10.1007/s11228-012-0209-0","title":"Construction of Pathological Maximally Monotone Operators on Non-reflexive Banach Spaces","year":2012,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Pure mathematics; Banach space; Type (biology); Pseudo-monotone operator; Convolution (computer science); Dual (grammatical number); Operator (biology); Function space; Property (philosophy); Space (punctuation); Function (biology); Operator theory; Approximation property; Discrete mathematics; Finite-rank operator; Operator space; Computer science; Chemistry","score_opus":0.03393967027093766,"score_gpt":0.3293729741415905,"score_spread":0.29543330387065286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118860912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22717266,0.00044909594,0.7380566,0.0010930661,0.00031664665,0.000123996,0.000115424744,0.00035624465,0.03231631],"genre_scores_gemma":[0.79737055,0.0003345871,0.18945216,0.00030865998,0.00011615,0.0001514064,0.00017996115,0.00013924394,0.011947264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989157,0.00032846455,0.000074157164,0.00013474555,0.00040192195,0.00014507462],"domain_scores_gemma":[0.9985253,0.00044885554,0.0001717122,0.00018774197,0.00031476867,0.00035163772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238869,0.0010705945,0.0007997375,0.0019985475,0.0014708807,0.0023649368,0.0014866634,0.0014257677,0.0027386828],"category_scores_gemma":[0.0031733434,0.00080508756,0.0011688415,0.0006144482,0.0034750507,0.0032005492,0.0038470253,0.0031322397,0.00034187306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021905467,0.000014810451,0.00017381873,0.0000301876,0.000005771077,0.000117772244,0.00014191949,0.0009788827,0.003142953,0.9934762,0.00022095528,0.0016749887],"study_design_scores_gemma":[0.000019176452,0.000050920356,0.00023856938,0.0000204865,0.000011598761,0.0004886674,0.00016763728,0.02651692,0.0033269539,0.9665808,0.00256157,0.00001661465],"about_ca_topic_score_codex":0.0001942389,"about_ca_topic_score_gemma":0.0002576355,"teacher_disagreement_score":0.0027386828,"about_ca_system_score_codex":0.0010916345,"about_ca_system_score_gemma":0.0008946276,"threshold_uncertainty_score":0.011840403},"labels":[],"label_agreement":null},{"id":"W2120001232","doi":"10.1007/s11228-009-0110-7","title":"An Answer to S. Simons’ Question on the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Operator and a Normal Cone Operator","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Monotonic function; Pseudo-monotone operator; Monotone polygon; Operator (biology); Discrete mathematics; Combinatorics; Finite-rank operator; Linear map; Pure mathematics; Banach space; Mathematical analysis","score_opus":0.01171228963208809,"score_gpt":0.2598769770426923,"score_spread":0.2481646874106042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120001232","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069302216,0.014812126,0.16006975,0.5587717,0.009978272,0.000048638907,0.0010657745,0.00040156767,0.18554987],"genre_scores_gemma":[0.77697426,0.009654681,0.06795003,0.05431384,0.016855998,0.00017024216,0.00085702015,0.00053741335,0.072686434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988186,0.0003895453,0.000066090055,0.00029361804,0.00028126052,0.00015092196],"domain_scores_gemma":[0.9939856,0.004049773,0.00028156512,0.00032963694,0.0010169726,0.00033646685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032915806,0.000617013,0.0015074083,0.0010752508,0.0018647023,0.002091002,0.0011631764,0.005216267,0.011460874],"category_scores_gemma":[0.016272224,0.0003731096,0.0007329304,0.0012166342,0.004285263,0.010881691,0.0025979101,0.005245085,0.0016017365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069538524,0.000020762378,0.00016950569,0.00010017693,0.000016115737,0.00007650018,0.00014602982,0.00049447495,0.0005221401,0.9534015,0.036418293,0.008564977],"study_design_scores_gemma":[0.000019577088,0.00000869183,0.00012447049,0.000018803757,0.0000052689165,0.00008234068,0.0000695057,0.0014257198,0.00023074061,0.9805524,0.017450087,0.000012549128],"about_ca_topic_score_codex":0.0008269811,"about_ca_topic_score_gemma":0.00059551944,"teacher_disagreement_score":0.011460874,"about_ca_system_score_codex":0.0010709863,"about_ca_system_score_gemma":0.00089426537,"threshold_uncertainty_score":0.03834045},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01273990833924538,"score_gpt":0.2688874153341057,"score_spread":0.25614750699486033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132628835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036352167,0.0008572647,0.98643005,0.00046718077,0.0001286141,0.000026202353,0.00004881794,0.00006767676,0.008339028],"genre_scores_gemma":[0.24857698,0.0037579038,0.7134413,0.00061627326,0.0009734131,0.00047454753,0.00032105081,0.00061856257,0.031219985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978759,0.0012876234,0.00006394723,0.0002293483,0.00045544372,0.00008766421],"domain_scores_gemma":[0.99621934,0.0023431468,0.00022182117,0.00030099342,0.00058377645,0.00033082385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040327995,0.0013285411,0.001217967,0.0017140092,0.00094895123,0.0028225887,0.0024905743,0.0014805954,0.0053987466],"category_scores_gemma":[0.00933586,0.0010981482,0.0015256541,0.0013167872,0.0040511643,0.004740644,0.004019776,0.0051609105,0.00080452854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008828587,0.000011913892,0.000036895995,0.00003339174,0.000010014409,0.000009982875,0.000036456026,0.0040511005,0.00020364822,0.9892545,0.0007584308,0.0055847582],"study_design_scores_gemma":[0.000009652429,0.000016758016,0.00004596944,0.00002199311,0.000006655398,0.000039811355,0.000019156261,0.08865977,0.00017898162,0.9079159,0.0030717717,0.000013567225],"about_ca_topic_score_codex":0.0015378073,"about_ca_topic_score_gemma":0.0012442073,"teacher_disagreement_score":0.0053987466,"about_ca_system_score_codex":0.0012669397,"about_ca_system_score_gemma":0.001755943,"threshold_uncertainty_score":0.021327794},"labels":[],"label_agreement":null},{"id":"W2546659876","doi":"10.1007/s11228-016-0394-3","title":"Computing Proximal Points of Convex Functions with Inexact Subgradients","year":2016,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Bounded function; Mathematical optimization; Function (biology); Subderivative; Saddle point; Point (geometry); Regular polygon; Convex function; Oracle; Minification; Convex optimization; Applied mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.03364518097489857,"score_gpt":0.32039651373612477,"score_spread":0.2867513327612262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546659876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123168435,0.0001559835,0.98635834,0.00008776147,0.000033869153,0.000036769812,0.000033137625,0.00015832207,0.00081895036],"genre_scores_gemma":[0.245754,0.00039579233,0.7487752,0.00007200212,0.00009157242,0.00019597457,0.0002505191,0.00040954683,0.004055349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985316,0.0006091139,0.00007601775,0.00019582352,0.0004783995,0.0001090443],"domain_scores_gemma":[0.9950133,0.0033379977,0.00031891535,0.0003637445,0.0006489111,0.0003170186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037588228,0.0018965382,0.002669872,0.0020162351,0.00070222764,0.0024192848,0.0023435415,0.0026413726,0.0034865953],"category_scores_gemma":[0.018608725,0.0017363125,0.001167945,0.0014088824,0.0021993325,0.003052131,0.003904838,0.0035790678,0.0010098327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003396101,0.0001615096,0.0008032107,0.00034620365,0.000110676025,0.00016559153,0.00022143153,0.8285965,0.0029481663,0.071523435,0.0023928706,0.092390776],"study_design_scores_gemma":[0.00001804852,0.000052572526,0.00009762942,0.000023350976,0.0000118890475,0.000026566318,0.000024921737,0.96539056,0.0012812228,0.032494444,0.00056981615,0.000009013435],"about_ca_topic_score_codex":0.0026415826,"about_ca_topic_score_gemma":0.003286966,"teacher_disagreement_score":0.0037588228,"about_ca_system_score_codex":0.001333852,"about_ca_system_score_gemma":0.00205463,"threshold_uncertainty_score":0.019878745},"labels":[],"label_agreement":null},{"id":"W2617461187","doi":"10.1007/s11228-017-0415-x","title":"Subgradient Projectors: Extensions, Theory, and Characterizations","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Projector; Convex optimization; Convex analysis; Projection (relational algebra); Regular polygon; Mathematical optimization; Computer science; Algorithm; Geometry; Computer vision","score_opus":0.018262609816990207,"score_gpt":0.27462198711813957,"score_spread":0.2563593773011494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617461187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025919225,0.0018914397,0.9547668,0.0014608068,0.00012398706,0.00005167002,0.0001730299,0.00013098652,0.01548206],"genre_scores_gemma":[0.6261156,0.007909797,0.3273195,0.0010903399,0.0015979107,0.00046531082,0.0007506224,0.0006905055,0.03406048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977156,0.0011310467,0.00011756117,0.00034368387,0.0005263583,0.00016573614],"domain_scores_gemma":[0.9925868,0.0040595653,0.0007188617,0.0006477464,0.001215215,0.0007719133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004705571,0.0012766266,0.0013326228,0.002181462,0.0008754998,0.003883427,0.0017000474,0.0013448008,0.0047712084],"category_scores_gemma":[0.014256313,0.0007528426,0.001254904,0.0022450758,0.0036743467,0.0076388875,0.0034041263,0.0057162726,0.00065300445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016131555,0.000022588407,0.00019205162,0.000041190855,0.000010734861,0.000022439826,0.00008354265,0.003387292,0.00033771296,0.98462856,0.0013060308,0.009951718],"study_design_scores_gemma":[0.000009543272,0.00003892294,0.00021945717,0.00003737928,0.000014282549,0.00011659673,0.00005367981,0.07873818,0.00043272218,0.9168059,0.0035196277,0.00001375915],"about_ca_topic_score_codex":0.0008881104,"about_ca_topic_score_gemma":0.0006847976,"teacher_disagreement_score":0.0047712084,"about_ca_system_score_codex":0.0016105897,"about_ca_system_score_gemma":0.0016068217,"threshold_uncertainty_score":0.024885774},"labels":[],"label_agreement":null},{"id":"W2767642227","doi":"10.1007/s11228-021-00603-2","title":"On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals","year":2021,"lang":"en","type":"preprint","venue":"Set-Valued and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Oak Ridge National Laboratory; Advanced Scientific Computing Research; Office of Science; UT-Battelle; Battelle; Division of Mathematical Sciences; U.S. Department of Energy","keywords":"Convergence (economics); Computation; Norm (philosophy); Relaxation (psychology); Set (abstract data type); Regular polygon; Mathematical optimization; Algorithm; Mathematics; Sparse approximation; Inverse; Computer science; Applied mathematics","score_opus":0.03225607835430253,"score_gpt":0.2567377612541529,"score_spread":0.22448168289985035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767642227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011920496,0.00065621035,0.9814038,0.0008807084,0.00012044481,0.00005651098,0.00008533708,0.000063875035,0.004812677],"genre_scores_gemma":[0.46799383,0.0035228604,0.50240564,0.0012069446,0.00071987516,0.00056981336,0.00070064946,0.0006291351,0.022251243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968156,0.001971867,0.0001143199,0.00028610093,0.0006765892,0.0001355228],"domain_scores_gemma":[0.9683049,0.027098544,0.0007947344,0.00086340687,0.0020901891,0.0008482633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013225068,0.0024858934,0.0019097715,0.0019336959,0.0009510665,0.0022021008,0.0022556665,0.003068976,0.0035548324],"category_scores_gemma":[0.04217623,0.0014279732,0.0017789835,0.001346556,0.0068948045,0.0055134925,0.006818344,0.0066096983,0.0005464988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044773726,0.0001324101,0.00093310315,0.00050902605,0.00017964804,0.00024872893,0.00059817726,0.2694821,0.009798185,0.6803719,0.0040552416,0.03324372],"study_design_scores_gemma":[0.000018993622,0.00005841744,0.0001424322,0.0000465593,0.000015067076,0.00006390399,0.00005359858,0.8355219,0.0010855637,0.16211623,0.0008577241,0.000019542718],"about_ca_topic_score_codex":0.00399839,"about_ca_topic_score_gemma":0.0025831773,"teacher_disagreement_score":0.013225068,"about_ca_system_score_codex":0.0015493644,"about_ca_system_score_gemma":0.0018146081,"threshold_uncertainty_score":0.06994164},"labels":[],"label_agreement":null},{"id":"W2794154484","doi":"10.1007/s11228-018-0476-5","title":"Computation of the Epsilon-Subdifferential of Convex Piecewise Linear-Quadratic Functions in Optimal Worst-Case Time","year":2018,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Proper convex function; Convex analysis; Convex combination; Piecewise linear function; Regular polygon; Logarithmically convex function; Convex function; Convex optimization; Subderivative","score_opus":0.043630747610200964,"score_gpt":0.344245910834639,"score_spread":0.30061516322443804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794154484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078761026,0.00065667526,0.90896225,0.0009031877,0.00011810807,0.000053728127,0.00015050588,0.00019176082,0.0102028055],"genre_scores_gemma":[0.78848696,0.00038870462,0.20048648,0.00018799037,0.0000791105,0.00015735612,0.00032140804,0.0004562413,0.0094356565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.00033577663,0.00003736773,0.00009810772,0.00017286095,0.000126033],"domain_scores_gemma":[0.99327976,0.0053364434,0.00026093022,0.00023492558,0.000500388,0.0003874744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781904,0.001313834,0.0012905716,0.0010662052,0.0005497422,0.0020705066,0.001489301,0.0016486226,0.0053938944],"category_scores_gemma":[0.016488723,0.0007388921,0.0007739257,0.0006862342,0.0015070409,0.0022056345,0.0015798212,0.0024215807,0.00031077047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016490015,0.00004850766,0.0005866467,0.00012571424,0.00002933635,0.00009871442,0.00007580154,0.91072273,0.0010448194,0.07501085,0.0011886684,0.010903331],"study_design_scores_gemma":[0.0000031156608,0.0000066544358,0.000048373586,0.0000083143095,0.0000031261193,0.000007714608,0.000007825446,0.9893646,0.00016248871,0.010257589,0.00012783549,0.0000022935396],"about_ca_topic_score_codex":0.0050560413,"about_ca_topic_score_gemma":0.0052872463,"teacher_disagreement_score":0.0053938944,"about_ca_system_score_codex":0.0023160141,"about_ca_system_score_gemma":0.0020689042,"threshold_uncertainty_score":0.020000815},"labels":[],"label_agreement":null},{"id":"W2951241939","doi":"10.1007/s11228-019-00519-y","title":"New Sharp Necessary Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2019,"lang":"en","type":"preprint","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Complementarity (molecular biology); Constraint (computer-aided design); Mathematical optimization; Parametric statistics; Mathematics; Mixed complementarity problem; Mathematical economics; Cone (formal languages); Applied mathematics; Computer science; Algorithm; Nonlinear system; Geometry; Physics","score_opus":0.03173994879061303,"score_gpt":0.2952924408431884,"score_spread":0.26355249205257536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951241939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016463386,0.0011896621,0.9495219,0.0016924859,0.0004521438,0.0002096165,0.0006730373,0.00027974986,0.029518023],"genre_scores_gemma":[0.46824068,0.003244269,0.49323776,0.0021207272,0.0013059606,0.0017211386,0.0013612256,0.0010256331,0.027742663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979499,0.0007000826,0.00015608751,0.00035743814,0.0005701037,0.0002664259],"domain_scores_gemma":[0.99318355,0.004694758,0.0004981432,0.00031122746,0.0008995639,0.00041282678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004734526,0.002705671,0.00199961,0.0035077427,0.0014040646,0.003535495,0.0029285983,0.0032679292,0.014865625],"category_scores_gemma":[0.020040281,0.0021433604,0.0025988123,0.0019261644,0.002874732,0.0077652824,0.0041187666,0.00933657,0.001809564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006058223,0.000066980254,0.00016524168,0.00024900094,0.000031110976,0.00012534244,0.00015421677,0.012680013,0.0027516629,0.96966773,0.003969637,0.010078597],"study_design_scores_gemma":[0.00004544754,0.000058673937,0.00025106932,0.00010387521,0.00003420156,0.00007896375,0.00006874708,0.10547859,0.0016836334,0.88697654,0.005187026,0.000033278906],"about_ca_topic_score_codex":0.00086845335,"about_ca_topic_score_gemma":0.0014239685,"teacher_disagreement_score":0.014865625,"about_ca_system_score_codex":0.002049811,"about_ca_system_score_gemma":0.0022838938,"threshold_uncertainty_score":0.04973048},"labels":[],"label_agreement":null},{"id":"W3153160857","doi":"10.1007/s11228-021-00584-2","title":"Resolvents and Yosida Approximations of Displacement Mappings of Isometries","year":2021,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Pure mathematics; Class (philosophy); Operator theory; Subderivative; Displacement (psychology); Set (abstract data type); Algebra over a field; Regular polygon; Convex optimization; Computer science; Geometry","score_opus":0.014195760703829751,"score_gpt":0.24893897843207535,"score_spread":0.2347432177282456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153160857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17739512,0.0016620407,0.7951637,0.0008752428,0.0005172617,0.000059477123,0.000177238,0.00012190537,0.024027964],"genre_scores_gemma":[0.82721263,0.0014365739,0.1400992,0.0001937162,0.00023503033,0.00012642074,0.00030767897,0.00020556111,0.03018315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996119,0.00012303259,0.000022419941,0.000079557634,0.00011038734,0.000052800366],"domain_scores_gemma":[0.99944097,0.00019848881,0.00007714776,0.00005677127,0.00013519905,0.000091324575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697736,0.00088297355,0.0009187891,0.0013818357,0.00071956764,0.0020270613,0.0011868746,0.001115866,0.002851421],"category_scores_gemma":[0.0038485113,0.0006015271,0.0008015113,0.0007268507,0.0017346992,0.0022515943,0.0021257023,0.00219113,0.00048583563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004378143,0.000022704196,0.00030087715,0.000057529305,0.000016773625,0.000056991204,0.00022252693,0.021335226,0.002557702,0.9660661,0.00059054425,0.008729193],"study_design_scores_gemma":[0.000018726447,0.000056808432,0.00039983622,0.00003772323,0.000014049144,0.00007962662,0.00029921657,0.50187236,0.0013257662,0.49117845,0.0046889493,0.000028428403],"about_ca_topic_score_codex":0.001911802,"about_ca_topic_score_gemma":0.0016589897,"teacher_disagreement_score":0.002851421,"about_ca_system_score_codex":0.000977627,"about_ca_system_score_gemma":0.0007479189,"threshold_uncertainty_score":0.009538949},"labels":[],"label_agreement":null},{"id":"W3174661081","doi":"10.1007/s11228-021-00591-3","title":"Variational Analysis Perspective on Linear Convergence of Some First Order Methods for Nonsmooth Convex Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Metric (unit); Lasso (programming language); Rate of convergence; Convergence (economics); Calmness; Mathematical optimization; Applied mathematics; Convex function; Convex optimization; Rank (graph theory); Regular polygon; Computer science; Combinatorics","score_opus":0.02273572245229764,"score_gpt":0.31270713313180887,"score_spread":0.2899714106795112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174661081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003288958,0.0024028716,0.97747254,0.002323345,0.0003348641,0.00003410733,0.00007573662,0.000051075775,0.014016442],"genre_scores_gemma":[0.37378663,0.011154657,0.5469011,0.0023522615,0.0026636356,0.0005672784,0.00038765575,0.0006846921,0.061502036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980385,0.0010976135,0.00007368855,0.00021032996,0.0004726599,0.00010730859],"domain_scores_gemma":[0.99349314,0.0047674207,0.00028652998,0.00024342077,0.00095264195,0.00025686264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064568054,0.002026437,0.0014909245,0.002121284,0.0009419471,0.0028505467,0.002325687,0.00229253,0.0042038844],"category_scores_gemma":[0.0112396,0.0008742156,0.0023878373,0.0012062191,0.0049534733,0.0032926274,0.00324801,0.007051108,0.0005017208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017277993,0.00001965162,0.00008726438,0.00014268953,0.000033482862,0.000033038694,0.00012681705,0.032914758,0.0012337614,0.9590401,0.0013527243,0.0049984143],"study_design_scores_gemma":[0.00001118952,0.000056518355,0.00017098297,0.00007064094,0.000025474601,0.00006733994,0.00005588041,0.5151698,0.0008298542,0.47662547,0.0068882187,0.000028529328],"about_ca_topic_score_codex":0.004938203,"about_ca_topic_score_gemma":0.0029285385,"teacher_disagreement_score":0.0064568054,"about_ca_system_score_codex":0.0027383508,"about_ca_system_score_gemma":0.0019846314,"threshold_uncertainty_score":0.034147263},"labels":[],"label_agreement":null},{"id":"W4238404478","doi":"10.1007/s11228-017-0466-z","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Philosophy","score_opus":0.021250713558395976,"score_gpt":0.2790753072660079,"score_spread":0.2578245937076119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238404478","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017078634,0.017833978,0.016199984,0.058024816,0.31368375,0.0005062909,0.015111638,0.0016714501,0.57526016],"genre_scores_gemma":[0.008841677,0.005526488,0.0041903164,0.0095140785,0.034437027,0.00025890584,0.007520824,0.0010848609,0.92862576],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990607,0.000158034,0.00005230458,0.00017517645,0.0004775715,0.0000762419],"domain_scores_gemma":[0.9942152,0.0009505753,0.00019095327,0.00051009306,0.003217712,0.00091550424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015464571,0.00089649804,0.0006603225,0.0026489508,0.0020974502,0.0033215233,0.0011715707,0.0010289797,0.39254096],"category_scores_gemma":[0.014684435,0.00024017229,0.00050173135,0.0016753728,0.00060097297,0.0023546617,0.0020455166,0.0028209933,0.25432774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023247829,0.00001594001,0.000092155795,0.00007740664,0.0000024871224,0.000033259337,0.000049446182,0.00007766634,0.000100938625,0.009130236,0.9508025,0.039594766],"study_design_scores_gemma":[0.000004357628,0.00000748539,0.00018390786,0.00010688579,0.0000019850659,0.000036474496,0.00004873301,0.000045039174,0.00011156928,0.006390421,0.9930582,0.0000048300276],"about_ca_topic_score_codex":0.0034306147,"about_ca_topic_score_gemma":0.0052820207,"teacher_disagreement_score":0.60745907,"about_ca_system_score_codex":0.0022315406,"about_ca_system_score_gemma":0.0024274462,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4317493516","doi":"10.1007/s11228-023-00664-5","title":"Limiting Behaviour of the Generalized Simplex Gradient as the Number of Points Tends to Infinity on a Fixed Shape in IRn","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Simplex; Mathematics; Infinity; Position (finance); Function (biology); Limiting; Fixed point; Mathematical analysis; Finite set; Upper and lower bounds; Work (physics); Point (geometry); Sample (material); Applied mathematics; Combinatorics; Geometry; Physics","score_opus":0.0724339798274549,"score_gpt":0.3897422809007294,"score_spread":0.31730830107327446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317493516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49842978,0.0029553592,0.4319214,0.0038548054,0.00030305432,0.00018900035,0.00051031116,0.00089142047,0.060944915],"genre_scores_gemma":[0.90211064,0.0014827119,0.07208237,0.0005531749,0.00023934743,0.00025479446,0.0005658547,0.0007039026,0.022007158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988127,0.00056536036,0.000043727076,0.00016755219,0.0002551788,0.00015554516],"domain_scores_gemma":[0.98603386,0.007994589,0.0011522142,0.00067005854,0.0018073682,0.0023419706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003906656,0.001332732,0.0017011637,0.0034240822,0.0017812051,0.0038752158,0.003976944,0.0025210918,0.006267113],"category_scores_gemma":[0.027198954,0.0014312486,0.0013139916,0.0013558639,0.0048954743,0.0048686485,0.0043441453,0.0029122808,0.00080188864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031770102,0.00013905099,0.002927655,0.00060581503,0.00012126345,0.0004374735,0.00051142514,0.19923773,0.006470806,0.77559054,0.0039695743,0.009670884],"study_design_scores_gemma":[0.000028669856,0.0000673733,0.0014316997,0.0001393411,0.000031271076,0.00028476835,0.00018892715,0.8066791,0.001023541,0.18870176,0.0013600874,0.00006346519],"about_ca_topic_score_codex":0.0077808714,"about_ca_topic_score_gemma":0.0061099,"teacher_disagreement_score":0.0077808714,"about_ca_system_score_codex":0.0031360341,"about_ca_system_score_gemma":0.0013110664,"threshold_uncertainty_score":0.022753656},"labels":[],"label_agreement":null},{"id":"W4385644730","doi":"10.1007/s11228-023-00683-2","title":"Relaxed Constant Positive Linear Dependence Constraint Qualification for Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Piecewise; Mathematics; Constant (computer programming); Upper and lower bounds; Piecewise linear function; Mathematical optimization; Set (abstract data type); Regular polygon; Property (philosophy); Computer science; Mathematical analysis","score_opus":0.029383924758906967,"score_gpt":0.2904096471752086,"score_spread":0.2610257224163017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385644730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011015613,0.00026046115,0.9743033,0.00061372685,0.00006561805,0.00006583059,0.00032878685,0.00012103042,0.013225733],"genre_scores_gemma":[0.6745759,0.00061379164,0.293257,0.00079314836,0.00022722705,0.0003569258,0.0012836645,0.00043001826,0.028462254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713814,0.0010376547,0.00011235816,0.00064862915,0.0007991285,0.00026407454],"domain_scores_gemma":[0.9942602,0.0038172156,0.00028409535,0.00046253766,0.0009607128,0.00021516421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038211222,0.0010765904,0.0012882021,0.000732407,0.0007219383,0.0024763271,0.002592461,0.001618331,0.011809942],"category_scores_gemma":[0.010463841,0.0010481571,0.0010542892,0.0010384776,0.0021456347,0.00373051,0.002996411,0.0044377577,0.00092686195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015750881,0.0001105265,0.00038036736,0.00048693732,0.00009179981,0.00025394018,0.0002945381,0.35557127,0.006257281,0.5890943,0.007432314,0.039869223],"study_design_scores_gemma":[0.000022715583,0.000034303397,0.00016529587,0.00003733477,0.00001683797,0.0000694941,0.00004666659,0.78903514,0.0014137725,0.20590661,0.0032328367,0.00001899171],"about_ca_topic_score_codex":0.004554423,"about_ca_topic_score_gemma":0.005323401,"teacher_disagreement_score":0.011809942,"about_ca_system_score_codex":0.0023385866,"about_ca_system_score_gemma":0.002037375,"threshold_uncertainty_score":0.039508224},"labels":[],"label_agreement":null},{"id":"W4385811091","doi":"10.1007/s11228-023-00687-y","title":"The Homogenization Cone: Polar Cone and Projection","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Dual cone and polar cone; Homogenization (climate); Cone (formal languages); Mathematics; Regular polygon; Unit sphere; Polar; Geometry; Ligand cone angle; Mathematical analysis; Pure mathematics; Physics; Conical surface; Algorithm","score_opus":0.043523919192755514,"score_gpt":0.314282693898874,"score_spread":0.2707587747061185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385811091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074827544,0.008942495,0.81052965,0.005509325,0.000491743,0.00007352466,0.00045647126,0.00009315108,0.09907615],"genre_scores_gemma":[0.8687901,0.010452199,0.0804604,0.0010825318,0.0017915112,0.00012384022,0.0005293944,0.0002654046,0.036504626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925834,0.000310651,0.000030583145,0.00017256859,0.00016963121,0.000058217214],"domain_scores_gemma":[0.9975908,0.0011890632,0.00029478388,0.00012220102,0.00047301888,0.00033010985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017156034,0.0009766672,0.0009324445,0.0028133967,0.0009513837,0.004258166,0.00092007645,0.0010659193,0.0054540555],"category_scores_gemma":[0.0045375526,0.00055116165,0.000784139,0.001781161,0.0045982287,0.0063586333,0.002633919,0.0034335405,0.00048185527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007353493,0.0000043051464,0.000076276214,0.0000178661,0.0000035276253,0.000023980052,0.00006299209,0.0008082851,0.00023100825,0.99602,0.0005659433,0.002178424],"study_design_scores_gemma":[0.0000046021805,0.000010601285,0.00016860546,0.000015206289,0.000004898323,0.0000750265,0.0000698536,0.0099793635,0.00020468359,0.98577994,0.003681337,0.000005908184],"about_ca_topic_score_codex":0.002180413,"about_ca_topic_score_gemma":0.0011684285,"teacher_disagreement_score":0.0054540555,"about_ca_system_score_codex":0.0012736795,"about_ca_system_score_gemma":0.00071626616,"threshold_uncertainty_score":0.018245637},"labels":[],"label_agreement":null},{"id":"W4409337533","doi":"10.1007/s11228-025-00750-w","title":"Calm Local Optimality for Nonconvex-Nonconcave Minimax Problems","year":2025,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematical optimization; Mathematical economics; Economics; Mathematics; Computer science","score_opus":0.015341426648920797,"score_gpt":0.2783141284345232,"score_spread":0.2629727017856024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409337533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048255205,0.0022240772,0.91563106,0.0032502855,0.000208703,0.00014173712,0.00025258918,0.00021895596,0.029817438],"genre_scores_gemma":[0.7575998,0.0021185493,0.18838792,0.0012148529,0.00060686946,0.00075950474,0.00059576926,0.00065083563,0.048065886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848396,0.0007318364,0.00005906767,0.0002736666,0.0003102741,0.00014119444],"domain_scores_gemma":[0.99087393,0.007001842,0.000592192,0.00036975907,0.0006649662,0.00049730286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004796858,0.0015522846,0.0027104616,0.0020194752,0.001303425,0.0027716905,0.0023715578,0.002723555,0.0065529435],"category_scores_gemma":[0.023228247,0.0010770813,0.0013112762,0.0015064339,0.003675139,0.0040814765,0.004619878,0.0051353853,0.00050620415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016058027,0.00011289757,0.00040521345,0.000443263,0.000087569475,0.0001516629,0.00022323147,0.22245601,0.0016675475,0.753838,0.005736007,0.014718137],"study_design_scores_gemma":[0.000030507912,0.00006282778,0.0002043864,0.000045435336,0.000014913585,0.00003551659,0.00005261973,0.5831021,0.00039204443,0.41457164,0.0014716635,0.00001633477],"about_ca_topic_score_codex":0.0032510804,"about_ca_topic_score_gemma":0.004530943,"teacher_disagreement_score":0.0065529435,"about_ca_system_score_codex":0.0033042324,"about_ca_system_score_gemma":0.0022372217,"threshold_uncertainty_score":0.025368512},"labels":[],"label_agreement":null}]}