{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"455f61133b2d","filters":{"venue":"Set-Valued and Variational Analysis"}},"results":[{"id":"W2132628835","doi":"10.1007/s11228-013-0239-2","title":"Restricted Normal Cones and the Method of Alternating Projections: Theory","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Underpinning; Constraint (computer-aided design); Convergence (economics); Cone (formal languages); Mathematics; Computer science; Calculus (dental); Mathematical optimization; Applied mathematics; Algorithm; Engineering; Geometry; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01273990833924538,"gpt":0.2688874153341057,"spread":0.2561475069948603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003288,0.0001152963,0.0002803073,0.0004015681,0.0003000389,0.0001956554,0.0002404807,0.0000458752,0.0001731543],"category_scores_gemma":[0.0003101008,0.00007500362,0.000137726,0.001873999,0.00008264329,0.0004676006,0.0001363602,0.00008271798,0.000004301853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000114357,"about_ca_system_score_gemma":0.00004899441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009642745,"about_ca_topic_score_gemma":0.00001549972,"domain_scores_codex":[0.9983432,0.0005085691,0.0003996228,0.0002875161,0.0003409288,0.0001202148],"domain_scores_gemma":[0.9980879,0.0009216163,0.0002967453,0.0002149667,0.0004235125,0.00005519862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001373699,0.00002759604,0.003399885,0.000005732394,0.001221657,1.545145e-7,0.0008181248,0.01522195,0.0000515343,0.9768947,0.0000319057,0.002313066],"study_design_scores_gemma":[0.0005484858,0.00001130762,0.05897048,0.00000301996,0.0005348843,0.000003743965,0.000112612,0.8864787,0.00001828271,0.05320532,0.00002546778,0.00008769928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004333657,0.0001090139,0.99187,0.002693234,0.00003530529,0.0001590599,0.00001199016,0.00003152734,0.0007562442],"genre_scores_gemma":[0.7253401,0.00008507958,0.2732117,0.0004958594,0.00006899524,0.00005795517,0.000052804,0.000005428963,0.0006821043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9236893,"threshold_uncertainty_score":0.3058559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101393121","doi":"10.1007/s11228-011-0187-7","title":"Firmly Nonexpansive Mappings and Maximally Monotone Operators: Correspondence and Duality","year":2011,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Monotone polygon; Mathematics; Duality (order theory); Fixed point; Dual (grammatical number); Convergence (economics); Pure mathematics; Monotonic function; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02664853637802502,"gpt":0.2432763106379922,"spread":0.2166277742599672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089706,0.0002121489,0.00036474,0.0005072565,0.0003489417,0.0002759473,0.0002454578,0.00009401995,0.0002349509],"category_scores_gemma":[0.0001199777,0.0001911006,0.0000984983,0.001594342,0.00009187498,0.0007864687,0.0002468824,0.0001068657,0.00001221557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002420392,"about_ca_system_score_gemma":0.000077185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006240391,"about_ca_topic_score_gemma":0.00005186245,"domain_scores_codex":[0.9981659,0.0001715854,0.0003988314,0.0006620529,0.0003946011,0.0002070152],"domain_scores_gemma":[0.9988082,0.0001452771,0.0001942966,0.000275457,0.0003716066,0.0002051701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008427304,0.0001928266,0.08419247,0.00002967145,0.002470521,0.00001554105,0.009564553,0.001875015,0.000272323,0.8987916,0.0001538372,0.002357368],"study_design_scores_gemma":[0.0003616952,0.00004016254,0.3127097,0.000006390086,0.000462024,0.000008999268,0.0001174927,0.6776665,0.00002732111,0.008240182,0.0001119677,0.0002475735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0874484,0.0002156678,0.9097159,0.00153116,0.0000581932,0.0001463841,0.00005990237,0.00007519651,0.0007492151],"genre_scores_gemma":[0.8930039,0.0001867343,0.105145,0.001052974,0.00004316796,0.00001936101,0.00007050265,0.000007499956,0.0004707756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8905514,"threshold_uncertainty_score":0.7792856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041901627","doi":"10.1007/s11228-013-0238-3","title":"Restricted Normal Cones and the Method of Alternating Projections: Applications","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Linear subspace; Convexity; Convex cone; Regular polygon; Cone (formal languages); Generalization; Convex analysis; Mathematics; Simple (philosophy); Convex set; Property (philosophy); Dual cone and polar cone; Subderivative; Convergence (economics); Space (punctuation); Convex optimization; Combinatorics; Mathematical optimization; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01332822731432294,"gpt":0.2756673167549808,"spread":0.2623390894406579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289036,0.0001096505,0.000260408,0.0003939879,0.0003474817,0.0001938145,0.0002492355,0.00004439166,0.0001023784],"category_scores_gemma":[0.0001267352,0.00007532786,0.0001243053,0.002313258,0.00007563286,0.0004211674,0.0001262279,0.00007795506,0.000005606644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001248571,"about_ca_system_score_gemma":0.00005007352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243714,"about_ca_topic_score_gemma":0.00002193951,"domain_scores_codex":[0.9986121,0.000241276,0.0004115958,0.0002998141,0.0003211003,0.0001141181],"domain_scores_gemma":[0.9983566,0.0005633144,0.0003034632,0.0002400946,0.0004773585,0.00005913541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007082142,0.00004432437,0.005989706,0.000008991067,0.001186542,8.443744e-8,0.0005623116,0.02148012,0.00007645735,0.967068,0.00004476443,0.00353158],"study_design_scores_gemma":[0.0004793736,0.00000834501,0.05867196,0.000002142061,0.0004869331,0.000003359757,0.00007295345,0.9198974,0.00001511957,0.02017957,0.00009530824,0.00008757144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001512191,0.00009553041,0.9939937,0.003420818,0.00001876955,0.0002633742,0.00001617146,0.00003429202,0.0006451409],"genre_scores_gemma":[0.5849034,0.0000916184,0.4136881,0.0004091943,0.00008021102,0.0002462319,0.00009049875,0.000005552672,0.0004851216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468884,"threshold_uncertainty_score":0.3071781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03342346534523686,"gpt":0.3108755328615045,"spread":0.2774520675162676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002659144,0.0001049194,0.0002919799,0.0002220959,0.0001637211,0.00002746487,0.00008661243,0.00006953309,0.0000662],"category_scores_gemma":[0.0002456096,0.00006763495,0.0002095515,0.001391337,0.00002515833,0.00007655165,0.00001930983,0.00006413037,0.000001131785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003680048,"about_ca_system_score_gemma":0.00002598911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002336078,"about_ca_topic_score_gemma":0.0001378037,"domain_scores_codex":[0.9988739,0.0001443282,0.0003770145,0.0001803094,0.0003161133,0.0001082574],"domain_scores_gemma":[0.9992125,0.0001518296,0.0002588549,0.0001817751,0.0001544511,0.00004060388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002498201,0.0001363199,0.003881929,0.00001911499,0.0005279431,1.165808e-7,0.0001953728,0.0009059734,0.001000738,0.9916188,0.00004962731,0.001639151],"study_design_scores_gemma":[0.0006816299,0.00005216986,0.1571604,0.00001906973,0.001588013,0.000001673617,0.00008412555,0.4016507,0.00008826512,0.438408,0.00009641307,0.0001695753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5219696,0.0001195579,0.4751267,0.0006828912,0.0001317836,0.0003983977,0.00007993059,0.00004442201,0.001446737],"genre_scores_gemma":[0.9920103,0.00000906303,0.007151952,0.00006203628,0.00006785553,0.000008778831,0.00004699347,0.00000452197,0.000638482],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5532107,"threshold_uncertainty_score":0.2758073,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02273572245229764,"gpt":0.3127071331318089,"spread":0.2899714106795112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422455,0.0001873816,0.0004969197,0.0005227566,0.0001415952,0.00003792101,0.0000928195,0.000115604,0.0003079945],"category_scores_gemma":[0.0002181328,0.000186616,0.0002938781,0.002233655,0.0000385982,0.0001382684,0.00002994138,0.00009543377,0.000001244459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000802992,"about_ca_system_score_gemma":0.00006992154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001210504,"about_ca_topic_score_gemma":0.00003904511,"domain_scores_codex":[0.9987323,0.0001107139,0.0003837444,0.0003687383,0.0002437212,0.000160836],"domain_scores_gemma":[0.9981482,0.0004013116,0.0001481275,0.0002297402,0.001011939,0.00006067553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001787234,0.00005605125,0.0008100235,0.00001901648,0.006076983,4.27119e-7,0.00032327,0.9386286,0.0005417561,0.05336099,0.00005415801,0.0001109094],"study_design_scores_gemma":[0.0002410887,0.00003232573,0.004375156,0.00001429629,0.003825155,7.249313e-7,0.00008132109,0.9821864,0.001655169,0.007184485,0.0002005157,0.0002034157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001198541,0.0003411489,0.9973314,0.0003600786,0.00007856617,0.0001594386,0.0001706271,0.00009831689,0.0002618904],"genre_scores_gemma":[0.3723753,0.0002500317,0.6260099,0.0001377518,0.0001200614,0.00005094321,0.0009090557,0.00002466013,0.0001222953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3713215,"threshold_uncertainty_score":0.7609979,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Monotonic function; Pseudo-monotone operator; Monotone polygon; Operator (biology); Discrete mathematics; Combinatorics; Finite-rank operator; Linear map; Pure mathematics; Banach space; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01171228963208809,"gpt":0.2598769770426923,"spread":0.2481646874106042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961257,0.0001805329,0.0003543667,0.0002787528,0.0002968316,0.0001172363,0.0004473227,0.00007741794,0.00006778758],"category_scores_gemma":[0.0001416455,0.00011314,0.0001578331,0.001840384,0.00006599176,0.0003560198,0.0001028052,0.0001195979,0.000002542886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002807621,"about_ca_system_score_gemma":0.0001111563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000280787,"about_ca_topic_score_gemma":0.00004861848,"domain_scores_codex":[0.998104,0.0003131127,0.0004711221,0.0004116459,0.0005333465,0.0001668252],"domain_scores_gemma":[0.9986129,0.0001251261,0.0002204548,0.0004452841,0.0004698486,0.0001263506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001608018,0.0005126421,0.01822657,0.000008634081,0.0008787373,9.874452e-7,0.001523746,0.2741596,0.003565846,0.6997634,0.0000608948,0.001138232],"study_design_scores_gemma":[0.0002863416,0.0001633734,0.2200641,0.000009010872,0.0002845199,0.000001006175,0.00004110874,0.7769478,0.001007279,0.001038356,0.00003151986,0.0001256232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6615722,0.00005027947,0.3283577,0.009382484,0.00004521619,0.000309939,0.0001344125,0.00002627678,0.0001214287],"genre_scores_gemma":[0.9788945,0.00001916899,0.01930864,0.001617004,0.00004915623,0.00001219924,0.00003765494,0.000004846463,0.0000568004],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.698725,"threshold_uncertainty_score":0.4613715,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01172606926055366,"gpt":0.2449463745589719,"spread":0.2332203052984183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700711,0.0002391245,0.0004476605,0.000473592,0.0003662015,0.0003041375,0.0003384309,0.0000880627,0.0001278804],"category_scores_gemma":[0.00007290704,0.0001900431,0.0002443522,0.001652436,0.00006354869,0.0004571978,0.00003603053,0.00009132292,0.000008224448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004573543,"about_ca_system_score_gemma":0.0001704891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002053112,"about_ca_topic_score_gemma":0.00002293131,"domain_scores_codex":[0.9980277,0.00009927558,0.0004380755,0.0006214501,0.0005012275,0.0003122528],"domain_scores_gemma":[0.9985433,0.0001818951,0.0002782548,0.0003074287,0.0005079286,0.0001811983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006622252,0.0001960022,0.00250321,0.000009379315,0.001954983,0.000001593312,0.0002619531,0.3101723,0.00006830871,0.6822551,0.0001330174,0.002377857],"study_design_scores_gemma":[0.00181559,0.0001684594,0.03385872,0.000007629719,0.001012124,0.000006493949,0.00002490458,0.9532218,0.00001006045,0.008899468,0.0006915221,0.0002832207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001492028,0.000038618,0.9928398,0.004416832,0.00003603517,0.0003437425,0.000124244,0.00009215874,0.000616555],"genre_scores_gemma":[0.7355213,0.000008393476,0.2628477,0.0008170232,0.00007149055,0.00005231705,0.000278334,0.000007506033,0.000395964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7340293,"threshold_uncertainty_score":0.7749732,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0330838813459778,"gpt":0.2859627129001348,"spread":0.252878831554157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655603,0.0002342556,0.000375281,0.0004102037,0.0007204395,0.0001773078,0.0001931231,0.0001017351,0.00008702467],"category_scores_gemma":[0.001211501,0.0001570085,0.000172213,0.001155509,0.00005211115,0.00008793939,0.00006896932,0.0001527234,0.0000163176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002747391,"about_ca_system_score_gemma":0.00002133208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000141757,"about_ca_topic_score_gemma":0.0001324338,"domain_scores_codex":[0.9979885,0.0003602498,0.000349148,0.0003935235,0.0006475945,0.0002610091],"domain_scores_gemma":[0.9972388,0.001889234,0.0001820821,0.0003540157,0.0002108874,0.0001250145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002170774,0.0009344369,0.05233911,0.0001555357,0.01078974,0.00000447575,0.002560136,0.0043,0.0002791709,0.9132366,0.002999705,0.01218406],"study_design_scores_gemma":[0.0009790944,0.0001484396,0.3255552,0.00001537929,0.002974513,0.000004344573,0.0001902117,0.5568943,0.00006581829,0.1090304,0.003714435,0.0004278072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8840524,0.002532135,0.09433693,0.004202292,0.0004398014,0.001087316,0.000182441,0.0006074745,0.0125592],"genre_scores_gemma":[0.9893996,0.00005911807,0.0096806,0.0001661721,0.0001496989,0.00001908645,0.00002226958,0.00001553701,0.0004879175],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8042061,"threshold_uncertainty_score":0.6402619,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.05239085046265335,"gpt":0.3808286360075549,"spread":0.3284377855449016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001062787,0.0002745397,0.000761038,0.001654121,0.0003585602,0.0001108527,0.0002009019,0.0001938203,0.001178575],"category_scores_gemma":[0.000919677,0.000266059,0.000410726,0.004419657,0.0001427457,0.0002829471,0.00007017647,0.0003813513,0.00002062685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007114347,"about_ca_system_score_gemma":0.0001831535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008171015,"about_ca_topic_score_gemma":0.000494121,"domain_scores_codex":[0.9973187,0.0001520533,0.0008051043,0.0006307579,0.0007113775,0.0003819517],"domain_scores_gemma":[0.9965117,0.001752543,0.0002974678,0.0003445058,0.0008807082,0.0002131033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001266076,0.0006951608,0.02370096,0.00008357163,0.009850939,0.000006750493,0.0009493371,0.7624965,0.0000954662,0.1995222,0.0004383679,0.002034042],"study_design_scores_gemma":[0.00117201,0.00003318441,0.01206287,0.000003900617,0.002625803,0.000002191845,0.0001700985,0.9139512,0.000008775717,0.06947111,0.0002286702,0.0002702238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01456395,0.00003347392,0.9828766,0.001092924,0.0001071702,0.00049062,0.0005849175,0.00007057558,0.0001797447],"genre_scores_gemma":[0.3284017,0.0000127645,0.6661454,0.0002008899,0.0002052677,0.0002356748,0.002947136,0.00003980682,0.001811369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3167312,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007822943143118505,"gpt":0.2389375222410473,"spread":0.2311145790979288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003996544,0.0001879214,0.0004755247,0.0006095279,0.0003272746,0.0001261765,0.0004844091,0.0001261808,0.0006372983],"category_scores_gemma":[0.000129028,0.0001615934,0.0003418486,0.001663401,0.00006735256,0.0003497384,0.0001923471,0.0001924426,0.00001364236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657745,"about_ca_system_score_gemma":0.0001164069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001322988,"about_ca_topic_score_gemma":0.00005727276,"domain_scores_codex":[0.998073,0.0001125332,0.0004972002,0.0004472162,0.0006694045,0.0002006477],"domain_scores_gemma":[0.9983957,0.0001916696,0.0003059931,0.0003840758,0.0005528271,0.0001697816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006261838,0.0005166856,0.05050756,0.00001790598,0.006039999,0.00000340641,0.001406657,0.2118819,0.01831739,0.7094956,0.0001660128,0.001584263],"study_design_scores_gemma":[0.0007013447,0.00002198842,0.1230277,0.000002663034,0.0009150809,0.000001576915,0.00001131175,0.8740381,0.00008150675,0.0009857609,0.00004881059,0.0001640739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03784373,0.00001150614,0.9600679,0.001366231,0.0001491597,0.0001011305,0.0000823923,0.00004094213,0.0003370419],"genre_scores_gemma":[0.9098931,0.000006169368,0.08947879,0.0002017321,0.0001131896,0.00001194219,0.0001293183,0.000006397959,0.000159392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8720493,"threshold_uncertainty_score":0.6977969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03393967027093766,"gpt":0.3293729741415905,"spread":0.2954333038706529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985233,0.0001900868,0.0004646013,0.0003213902,0.0001270604,0.00001856959,0.00009410526,0.0001200168,0.0002781599],"category_scores_gemma":[0.0002918971,0.0001497785,0.0001628058,0.0006639993,0.0001445509,0.0002036071,0.00005082082,0.0001394732,0.00001236622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005153513,"about_ca_system_score_gemma":0.00002618895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000240521,"about_ca_topic_score_gemma":0.000007908977,"domain_scores_codex":[0.9986472,0.0001678301,0.0003458009,0.0002541417,0.0003470392,0.0002379479],"domain_scores_gemma":[0.9988936,0.0003549323,0.00027087,0.0002252079,0.00014243,0.0001130288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001297659,0.0002423902,0.02594175,0.00002851113,0.0009976615,0.000001864342,0.001018988,0.0009874124,0.001346771,0.9686484,0.00004391989,0.0006125846],"study_design_scores_gemma":[0.002383054,0.0005501725,0.2496946,0.00007714163,0.006345868,0.00003086571,0.00398549,0.03753173,0.00542798,0.6925736,0.0002365241,0.001162963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8950544,0.0000610671,0.1028211,0.0002195271,0.00007227897,0.0001685332,0.00008518135,0.0000387607,0.00147913],"genre_scores_gemma":[0.9244231,0.00002429266,0.07517254,0.0000695113,0.0001147188,0.00001497159,0.00005533415,0.00001236892,0.0001131878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2760748,"threshold_uncertainty_score":0.6107792,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.03364518097489857,"gpt":0.3203965137361248,"spread":0.2867513327612262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003687796,0.0001201546,0.000298677,0.0003497663,0.0001364604,0.00001919468,0.0000870454,0.00004585605,0.0003958217],"category_scores_gemma":[0.0003739506,0.00007543944,0.000079938,0.001008433,0.0000953223,0.0001614195,0.00005122465,0.00006662599,0.000007535482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004443591,"about_ca_system_score_gemma":0.00006173089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001870082,"about_ca_topic_score_gemma":0.00002049396,"domain_scores_codex":[0.9986818,0.0000965791,0.0003198095,0.000259068,0.0004616342,0.0001810935],"domain_scores_gemma":[0.9985776,0.0004768826,0.0002192207,0.0001810367,0.0004566722,0.0000885958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007687297,0.001352093,0.4218049,0.0002864735,0.01327438,0.00001465011,0.002467362,0.02224374,0.001526511,0.524666,0.0008577983,0.01073733],"study_design_scores_gemma":[0.00388961,0.0002835755,0.1137365,0.0001136979,0.001798123,0.00001296924,0.0003269573,0.8302359,0.0003378157,0.04861663,0.0001484236,0.0004998153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07300577,0.0000114355,0.9259058,0.0004099842,0.00001829546,0.0001535522,0.0001015441,0.00003384479,0.000359808],"genre_scores_gemma":[0.8661506,0.000006971979,0.1326658,0.00002476847,0.0000448641,0.000008284064,0.00006377477,0.00001472521,0.001020243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8079922,"threshold_uncertainty_score":0.433397,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02106871951112374,"gpt":0.2298201094947784,"spread":0.2087513899836547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264084,0.0001057564,0.0002247837,0.0001440136,0.000319068,0.0001755374,0.0001380999,0.00007731269,0.0000315145],"category_scores_gemma":[0.00007780895,0.00007673152,0.00008266936,0.0001830982,0.00009308422,0.0001242648,0.00003290721,0.0001908022,0.000009380139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004931701,"about_ca_system_score_gemma":0.0000132906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003972254,"about_ca_topic_score_gemma":0.001803343,"domain_scores_codex":[0.9991974,0.00002990877,0.0003306281,0.000250837,0.00004077034,0.0001504142],"domain_scores_gemma":[0.9992926,0.0002733947,0.00016866,0.0002099621,0.00002218705,0.00003327022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001194771,0.00001679484,0.02370661,0.000002443352,0.0001226889,1.284476e-7,0.0004969286,0.006971312,0.000001563291,0.9684113,0.00001994975,0.000238341],"study_design_scores_gemma":[0.000155131,0.000009975741,0.05331798,9.095912e-7,0.00004022891,5.990857e-7,0.0001922849,0.6413288,3.386614e-7,0.3047323,0.0001497941,0.00007173233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.979976,0.0001537939,0.01168588,0.002869039,0.0001219863,0.0001173004,0.0003014439,0.000009049652,0.004765536],"genre_scores_gemma":[0.9986191,0.0001575092,0.0002724864,0.0003980277,0.00006557142,0.0000174279,0.00007049035,0.000006074975,0.0003932827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.663679,"threshold_uncertainty_score":0.3129021,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06346052568580175,"gpt":0.3719427834021519,"spread":0.3084822577163501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133689,0.0001270509,0.0003480888,0.0002207237,0.0001293028,0.00002854348,0.00009657005,0.00004410885,0.0003935313],"category_scores_gemma":[0.0001262251,0.0001005144,0.00008341319,0.001022352,0.0001379022,0.0001090873,0.00002252282,0.0001083082,0.000002117604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000352872,"about_ca_system_score_gemma":0.00007694517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003425467,"about_ca_topic_score_gemma":0.00007257581,"domain_scores_codex":[0.9985858,0.00009832164,0.0003662788,0.0002341605,0.0005360991,0.0001793651],"domain_scores_gemma":[0.9989913,0.0001767376,0.0001998633,0.0001808659,0.000361097,0.00009017875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002610511,0.001607427,0.02557983,0.0001509674,0.004868406,0.0000131323,0.002371165,0.02886976,0.0002010893,0.9200454,0.0001429154,0.01588885],"study_design_scores_gemma":[0.001353716,0.0003040628,0.01412877,0.00002773672,0.001021673,0.000005503754,0.0004591107,0.9068798,0.00005185831,0.07548262,0.0000596738,0.0002254258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03188924,0.00001625925,0.9661676,0.0006943714,0.000008300205,0.000367102,0.00009593728,0.00004454672,0.0007166619],"genre_scores_gemma":[0.6066574,0.000005003089,0.3928815,0.0000645,0.00002200059,0.00000879812,0.0002397101,0.000006022556,0.0001150442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8780101,"threshold_uncertainty_score":0.4308892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.01419576070382975,"gpt":0.2489389784320754,"spread":0.2347432177282456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355054,0.0001018459,0.0003193083,0.0005490764,0.0001263422,0.00007189563,0.0001459951,0.00004508929,0.0001328743],"category_scores_gemma":[0.0001620689,0.00009500483,0.0001382196,0.003065384,0.00004817024,0.0002945968,0.0001612768,0.00004352513,0.000001140167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001551043,"about_ca_system_score_gemma":0.00008240907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007109428,"about_ca_topic_score_gemma":0.00001618709,"domain_scores_codex":[0.9986133,0.00009553842,0.0004513552,0.0003033318,0.0004358146,0.0001006457],"domain_scores_gemma":[0.9987503,0.0001643092,0.0002872434,0.0002289008,0.0005028412,0.00006644811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000881822,0.0001761436,0.03613053,0.00005339241,0.00198441,7.337378e-7,0.001068083,0.01365956,0.0005674234,0.9457451,0.00006531958,0.0005404589],"study_design_scores_gemma":[0.0004023438,0.00002323133,0.1529868,0.00001358963,0.0007636329,0.00000171622,0.0001585875,0.8337188,0.0004802159,0.01117911,0.0001420084,0.0001299265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01383388,0.0002877874,0.9835569,0.001724896,0.00002766284,0.00005559901,0.00007847608,0.00001374732,0.0004210406],"genre_scores_gemma":[0.8508929,0.0001279939,0.1481159,0.0001301196,0.00001670548,0.000007272965,0.0002276385,0.000003472154,0.0004780235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.934566,"threshold_uncertainty_score":0.3874184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Subderivative; Monotonic function; Monotone polygon; Banach space; Regular polygon; Closed set; Function (biology); Convex function","retraction":null,"screen_n_in":null,"score":{"opus":0.02404510212620979,"gpt":0.2523662866681549,"spread":0.2283211845419451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220152,0.0001846973,0.0003662058,0.0004148197,0.0002497796,0.0003300648,0.0002523315,0.0000913184,0.00007123709],"category_scores_gemma":[0.0001118747,0.0001644611,0.0001402554,0.001363264,0.00004582718,0.0004804429,0.0002484603,0.0001001476,0.0000162563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005255582,"about_ca_system_score_gemma":0.0001016155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003499028,"about_ca_topic_score_gemma":0.00007419644,"domain_scores_codex":[0.9981987,0.0001762142,0.0003354084,0.0005449844,0.0005373553,0.0002073295],"domain_scores_gemma":[0.9987803,0.00009281419,0.0001700777,0.0002869219,0.0003855205,0.0002843613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004729017,0.0001937212,0.07030629,0.00001179528,0.002310639,0.000007851149,0.001397099,0.01808895,0.0001048691,0.9053894,0.0004657538,0.001676333],"study_design_scores_gemma":[0.0004173474,0.00002535993,0.167575,0.000001589304,0.0005774633,0.000005481934,0.00003142646,0.812325,0.00003100932,0.01868831,0.0001334283,0.0001885327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0854165,0.0001225408,0.9112754,0.002449055,0.00008974128,0.00008910139,0.00002341443,0.0000895092,0.0004447502],"genre_scores_gemma":[0.9523749,0.0000383681,0.04651912,0.0004755899,0.00009755742,0.00000807528,0.0001461919,0.000005791273,0.0003344312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8867011,"threshold_uncertainty_score":0.670653,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03225607835430253,"gpt":0.2567377612541529,"spread":0.2244816828998503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006343264,0.00026103,0.0006173219,0.0003767804,0.00007405038,0.0000859621,0.0001951976,0.0001833034,0.0002241493],"category_scores_gemma":[0.0001908539,0.0002258476,0.0002894277,0.0005874488,0.00005150922,0.00006089512,0.0001829268,0.0004891242,0.000001417166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006607305,"about_ca_system_score_gemma":0.00006903999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002928635,"about_ca_topic_score_gemma":0.00006311658,"domain_scores_codex":[0.9982991,0.0001671866,0.0006213756,0.0003900507,0.000314543,0.0002077157],"domain_scores_gemma":[0.9987124,0.0004371908,0.0002664523,0.0003716296,0.0001676809,0.00004460139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001634795,0.00003159077,0.01232682,0.0001126707,0.002744756,0.0000111691,0.0008755894,0.9630572,0.002060721,0.01720267,0.0001194756,0.001440987],"study_design_scores_gemma":[0.00011442,0.00001146578,0.008540746,0.0004183738,0.00063855,0.000002335664,0.0004718735,0.9717482,0.004590172,0.01317896,0.000006081213,0.0002788289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9400487,0.000395864,0.05793131,0.0001289803,0.0001984644,0.00018976,0.0000773606,0.0000978135,0.0009317277],"genre_scores_gemma":[0.9918638,0.0001260864,0.007723593,0.00004488227,0.00007308152,0.00001761726,0.0001176069,0.00001992398,0.00001335358],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05181513,"threshold_uncertainty_score":0.9209798,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04352391919275551,"gpt":0.314282693898874,"spread":0.2707587747061185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009302562,0.00009420209,0.0001751317,0.0003429398,0.0005036974,0.000133865,0.00005249281,0.00005469803,0.00003905333],"category_scores_gemma":[0.0009389914,0.00006537616,0.0000600025,0.002369187,0.00004325226,0.0001218199,0.00004286364,0.00006099874,0.000008214228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001572512,"about_ca_system_score_gemma":0.00003502738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001364429,"about_ca_topic_score_gemma":0.00004811252,"domain_scores_codex":[0.9990564,0.00007521528,0.0002635854,0.000180048,0.0002779274,0.0001467969],"domain_scores_gemma":[0.9988769,0.0005855855,0.0001302734,0.0001054876,0.0002628413,0.00003893017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002947596,0.00002856661,0.01093187,0.00009502048,0.001543828,0.000001371925,0.001491359,0.000121501,0.00006616629,0.9813051,0.001657217,0.00272849],"study_design_scores_gemma":[0.0007843067,0.00008203618,0.06786148,0.00002117361,0.002221901,0.000009483003,0.002444723,0.3092283,0.00007874284,0.6122701,0.004635379,0.0003624692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8597524,0.00187287,0.1253166,0.008814105,0.0003370981,0.0006866311,0.0004963638,0.0004417942,0.002282074],"genre_scores_gemma":[0.992901,0.0006468371,0.001697392,0.0001257453,0.0001662481,0.00002970204,0.0002803624,0.00001256178,0.004140147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3690351,"threshold_uncertainty_score":0.3874084,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Projector; Convex optimization; Convex analysis; Projection (relational algebra); Regular polygon; Mathematical optimization; Computer science; Algorithm; Geometry; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01826260981699021,"gpt":0.2746219871181396,"spread":0.2563593773011494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007743093,0.0001679172,0.0002847194,0.0004387069,0.001382054,0.0008498419,0.0004064387,0.0000673435,0.0001284269],"category_scores_gemma":[0.0003692351,0.0001417712,0.0001360498,0.0006194999,0.00008264239,0.0008264251,0.0002663697,0.00008040104,0.00001168946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002238457,"about_ca_system_score_gemma":0.0000633864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001198286,"about_ca_topic_score_gemma":0.00002936115,"domain_scores_codex":[0.9984738,0.0001833256,0.0003035975,0.0005194387,0.0003374907,0.0001823644],"domain_scores_gemma":[0.9985065,0.0001646309,0.0003171831,0.0005842076,0.0002778628,0.0001496201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000008216679,0.00005283204,0.02388409,0.00000429233,0.0007431203,0.000001690165,0.0005182129,0.0005865344,0.00008255192,0.972867,0.0000461125,0.001205315],"study_design_scores_gemma":[0.000214674,0.00001328583,0.4991601,0.00000467287,0.0004952715,0.000002991693,0.00001956849,0.4831214,0.000008139312,0.01644146,0.0003584052,0.000160005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02211654,0.00009755457,0.9713371,0.005402929,0.000115123,0.0001434293,0.00006666565,0.00008084283,0.0006398495],"genre_scores_gemma":[0.9711706,0.0001277187,0.0268861,0.0005011308,0.0000947389,0.00002094469,0.0002001592,0.00000728601,0.0009913357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9564255,"threshold_uncertainty_score":0.999918,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0724339798274549,"gpt":0.3897422809007294,"spread":0.3173083010732745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452789,0.0001112803,0.0002895681,0.0003072039,0.0001350101,0.0000184191,0.0002065162,0.00005063616,0.0004317554],"category_scores_gemma":[0.001685457,0.00007013156,0.0001568145,0.002980246,0.00004984373,0.00004615877,0.0001646508,0.0001373066,0.00001011301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004484261,"about_ca_system_score_gemma":0.00005689061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000209918,"about_ca_topic_score_gemma":0.00009650079,"domain_scores_codex":[0.9982435,0.0002755857,0.0004592496,0.0002088141,0.0006280175,0.0001848323],"domain_scores_gemma":[0.9984193,0.0007850828,0.0002171802,0.000280968,0.0002435077,0.00005396241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003222719,0.0006709832,0.2262953,0.0001054029,0.00180418,0.000007188742,0.009769751,0.2085862,0.0004850427,0.5481513,0.0006008451,0.003201539],"study_design_scores_gemma":[0.0006854352,0.00003026818,0.3333991,0.00003007949,0.0002972496,0.000001355227,0.0004796078,0.6018051,0.0001896845,0.06291559,0.0000402539,0.0001262301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9940478,0.000003120712,0.003075836,0.001914731,0.00002385525,0.0002655956,0.0001412367,0.00001878438,0.0005090217],"genre_scores_gemma":[0.9799358,0.00001224064,0.01899842,0.0002217555,0.0000293809,0.00004364654,0.00007704296,0.00001542335,0.0006662649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4852358,"threshold_uncertainty_score":0.4727419,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04363074761020096,"gpt":0.344245910834639,"spread":0.300615163224438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162245,0.000114672,0.000377523,0.0005969274,0.0001829705,0.00004914871,0.000170345,0.0000793915,0.0006045256],"category_scores_gemma":[0.0004737344,0.00007658062,0.0001900402,0.003023329,0.0001917793,0.0001907457,0.00006790965,0.00007822739,0.00002640964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158289,"about_ca_system_score_gemma":0.00008962009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002335161,"about_ca_topic_score_gemma":0.0001638889,"domain_scores_codex":[0.9976948,0.0003273188,0.0008398807,0.0002921469,0.0007280077,0.0001178669],"domain_scores_gemma":[0.9980737,0.0004093352,0.0005460565,0.0002518873,0.0006647856,0.00005424705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000297749,0.0004374662,0.2720245,0.00001137738,0.0009888365,0.000007386117,0.004002972,0.70715,0.0006549712,0.007366475,0.0007500261,0.006308158],"study_design_scores_gemma":[0.0003649038,0.00004927636,0.1536926,0.000006858746,0.000388675,0.000005400924,0.0001908617,0.8421791,0.00007566496,0.002950544,0.00002359316,0.00007250148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7759997,0.00003288114,0.2231428,0.000221983,0.0001234405,0.0001209667,0.00009230494,0.000006366352,0.0002594713],"genre_scores_gemma":[0.9941654,0.000008184026,0.005244863,0.00003374964,0.00006747284,0.000004027087,0.00007961535,0.000004780071,0.0003918614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2181657,"threshold_uncertainty_score":0.6619131,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.02125071355839598,"gpt":0.2790753072660079,"spread":0.2578245937076119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181795,0.00013531,0.0002468095,0.0003009583,0.001022384,0.0008354694,0.0007179915,0.00006234321,0.0002653595],"category_scores_gemma":[0.0001673696,0.0001186615,0.0001916851,0.0005798661,0.00004457064,0.0008762715,0.0002612226,0.00007400694,0.00005003643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002368954,"about_ca_system_score_gemma":0.0000579307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001879679,"about_ca_topic_score_gemma":0.00004216869,"domain_scores_codex":[0.9986521,0.00006827807,0.0002533269,0.0004431797,0.0004146038,0.0001685268],"domain_scores_gemma":[0.9985963,0.00006976526,0.0002821321,0.0006992621,0.0002278635,0.0001246858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004306242,0.00004665817,0.02368946,0.000003507864,0.00125674,0.000001876262,0.0002462027,0.01352779,0.00002770019,0.9593303,0.0002447064,0.001620729],"study_design_scores_gemma":[0.0002009853,0.000007876693,0.2606359,0.00000169801,0.000366025,0.000001066387,0.00000661982,0.7256468,0.00000957732,0.01231944,0.000672235,0.0001317841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002412071,0.000047626,0.9857342,0.006525971,0.00009448854,0.00005831213,0.00002347879,0.00006998894,0.005033827],"genre_scores_gemma":[0.9123278,0.00003528078,0.08425213,0.0004918324,0.0001018822,0.000009910956,0.00007784409,0.00000511678,0.002698163],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9470109,"threshold_uncertainty_score":0.8056451,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); 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","retraction":null,"screen_n_in":null,"score":{"opus":0.02938392475890697,"gpt":0.2904096471752086,"spread":0.2610257224163017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085327,0.0001886237,0.0003664544,0.0006784022,0.0004526249,0.0002447781,0.0002862312,0.0001018098,0.00003489067],"category_scores_gemma":[0.0003192112,0.000169564,0.0002381411,0.003282738,0.00006728192,0.0004310893,0.00008764363,0.00008713309,0.00004422408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007690096,"about_ca_system_score_gemma":0.0001574251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001394426,"about_ca_topic_score_gemma":0.00001880286,"domain_scores_codex":[0.9978511,0.0002169734,0.0005157129,0.0006316841,0.000535068,0.000249484],"domain_scores_gemma":[0.9977391,0.0007478229,0.0003161575,0.0002916555,0.0007664212,0.00013888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001870045,0.00003898919,0.001335693,0.00001029899,0.001298127,0.000001619131,0.0006156241,0.1025476,0.00009598416,0.8935953,0.000178056,0.0002639951],"study_design_scores_gemma":[0.000429337,0.00003473271,0.01731539,0.000009532651,0.0006389495,0.000002925619,0.0003303189,0.9714462,0.00001729272,0.009423914,0.000130948,0.0002204426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001355741,0.00005218419,0.9945249,0.002582601,0.0001513361,0.0003164454,0.0004551492,0.0001687215,0.0003929117],"genre_scores_gemma":[0.9547197,0.00005648355,0.04192261,0.0002789913,0.0001186647,0.0001297332,0.001808432,0.00001127869,0.0009540898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.953364,"threshold_uncertainty_score":0.6914619,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.03173994879061303,"gpt":0.2952924408431884,"spread":0.2635524920525754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006837631,0.0004568199,0.0009308233,0.0005905632,0.0002335485,0.0008785038,0.0007745012,0.0003095193,0.0007465668],"category_scores_gemma":[0.00009981715,0.0003843028,0.0005859411,0.001418732,0.000115124,0.0004841697,0.0005549449,0.0003062304,0.0000344313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008458614,"about_ca_system_score_gemma":0.0008381266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001110652,"about_ca_topic_score_gemma":0.00001759135,"domain_scores_codex":[0.9966732,0.0001566173,0.0007618765,0.001206605,0.0008208211,0.0003808565],"domain_scores_gemma":[0.9971951,0.0003795064,0.000612087,0.0007717768,0.0007227465,0.0003188004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003271846,0.0002043266,0.002741152,0.0001573919,0.00571021,0.000002192343,0.0003426349,0.2438652,0.000008001147,0.7455618,0.0006188382,0.0007554806],"study_design_scores_gemma":[0.0007145864,0.00006164526,0.005916289,0.00005309049,0.002841323,0.000006090369,0.00002828985,0.9002967,0.000004219572,0.08949441,0.0001096259,0.0004736768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007640519,0.00005806144,0.9922314,0.004086762,0.000118316,0.0007726715,0.0006477931,0.000158657,0.001162309],"genre_scores_gemma":[0.2749775,0.00001390336,0.7139883,0.0005380139,0.000251114,0.0002139378,0.007902237,0.00003033725,0.002084612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6564316,"threshold_uncertainty_score":0.9998609,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematical optimization; Mathematical economics; Economics; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0153414266489208,"gpt":0.2783141284345232,"spread":0.2629727017856024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228299,0.0002257957,0.0004733309,0.0006561009,0.0004155448,0.0002786922,0.0004465069,0.0001336801,0.0001414688],"category_scores_gemma":[0.0001256146,0.0002049698,0.0003916897,0.002844238,0.00007232396,0.0004259082,0.0001702393,0.0001036219,0.00001168896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001031337,"about_ca_system_score_gemma":0.0002614718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002166731,"about_ca_topic_score_gemma":0.00009142682,"domain_scores_codex":[0.9978868,0.0001358398,0.000583211,0.0007154786,0.0003986115,0.0002800972],"domain_scores_gemma":[0.9982789,0.0003944185,0.0002177822,0.0003797467,0.0005938435,0.0001353163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002129701,0.0001219773,0.00380022,0.0000307736,0.002373936,7.489283e-7,0.0002980685,0.1600076,0.00002357027,0.8294547,0.0008110114,0.003056124],"study_design_scores_gemma":[0.0007222076,0.00003108407,0.0205486,0.000008380031,0.001047672,8.341059e-7,0.00004469368,0.9491045,0.00002509697,0.02611002,0.002133302,0.0002235889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004181786,0.0001190644,0.9914134,0.005706947,0.0001258608,0.0002418655,0.00009713287,0.00008574612,0.001791877],"genre_scores_gemma":[0.7473234,0.0000343975,0.2456085,0.00241665,0.0001140648,0.0001418018,0.0005868077,0.00001022875,0.003764092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8033447,"threshold_uncertainty_score":0.8358425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}