{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"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":"e568ecacbc73","filters":{"venue":"Set-Valued Analysis"}},"results":[{"id":"W2096220424","doi":"10.1007/s11228-004-7197-7","title":"Nonsmooth Analysis of Singular Values. Part I: Theory","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Subderivative; Mathematics; Simple (philosophy); Limiting; TRACE (psycholinguistics); Singular value; Mathematical analysis; Singular solution; Work (physics); Applied mathematics; Matrix (chemical analysis); Pure mathematics; Calculus (dental); Eigenvalues and eigenvectors; Regular polygon; Geometry; Philosophy; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01194793296660928,"gpt":0.2594108906264844,"spread":0.2474629576598751,"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.002499003,0.0002809208,0.0009525121,0.001871815,0.0002001071,0.0001248567,0.001358879,0.0001123209,0.0009541748],"category_scores_gemma":[0.000123186,0.0002452323,0.001350749,0.01083778,0.0001578463,0.0004275902,0.0002510131,0.0001679065,0.00007826833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005809985,"about_ca_system_score_gemma":0.00006742855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004808078,"about_ca_topic_score_gemma":0.00003265322,"domain_scores_codex":[0.9968219,0.0006324454,0.0007016324,0.0007201604,0.0006746548,0.0004492144],"domain_scores_gemma":[0.9972589,0.0002813606,0.0003754828,0.001708233,0.0001924895,0.0001835397],"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.00005930585,0.0006803185,0.004473675,0.00004073429,0.05812826,0.00007060115,0.004701909,0.2483548,0.0004200498,0.5458328,0.0007991766,0.1364384],"study_design_scores_gemma":[0.0002898062,0.00004670507,0.00183511,0.000009684766,0.01612743,0.000002379525,0.0001284673,0.9621564,0.002110392,0.01371099,0.003151777,0.0004308867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05617754,0.0007443528,0.9383847,0.0003382607,0.0001303906,0.0001130476,0.00004538376,0.0002076525,0.003858727],"genre_scores_gemma":[0.9446645,0.00003793106,0.05211852,0.0004012717,0.0001668517,0.000009525668,0.00006030535,0.00001612223,0.002525006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8884869,"threshold_uncertainty_score":1,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969123878","doi":"10.1007/s11228-004-7198-6","title":"Nonsmooth Analysis of Singular Values. Part II: Applications","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Subderivative; Lipschitz continuity; Pure mathematics; Absolute continuity; Singular value; Invariant (physics); Sign (mathematics); Mathematical analysis; Applied mathematics; Regular polygon; Convex optimization; Geometry; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01190930068803187,"gpt":0.2656462332177362,"spread":0.2537369325297043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003228,0.0002236649,0.0007365842,0.001544777,0.0003502768,0.000091469,0.001209448,0.00009151881,0.0004614511],"category_scores_gemma":[0.00003721371,0.0002073898,0.0009958758,0.01242864,0.000116682,0.0003276921,0.0002775113,0.0001322784,0.0000600223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484691,"about_ca_system_score_gemma":0.00006156209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006325237,"about_ca_topic_score_gemma":0.00004554738,"domain_scores_codex":[0.9976043,0.0002008515,0.0006318301,0.0006604949,0.0005481516,0.0003543606],"domain_scores_gemma":[0.997509,0.0001141767,0.0003400321,0.001667553,0.0002038311,0.0001654291],"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.00002180847,0.001347999,0.005891657,0.00005139085,0.05031775,0.000020873,0.00419355,0.409573,0.0006029886,0.3395509,0.001315258,0.1871129],"study_design_scores_gemma":[0.0001961221,0.00003474394,0.001265536,0.000004825533,0.0114975,0.00000142262,0.00005920626,0.9669383,0.001323369,0.003724206,0.01462483,0.0003299157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02767007,0.0004509653,0.9685569,0.0005148888,0.00004670711,0.0001678379,0.00005574221,0.0001779541,0.002358869],"genre_scores_gemma":[0.8980683,0.0000343365,0.09898623,0.0002987366,0.0001802772,0.00005047919,0.0001174676,0.00001359213,0.002250561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8703982,"threshold_uncertainty_score":0.8457111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012743680","doi":"10.1007/s11228-005-0005-1","title":"Clarke Generalized Jacobian of the Projection onto the Cone of Positive Semidefinite Matrices","year":2006,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Jacobian matrix and determinant; Cone (formal languages); Differentiable function; Projection (relational algebra); Positive-definite matrix; Mathematics; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Applied mathematics; Physics; Eigenvalues and eigenvectors; Algorithm; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.00880545216618401,"gpt":0.2364736850402417,"spread":0.2276682328740577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009186245,0.0001383015,0.0003341052,0.0002228454,0.0001986611,0.0000593967,0.0008253928,0.0000620063,0.00003239069],"category_scores_gemma":[0.00003198686,0.00007808899,0.0004362173,0.003030273,0.0001332977,0.0001663472,0.0001619825,0.0001145333,0.00000372098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002909435,"about_ca_system_score_gemma":0.00005471582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002846308,"about_ca_topic_score_gemma":0.0003298454,"domain_scores_codex":[0.9981385,0.0005706104,0.0004275298,0.0002742165,0.0004057426,0.0001833301],"domain_scores_gemma":[0.9984674,0.0001560951,0.0004654782,0.0007025131,0.000183937,0.00002459628],"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.0002378661,0.0008196133,0.02960619,0.0002054002,0.00694565,0.00001421647,0.00842308,0.05187996,0.04651853,0.8378595,0.002625544,0.01486447],"study_design_scores_gemma":[0.001649421,0.0002083941,0.07439302,0.0001041658,0.004496182,0.00002014513,0.0008494476,0.7495763,0.1177826,0.0489504,0.001244547,0.0007254046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7981721,0.001016186,0.1917452,0.00126564,0.0003034353,0.0005730972,0.0001248324,0.00009648223,0.006702945],"genre_scores_gemma":[0.9940766,0.00002050202,0.004794271,0.0001047076,0.00006544317,0.000009623965,0.00001392723,0.000005936783,0.0009089701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7889091,"threshold_uncertainty_score":0.4302785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993863961","doi":"10.1007/s11228-008-0095-7","title":"Partial Exact Penalty for Mathematical Programs with Equilibrium Constraints","year":2008,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Penalty method; Constraint (computer-aided design); Stationary point; Mathematical optimization; Mathematics; Complementarity (molecular biology); Complementarity theory; Simple (philosophy); Smoothing; Mixed complementarity problem; Nonlinear programming; Function (biology); Applied mathematics; Nonlinear system; Mathematical economics; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03807651040896165,"gpt":0.2775432797734925,"spread":0.2394667693645308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003881679,0.0002014637,0.0004660787,0.0003145383,0.0002321848,0.0001662056,0.0005100525,0.00006810703,0.0003731589],"category_scores_gemma":[0.0000741564,0.0001512617,0.0004273456,0.002346506,0.0001774631,0.0003712338,0.0000784678,0.00008126671,0.00005881631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003860327,"about_ca_system_score_gemma":0.0001548095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001732765,"about_ca_topic_score_gemma":0.00001081837,"domain_scores_codex":[0.9980231,0.00009363777,0.0004128048,0.000536258,0.0005719625,0.0003622555],"domain_scores_gemma":[0.9986338,0.0001121944,0.0001967373,0.0005339264,0.0003235592,0.0001997976],"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.0002857535,0.002784307,0.05083963,0.0001863783,0.02320226,0.0001683226,0.006739204,0.2296408,0.0003350077,0.666859,0.002407929,0.01655139],"study_design_scores_gemma":[0.0005597917,0.0001018688,0.001027016,0.000006605601,0.0009274966,0.00002097278,0.00004553487,0.9951718,0.000138067,0.00152784,0.0002207187,0.0002523307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01210568,0.00001145712,0.9855393,0.000852574,0.00002578577,0.0002445253,0.00001560488,0.0001571788,0.00104787],"genre_scores_gemma":[0.7848179,0.000002835431,0.214006,0.0001949657,0.00006068925,0.0000621134,0.0001469001,0.0000107542,0.0006978147],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7727122,"threshold_uncertainty_score":0.6168274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082662565","doi":"10.1023/b:svan.0000023400.92518.cb","title":"A One Perturbation Variational Principle and Applications","year":2004,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":13,"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":"","keywords":"Differentiable function; Separable space; Mathematics; Banach space; Perturbation (astronomy); Variational principle; Pure mathematics; Variational analysis; Mathematical analysis; Hadamard transform; Regular polygon; Convex function; Subderivative; Applied mathematics; Convex optimization; Physics; Quantum mechanics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02696684529786334,"gpt":0.3205052095309964,"spread":0.293538364233133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000334891,0.0001246548,0.0002654915,0.000265126,0.0001718952,0.00002922434,0.0001099809,0.00006711011,0.0001156823],"category_scores_gemma":[0.0002249979,0.0001288408,0.000113325,0.000963391,0.00006157929,0.0001404857,0.00004913275,0.0001014196,0.00003064251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001410304,"about_ca_system_score_gemma":0.00004958848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002048539,"about_ca_topic_score_gemma":0.00007832092,"domain_scores_codex":[0.9989455,0.00005228121,0.0002495955,0.0002945542,0.0002873527,0.0001706871],"domain_scores_gemma":[0.9990826,0.000164579,0.0001642695,0.000394193,0.0001131157,0.00008127302],"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.000009260042,0.0001277652,0.0003284164,0.00002426809,0.0007209159,4.823811e-7,0.000526197,0.005505228,0.0003501717,0.9917324,0.000006747332,0.0006681746],"study_design_scores_gemma":[0.0004488677,0.00001734211,0.0033296,0.000007926527,0.001504783,0.000001503351,0.0001543723,0.005892836,0.0002156019,0.9879169,0.0003347666,0.0001754552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04666227,0.00008697246,0.9507974,0.0004791132,0.00001010065,0.0002975501,0.00003337623,0.000129118,0.001504065],"genre_scores_gemma":[0.8245664,0.00001698694,0.1737578,0.0001206585,0.0001303746,0.000137203,0.0001282949,0.00002516926,0.001117108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7779042,"threshold_uncertainty_score":0.5253975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056487287","doi":"10.1023/b:svan.0000023393.75251.05","title":"Constructible Convex Sets","year":2004,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":12,"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":"","keywords":"Countable set; Mathematics; Convex set; Subderivative; Banach space; Convex analysis; Regular polygon; Convex combination; Class (philosophy); Uniformly convex space; Set (abstract data type); Discrete mathematics; Pure mathematics; Combinatorics; Convex optimization; Computer science; Banach manifold; Lp space; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02848149618176824,"gpt":0.3324439221568091,"spread":0.3039624259750408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004603846,0.0002684803,0.0006866754,0.0004561992,0.0001628687,0.00003767879,0.000289157,0.0001206881,0.0007797977],"category_scores_gemma":[0.0003764315,0.0002486818,0.0004098605,0.001736888,0.0002317697,0.0001782932,0.00008088051,0.0002226901,0.0002319923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001798173,"about_ca_system_score_gemma":0.00008857915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000858993,"about_ca_topic_score_gemma":0.0001540824,"domain_scores_codex":[0.9982069,0.0001089301,0.0003969343,0.0004299725,0.0004172995,0.0004399417],"domain_scores_gemma":[0.9984395,0.0001918393,0.000242276,0.0008350643,0.0001269426,0.0001643743],"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.00007206386,0.0002571622,0.002904002,0.0001259627,0.006674341,0.0001186194,0.002510117,0.008353999,0.002005349,0.9735127,0.0009643769,0.002501283],"study_design_scores_gemma":[0.001276856,0.00004725072,0.0003090245,0.00002892089,0.003554849,0.00002189055,0.001830271,0.001632942,0.004469717,0.9859341,0.0003919963,0.0005021609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8305594,0.0002134459,0.1561207,0.0005890132,0.0001716356,0.0003297112,0.00008068349,0.0005635921,0.01137181],"genre_scores_gemma":[0.9286917,0.00001430758,0.07004136,0.0001892685,0.00005862386,0.00001348794,0.00003608561,0.00004354449,0.0009116218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09813234,"threshold_uncertainty_score":0.9999965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072061258","doi":"10.1007/s11228-006-0029-1","title":"A Convex-Analytical Approach to Extension Results for n-Cyclically Monotone Operators","year":2006,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Mathematical proof; Elementary proof; Duality (order theory); Extension (predicate logic); Regular polygon; Cardinality (data modeling); Minimax theorem; Minimax; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical economics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02388549093823213,"gpt":0.2800954721042543,"spread":0.2562099811660222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767326,0.0002532607,0.0006347863,0.0008971939,0.000282198,0.0003449991,0.0007479225,0.0001233224,0.0000241875],"category_scores_gemma":[0.0002884868,0.0002162426,0.0006379344,0.005359294,0.00003697014,0.0003663008,0.0001768582,0.000102094,0.00007171665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008825455,"about_ca_system_score_gemma":0.00008327868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003851853,"about_ca_topic_score_gemma":0.00004156758,"domain_scores_codex":[0.9969645,0.0001461015,0.0007911512,0.001050691,0.0006459238,0.0004016304],"domain_scores_gemma":[0.9978772,0.0001590964,0.0001765302,0.0009095011,0.0006176878,0.0002599162],"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.00007040715,0.0003476179,0.0004659273,0.000006911488,0.001166218,0.000002589783,0.0001694327,0.7026038,0.000203012,0.2868812,0.00767043,0.0004124896],"study_design_scores_gemma":[0.0006432233,0.00004505303,0.003485715,0.000002664375,0.001046775,0.000001166635,0.00002547869,0.9905813,0.0001157209,0.001243973,0.002509837,0.0002990505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003920656,0.00002035449,0.9878234,0.004026434,0.00004823552,0.0003060826,0.00006271142,0.0001483566,0.003643756],"genre_scores_gemma":[0.6619746,0.000003467439,0.3320747,0.00200167,0.0001427257,0.00007592748,0.000520527,0.00001619878,0.003190182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.658054,"threshold_uncertainty_score":0.8818115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012211848","doi":"10.1023/a:1025679902969","title":"Dense Families of Selections and Finite-Dimensional Spaces","year":2003,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nipissing University","funders":"","keywords":"Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.0269437156839676,"gpt":0.2786265786825914,"spread":0.2516828629986238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003435277,0.0001511065,0.000413288,0.0004162288,0.0001509091,0.000029803,0.00006840121,0.00006895752,0.0001981903],"category_scores_gemma":[0.0006394489,0.0001315977,0.0002029373,0.001032483,0.0001116972,0.00007259795,0.00002490739,0.00009668207,0.00001005485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001722619,"about_ca_system_score_gemma":0.00004044958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001193352,"about_ca_topic_score_gemma":0.0002954798,"domain_scores_codex":[0.9988707,0.0001208897,0.0003022562,0.0002549499,0.0002589201,0.0001922628],"domain_scores_gemma":[0.998984,0.0003866565,0.0001478224,0.0002788377,0.0001288372,0.0000738431],"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.0001263474,0.001574912,0.2541296,0.0007530079,0.02099052,0.00005297113,0.01336778,0.01417695,0.01475271,0.6644495,0.01340638,0.002219381],"study_design_scores_gemma":[0.003462406,0.0004809435,0.04211611,0.0002212957,0.02446312,0.00007505329,0.01218117,0.06787474,0.06543881,0.7748129,0.006372858,0.002500577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9957504,0.0003115589,0.0023025,0.00005662861,0.00004026491,0.00006787101,0.00001948015,0.00004431902,0.001407019],"genre_scores_gemma":[0.9860642,0.0000596414,0.01256205,0.00004257097,0.0000237481,0.000005310903,0.00001089966,0.00001506263,0.001216515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2120135,"threshold_uncertainty_score":0.5366396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1522131509","doi":"10.1023/a:1011246414064","title":"Some Generic Results on Nonattaining Functionals","year":2001,"lang":"en","type":"article","venue":"Set-Valued 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":"Simon Fraser University","funders":"","keywords":"Infimum and supremum; Mathematics; Banach space; Regular polygon; Pure mathematics; Bounded function; Convex set; Reflexive space; Space (punctuation); Convex function; Subderivative; Set (abstract data type); Convex analysis; Uniformly convex space; Reflexivity; Mathematical analysis; Convex optimization; Computer science; Interpolation space; Functional analysis; Lp space; Geometry; Eberlein–Šmulian theorem","retraction":null,"screen_n_in":null,"score":{"opus":0.03689424208681979,"gpt":0.2789762514347622,"spread":0.2420820093479424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005244774,0.0001959163,0.0003363662,0.00112167,0.0003388486,0.000222802,0.00058141,0.00007901366,0.0002444677],"category_scores_gemma":[0.0001334246,0.000174901,0.0003588221,0.005950622,0.00002000001,0.0004962513,0.0001105573,0.0001238007,0.0003161528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000878857,"about_ca_system_score_gemma":0.00005726123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001128644,"about_ca_topic_score_gemma":0.00003648256,"domain_scores_codex":[0.9976192,0.0001640827,0.0004830027,0.0006829437,0.0007554789,0.0002952714],"domain_scores_gemma":[0.9984836,0.0001490317,0.0002432928,0.0007253382,0.000246653,0.0001520607],"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.00003130272,0.0001334034,0.0008311081,0.000001382298,0.001370487,0.00001446719,0.0002840595,0.924558,0.00002801526,0.06815595,0.00188164,0.002710117],"study_design_scores_gemma":[0.0005213293,0.0000575735,0.006742351,0.000003414937,0.0004281812,0.000002683039,0.00005066868,0.9853488,0.00002326123,0.001959297,0.004621618,0.0002408276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01937803,0.0001614383,0.9627993,0.007470663,0.0003338945,0.0001116526,0.00003172765,0.0003841163,0.009329166],"genre_scores_gemma":[0.9610939,0.0001467465,0.02594082,0.004463622,0.000472336,0.00002051159,0.0003514901,0.00001599603,0.007494542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9417159,"threshold_uncertainty_score":0.7132255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158961014","doi":"10.1007/s11228-008-0075-y","title":"Second Order Cones for Maximal Monotone Operators via Representative Functions","year":2008,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"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":"Monotone polygon; Mathematics; Banach space; Graph; Pure mathematics; Cone (formal languages); Differentiable function; Differential operator; Order (exchange); Combinatorics; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02566835373587489,"gpt":0.280487716216663,"spread":0.2548193624807881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025406,0.0001942761,0.000412074,0.0006359826,0.0006099291,0.0001219155,0.0004281095,0.0000745019,0.001022045],"category_scores_gemma":[0.0001009395,0.0001769736,0.000429719,0.004571117,0.00007324131,0.0005827319,0.0001073006,0.00008887299,0.00009770306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005230998,"about_ca_system_score_gemma":0.0001135586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001600025,"about_ca_topic_score_gemma":0.0001086821,"domain_scores_codex":[0.9982015,0.0001284709,0.0004231007,0.000631934,0.0003520014,0.0002629813],"domain_scores_gemma":[0.9982449,0.0001343393,0.0001790818,0.0005597894,0.0007394298,0.0001424129],"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.0001431169,0.0008069602,0.03038913,0.00002673446,0.02088135,0.00004059851,0.008085277,0.8279464,0.001553045,0.07621931,0.03240113,0.001506955],"study_design_scores_gemma":[0.0005655585,0.00004696584,0.007610079,9.163177e-7,0.0007258616,0.000005868859,0.000154403,0.9877443,0.0003000607,0.0006712473,0.001912644,0.000262131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01313317,0.00006343194,0.9845573,0.0009075369,0.00009953692,0.0001903806,0.00007874453,0.000116704,0.0008531361],"genre_scores_gemma":[0.8459004,0.00003145894,0.1398644,0.0008853129,0.0001171282,0.0001353004,0.000463707,0.00001863487,0.01258361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8446929,"threshold_uncertainty_score":0.9998912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072255091","doi":"10.1023/a:1021975622768","title":"Local Lipschitz-constant Functions and Maximal Subdifferentials","year":2003,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Fixed Point Theorems Analysis","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":"Okanagan University College; Okanagan College; Simon Fraser University","funders":"","keywords":"Subderivative; Lipschitz continuity; Mathematics; Banach space; Pure mathematics; Characterization (materials science); Lipschitz domain; Constant (computer programming); Function (biology); Mathematical analysis; Regular polygon; Geometry; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02517835867975333,"gpt":0.2758320433367246,"spread":0.2506536846569712,"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.001053952,0.0003727448,0.0009691799,0.0008577327,0.0003190088,0.0001288049,0.0001862162,0.0001768558,0.003009688],"category_scores_gemma":[0.0004055918,0.0003223957,0.0007206033,0.002239028,0.000305429,0.0001339377,0.00007358121,0.0002688383,0.0001224103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000933784,"about_ca_system_score_gemma":0.00006033285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001548381,"about_ca_topic_score_gemma":0.0005113345,"domain_scores_codex":[0.9971766,0.0004877854,0.0007038072,0.0006302735,0.000495163,0.0005063182],"domain_scores_gemma":[0.9981298,0.0003464259,0.0002616502,0.0008496048,0.0001557154,0.0002567645],"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.00006635022,0.0003726805,0.01372244,0.00008765887,0.01446017,0.00004031403,0.0008163342,0.0004558167,0.001264947,0.9641837,0.002385712,0.002143792],"study_design_scores_gemma":[0.003582947,0.0003061693,0.005095003,0.00009637295,0.08733255,0.0001284156,0.01110985,0.06001977,0.01054688,0.8140852,0.00467022,0.003026616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6288252,0.0003362492,0.354933,0.000157375,0.0001157501,0.0002021614,0.0001069601,0.0001946116,0.01512862],"genre_scores_gemma":[0.991206,0.00002595588,0.005765623,0.00006384892,0.00004106194,0.00002001639,0.00005867727,0.00004438174,0.002774405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3623808,"threshold_uncertainty_score":0.9999228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}