{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085416496,0.0001225408,0.9112754,0.002449055,0.000089741276,0.00008910139,0.000023414426,0.0000895092,0.00044475024],"genre_scores_gemma":[0.9523749,0.0000383681,0.046519123,0.00047558986,0.00009755742,0.00000807528,0.00014619195,0.0000057912735,0.00033443116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981987,0.00017621416,0.00033540843,0.00054498436,0.0005373553,0.00020732947],"domain_scores_gemma":[0.9987803,0.00009281419,0.0001700777,0.0002869219,0.00038552046,0.0002843613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220152,0.00018469726,0.00036620582,0.0004148197,0.0002497796,0.0003300648,0.00025233155,0.000091318405,0.00007123709],"category_scores_gemma":[0.000111874666,0.00016446112,0.00014025539,0.0013632644,0.000045827182,0.00048044295,0.0002484603,0.00010014765,0.000016256301],"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.000047290174,0.00019372116,0.070306286,0.000011795284,0.0023106388,0.000007851149,0.0013970986,0.018088948,0.00010486914,0.9053894,0.00046575378,0.0016763333],"study_design_scores_gemma":[0.00041734744,0.000025359926,0.16757505,0.0000015893044,0.0005774633,0.0000054819343,0.000031426458,0.812325,0.00003100932,0.018688306,0.00013342834,0.0001885327],"about_ca_topic_score_codex":0.00034990284,"about_ca_topic_score_gemma":0.00007419644,"teacher_disagreement_score":0.8867011,"about_ca_system_score_codex":0.000052555824,"about_ca_system_score_gemma":0.00010161553,"threshold_uncertainty_score":0.670653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979976,0.00015379388,0.011685875,0.0028690386,0.00012198629,0.00011730041,0.00030144386,0.000009049652,0.004765536],"genre_scores_gemma":[0.99861914,0.00015750916,0.00027248645,0.00039802765,0.000065571425,0.0000174279,0.00007049035,0.000006074975,0.00039328274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991974,0.000029908768,0.00033062807,0.00025083698,0.00004077034,0.00015041417],"domain_scores_gemma":[0.99929255,0.00027339475,0.00016866003,0.00020996209,0.00002218705,0.000033270222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012640835,0.0001057564,0.00022478374,0.00014401361,0.000319068,0.00017553743,0.00013809989,0.00007731269,0.000031514504],"category_scores_gemma":[0.000077808945,0.00007673152,0.00008266936,0.00018309818,0.00009308422,0.00012426477,0.000032907206,0.00019080217,0.000009380139],"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.000011947709,0.000016794838,0.023706611,0.0000024433523,0.0001226889,1.2844761e-7,0.0004969286,0.006971312,0.0000015632913,0.96841127,0.000019949754,0.00023834105],"study_design_scores_gemma":[0.00015513097,0.000009975741,0.053317983,9.095912e-7,0.00004022891,5.990857e-7,0.00019228495,0.64132875,3.3866135e-7,0.30473226,0.00014979405,0.00007173233],"about_ca_topic_score_codex":0.00039722538,"about_ca_topic_score_gemma":0.0018033427,"teacher_disagreement_score":0.663679,"about_ca_system_score_codex":0.000049317012,"about_ca_system_score_gemma":0.000013290597,"threshold_uncertainty_score":0.31290206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014563947,0.00003347392,0.9828766,0.0010929238,0.00010717018,0.00049062,0.0005849175,0.00007057558,0.00017974475],"genre_scores_gemma":[0.32840168,0.000012764501,0.6661454,0.00020088987,0.00020526774,0.00023567476,0.0029471363,0.000039806822,0.0018113692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731874,0.00015205325,0.0008051043,0.00063075795,0.0007113775,0.00038195172],"domain_scores_gemma":[0.9965117,0.0017525435,0.00029746784,0.0003445058,0.0008807082,0.00021310331],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010627873,0.0002745397,0.00076103804,0.0016541214,0.00035856015,0.00011085272,0.00020090191,0.00019382028,0.0011785747],"category_scores_gemma":[0.000919677,0.000266059,0.00041072597,0.0044196574,0.00014274566,0.00028294715,0.00007017647,0.00038135127,0.000020626849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012660759,0.00069516076,0.02370096,0.000083571635,0.009850939,0.000006750493,0.00094933715,0.76249653,0.000095466195,0.19952224,0.00043836792,0.0020340425],"study_design_scores_gemma":[0.0011720095,0.000033184413,0.012062875,0.000003900617,0.0026258028,0.0000021918452,0.00017009846,0.91395116,0.000008775717,0.06947111,0.00022867022,0.00027022377],"about_ca_topic_score_codex":0.00008171015,"about_ca_topic_score_gemma":0.00049412105,"teacher_disagreement_score":0.31673124,"about_ca_system_score_codex":0.00007114347,"about_ca_system_score_gemma":0.00018315346,"threshold_uncertainty_score":0.99997914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031889245,0.000016259248,0.96616757,0.0006943714,0.000008300205,0.000367102,0.000095937285,0.000044546723,0.00071666186],"genre_scores_gemma":[0.60665745,0.0000050030885,0.39288145,0.0000645,0.000022000586,0.00000879812,0.00023971013,0.000006022556,0.00011504417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858576,0.00009832164,0.00036627878,0.00023416046,0.00053609913,0.00017936512],"domain_scores_gemma":[0.99899125,0.00017673758,0.00019986328,0.00018086594,0.000361097,0.00009017875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031336895,0.00012705094,0.00034808877,0.00022072373,0.00012930277,0.00002854348,0.00009657005,0.000044108852,0.00039353134],"category_scores_gemma":[0.00012622507,0.000100514444,0.00008341319,0.001022352,0.00013790217,0.000109087334,0.000022522818,0.00010830818,0.0000021176036],"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.00026105114,0.0016074266,0.025579834,0.0001509674,0.004868406,0.0000131323,0.0023711647,0.028869757,0.0002010893,0.9200454,0.00014291544,0.015888855],"study_design_scores_gemma":[0.0013537162,0.00030406276,0.014128766,0.000027736723,0.001021673,0.0000055037544,0.00045911068,0.90687984,0.00005185831,0.07548262,0.000059673795,0.00022542581],"about_ca_topic_score_codex":0.00003425467,"about_ca_topic_score_gemma":0.000072575815,"teacher_disagreement_score":0.8780101,"about_ca_system_score_codex":0.000035287205,"about_ca_system_score_gemma":0.00007694517,"threshold_uncertainty_score":0.43088922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52196956,0.00011955788,0.4751267,0.00068289123,0.00013178357,0.00039839768,0.00007993059,0.000044422006,0.001446737],"genre_scores_gemma":[0.9920103,0.00000906303,0.0071519515,0.000062036284,0.00006785553,0.000008778831,0.000046993468,0.00000452197,0.00063848204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887395,0.00014432824,0.00037701445,0.00018030936,0.00031611332,0.000108257416],"domain_scores_gemma":[0.9992125,0.0001518296,0.00025885494,0.0001817751,0.00015445106,0.000040603878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026591442,0.00010491935,0.00029197987,0.0002220959,0.00016372112,0.000027464866,0.00008661243,0.00006953309,0.0000662],"category_scores_gemma":[0.0002456096,0.00006763495,0.00020955154,0.0013913366,0.000025158333,0.00007655165,0.000019309828,0.00006413037,0.0000011317852],"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.000024982008,0.0001363199,0.0038819287,0.000019114987,0.00052794314,1.1658077e-7,0.00019537278,0.00090597343,0.0010007377,0.99161875,0.00004962731,0.0016391507],"study_design_scores_gemma":[0.0006816299,0.000052169864,0.15716043,0.000019069734,0.0015880135,0.0000016736169,0.00008412555,0.40165067,0.00008826512,0.438408,0.00009641307,0.00016957529],"about_ca_topic_score_codex":0.00023360783,"about_ca_topic_score_gemma":0.00013780371,"teacher_disagreement_score":0.55321074,"about_ca_system_score_codex":0.000036800484,"about_ca_system_score_gemma":0.000025989106,"threshold_uncertainty_score":0.27580732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014920282,0.000038618004,0.9928398,0.004416832,0.000036035173,0.00034374252,0.00012424396,0.00009215874,0.000616555],"genre_scores_gemma":[0.7355213,0.000008393476,0.26284766,0.0008170232,0.000071490555,0.000052317053,0.000278334,0.0000075060334,0.00039596405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802774,0.00009927558,0.00043807554,0.00062145013,0.0005012275,0.0003122528],"domain_scores_gemma":[0.9985433,0.00018189511,0.00027825483,0.00030742868,0.0005079286,0.00018119832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700711,0.00023912448,0.00044766045,0.00047359196,0.00036620154,0.00030413747,0.00033843087,0.000088062705,0.00012788035],"category_scores_gemma":[0.00007290704,0.00019004307,0.00024435215,0.0016524357,0.00006354869,0.00045719778,0.00003603053,0.000091322916,0.000008224448],"study_design_candidate":"simulation_or_modeling","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.00006622252,0.00019600218,0.0025032097,0.000009379315,0.0019549825,0.0000015933116,0.00026195307,0.31017232,0.00006830871,0.68225515,0.00013301737,0.0023778568],"study_design_scores_gemma":[0.00181559,0.00016845936,0.03385872,0.000007629719,0.0010121244,0.0000064939486,0.000024904575,0.9532218,0.0000100604475,0.008899468,0.00069152215,0.0002832207],"about_ca_topic_score_codex":0.000020531115,"about_ca_topic_score_gemma":0.00002293131,"teacher_disagreement_score":0.7340293,"about_ca_system_score_codex":0.000045735433,"about_ca_system_score_gemma":0.0001704891,"threshold_uncertainty_score":0.77497315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015121907,0.00009553041,0.9939937,0.0034208177,0.000018769551,0.0002633742,0.000016171456,0.00003429202,0.0006451409],"genre_scores_gemma":[0.5849034,0.0000916184,0.41368812,0.0004091943,0.000080211015,0.00024623194,0.000090498754,0.000005552672,0.00048512156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986121,0.00024127601,0.00041159583,0.00029981407,0.00032110035,0.00011411812],"domain_scores_gemma":[0.99835664,0.00056331436,0.0003034632,0.0002400946,0.00047735852,0.000059135415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052890356,0.000109650515,0.00026040798,0.00039398792,0.00034748175,0.0001938145,0.00024923548,0.00004439166,0.00010237837],"category_scores_gemma":[0.00012673519,0.00007532786,0.00012430527,0.0023132581,0.00007563286,0.0004211674,0.00012622788,0.00007795506,0.000005606644],"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.000007082142,0.000044324373,0.0059897057,0.000008991067,0.0011865424,8.443744e-8,0.0005623116,0.021480119,0.00007645735,0.967068,0.000044764434,0.0035315799],"study_design_scores_gemma":[0.00047937364,0.00000834501,0.05867196,0.0000021420615,0.00048693307,0.000003359757,0.00007295345,0.9198974,0.0000151195745,0.02017957,0.00009530824,0.00008757144],"about_ca_topic_score_codex":0.0012437138,"about_ca_topic_score_gemma":0.000021939508,"teacher_disagreement_score":0.94688845,"about_ca_system_score_codex":0.000012485707,"about_ca_system_score_gemma":0.000050073522,"threshold_uncertainty_score":0.3071781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037843734,0.000011506136,0.96006787,0.0013662311,0.00014915974,0.000101130536,0.000082392304,0.000040942134,0.00033704189],"genre_scores_gemma":[0.9098931,0.0000061693677,0.08947879,0.0002017321,0.000113189555,0.000011942193,0.00012931827,0.000006397959,0.000159392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998073,0.00011253316,0.0004972002,0.00044721624,0.0006694045,0.00020064769],"domain_scores_gemma":[0.9983957,0.00019166962,0.00030599308,0.00038407583,0.00055282714,0.00016978156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039965435,0.00018792141,0.00047552466,0.00060952787,0.00032727455,0.00012617654,0.00048440913,0.00012618076,0.0006372983],"category_scores_gemma":[0.00012902803,0.00016159339,0.00034184856,0.0016634008,0.00006735256,0.00034973843,0.00019234714,0.00019244257,0.000013642363],"study_design_candidate":"simulation_or_modeling","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.00006261838,0.0005166856,0.050507557,0.000017905983,0.0060399994,0.0000034064096,0.0014066574,0.21188192,0.018317387,0.7094956,0.00016601276,0.0015842628],"study_design_scores_gemma":[0.0007013447,0.000021988417,0.12302775,0.000002663034,0.00091508095,0.0000015769151,0.000011311754,0.8740381,0.000081506754,0.0009857609,0.00004881059,0.00016407389],"about_ca_topic_score_codex":0.0001322988,"about_ca_topic_score_gemma":0.000057272762,"teacher_disagreement_score":0.87204933,"about_ca_system_score_codex":0.00001657745,"about_ca_system_score_gemma":0.00011640692,"threshold_uncertainty_score":0.69779694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8840524,0.0025321355,0.094336934,0.0042022923,0.00043980137,0.0010873156,0.00018244101,0.0006074745,0.012559202],"genre_scores_gemma":[0.9893996,0.000059118065,0.0096806,0.00016617215,0.00014969888,0.00001908645,0.000022269582,0.000015537005,0.00048791748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798846,0.00036024977,0.00034914797,0.00039352354,0.0006475945,0.0002610091],"domain_scores_gemma":[0.99723876,0.0018892344,0.0001820821,0.0003540157,0.00021088739,0.00012501447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016556031,0.00023425563,0.00037528097,0.00041020373,0.00072043954,0.00017730777,0.00019312314,0.000101735095,0.000087024666],"category_scores_gemma":[0.0012115012,0.00015700847,0.00017221303,0.0011555091,0.00005211115,0.00008793939,0.00006896932,0.00015272338,0.000016317601],"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.00021707737,0.0009344369,0.052339107,0.0001555357,0.010789737,0.0000044757503,0.002560136,0.0043,0.00027917093,0.91323656,0.002999705,0.012184064],"study_design_scores_gemma":[0.0009790944,0.00014843959,0.32555524,0.000015379292,0.0029745128,0.000004344573,0.00019021174,0.5568943,0.00006581829,0.10903045,0.0037144346,0.00042780724],"about_ca_topic_score_codex":0.00014175699,"about_ca_topic_score_gemma":0.00013243378,"teacher_disagreement_score":0.80420613,"about_ca_system_score_codex":0.00002747391,"about_ca_system_score_gemma":0.000021332082,"threshold_uncertainty_score":0.64026195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0874484,0.00021566778,0.9097159,0.0015311603,0.0000581932,0.00014638406,0.00005990237,0.00007519651,0.00074921513],"genre_scores_gemma":[0.89300394,0.00018673427,0.10514503,0.0010529745,0.000043167962,0.00001936101,0.00007050265,0.000007499956,0.00047077565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981659,0.00017158536,0.0003988314,0.0006620529,0.00039460108,0.00020701521],"domain_scores_gemma":[0.9988082,0.00014527711,0.00019429658,0.00027545702,0.0003716066,0.00020517014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060897064,0.0002121489,0.00036474003,0.00050725654,0.00034894168,0.00027594727,0.00024545784,0.00009401995,0.00023495089],"category_scores_gemma":[0.00011997768,0.00019110058,0.0000984983,0.0015943422,0.00009187498,0.00078646874,0.00024688238,0.00010686571,0.000012215571],"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.000084273044,0.00019282657,0.08419247,0.000029671453,0.0024705215,0.000015541049,0.009564553,0.0018750149,0.000272323,0.8987916,0.00015383723,0.0023573681],"study_design_scores_gemma":[0.00036169525,0.00004016254,0.31270966,0.0000063900857,0.000462024,0.000008999268,0.00011749274,0.67766654,0.000027321108,0.008240182,0.0001119677,0.0002475735],"about_ca_topic_score_codex":0.0006240391,"about_ca_topic_score_gemma":0.000051862455,"teacher_disagreement_score":0.89055145,"about_ca_system_score_codex":0.000024203917,"about_ca_system_score_gemma":0.000077185,"threshold_uncertainty_score":0.77928555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8950544,0.0000610671,0.102821104,0.00021952714,0.00007227897,0.00016853317,0.000085181346,0.0000387607,0.00147913],"genre_scores_gemma":[0.9244231,0.000024292664,0.075172536,0.000069511305,0.0001147188,0.000014971587,0.000055334145,0.000012368916,0.000113187845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986472,0.00016783013,0.0003458009,0.00025414166,0.0003470392,0.0002379479],"domain_scores_gemma":[0.99889356,0.00035493227,0.00027087,0.00022520786,0.00014242996,0.00011302882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985233,0.00019008681,0.00046460127,0.00032139017,0.00012706044,0.000018569588,0.000094105264,0.00012001677,0.0002781599],"category_scores_gemma":[0.00029189707,0.00014977854,0.00016280577,0.0006639993,0.00014455094,0.00020360711,0.000050820825,0.00013947322,0.000012366216],"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.00012976593,0.00024239016,0.025941748,0.000028511127,0.0009976615,0.0000018643423,0.0010189884,0.0009874124,0.0013467713,0.9686484,0.00004391989,0.0006125846],"study_design_scores_gemma":[0.0023830535,0.00055017247,0.24969463,0.00007714163,0.006345868,0.000030865707,0.00398549,0.037531726,0.00542798,0.6925736,0.00023652407,0.0011629625],"about_ca_topic_score_codex":0.000024052102,"about_ca_topic_score_gemma":0.000007908977,"teacher_disagreement_score":0.2760748,"about_ca_system_score_codex":0.000051535135,"about_ca_system_score_gemma":0.000026188949,"threshold_uncertainty_score":0.61077917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615722,0.000050279472,0.32835773,0.009382484,0.00004521619,0.000309939,0.0001344125,0.000026276784,0.000121428704],"genre_scores_gemma":[0.97889453,0.000019168987,0.019308643,0.0016170044,0.00004915623,0.000012199241,0.00003765494,0.000004846463,0.0000568004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998104,0.00031311275,0.00047112213,0.00041164595,0.0005333465,0.00016682522],"domain_scores_gemma":[0.99861294,0.00012512611,0.00022045484,0.00044528412,0.00046984863,0.00012635055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079612574,0.00018053285,0.00035436673,0.0002787528,0.00029683163,0.000117236305,0.0004473227,0.000077417935,0.00006778758],"category_scores_gemma":[0.00014164555,0.00011313999,0.00015783306,0.0018403835,0.00006599176,0.0003560198,0.00010280523,0.000119597935,0.0000025428865],"study_design_candidate":"simulation_or_modeling","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.00016080176,0.0005126421,0.018226571,0.0000086340815,0.0008787373,9.874452e-7,0.0015237464,0.27415958,0.0035658455,0.69976336,0.000060894803,0.001138232],"study_design_scores_gemma":[0.00028634164,0.00016337342,0.22006409,0.0000090108715,0.0002845199,0.0000010061755,0.00004110874,0.7769478,0.0010072791,0.001038356,0.00003151986,0.00012562324],"about_ca_topic_score_codex":0.000280787,"about_ca_topic_score_gemma":0.00004861848,"teacher_disagreement_score":0.698725,"about_ca_system_score_codex":0.000028076207,"about_ca_system_score_gemma":0.0001111563,"threshold_uncertainty_score":0.46137148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043336567,0.000109013905,0.99187,0.0026932342,0.000035305293,0.00015905985,0.000011990161,0.000031527343,0.00075624423],"genre_scores_gemma":[0.72534007,0.00008507958,0.27321172,0.0004958594,0.00006899524,0.000057955167,0.000052804,0.000005428963,0.0006821043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834317,0.0005085691,0.0003996228,0.00028751607,0.0003409288,0.00012021484],"domain_scores_gemma":[0.99808794,0.00092161633,0.00029674533,0.00021496667,0.00042351245,0.000055198616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032877,0.00011529633,0.00028030726,0.0004015681,0.00030003887,0.00019565538,0.00024048066,0.000045875204,0.00017315429],"category_scores_gemma":[0.00031010082,0.00007500362,0.00013772598,0.0018739993,0.00008264329,0.00046760062,0.00013636022,0.00008271798,0.0000043018526],"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.000013736988,0.00002759604,0.003399885,0.000005732394,0.0012216575,1.5451447e-7,0.0008181248,0.015221953,0.0000515343,0.9768947,0.000031905696,0.0023130658],"study_design_scores_gemma":[0.00054848584,0.000011307618,0.05897048,0.00000301996,0.00053488434,0.0000037439654,0.000112612,0.8864787,0.000018282712,0.053205322,0.000025467782,0.00008769928],"about_ca_topic_score_codex":0.00096427446,"about_ca_topic_score_gemma":0.00001549972,"teacher_disagreement_score":0.9236893,"about_ca_system_score_codex":0.000011435699,"about_ca_system_score_gemma":0.000048994407,"threshold_uncertainty_score":0.30585587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073005766,0.0000114355025,0.92590576,0.0004099842,0.000018295463,0.00015355219,0.00010154412,0.000033844786,0.000359808],"genre_scores_gemma":[0.8661506,0.000006971979,0.13266575,0.000024768473,0.000044864104,0.000008284064,0.00006377477,0.000014725211,0.0010202429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868184,0.0000965791,0.00031980954,0.00025906804,0.00046163416,0.0001810935],"domain_scores_gemma":[0.9985776,0.00047688265,0.00021922072,0.00018103671,0.00045667222,0.0000885958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036877958,0.00012015459,0.00029867695,0.00034976634,0.00013646037,0.00001919468,0.0000870454,0.00004585605,0.0003958217],"category_scores_gemma":[0.00037395058,0.00007543944,0.000079938,0.0010084329,0.0000953223,0.00016141946,0.00005122465,0.00006662599,0.0000075354824],"study_design_candidate":"simulation_or_modeling","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.0007687297,0.0013520928,0.4218049,0.0002864735,0.013274384,0.000014650109,0.0024673624,0.022243736,0.0015265114,0.524666,0.0008577983,0.010737327],"study_design_scores_gemma":[0.00388961,0.00028357547,0.113736495,0.000113697904,0.0017981232,0.000012969238,0.00032695732,0.8302359,0.0003378157,0.04861663,0.00014842358,0.0004998153],"about_ca_topic_score_codex":0.000018700823,"about_ca_topic_score_gemma":0.000020493962,"teacher_disagreement_score":0.80799216,"about_ca_system_score_codex":0.00004443591,"about_ca_system_score_gemma":0.00006173089,"threshold_uncertainty_score":0.433397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022116538,0.00009755457,0.9713371,0.005402929,0.00011512296,0.00014342932,0.00006666565,0.00008084283,0.0006398495],"genre_scores_gemma":[0.9711706,0.00012771868,0.026886096,0.00050113077,0.0000947389,0.000020944692,0.00020015916,0.00000728601,0.0009913357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99847376,0.00018332558,0.0003035975,0.0005194387,0.0003374907,0.00018236444],"domain_scores_gemma":[0.9985065,0.00016463094,0.0003171831,0.0005842076,0.00027786277,0.00014962011],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00077430933,0.00016791715,0.00028471943,0.00043870686,0.0013820543,0.00084984186,0.00040643875,0.0000673435,0.00012842692],"category_scores_gemma":[0.00036923512,0.0001417712,0.00013604984,0.00061949994,0.000082642386,0.0008264251,0.00026636972,0.00008040104,0.000011689456],"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.000008216679,0.00005283204,0.023884092,0.0000042923302,0.00074312027,0.0000016901653,0.00051821285,0.0005865344,0.00008255192,0.972867,0.0000461125,0.0012053153],"study_design_scores_gemma":[0.00021467399,0.000013285833,0.4991601,0.0000046728696,0.00049527147,0.000002991693,0.00001956849,0.48312142,0.000008139312,0.016441463,0.00035840517,0.00016000497],"about_ca_topic_score_codex":0.000119828605,"about_ca_topic_score_gemma":0.000029361148,"teacher_disagreement_score":0.95642555,"about_ca_system_score_codex":0.000022384571,"about_ca_system_score_gemma":0.000063386404,"threshold_uncertainty_score":0.999918},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9400487,0.000395864,0.057931308,0.0001289803,0.00019846437,0.00018975996,0.0000773606,0.0000978135,0.0009317277],"genre_scores_gemma":[0.99186385,0.0001260864,0.0077235927,0.000044882272,0.000073081515,0.000017617258,0.00011760691,0.000019923984,0.000013353579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982991,0.0001671866,0.00062137557,0.00039005073,0.000314543,0.00020771565],"domain_scores_gemma":[0.9987124,0.00043719084,0.00026645226,0.00037162958,0.00016768093,0.000044601387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063432637,0.00026103004,0.00061732193,0.00037678043,0.00007405038,0.0000859621,0.00019519756,0.00018330339,0.00022414932],"category_scores_gemma":[0.00019085393,0.0002258476,0.00028942773,0.00058744877,0.00005150922,0.000060895123,0.00018292681,0.00048912416,0.0000014171662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001634795,0.00003159077,0.012326822,0.00011267069,0.002744756,0.000011169096,0.0008755894,0.9630572,0.0020607214,0.017202668,0.000119475626,0.0014409873],"study_design_scores_gemma":[0.00011442,0.000011465775,0.008540746,0.00041837382,0.00063855,0.0000023356645,0.0004718735,0.9717482,0.0045901723,0.013178959,0.0000060812126,0.00027882893],"about_ca_topic_score_codex":0.00029286352,"about_ca_topic_score_gemma":0.00006311658,"teacher_disagreement_score":0.051815134,"about_ca_system_score_codex":0.00006607305,"about_ca_system_score_gemma":0.00006903999,"threshold_uncertainty_score":0.9209798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7759997,0.000032881144,0.22314283,0.00022198296,0.00012344054,0.000120966724,0.000092304945,0.000006366352,0.00025947127],"genre_scores_gemma":[0.9941654,0.000008184026,0.0052448628,0.000033749642,0.000067472836,0.0000040270875,0.000079615354,0.0000047800713,0.00039186142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976948,0.00032731882,0.00083988067,0.00029214687,0.0007280077,0.00011786691],"domain_scores_gemma":[0.9980737,0.00040933522,0.0005460565,0.00025188734,0.00066478556,0.000054247048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162245,0.00011467197,0.00037752299,0.0005969274,0.00018297049,0.000049148708,0.00017034497,0.000079391495,0.00060452556],"category_scores_gemma":[0.00047373437,0.00007658062,0.00019004024,0.003023329,0.00019177934,0.00019074572,0.00006790965,0.00007822739,0.000026409638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029774898,0.00043746622,0.2720245,0.00001137738,0.0009888365,0.0000073861174,0.004002972,0.70715004,0.0006549712,0.007366475,0.00075002614,0.006308158],"study_design_scores_gemma":[0.00036490377,0.000049276365,0.15369265,0.0000068587456,0.00038867505,0.000005400924,0.0001908617,0.84217906,0.00007566496,0.0029505442,0.000023593158,0.000072501476],"about_ca_topic_score_codex":0.0002335161,"about_ca_topic_score_gemma":0.00016388888,"teacher_disagreement_score":0.2181657,"about_ca_system_score_codex":0.000015828904,"about_ca_system_score_gemma":0.000089620095,"threshold_uncertainty_score":0.6619131},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007640519,0.00005806144,0.99223137,0.0040867617,0.00011831599,0.0007726715,0.00064779306,0.00015865697,0.001162309],"genre_scores_gemma":[0.27497754,0.00001390336,0.7139883,0.00053801393,0.000251114,0.00021393785,0.007902237,0.000030337245,0.0020846121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966732,0.0001566173,0.0007618765,0.001206605,0.0008208211,0.0003808565],"domain_scores_gemma":[0.99719507,0.0003795064,0.00061208697,0.0007717768,0.00072274654,0.00031880045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006837631,0.00045681986,0.00093082327,0.0005905632,0.00023354848,0.0008785038,0.00077450124,0.0003095193,0.0007465668],"category_scores_gemma":[0.00009981715,0.00038430275,0.00058594113,0.001418732,0.00011512402,0.00048416966,0.00055494485,0.00030623036,0.000034431305],"study_design_candidate":"simulation_or_modeling","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.000032718457,0.00020432656,0.002741152,0.00015739194,0.0057102097,0.0000021923433,0.00034263486,0.24386524,0.000008001147,0.74556184,0.0006188382,0.0007554806],"study_design_scores_gemma":[0.0007145864,0.00006164526,0.0059162886,0.00005309049,0.0028413227,0.000006090369,0.000028289849,0.90029675,0.0000042195716,0.08949441,0.00010962586,0.0004736768],"about_ca_topic_score_codex":0.0001110652,"about_ca_topic_score_gemma":0.000017591352,"teacher_disagreement_score":0.65643156,"about_ca_system_score_codex":0.00008458614,"about_ca_system_score_gemma":0.0008381266,"threshold_uncertainty_score":0.9998609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013833881,0.0002877874,0.9835569,0.0017248956,0.00002766284,0.00005559901,0.00007847608,0.000013747319,0.00042104063],"genre_scores_gemma":[0.8508929,0.00012799387,0.14811587,0.00013011957,0.000016705484,0.0000072729654,0.00022763855,0.0000034721538,0.0004780235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986133,0.000095538424,0.0004513552,0.0003033318,0.0004358146,0.000100645695],"domain_scores_gemma":[0.99875027,0.0001643092,0.00028724337,0.00022890075,0.0005028412,0.00006644811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035505395,0.000101845915,0.00031930834,0.0005490764,0.00012634222,0.00007189563,0.00014599509,0.000045089295,0.00013287425],"category_scores_gemma":[0.00016206893,0.00009500483,0.00013821965,0.0030653835,0.00004817024,0.00029459683,0.00016127678,0.000043525128,0.0000011401667],"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.00000881822,0.00017614361,0.036130533,0.00005339241,0.0019844098,7.337378e-7,0.0010680826,0.013659561,0.0005674234,0.9457451,0.00006531958,0.0005404589],"study_design_scores_gemma":[0.00040234375,0.000023231325,0.15298678,0.000013589628,0.0007636329,0.00000171622,0.0001585875,0.83371884,0.00048021585,0.011179112,0.00014200843,0.00012992651],"about_ca_topic_score_codex":0.000071094284,"about_ca_topic_score_gemma":0.00001618709,"teacher_disagreement_score":0.934566,"about_ca_system_score_codex":0.00001551043,"about_ca_system_score_gemma":0.000082409075,"threshold_uncertainty_score":0.38741842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011985415,0.0003411489,0.9973314,0.00036007861,0.00007856617,0.00015943861,0.00017062707,0.000098316894,0.00026189035],"genre_scores_gemma":[0.3723753,0.00025003174,0.6260099,0.00013775182,0.000120061384,0.00005094321,0.0009090557,0.00002466013,0.00012229527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873227,0.00011071391,0.0003837444,0.0003687383,0.00024372117,0.00016083602],"domain_scores_gemma":[0.9981482,0.00040131155,0.00014812752,0.00022974021,0.0010119394,0.000060675535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422455,0.00018738162,0.00049691973,0.0005227566,0.00014159523,0.000037921007,0.0000928195,0.000115604016,0.00030799452],"category_scores_gemma":[0.00021813282,0.00018661599,0.0002938781,0.002233655,0.000038598202,0.00013826835,0.000029941379,0.00009543377,0.0000012444593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017872344,0.000056051253,0.0008100235,0.000019016481,0.006076983,4.2711903e-7,0.00032326995,0.93862855,0.0005417561,0.053360987,0.00005415801,0.000110909445],"study_design_scores_gemma":[0.0002410887,0.000032325726,0.0043751555,0.000014296288,0.0038251553,7.249313e-7,0.000081321086,0.9821864,0.0016551692,0.0071844845,0.00020051573,0.00020341574],"about_ca_topic_score_codex":0.000121050354,"about_ca_topic_score_gemma":0.000039045113,"teacher_disagreement_score":0.3713215,"about_ca_system_score_codex":0.0000802992,"about_ca_system_score_gemma":0.00006992154,"threshold_uncertainty_score":0.7609979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024120705,0.000047626,0.9857342,0.0065259705,0.00009448854,0.000058312125,0.000023478786,0.00006998894,0.0050338274],"genre_scores_gemma":[0.9123278,0.000035280777,0.084252134,0.00049183244,0.00010188222,0.000009910956,0.00007784409,0.00000511678,0.0026981628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986521,0.00006827807,0.00025332687,0.0004431797,0.00041460377,0.00016852684],"domain_scores_gemma":[0.9985963,0.00006976526,0.00028213212,0.0006992621,0.00022786346,0.00012468577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041817952,0.00013530995,0.00024680953,0.00030095835,0.0010223837,0.0008354694,0.0007179915,0.000062343206,0.00026535953],"category_scores_gemma":[0.00016736964,0.00011866151,0.00019168507,0.0005798661,0.00004457064,0.0008762715,0.00026122262,0.00007400694,0.00005003643],"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.0000043062423,0.00004665817,0.023689456,0.0000035078644,0.0012567402,0.0000018762621,0.00024620275,0.013527792,0.000027700195,0.9593303,0.00024470637,0.0016207288],"study_design_scores_gemma":[0.00020098526,0.000007876693,0.2606359,0.0000016980097,0.000366025,0.0000010663866,0.00000661982,0.7256468,0.00000957732,0.012319442,0.00067223504,0.00013178408],"about_ca_topic_score_codex":0.00018796795,"about_ca_topic_score_gemma":0.000042168693,"teacher_disagreement_score":0.9470109,"about_ca_system_score_codex":0.000023689536,"about_ca_system_score_gemma":0.0000579307,"threshold_uncertainty_score":0.8056451},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940478,0.000003120712,0.0030758362,0.0019147315,0.00002385525,0.00026559562,0.00014123665,0.000018784382,0.0005090217],"genre_scores_gemma":[0.9799358,0.0000122406445,0.018998422,0.0002217555,0.0000293809,0.000043646538,0.00007704296,0.000015423355,0.00066626485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982435,0.0002755857,0.00045924957,0.0002088141,0.00062801753,0.00018483229],"domain_scores_gemma":[0.9984193,0.0007850828,0.00021718016,0.00028096797,0.00024350766,0.00005396241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452789,0.00011128027,0.0002895681,0.0003072039,0.00013501011,0.000018419098,0.00020651624,0.00005063616,0.00043175544],"category_scores_gemma":[0.0016854573,0.00007013156,0.00015681452,0.0029802464,0.00004984373,0.00004615877,0.0001646508,0.00013730656,0.000010113009],"study_design_candidate":"simulation_or_modeling","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.00032227187,0.00067098317,0.22629528,0.0001054029,0.0018041795,0.0000071887416,0.009769751,0.20858617,0.00048504272,0.5481513,0.00060084515,0.0032015394],"study_design_scores_gemma":[0.0006854352,0.000030268182,0.33339915,0.00003007949,0.00029724956,0.0000013552267,0.00047960776,0.6018051,0.0001896845,0.06291559,0.000040253904,0.00012623012],"about_ca_topic_score_codex":0.00020991801,"about_ca_topic_score_gemma":0.00009650079,"teacher_disagreement_score":0.48523575,"about_ca_system_score_codex":0.00004484261,"about_ca_system_score_gemma":0.000056890614,"threshold_uncertainty_score":0.47274193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001355741,0.000052184187,0.9945249,0.0025826013,0.00015133613,0.00031644542,0.00045514922,0.00016872147,0.00039291172],"genre_scores_gemma":[0.9547197,0.00005648355,0.041922614,0.00027899127,0.0001186647,0.00012973325,0.0018084316,0.000011278693,0.0009540898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978511,0.0002169734,0.0005157129,0.00063168415,0.00053506804,0.00024948403],"domain_scores_gemma":[0.9977391,0.00074782287,0.0003161575,0.00029165548,0.0007664212,0.00013887996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853268,0.00018862372,0.00036645436,0.0006784022,0.00045262487,0.00024477812,0.00028623117,0.00010180985,0.00003489067],"category_scores_gemma":[0.0003192112,0.000169564,0.00023814115,0.0032827384,0.00006728192,0.00043108934,0.00008764363,0.00008713309,0.00004422408],"study_design_candidate":"simulation_or_modeling","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.000018700446,0.00003898919,0.0013356932,0.000010298985,0.0012981265,0.0000016191309,0.00061562407,0.10254761,0.00009598416,0.8935953,0.00017805595,0.00026399514],"study_design_scores_gemma":[0.00042933703,0.00003473271,0.017315388,0.000009532651,0.00063894945,0.0000029256191,0.00033031887,0.9714462,0.00001729272,0.009423914,0.00013094796,0.00022044261],"about_ca_topic_score_codex":0.00013944264,"about_ca_topic_score_gemma":0.000018802864,"teacher_disagreement_score":0.95336396,"about_ca_system_score_codex":0.000076900964,"about_ca_system_score_gemma":0.00015742506,"threshold_uncertainty_score":0.6914619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8597524,0.0018728696,0.12531663,0.008814105,0.00033709806,0.0006866311,0.0004963638,0.00044179417,0.0022820742],"genre_scores_gemma":[0.992901,0.00064683706,0.0016973915,0.00012574534,0.00016624806,0.000029702042,0.00028036235,0.000012561779,0.004140147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990564,0.00007521528,0.00026358545,0.00018004804,0.00027792738,0.00014679694],"domain_scores_gemma":[0.99887687,0.0005855855,0.00013027342,0.00010548763,0.00026284135,0.000038930168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093025615,0.000094202085,0.00017513167,0.00034293978,0.0005036974,0.00013386497,0.00005249281,0.000054698026,0.00003905333],"category_scores_gemma":[0.00093899143,0.00006537616,0.000060002498,0.0023691873,0.00004325226,0.00012181991,0.00004286364,0.000060998744,0.000008214228],"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.000029475956,0.000028566608,0.010931866,0.00009502048,0.0015438277,0.0000013719251,0.0014913594,0.000121501,0.00006616629,0.9813051,0.0016572166,0.00272849],"study_design_scores_gemma":[0.00078430667,0.00008203618,0.067861475,0.000021173611,0.0022219014,0.000009483003,0.0024447232,0.30922827,0.00007874284,0.61227006,0.004635379,0.00036246923],"about_ca_topic_score_codex":0.00013644286,"about_ca_topic_score_gemma":0.000048112517,"teacher_disagreement_score":0.3690351,"about_ca_system_score_codex":0.000015725123,"about_ca_system_score_gemma":0.000035027384,"threshold_uncertainty_score":0.3874084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004181786,0.00011906435,0.99141335,0.0057069473,0.00012586077,0.00024186552,0.00009713287,0.00008574612,0.0017918771],"genre_scores_gemma":[0.7473234,0.000034397504,0.24560854,0.0024166503,0.0001140648,0.00014180184,0.00058680767,0.000010228751,0.0037640918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978868,0.00013583976,0.000583211,0.00071547856,0.00039861153,0.00028009716],"domain_scores_gemma":[0.9982789,0.0003944185,0.00021778219,0.00037974666,0.00059384346,0.00013531631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228299,0.00022579568,0.00047333093,0.0006561009,0.0004155448,0.00027869223,0.00044650686,0.00013368009,0.00014146876],"category_scores_gemma":[0.00012561458,0.00020496978,0.00039168974,0.0028442377,0.000072323965,0.00042590816,0.00017023935,0.00010362187,0.000011688961],"study_design_candidate":"simulation_or_modeling","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.000021297012,0.00012197734,0.00380022,0.000030773605,0.0023739357,7.489283e-7,0.00029806854,0.16000761,0.000023570268,0.82945466,0.00081101136,0.0030561236],"study_design_scores_gemma":[0.0007222076,0.000031084073,0.020548603,0.0000083800305,0.001047672,8.3410595e-7,0.00004469368,0.94910455,0.000025096973,0.02611002,0.0021333017,0.00022358887],"about_ca_topic_score_codex":0.00021667308,"about_ca_topic_score_gemma":0.00009142682,"teacher_disagreement_score":0.80334467,"about_ca_system_score_codex":0.000103133665,"about_ca_system_score_gemma":0.00026147178,"threshold_uncertainty_score":0.8358425},"labels":[],"label_agreement":null}]}